./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix031.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/protection/mix031.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/mix031.opt.i ./goblint.2024-05-07_14-17-48.files/protection/mix031.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:17:11,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 13:17:11,231 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 13:17:11,236 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 13:17:11,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 13:17:11,266 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 13:17:11,268 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 13:17:11,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 13:17:11,269 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 13:17:11,272 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 13:17:11,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 13:17:11,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 13:17:11,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 13:17:11,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 13:17:11,273 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 13:17:11,274 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 13:17:11,274 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 13:17:11,274 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 13:17:11,275 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 13:17:11,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 13:17:11,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 13:17:11,277 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 13:17:11,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 13:17:11,278 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 13:17:11,278 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 13:17:11,278 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 13:17:11,279 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 13:17:11,279 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 13:17:11,280 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 13:17:11,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 13:17:11,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 13:17:11,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 13:17:11,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 13:17:11,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 13:17:11,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 13:17:11,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 13:17:11,283 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 13:17:11,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 13:17:11,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 13:17:11,283 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 13:17:11,284 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 13:17:11,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 13:17:11,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 13:17:11,284 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:17:11,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 13:17:11,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 13:17:11,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 13:17:11,563 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 13:17:11,564 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 13:17:11,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031.opt.i [2024-05-12 13:17:12,748 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 13:17:12,979 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 13:17:12,980 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031.opt.i [2024-05-12 13:17:12,997 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe8c18355/879e54eb9bc44d2dbc6786d9d08470cc/FLAG87fab8923 [2024-05-12 13:17:13,009 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe8c18355/879e54eb9bc44d2dbc6786d9d08470cc [2024-05-12 13:17:13,012 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 13:17:13,012 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 13:17:13,013 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/mix031.opt.yml/witness.yml [2024-05-12 13:17:13,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 13:17:13,152 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 13:17:13,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 13:17:13,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 13:17:13,160 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 13:17:13,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 01:17:13" (1/2) ... [2024-05-12 13:17:13,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2251a548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:17:13, skipping insertion in model container [2024-05-12 13:17:13,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 01:17:13" (1/2) ... [2024-05-12 13:17:13,164 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5921ba7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:17:13, skipping insertion in model container [2024-05-12 13:17:13,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:17:13" (2/2) ... [2024-05-12 13:17:13,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2251a548 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:17:13, skipping insertion in model container [2024-05-12 13:17:13,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:17:13" (2/2) ... [2024-05-12 13:17:13,167 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 13:17:13,232 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 13:17:13,234 INFO L97 edCorrectnessWitness]: Location invariant before [L827-L827] ((((((((((((((((((! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1))) [2024-05-12 13:17:13,234 INFO L97 edCorrectnessWitness]: Location invariant before [L826-L826] ((((((((((((((((((! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1))) [2024-05-12 13:17:13,235 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 13:17:13,235 INFO L106 edCorrectnessWitness]: ghost_update [L824-L824] multithreaded = 1; [2024-05-12 13:17:13,279 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 13:17:13,427 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/mix031.opt.i[987,1000] [2024-05-12 13:17:13,596 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 13:17:13,610 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 13:17:13,649 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/mix031.opt.i[987,1000] Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 13:17:13,743 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 13:17:13,775 INFO L206 MainTranslator]: Completed translation [2024-05-12 13:17:13,775 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:17:13 WrapperNode [2024-05-12 13:17:13,775 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 13:17:13,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 13:17:13,776 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 13:17:13,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 13:17:13,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:17:13" (1/1) ... [2024-05-12 13:17:13,801 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:17:13" (1/1) ... [2024-05-12 13:17:13,831 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2024-05-12 13:17:13,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 13:17:13,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 13:17:13,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 13:17:13,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 13:17:13,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:17:13" (1/1) ... [2024-05-12 13:17:13,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:17:13" (1/1) ... [2024-05-12 13:17:13,866 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:17:13" (1/1) ... [2024-05-12 13:17:13,881 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:17:13,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:17:13" (1/1) ... [2024-05-12 13:17:13,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:17:13" (1/1) ... [2024-05-12 13:17:13,898 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:17:13" (1/1) ... [2024-05-12 13:17:13,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:17:13" (1/1) ... [2024-05-12 13:17:13,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:17:13" (1/1) ... [2024-05-12 13:17:13,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:17:13" (1/1) ... [2024-05-12 13:17:13,922 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 13:17:13,923 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 13:17:13,923 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 13:17:13,923 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 13:17:13,924 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:17:13" (1/1) ... [2024-05-12 13:17:13,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 13:17:13,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 13:17:13,974 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:17:13,982 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:17:14,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 13:17:14,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 13:17:14,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 13:17:14,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 13:17:14,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 13:17:14,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 13:17:14,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 13:17:14,013 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 13:17:14,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 13:17:14,013 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 13:17:14,014 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 13:17:14,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 13:17:14,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 13:17:14,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 13:17:14,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 13:17:14,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 13:17:14,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 13:17:14,018 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:17:14,194 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 13:17:14,196 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 13:17:14,523 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 13:17:14,523 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 13:17:14,655 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 13:17:14,656 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 13:17:14,660 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 01:17:14 BoogieIcfgContainer [2024-05-12 13:17:14,660 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 13:17:14,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 13:17:14,662 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 13:17:14,665 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 13:17:14,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 01:17:13" (1/4) ... [2024-05-12 13:17:14,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4799a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 01:17:14, skipping insertion in model container [2024-05-12 13:17:14,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:17:13" (2/4) ... [2024-05-12 13:17:14,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4799a1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 01:17:14, skipping insertion in model container [2024-05-12 13:17:14,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:17:13" (3/4) ... [2024-05-12 13:17:14,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4799a1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 01:17:14, skipping insertion in model container [2024-05-12 13:17:14,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 01:17:14" (4/4) ... [2024-05-12 13:17:14,667 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.opt.i [2024-05-12 13:17:14,684 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 13:17:14,684 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-12 13:17:14,684 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 13:17:14,730 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 13:17:14,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 40 transitions, 88 flow [2024-05-12 13:17:14,810 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2024-05-12 13:17:14,810 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 13:17:14,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 38 events. 1/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2024-05-12 13:17:14,815 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 40 transitions, 88 flow [2024-05-12 13:17:14,820 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 38 transitions, 82 flow [2024-05-12 13:17:14,834 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 13:17:14,843 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;@7b8565ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 13:17:14,843 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-12 13:17:14,847 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 13:17:14,848 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 13:17:14,848 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 13:17:14,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:14,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 13:17:14,850 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:17:14,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:14,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1285957062, now seen corresponding path program 1 times [2024-05-12 13:17:14,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:14,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756278442] [2024-05-12 13:17:14,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:14,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:16,022 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:17:16,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:16,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756278442] [2024-05-12 13:17:16,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756278442] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:16,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:16,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 13:17:16,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344775065] [2024-05-12 13:17:16,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:16,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 13:17:16,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:16,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 13:17:16,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 13:17:16,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2024-05-12 13:17:16,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 82 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:17:16,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:16,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2024-05-12 13:17:16,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:16,354 INFO L124 PetriNetUnfolderBase]: 472/877 cut-off events. [2024-05-12 13:17:16,355 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-05-12 13:17:16,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1686 conditions, 877 events. 472/877 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4743 event pairs, 210 based on Foata normal form. 43/857 useless extension candidates. Maximal degree in co-relation 1672. Up to 780 conditions per place. [2024-05-12 13:17:16,366 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 32 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2024-05-12 13:17:16,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 177 flow [2024-05-12 13:17:16,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 13:17:16,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 13:17:16,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2024-05-12 13:17:16,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2024-05-12 13:17:16,379 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 82 flow. Second operand 3 states and 82 transitions. [2024-05-12 13:17:16,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 177 flow [2024-05-12 13:17:16,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 13:17:16,384 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 106 flow [2024-05-12 13:17:16,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2024-05-12 13:17:16,390 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2024-05-12 13:17:16,390 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 106 flow [2024-05-12 13:17:16,391 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:17:16,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:16,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:16,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 13:17:16,392 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:17:16,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:16,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1145810779, now seen corresponding path program 1 times [2024-05-12 13:17:16,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:16,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764636094] [2024-05-12 13:17:16,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:16,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:17,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:17:17,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:17,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764636094] [2024-05-12 13:17:17,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764636094] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:17,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:17,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 13:17:17,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921190146] [2024-05-12 13:17:17,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:17,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 13:17:17,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:17,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 13:17:17,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 13:17:17,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2024-05-12 13:17:17,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:17:17,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:17,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2024-05-12 13:17:17,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:17,420 INFO L124 PetriNetUnfolderBase]: 539/1080 cut-off events. [2024-05-12 13:17:17,420 INFO L125 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2024-05-12 13:17:17,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2206 conditions, 1080 events. 539/1080 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6172 event pairs, 283 based on Foata normal form. 2/988 useless extension candidates. Maximal degree in co-relation 2191. Up to 870 conditions per place. [2024-05-12 13:17:17,428 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 41 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2024-05-12 13:17:17,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 248 flow [2024-05-12 13:17:17,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 13:17:17,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 13:17:17,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2024-05-12 13:17:17,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6375 [2024-05-12 13:17:17,433 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 106 flow. Second operand 4 states and 102 transitions. [2024-05-12 13:17:17,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 248 flow [2024-05-12 13:17:17,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 13:17:17,438 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 140 flow [2024-05-12 13:17:17,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2024-05-12 13:17:17,441 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2024-05-12 13:17:17,441 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 140 flow [2024-05-12 13:17:17,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:17:17,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:17,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:17,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 13:17:17,448 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:17:17,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:17,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1160394661, now seen corresponding path program 1 times [2024-05-12 13:17:17,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:17,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727086305] [2024-05-12 13:17:17,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:17,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:18,255 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:17:18,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:18,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727086305] [2024-05-12 13:17:18,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727086305] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:18,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:18,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 13:17:18,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410625330] [2024-05-12 13:17:18,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:18,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 13:17:18,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:18,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 13:17:18,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 13:17:18,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2024-05-12 13:17:18,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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:17:18,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:18,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2024-05-12 13:17:18,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:18,540 INFO L124 PetriNetUnfolderBase]: 636/1109 cut-off events. [2024-05-12 13:17:18,540 INFO L125 PetriNetUnfolderBase]: For 358/358 co-relation queries the response was YES. [2024-05-12 13:17:18,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2629 conditions, 1109 events. 636/1109 cut-off events. For 358/358 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5817 event pairs, 196 based on Foata normal form. 2/1059 useless extension candidates. Maximal degree in co-relation 2612. Up to 1008 conditions per place. [2024-05-12 13:17:18,546 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 50 selfloop transitions, 10 changer transitions 0/70 dead transitions. [2024-05-12 13:17:18,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 70 transitions, 328 flow [2024-05-12 13:17:18,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 13:17:18,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 13:17:18,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2024-05-12 13:17:18,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.61 [2024-05-12 13:17:18,548 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 140 flow. Second operand 5 states and 122 transitions. [2024-05-12 13:17:18,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 70 transitions, 328 flow [2024-05-12 13:17:18,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 70 transitions, 314 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-05-12 13:17:18,550 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 174 flow [2024-05-12 13:17:18,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2024-05-12 13:17:18,551 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2024-05-12 13:17:18,551 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 174 flow [2024-05-12 13:17:18,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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:17:18,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:18,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:18,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 13:17:18,552 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:17:18,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:18,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1161093088, now seen corresponding path program 1 times [2024-05-12 13:17:18,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:18,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439253178] [2024-05-12 13:17:18,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:18,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:18,629 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:17:18,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:18,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439253178] [2024-05-12 13:17:18,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439253178] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:18,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:18,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 13:17:18,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527153161] [2024-05-12 13:17:18,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:18,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 13:17:18,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:18,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 13:17:18,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 13:17:18,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 40 [2024-05-12 13:17:18,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:17:18,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:18,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 40 [2024-05-12 13:17:18,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:18,726 INFO L124 PetriNetUnfolderBase]: 166/487 cut-off events. [2024-05-12 13:17:18,727 INFO L125 PetriNetUnfolderBase]: For 240/267 co-relation queries the response was YES. [2024-05-12 13:17:18,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 487 events. 166/487 cut-off events. For 240/267 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2986 event pairs, 19 based on Foata normal form. 0/479 useless extension candidates. Maximal degree in co-relation 943. Up to 238 conditions per place. [2024-05-12 13:17:18,730 INFO L140 encePairwiseOnDemand]: 37/40 looper letters, 21 selfloop transitions, 5 changer transitions 1/49 dead transitions. [2024-05-12 13:17:18,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 213 flow [2024-05-12 13:17:18,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 13:17:18,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 13:17:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-05-12 13:17:18,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2024-05-12 13:17:18,733 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 174 flow. Second operand 3 states and 88 transitions. [2024-05-12 13:17:18,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 213 flow [2024-05-12 13:17:18,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 49 transitions, 198 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-05-12 13:17:18,737 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 140 flow [2024-05-12 13:17:18,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2024-05-12 13:17:18,739 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2024-05-12 13:17:18,739 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 140 flow [2024-05-12 13:17:18,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:17:18,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:18,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:18,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 13:17:18,740 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:17:18,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:18,740 INFO L85 PathProgramCache]: Analyzing trace with hash -752667192, now seen corresponding path program 1 times [2024-05-12 13:17:18,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:18,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162364532] [2024-05-12 13:17:18,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:18,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:19,541 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:17:19,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:19,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162364532] [2024-05-12 13:17:19,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162364532] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:19,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:19,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 13:17:19,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396597396] [2024-05-12 13:17:19,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:19,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 13:17:19,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:19,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 13:17:19,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 13:17:19,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2024-05-12 13:17:19,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 140 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:17:19,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:19,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2024-05-12 13:17:19,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:19,825 INFO L124 PetriNetUnfolderBase]: 549/974 cut-off events. [2024-05-12 13:17:19,826 INFO L125 PetriNetUnfolderBase]: For 644/644 co-relation queries the response was YES. [2024-05-12 13:17:19,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2360 conditions, 974 events. 549/974 cut-off events. For 644/644 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4998 event pairs, 81 based on Foata normal form. 4/972 useless extension candidates. Maximal degree in co-relation 2342. Up to 834 conditions per place. [2024-05-12 13:17:19,831 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 53 selfloop transitions, 9 changer transitions 5/77 dead transitions. [2024-05-12 13:17:19,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 77 transitions, 360 flow [2024-05-12 13:17:19,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:17:19,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:17:19,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2024-05-12 13:17:19,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5875 [2024-05-12 13:17:19,833 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 140 flow. Second operand 6 states and 141 transitions. [2024-05-12 13:17:19,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 77 transitions, 360 flow [2024-05-12 13:17:19,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 77 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 13:17:19,835 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 167 flow [2024-05-12 13:17:19,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2024-05-12 13:17:19,836 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2024-05-12 13:17:19,836 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 167 flow [2024-05-12 13:17:19,837 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:17:19,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:19,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:19,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 13:17:19,837 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:17:19,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:19,838 INFO L85 PathProgramCache]: Analyzing trace with hash 881025531, now seen corresponding path program 1 times [2024-05-12 13:17:19,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:19,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411180167] [2024-05-12 13:17:19,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:19,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:20,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:17:20,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:20,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411180167] [2024-05-12 13:17:20,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411180167] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:20,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:20,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 13:17:20,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445902376] [2024-05-12 13:17:20,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:20,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 13:17:20,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:20,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 13:17:20,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 13:17:20,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2024-05-12 13:17:20,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 167 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:17:20,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:20,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2024-05-12 13:17:20,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:21,080 INFO L124 PetriNetUnfolderBase]: 430/906 cut-off events. [2024-05-12 13:17:21,081 INFO L125 PetriNetUnfolderBase]: For 727/729 co-relation queries the response was YES. [2024-05-12 13:17:21,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2162 conditions, 906 events. 430/906 cut-off events. For 727/729 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5157 event pairs, 176 based on Foata normal form. 3/878 useless extension candidates. Maximal degree in co-relation 2143. Up to 712 conditions per place. [2024-05-12 13:17:21,087 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 40 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2024-05-12 13:17:21,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 307 flow [2024-05-12 13:17:21,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 13:17:21,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 13:17:21,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2024-05-12 13:17:21,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53 [2024-05-12 13:17:21,089 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 167 flow. Second operand 5 states and 106 transitions. [2024-05-12 13:17:21,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 307 flow [2024-05-12 13:17:21,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 282 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-05-12 13:17:21,092 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 197 flow [2024-05-12 13:17:21,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=197, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2024-05-12 13:17:21,093 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 10 predicate places. [2024-05-12 13:17:21,093 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 197 flow [2024-05-12 13:17:21,093 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:17:21,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:21,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:21,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 13:17:21,094 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:17:21,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:21,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1520538874, now seen corresponding path program 1 times [2024-05-12 13:17:21,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:21,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543513117] [2024-05-12 13:17:21,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:21,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:17:22,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:22,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543513117] [2024-05-12 13:17:22,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543513117] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:22,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:22,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:17:22,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9504831] [2024-05-12 13:17:22,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:22,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:17:22,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:22,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:17:22,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:17:22,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2024-05-12 13:17:22,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 197 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 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:17:22,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:22,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2024-05-12 13:17:22,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:22,396 INFO L124 PetriNetUnfolderBase]: 507/1022 cut-off events. [2024-05-12 13:17:22,397 INFO L125 PetriNetUnfolderBase]: For 1010/1012 co-relation queries the response was YES. [2024-05-12 13:17:22,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2584 conditions, 1022 events. 507/1022 cut-off events. For 1010/1012 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5776 event pairs, 209 based on Foata normal form. 3/999 useless extension candidates. Maximal degree in co-relation 2562. Up to 829 conditions per place. [2024-05-12 13:17:22,404 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 46 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2024-05-12 13:17:22,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 353 flow [2024-05-12 13:17:22,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:17:22,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:17:22,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2024-05-12 13:17:22,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5041666666666667 [2024-05-12 13:17:22,406 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 197 flow. Second operand 6 states and 121 transitions. [2024-05-12 13:17:22,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 353 flow [2024-05-12 13:17:22,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 66 transitions, 344 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-05-12 13:17:22,411 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 223 flow [2024-05-12 13:17:22,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2024-05-12 13:17:22,412 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2024-05-12 13:17:22,412 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 223 flow [2024-05-12 13:17:22,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 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:17:22,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:22,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:22,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 13:17:22,413 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:17:22,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:22,414 INFO L85 PathProgramCache]: Analyzing trace with hash -115593654, now seen corresponding path program 1 times [2024-05-12 13:17:22,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:22,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270740330] [2024-05-12 13:17:22,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:22,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:23,336 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:17:23,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:23,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270740330] [2024-05-12 13:17:23,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270740330] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:23,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:23,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:17:23,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32446393] [2024-05-12 13:17:23,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:23,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:17:23,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:23,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:17:23,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:17:23,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2024-05-12 13:17:23,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 223 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 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:17:23,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:23,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2024-05-12 13:17:23,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:23,734 INFO L124 PetriNetUnfolderBase]: 548/1083 cut-off events. [2024-05-12 13:17:23,734 INFO L125 PetriNetUnfolderBase]: For 1599/1601 co-relation queries the response was YES. [2024-05-12 13:17:23,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2919 conditions, 1083 events. 548/1083 cut-off events. For 1599/1601 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6091 event pairs, 218 based on Foata normal form. 3/1060 useless extension candidates. Maximal degree in co-relation 2895. Up to 879 conditions per place. [2024-05-12 13:17:23,744 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 50 selfloop transitions, 10 changer transitions 0/72 dead transitions. [2024-05-12 13:17:23,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 72 transitions, 405 flow [2024-05-12 13:17:23,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:17:23,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:17:23,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2024-05-12 13:17:23,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5125 [2024-05-12 13:17:23,746 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 223 flow. Second operand 6 states and 123 transitions. [2024-05-12 13:17:23,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 72 transitions, 405 flow [2024-05-12 13:17:23,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 72 transitions, 386 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-05-12 13:17:23,749 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 265 flow [2024-05-12 13:17:23,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=265, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2024-05-12 13:17:23,752 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 17 predicate places. [2024-05-12 13:17:23,752 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 265 flow [2024-05-12 13:17:23,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 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:17:23,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:23,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:23,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 13:17:23,753 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:17:23,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:23,753 INFO L85 PathProgramCache]: Analyzing trace with hash -2056059179, now seen corresponding path program 1 times [2024-05-12 13:17:23,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:23,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644283170] [2024-05-12 13:17:23,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:23,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:25,045 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:17:25,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:25,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644283170] [2024-05-12 13:17:25,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644283170] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:25,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:25,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:17:25,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569364496] [2024-05-12 13:17:25,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:25,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:17:25,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:25,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:17:25,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:17:25,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2024-05-12 13:17:25,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 265 flow. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 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:17:25,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:25,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2024-05-12 13:17:25,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:25,470 INFO L124 PetriNetUnfolderBase]: 508/1009 cut-off events. [2024-05-12 13:17:25,470 INFO L125 PetriNetUnfolderBase]: For 2053/2053 co-relation queries the response was YES. [2024-05-12 13:17:25,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2897 conditions, 1009 events. 508/1009 cut-off events. For 2053/2053 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5585 event pairs, 121 based on Foata normal form. 4/981 useless extension candidates. Maximal degree in co-relation 2871. Up to 739 conditions per place. [2024-05-12 13:17:25,478 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 67 selfloop transitions, 16 changer transitions 0/94 dead transitions. [2024-05-12 13:17:25,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 94 transitions, 529 flow [2024-05-12 13:17:25,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:17:25,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:17:25,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2024-05-12 13:17:25,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5375 [2024-05-12 13:17:25,480 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 265 flow. Second operand 8 states and 172 transitions. [2024-05-12 13:17:25,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 94 transitions, 529 flow [2024-05-12 13:17:25,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 94 transitions, 510 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-05-12 13:17:25,484 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 283 flow [2024-05-12 13:17:25,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=283, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2024-05-12 13:17:25,484 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 22 predicate places. [2024-05-12 13:17:25,485 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 283 flow [2024-05-12 13:17:25,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 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:17:25,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:25,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:25,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 13:17:25,486 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:17:25,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:25,486 INFO L85 PathProgramCache]: Analyzing trace with hash 556989786, now seen corresponding path program 2 times [2024-05-12 13:17:25,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:25,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113270908] [2024-05-12 13:17:25,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:25,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:26,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:17:26,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:26,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113270908] [2024-05-12 13:17:26,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113270908] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:26,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:26,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:17:26,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881844712] [2024-05-12 13:17:26,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:26,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:17:26,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:26,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:17:26,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:17:26,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2024-05-12 13:17:26,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 283 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 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:17:26,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:26,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2024-05-12 13:17:26,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:26,777 INFO L124 PetriNetUnfolderBase]: 540/1120 cut-off events. [2024-05-12 13:17:26,777 INFO L125 PetriNetUnfolderBase]: For 2647/2653 co-relation queries the response was YES. [2024-05-12 13:17:26,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3277 conditions, 1120 events. 540/1120 cut-off events. For 2647/2653 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6420 event pairs, 165 based on Foata normal form. 7/1086 useless extension candidates. Maximal degree in co-relation 3250. Up to 846 conditions per place. [2024-05-12 13:17:26,787 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 49 selfloop transitions, 13 changer transitions 0/74 dead transitions. [2024-05-12 13:17:26,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 74 transitions, 461 flow [2024-05-12 13:17:26,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:17:26,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:17:26,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2024-05-12 13:17:26,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2024-05-12 13:17:26,789 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 283 flow. Second operand 6 states and 122 transitions. [2024-05-12 13:17:26,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 74 transitions, 461 flow [2024-05-12 13:17:26,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 74 transitions, 425 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-05-12 13:17:26,795 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 294 flow [2024-05-12 13:17:26,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=294, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2024-05-12 13:17:26,797 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 23 predicate places. [2024-05-12 13:17:26,797 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 294 flow [2024-05-12 13:17:26,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 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:17:26,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:26,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:26,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 13:17:26,798 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:17:26,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:26,799 INFO L85 PathProgramCache]: Analyzing trace with hash -107934422, now seen corresponding path program 1 times [2024-05-12 13:17:26,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:26,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986823357] [2024-05-12 13:17:26,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:26,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:27,792 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:17:27,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:27,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986823357] [2024-05-12 13:17:27,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986823357] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:27,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:27,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:17:27,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558868334] [2024-05-12 13:17:27,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:27,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:17:27,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:27,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:17:27,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:17:27,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2024-05-12 13:17:27,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 294 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 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:17:27,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:27,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2024-05-12 13:17:27,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:28,330 INFO L124 PetriNetUnfolderBase]: 518/1088 cut-off events. [2024-05-12 13:17:28,330 INFO L125 PetriNetUnfolderBase]: For 2486/2488 co-relation queries the response was YES. [2024-05-12 13:17:28,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3203 conditions, 1088 events. 518/1088 cut-off events. For 2486/2488 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6266 event pairs, 155 based on Foata normal form. 3/1050 useless extension candidates. Maximal degree in co-relation 3174. Up to 831 conditions per place. [2024-05-12 13:17:28,339 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 59 selfloop transitions, 11 changer transitions 0/81 dead transitions. [2024-05-12 13:17:28,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 81 transitions, 500 flow [2024-05-12 13:17:28,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:17:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:17:28,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2024-05-12 13:17:28,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49642857142857144 [2024-05-12 13:17:28,342 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 294 flow. Second operand 7 states and 139 transitions. [2024-05-12 13:17:28,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 81 transitions, 500 flow [2024-05-12 13:17:28,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 81 transitions, 469 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-05-12 13:17:28,347 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 304 flow [2024-05-12 13:17:28,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=304, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2024-05-12 13:17:28,347 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 26 predicate places. [2024-05-12 13:17:28,347 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 304 flow [2024-05-12 13:17:28,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 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:17:28,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:28,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:28,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 13:17:28,348 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:17:28,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:28,349 INFO L85 PathProgramCache]: Analyzing trace with hash 834435992, now seen corresponding path program 1 times [2024-05-12 13:17:28,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:28,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783508334] [2024-05-12 13:17:28,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:28,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:29,257 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:17:29,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:29,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783508334] [2024-05-12 13:17:29,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783508334] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:29,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:29,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:17:29,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229530391] [2024-05-12 13:17:29,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:29,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:17:29,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:29,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:17:29,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:17:29,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:17:29,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 304 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:17:29,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:29,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:17:29,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:29,841 INFO L124 PetriNetUnfolderBase]: 602/1134 cut-off events. [2024-05-12 13:17:29,841 INFO L125 PetriNetUnfolderBase]: For 3430/3432 co-relation queries the response was YES. [2024-05-12 13:17:29,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3635 conditions, 1134 events. 602/1134 cut-off events. For 3430/3432 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6149 event pairs, 172 based on Foata normal form. 3/1113 useless extension candidates. Maximal degree in co-relation 3605. Up to 942 conditions per place. [2024-05-12 13:17:29,850 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 65 selfloop transitions, 13 changer transitions 0/88 dead transitions. [2024-05-12 13:17:29,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 88 transitions, 545 flow [2024-05-12 13:17:29,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:17:29,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:17:29,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-05-12 13:17:29,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48928571428571427 [2024-05-12 13:17:29,852 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 304 flow. Second operand 7 states and 137 transitions. [2024-05-12 13:17:29,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 88 transitions, 545 flow [2024-05-12 13:17:29,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 88 transitions, 520 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-05-12 13:17:29,858 INFO L231 Difference]: Finished difference. Result has 73 places, 65 transitions, 353 flow [2024-05-12 13:17:29,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=353, PETRI_PLACES=73, PETRI_TRANSITIONS=65} [2024-05-12 13:17:29,858 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 29 predicate places. [2024-05-12 13:17:29,858 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 65 transitions, 353 flow [2024-05-12 13:17:29,859 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:17:29,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:29,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:29,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 13:17:29,859 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:17:29,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:29,860 INFO L85 PathProgramCache]: Analyzing trace with hash 77618121, now seen corresponding path program 1 times [2024-05-12 13:17:29,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:29,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455239468] [2024-05-12 13:17:29,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:29,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:30,736 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:17:30,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:30,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455239468] [2024-05-12 13:17:30,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455239468] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:30,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:30,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:17:30,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137067982] [2024-05-12 13:17:30,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:30,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:17:30,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:30,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:17:30,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:17:30,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:17:30,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 65 transitions, 353 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:17:30,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:30,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:17:30,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:31,245 INFO L124 PetriNetUnfolderBase]: 623/1177 cut-off events. [2024-05-12 13:17:31,245 INFO L125 PetriNetUnfolderBase]: For 4017/4017 co-relation queries the response was YES. [2024-05-12 13:17:31,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3898 conditions, 1177 events. 623/1177 cut-off events. For 4017/4017 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6434 event pairs, 187 based on Foata normal form. 1/1150 useless extension candidates. Maximal degree in co-relation 3866. Up to 987 conditions per place. [2024-05-12 13:17:31,255 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 65 selfloop transitions, 12 changer transitions 0/89 dead transitions. [2024-05-12 13:17:31,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 89 transitions, 579 flow [2024-05-12 13:17:31,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:17:31,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:17:31,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-05-12 13:17:31,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2024-05-12 13:17:31,257 INFO L175 Difference]: Start difference. First operand has 73 places, 65 transitions, 353 flow. Second operand 7 states and 135 transitions. [2024-05-12 13:17:31,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 89 transitions, 579 flow [2024-05-12 13:17:31,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 89 transitions, 548 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-05-12 13:17:31,264 INFO L231 Difference]: Finished difference. Result has 76 places, 67 transitions, 367 flow [2024-05-12 13:17:31,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=367, PETRI_PLACES=76, PETRI_TRANSITIONS=67} [2024-05-12 13:17:31,265 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 32 predicate places. [2024-05-12 13:17:31,265 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 67 transitions, 367 flow [2024-05-12 13:17:31,266 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:17:31,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:31,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:31,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 13:17:31,266 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:17:31,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:31,267 INFO L85 PathProgramCache]: Analyzing trace with hash 834616412, now seen corresponding path program 2 times [2024-05-12 13:17:31,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:31,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074472174] [2024-05-12 13:17:31,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:31,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:32,154 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:17:32,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:32,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074472174] [2024-05-12 13:17:32,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074472174] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:32,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:32,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:17:32,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873077412] [2024-05-12 13:17:32,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:32,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:17:32,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:32,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:17:32,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:17:32,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:17:32,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 67 transitions, 367 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:17:32,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:32,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:17:32,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:32,569 INFO L124 PetriNetUnfolderBase]: 629/1173 cut-off events. [2024-05-12 13:17:32,569 INFO L125 PetriNetUnfolderBase]: For 4840/4842 co-relation queries the response was YES. [2024-05-12 13:17:32,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4083 conditions, 1173 events. 629/1173 cut-off events. For 4840/4842 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6359 event pairs, 169 based on Foata normal form. 3/1152 useless extension candidates. Maximal degree in co-relation 4050. Up to 955 conditions per place. [2024-05-12 13:17:32,580 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 64 selfloop transitions, 16 changer transitions 0/91 dead transitions. [2024-05-12 13:17:32,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 91 transitions, 603 flow [2024-05-12 13:17:32,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:17:32,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:17:32,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-05-12 13:17:32,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48928571428571427 [2024-05-12 13:17:32,582 INFO L175 Difference]: Start difference. First operand has 76 places, 67 transitions, 367 flow. Second operand 7 states and 137 transitions. [2024-05-12 13:17:32,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 91 transitions, 603 flow [2024-05-12 13:17:32,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 91 transitions, 574 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-05-12 13:17:32,593 INFO L231 Difference]: Finished difference. Result has 78 places, 69 transitions, 395 flow [2024-05-12 13:17:32,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=395, PETRI_PLACES=78, PETRI_TRANSITIONS=69} [2024-05-12 13:17:32,594 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 34 predicate places. [2024-05-12 13:17:32,594 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 69 transitions, 395 flow [2024-05-12 13:17:32,594 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:17:32,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:32,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:32,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 13:17:32,595 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:17:32,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:32,596 INFO L85 PathProgramCache]: Analyzing trace with hash 86814891, now seen corresponding path program 2 times [2024-05-12 13:17:32,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:32,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894244436] [2024-05-12 13:17:32,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:32,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:33,557 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:17:33,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:33,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894244436] [2024-05-12 13:17:33,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894244436] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:33,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:33,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:17:33,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506573369] [2024-05-12 13:17:33,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:33,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:17:33,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:33,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:17:33,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:17:33,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:17:33,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 69 transitions, 395 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:17:33,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:33,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:17:33,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:34,029 INFO L124 PetriNetUnfolderBase]: 647/1310 cut-off events. [2024-05-12 13:17:34,029 INFO L125 PetriNetUnfolderBase]: For 5573/5573 co-relation queries the response was YES. [2024-05-12 13:17:34,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4391 conditions, 1310 events. 647/1310 cut-off events. For 5573/5573 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7507 event pairs, 178 based on Foata normal form. 1/1258 useless extension candidates. Maximal degree in co-relation 4357. Up to 966 conditions per place. [2024-05-12 13:17:34,040 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 63 selfloop transitions, 21 changer transitions 0/97 dead transitions. [2024-05-12 13:17:34,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 97 transitions, 707 flow [2024-05-12 13:17:34,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:17:34,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:17:34,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-05-12 13:17:34,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.471875 [2024-05-12 13:17:34,042 INFO L175 Difference]: Start difference. First operand has 78 places, 69 transitions, 395 flow. Second operand 8 states and 151 transitions. [2024-05-12 13:17:34,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 97 transitions, 707 flow [2024-05-12 13:17:34,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 97 transitions, 664 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-05-12 13:17:34,050 INFO L231 Difference]: Finished difference. Result has 82 places, 75 transitions, 454 flow [2024-05-12 13:17:34,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=454, PETRI_PLACES=82, PETRI_TRANSITIONS=75} [2024-05-12 13:17:34,051 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 38 predicate places. [2024-05-12 13:17:34,051 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 75 transitions, 454 flow [2024-05-12 13:17:34,051 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:17:34,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:34,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:34,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 13:17:34,052 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:17:34,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:34,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1506067112, now seen corresponding path program 3 times [2024-05-12 13:17:34,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:34,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868077920] [2024-05-12 13:17:34,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:34,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:34,948 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:17:34,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:34,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868077920] [2024-05-12 13:17:34,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868077920] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:34,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:34,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:17:34,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628310999] [2024-05-12 13:17:34,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:34,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:17:34,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:34,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:17:34,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:17:35,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:17:35,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 75 transitions, 454 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:17:35,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:35,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:17:35,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:35,402 INFO L124 PetriNetUnfolderBase]: 636/1246 cut-off events. [2024-05-12 13:17:35,403 INFO L125 PetriNetUnfolderBase]: For 6506/6507 co-relation queries the response was YES. [2024-05-12 13:17:35,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4467 conditions, 1246 events. 636/1246 cut-off events. For 6506/6507 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6947 event pairs, 164 based on Foata normal form. 2/1207 useless extension candidates. Maximal degree in co-relation 4431. Up to 932 conditions per place. [2024-05-12 13:17:35,421 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 65 selfloop transitions, 20 changer transitions 0/98 dead transitions. [2024-05-12 13:17:35,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 98 transitions, 708 flow [2024-05-12 13:17:35,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:17:35,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:17:35,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-05-12 13:17:35,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48928571428571427 [2024-05-12 13:17:35,423 INFO L175 Difference]: Start difference. First operand has 82 places, 75 transitions, 454 flow. Second operand 7 states and 137 transitions. [2024-05-12 13:17:35,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 98 transitions, 708 flow [2024-05-12 13:17:35,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 98 transitions, 686 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-05-12 13:17:35,434 INFO L231 Difference]: Finished difference. Result has 87 places, 77 transitions, 501 flow [2024-05-12 13:17:35,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=501, PETRI_PLACES=87, PETRI_TRANSITIONS=77} [2024-05-12 13:17:35,435 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 43 predicate places. [2024-05-12 13:17:35,437 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 77 transitions, 501 flow [2024-05-12 13:17:35,437 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:17:35,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:35,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:35,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 13:17:35,438 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:17:35,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:35,438 INFO L85 PathProgramCache]: Analyzing trace with hash 841141571, now seen corresponding path program 3 times [2024-05-12 13:17:35,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:35,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917630597] [2024-05-12 13:17:35,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:35,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:36,298 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:17:36,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:36,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917630597] [2024-05-12 13:17:36,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917630597] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:36,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:36,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:17:36,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881698260] [2024-05-12 13:17:36,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:36,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:17:36,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:36,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:17:36,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:17:36,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:17:36,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 77 transitions, 501 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:17:36,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:36,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:17:36,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:36,696 INFO L124 PetriNetUnfolderBase]: 645/1316 cut-off events. [2024-05-12 13:17:36,696 INFO L125 PetriNetUnfolderBase]: For 6977/6977 co-relation queries the response was YES. [2024-05-12 13:17:36,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4650 conditions, 1316 events. 645/1316 cut-off events. For 6977/6977 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7658 event pairs, 181 based on Foata normal form. 1/1261 useless extension candidates. Maximal degree in co-relation 4611. Up to 965 conditions per place. [2024-05-12 13:17:36,706 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 62 selfloop transitions, 21 changer transitions 0/97 dead transitions. [2024-05-12 13:17:36,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 97 transitions, 727 flow [2024-05-12 13:17:36,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:17:36,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:17:36,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-05-12 13:17:36,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-05-12 13:17:36,708 INFO L175 Difference]: Start difference. First operand has 87 places, 77 transitions, 501 flow. Second operand 7 states and 136 transitions. [2024-05-12 13:17:36,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 97 transitions, 727 flow [2024-05-12 13:17:36,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 97 transitions, 664 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-05-12 13:17:36,718 INFO L231 Difference]: Finished difference. Result has 89 places, 77 transitions, 485 flow [2024-05-12 13:17:36,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=485, PETRI_PLACES=89, PETRI_TRANSITIONS=77} [2024-05-12 13:17:36,719 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 45 predicate places. [2024-05-12 13:17:36,719 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 77 transitions, 485 flow [2024-05-12 13:17:36,719 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:17:36,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:36,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:36,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 13:17:36,720 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:17:36,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:36,720 INFO L85 PathProgramCache]: Analyzing trace with hash -4528919, now seen corresponding path program 1 times [2024-05-12 13:17:36,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:36,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144418715] [2024-05-12 13:17:36,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:36,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:37,551 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:17:37,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:37,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144418715] [2024-05-12 13:17:37,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144418715] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:37,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:37,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:17:37,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524602626] [2024-05-12 13:17:37,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:37,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:17:37,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:37,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:17:37,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:17:37,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:17:37,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 77 transitions, 485 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:17:37,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:37,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:17:37,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:38,106 INFO L124 PetriNetUnfolderBase]: 705/1328 cut-off events. [2024-05-12 13:17:38,107 INFO L125 PetriNetUnfolderBase]: For 8404/8406 co-relation queries the response was YES. [2024-05-12 13:17:38,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5054 conditions, 1328 events. 705/1328 cut-off events. For 8404/8406 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7392 event pairs, 179 based on Foata normal form. 4/1302 useless extension candidates. Maximal degree in co-relation 5014. Up to 1034 conditions per place. [2024-05-12 13:17:38,118 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 83 selfloop transitions, 31 changer transitions 0/127 dead transitions. [2024-05-12 13:17:38,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 127 transitions, 943 flow [2024-05-12 13:17:38,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:17:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:17:38,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-05-12 13:17:38,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-05-12 13:17:38,122 INFO L175 Difference]: Start difference. First operand has 89 places, 77 transitions, 485 flow. Second operand 9 states and 176 transitions. [2024-05-12 13:17:38,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 127 transitions, 943 flow [2024-05-12 13:17:38,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 127 transitions, 890 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-05-12 13:17:38,136 INFO L231 Difference]: Finished difference. Result has 95 places, 100 transitions, 704 flow [2024-05-12 13:17:38,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=704, PETRI_PLACES=95, PETRI_TRANSITIONS=100} [2024-05-12 13:17:38,136 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 51 predicate places. [2024-05-12 13:17:38,136 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 100 transitions, 704 flow [2024-05-12 13:17:38,137 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:17:38,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:38,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:38,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 13:17:38,137 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:17:38,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:38,138 INFO L85 PathProgramCache]: Analyzing trace with hash 577918313, now seen corresponding path program 2 times [2024-05-12 13:17:38,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:38,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658940685] [2024-05-12 13:17:38,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:38,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:39,136 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:17:39,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:39,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658940685] [2024-05-12 13:17:39,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658940685] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:39,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:39,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:17:39,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845123273] [2024-05-12 13:17:39,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:39,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:17:39,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:39,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:17:39,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:17:39,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:17:39,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 100 transitions, 704 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:17:39,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:39,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:17:39,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:39,911 INFO L124 PetriNetUnfolderBase]: 727/1368 cut-off events. [2024-05-12 13:17:39,911 INFO L125 PetriNetUnfolderBase]: For 10018/10024 co-relation queries the response was YES. [2024-05-12 13:17:39,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5575 conditions, 1368 events. 727/1368 cut-off events. For 10018/10024 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7676 event pairs, 179 based on Foata normal form. 8/1345 useless extension candidates. Maximal degree in co-relation 5531. Up to 1044 conditions per place. [2024-05-12 13:17:39,923 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 85 selfloop transitions, 33 changer transitions 0/131 dead transitions. [2024-05-12 13:17:39,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 131 transitions, 1062 flow [2024-05-12 13:17:39,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:17:39,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:17:39,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2024-05-12 13:17:39,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49375 [2024-05-12 13:17:39,924 INFO L175 Difference]: Start difference. First operand has 95 places, 100 transitions, 704 flow. Second operand 8 states and 158 transitions. [2024-05-12 13:17:39,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 131 transitions, 1062 flow [2024-05-12 13:17:39,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 131 transitions, 1026 flow, removed 15 selfloop flow, removed 2 redundant places. [2024-05-12 13:17:39,940 INFO L231 Difference]: Finished difference. Result has 101 places, 102 transitions, 769 flow [2024-05-12 13:17:39,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=769, PETRI_PLACES=101, PETRI_TRANSITIONS=102} [2024-05-12 13:17:39,941 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 57 predicate places. [2024-05-12 13:17:39,941 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 102 transitions, 769 flow [2024-05-12 13:17:39,941 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:17:39,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:39,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:39,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 13:17:39,942 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:17:39,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:39,942 INFO L85 PathProgramCache]: Analyzing trace with hash 578068973, now seen corresponding path program 3 times [2024-05-12 13:17:39,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:39,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47560948] [2024-05-12 13:17:39,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:39,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:40,764 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:17:40,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:40,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47560948] [2024-05-12 13:17:40,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47560948] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:40,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:40,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:17:40,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138495967] [2024-05-12 13:17:40,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:40,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:17:40,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:40,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:17:40,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:17:40,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:17:40,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 102 transitions, 769 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:17:40,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:40,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:17:40,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:41,307 INFO L124 PetriNetUnfolderBase]: 749/1410 cut-off events. [2024-05-12 13:17:41,307 INFO L125 PetriNetUnfolderBase]: For 11473/11475 co-relation queries the response was YES. [2024-05-12 13:17:41,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5985 conditions, 1410 events. 749/1410 cut-off events. For 11473/11475 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7981 event pairs, 182 based on Foata normal form. 4/1383 useless extension candidates. Maximal degree in co-relation 5939. Up to 1039 conditions per place. [2024-05-12 13:17:41,317 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 84 selfloop transitions, 35 changer transitions 0/132 dead transitions. [2024-05-12 13:17:41,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 132 transitions, 1129 flow [2024-05-12 13:17:41,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:17:41,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:17:41,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-05-12 13:17:41,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.496875 [2024-05-12 13:17:41,319 INFO L175 Difference]: Start difference. First operand has 101 places, 102 transitions, 769 flow. Second operand 8 states and 159 transitions. [2024-05-12 13:17:41,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 132 transitions, 1129 flow [2024-05-12 13:17:41,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 132 transitions, 1049 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-05-12 13:17:41,337 INFO L231 Difference]: Finished difference. Result has 104 places, 104 transitions, 794 flow [2024-05-12 13:17:41,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=794, PETRI_PLACES=104, PETRI_TRANSITIONS=104} [2024-05-12 13:17:41,339 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 60 predicate places. [2024-05-12 13:17:41,339 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 104 transitions, 794 flow [2024-05-12 13:17:41,339 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:17:41,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:41,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:41,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 13:17:41,340 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:17:41,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:41,340 INFO L85 PathProgramCache]: Analyzing trace with hash 578069221, now seen corresponding path program 1 times [2024-05-12 13:17:41,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:41,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564949317] [2024-05-12 13:17:41,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:41,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:42,166 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:17:42,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:42,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564949317] [2024-05-12 13:17:42,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564949317] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:42,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:42,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:17:42,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139352111] [2024-05-12 13:17:42,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:42,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:17:42,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:42,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:17:42,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:17:42,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:17:42,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 104 transitions, 794 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:17:42,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:42,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:17:42,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:42,677 INFO L124 PetriNetUnfolderBase]: 813/1503 cut-off events. [2024-05-12 13:17:42,678 INFO L125 PetriNetUnfolderBase]: For 11244/11248 co-relation queries the response was YES. [2024-05-12 13:17:42,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6300 conditions, 1503 events. 813/1503 cut-off events. For 11244/11248 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8449 event pairs, 197 based on Foata normal form. 5/1470 useless extension candidates. Maximal degree in co-relation 6253. Up to 1246 conditions per place. [2024-05-12 13:17:42,688 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 102 selfloop transitions, 24 changer transitions 0/134 dead transitions. [2024-05-12 13:17:42,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 134 transitions, 1166 flow [2024-05-12 13:17:42,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:17:42,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:17:42,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-05-12 13:17:42,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625 [2024-05-12 13:17:42,690 INFO L175 Difference]: Start difference. First operand has 104 places, 104 transitions, 794 flow. Second operand 8 states and 148 transitions. [2024-05-12 13:17:42,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 134 transitions, 1166 flow [2024-05-12 13:17:42,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 134 transitions, 1081 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-05-12 13:17:42,710 INFO L231 Difference]: Finished difference. Result has 106 places, 106 transitions, 784 flow [2024-05-12 13:17:42,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=784, PETRI_PLACES=106, PETRI_TRANSITIONS=106} [2024-05-12 13:17:42,710 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 62 predicate places. [2024-05-12 13:17:42,710 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 106 transitions, 784 flow [2024-05-12 13:17:42,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:17:42,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:42,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:42,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 13:17:42,711 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:17:42,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:42,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1888813485, now seen corresponding path program 2 times [2024-05-12 13:17:42,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:42,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652299037] [2024-05-12 13:17:42,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:42,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:42,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:43,591 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:17:43,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:43,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652299037] [2024-05-12 13:17:43,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652299037] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:43,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:43,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:17:43,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028606855] [2024-05-12 13:17:43,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:43,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:17:43,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:43,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:17:43,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:17:43,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:17:43,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 106 transitions, 784 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:17:43,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:43,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:17:43,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:44,014 INFO L124 PetriNetUnfolderBase]: 837/1537 cut-off events. [2024-05-12 13:17:44,014 INFO L125 PetriNetUnfolderBase]: For 12095/12099 co-relation queries the response was YES. [2024-05-12 13:17:44,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6508 conditions, 1537 events. 837/1537 cut-off events. For 12095/12099 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8630 event pairs, 198 based on Foata normal form. 5/1504 useless extension candidates. Maximal degree in co-relation 6460. Up to 1225 conditions per place. [2024-05-12 13:17:44,024 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 101 selfloop transitions, 29 changer transitions 0/138 dead transitions. [2024-05-12 13:17:44,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 138 transitions, 1230 flow [2024-05-12 13:17:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:17:44,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:17:44,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-05-12 13:17:44,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.471875 [2024-05-12 13:17:44,026 INFO L175 Difference]: Start difference. First operand has 106 places, 106 transitions, 784 flow. Second operand 8 states and 151 transitions. [2024-05-12 13:17:44,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 138 transitions, 1230 flow [2024-05-12 13:17:44,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 138 transitions, 1171 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-05-12 13:17:44,046 INFO L231 Difference]: Finished difference. Result has 108 places, 110 transitions, 836 flow [2024-05-12 13:17:44,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=836, PETRI_PLACES=108, PETRI_TRANSITIONS=110} [2024-05-12 13:17:44,047 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 64 predicate places. [2024-05-12 13:17:44,047 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 110 transitions, 836 flow [2024-05-12 13:17:44,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:17:44,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:44,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:44,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 13:17:44,048 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:17:44,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:44,048 INFO L85 PathProgramCache]: Analyzing trace with hash 103305457, now seen corresponding path program 4 times [2024-05-12 13:17:44,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:44,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765774582] [2024-05-12 13:17:44,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:44,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:44,921 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:17:44,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:44,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765774582] [2024-05-12 13:17:44,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765774582] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:44,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:44,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:17:44,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216870345] [2024-05-12 13:17:44,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:44,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:17:44,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:44,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:17:44,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:17:45,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:17:45,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 110 transitions, 836 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:17:45,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:45,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:17:45,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:45,487 INFO L124 PetriNetUnfolderBase]: 807/1515 cut-off events. [2024-05-12 13:17:45,488 INFO L125 PetriNetUnfolderBase]: For 14019/14021 co-relation queries the response was YES. [2024-05-12 13:17:45,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6578 conditions, 1515 events. 807/1515 cut-off events. For 14019/14021 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8757 event pairs, 189 based on Foata normal form. 4/1484 useless extension candidates. Maximal degree in co-relation 6529. Up to 1067 conditions per place. [2024-05-12 13:17:45,500 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 86 selfloop transitions, 37 changer transitions 0/139 dead transitions. [2024-05-12 13:17:45,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 139 transitions, 1204 flow [2024-05-12 13:17:45,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:17:45,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:17:45,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-05-12 13:17:45,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.496875 [2024-05-12 13:17:45,526 INFO L175 Difference]: Start difference. First operand has 108 places, 110 transitions, 836 flow. Second operand 8 states and 159 transitions. [2024-05-12 13:17:45,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 139 transitions, 1204 flow [2024-05-12 13:17:45,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 139 transitions, 1154 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-05-12 13:17:45,547 INFO L231 Difference]: Finished difference. Result has 112 places, 112 transitions, 895 flow [2024-05-12 13:17:45,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=895, PETRI_PLACES=112, PETRI_TRANSITIONS=112} [2024-05-12 13:17:45,548 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 68 predicate places. [2024-05-12 13:17:45,548 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 112 transitions, 895 flow [2024-05-12 13:17:45,549 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:17:45,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:45,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:45,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 13:17:45,549 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:17:45,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:45,550 INFO L85 PathProgramCache]: Analyzing trace with hash 103314385, now seen corresponding path program 1 times [2024-05-12 13:17:45,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:45,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256485717] [2024-05-12 13:17:45,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:45,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:46,448 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:17:46,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:46,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256485717] [2024-05-12 13:17:46,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256485717] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:46,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:46,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:17:46,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740737435] [2024-05-12 13:17:46,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:46,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:17:46,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:46,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:17:46,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:17:46,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:17:46,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 112 transitions, 895 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:17:46,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:46,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:17:46,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:46,937 INFO L124 PetriNetUnfolderBase]: 808/1525 cut-off events. [2024-05-12 13:17:46,937 INFO L125 PetriNetUnfolderBase]: For 14853/14867 co-relation queries the response was YES. [2024-05-12 13:17:46,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6709 conditions, 1525 events. 808/1525 cut-off events. For 14853/14867 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8835 event pairs, 197 based on Foata normal form. 15/1502 useless extension candidates. Maximal degree in co-relation 6658. Up to 1229 conditions per place. [2024-05-12 13:17:46,948 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 104 selfloop transitions, 18 changer transitions 0/140 dead transitions. [2024-05-12 13:17:46,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 140 transitions, 1247 flow [2024-05-12 13:17:46,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:17:46,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:17:46,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-05-12 13:17:46,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.478125 [2024-05-12 13:17:46,950 INFO L175 Difference]: Start difference. First operand has 112 places, 112 transitions, 895 flow. Second operand 8 states and 153 transitions. [2024-05-12 13:17:46,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 140 transitions, 1247 flow [2024-05-12 13:17:46,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 140 transitions, 1154 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-05-12 13:17:46,975 INFO L231 Difference]: Finished difference. Result has 114 places, 114 transitions, 861 flow [2024-05-12 13:17:46,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=861, PETRI_PLACES=114, PETRI_TRANSITIONS=114} [2024-05-12 13:17:46,976 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 70 predicate places. [2024-05-12 13:17:46,976 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 114 transitions, 861 flow [2024-05-12 13:17:46,977 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:17:46,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:46,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:46,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 13:17:46,977 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:17:46,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:46,978 INFO L85 PathProgramCache]: Analyzing trace with hash 863932111, now seen corresponding path program 3 times [2024-05-12 13:17:46,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:46,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812568908] [2024-05-12 13:17:46,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:46,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:47,798 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:17:47,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:47,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812568908] [2024-05-12 13:17:47,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812568908] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:47,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:47,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:17:47,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199522620] [2024-05-12 13:17:47,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:47,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:17:47,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:47,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:17:47,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:17:47,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:17:47,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 114 transitions, 861 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:17:47,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:47,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:17:47,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:48,244 INFO L124 PetriNetUnfolderBase]: 868/1602 cut-off events. [2024-05-12 13:17:48,245 INFO L125 PetriNetUnfolderBase]: For 15102/15106 co-relation queries the response was YES. [2024-05-12 13:17:48,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7060 conditions, 1602 events. 868/1602 cut-off events. For 15102/15106 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9149 event pairs, 198 based on Foata normal form. 5/1565 useless extension candidates. Maximal degree in co-relation 7008. Up to 1274 conditions per place. [2024-05-12 13:17:48,254 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 103 selfloop transitions, 30 changer transitions 0/141 dead transitions. [2024-05-12 13:17:48,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 141 transitions, 1229 flow [2024-05-12 13:17:48,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:17:48,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:17:48,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-05-12 13:17:48,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.465625 [2024-05-12 13:17:48,255 INFO L175 Difference]: Start difference. First operand has 114 places, 114 transitions, 861 flow. Second operand 8 states and 149 transitions. [2024-05-12 13:17:48,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 141 transitions, 1229 flow [2024-05-12 13:17:48,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 141 transitions, 1172 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-05-12 13:17:48,276 INFO L231 Difference]: Finished difference. Result has 116 places, 114 transitions, 869 flow [2024-05-12 13:17:48,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=869, PETRI_PLACES=116, PETRI_TRANSITIONS=114} [2024-05-12 13:17:48,276 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 72 predicate places. [2024-05-12 13:17:48,276 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 114 transitions, 869 flow [2024-05-12 13:17:48,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:17:48,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:48,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:48,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-12 13:17:48,277 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:17:48,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:48,278 INFO L85 PathProgramCache]: Analyzing trace with hash 785644973, now seen corresponding path program 5 times [2024-05-12 13:17:48,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:48,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290595513] [2024-05-12 13:17:48,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:48,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:49,072 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:17:49,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:49,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290595513] [2024-05-12 13:17:49,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290595513] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:49,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:49,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:17:49,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658293731] [2024-05-12 13:17:49,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:49,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:17:49,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:49,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:17:49,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:17:49,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:17:49,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 114 transitions, 869 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:17:49,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:49,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:17:49,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:49,470 INFO L124 PetriNetUnfolderBase]: 821/1584 cut-off events. [2024-05-12 13:17:49,470 INFO L125 PetriNetUnfolderBase]: For 16549/16552 co-relation queries the response was YES. [2024-05-12 13:17:49,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6941 conditions, 1584 events. 821/1584 cut-off events. For 16549/16552 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9231 event pairs, 178 based on Foata normal form. 5/1540 useless extension candidates. Maximal degree in co-relation 6888. Up to 1034 conditions per place. [2024-05-12 13:17:49,483 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 85 selfloop transitions, 42 changer transitions 0/143 dead transitions. [2024-05-12 13:17:49,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 143 transitions, 1255 flow [2024-05-12 13:17:49,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:17:49,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:17:49,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-05-12 13:17:49,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.496875 [2024-05-12 13:17:49,485 INFO L175 Difference]: Start difference. First operand has 116 places, 114 transitions, 869 flow. Second operand 8 states and 159 transitions. [2024-05-12 13:17:49,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 143 transitions, 1255 flow [2024-05-12 13:17:49,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 143 transitions, 1190 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-05-12 13:17:49,512 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 927 flow [2024-05-12 13:17:49,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=927, PETRI_PLACES=117, PETRI_TRANSITIONS=116} [2024-05-12 13:17:49,512 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 73 predicate places. [2024-05-12 13:17:49,512 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 927 flow [2024-05-12 13:17:49,513 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:17:49,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:49,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:49,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-12 13:17:49,513 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:17:49,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:49,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1603713615, now seen corresponding path program 4 times [2024-05-12 13:17:49,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:49,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749962703] [2024-05-12 13:17:49,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:49,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:50,334 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:17:50,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:50,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749962703] [2024-05-12 13:17:50,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749962703] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:50,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:50,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:17:50,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553427765] [2024-05-12 13:17:50,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:50,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:17:50,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:50,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:17:50,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:17:50,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:17:50,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 116 transitions, 927 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:17:50,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:50,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:17:50,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:50,750 INFO L124 PetriNetUnfolderBase]: 894/1720 cut-off events. [2024-05-12 13:17:50,750 INFO L125 PetriNetUnfolderBase]: For 17972/17976 co-relation queries the response was YES. [2024-05-12 13:17:50,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7633 conditions, 1720 events. 894/1720 cut-off events. For 17972/17976 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 10088 event pairs, 191 based on Foata normal form. 5/1663 useless extension candidates. Maximal degree in co-relation 7579. Up to 1222 conditions per place. [2024-05-12 13:17:50,759 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 101 selfloop transitions, 39 changer transitions 0/148 dead transitions. [2024-05-12 13:17:50,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 148 transitions, 1417 flow [2024-05-12 13:17:50,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:17:50,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:17:50,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-05-12 13:17:50,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-05-12 13:17:50,761 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 927 flow. Second operand 8 states and 152 transitions. [2024-05-12 13:17:50,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 148 transitions, 1417 flow [2024-05-12 13:17:50,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 148 transitions, 1310 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-05-12 13:17:50,786 INFO L231 Difference]: Finished difference. Result has 119 places, 120 transitions, 959 flow [2024-05-12 13:17:50,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=959, PETRI_PLACES=119, PETRI_TRANSITIONS=120} [2024-05-12 13:17:50,787 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 75 predicate places. [2024-05-12 13:17:50,787 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 120 transitions, 959 flow [2024-05-12 13:17:50,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:17:50,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:50,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:50,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-12 13:17:50,788 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:17:50,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:50,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1603705245, now seen corresponding path program 5 times [2024-05-12 13:17:50,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:50,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573678513] [2024-05-12 13:17:50,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:50,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:51,584 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:17:51,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:51,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573678513] [2024-05-12 13:17:51,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573678513] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:51,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:51,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:17:51,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923265295] [2024-05-12 13:17:51,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:51,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:17:51,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:51,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:17:51,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:17:51,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:17:51,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 120 transitions, 959 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:17:51,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:51,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:17:51,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:51,991 INFO L124 PetriNetUnfolderBase]: 905/1737 cut-off events. [2024-05-12 13:17:51,991 INFO L125 PetriNetUnfolderBase]: For 18793/18797 co-relation queries the response was YES. [2024-05-12 13:17:51,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7732 conditions, 1737 events. 905/1737 cut-off events. For 18793/18797 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10162 event pairs, 191 based on Foata normal form. 5/1680 useless extension candidates. Maximal degree in co-relation 7677. Up to 1234 conditions per place. [2024-05-12 13:17:52,001 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 102 selfloop transitions, 40 changer transitions 0/150 dead transitions. [2024-05-12 13:17:52,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 150 transitions, 1433 flow [2024-05-12 13:17:52,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:17:52,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:17:52,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-05-12 13:17:52,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.478125 [2024-05-12 13:17:52,009 INFO L175 Difference]: Start difference. First operand has 119 places, 120 transitions, 959 flow. Second operand 8 states and 153 transitions. [2024-05-12 13:17:52,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 150 transitions, 1433 flow [2024-05-12 13:17:52,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 150 transitions, 1334 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-05-12 13:17:52,036 INFO L231 Difference]: Finished difference. Result has 122 places, 122 transitions, 975 flow [2024-05-12 13:17:52,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=975, PETRI_PLACES=122, PETRI_TRANSITIONS=122} [2024-05-12 13:17:52,036 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 78 predicate places. [2024-05-12 13:17:52,037 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 122 transitions, 975 flow [2024-05-12 13:17:52,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:17:52,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:52,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:52,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-12 13:17:52,037 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:17:52,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:52,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1593229415, now seen corresponding path program 2 times [2024-05-12 13:17:52,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:52,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383183224] [2024-05-12 13:17:52,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:52,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:52,838 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:17:52,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:52,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383183224] [2024-05-12 13:17:52,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383183224] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:52,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:52,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:17:52,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711065412] [2024-05-12 13:17:52,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:52,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:17:52,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:52,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:17:52,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:17:52,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:17:52,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 122 transitions, 975 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:17:52,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:52,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:17:52,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:53,236 INFO L124 PetriNetUnfolderBase]: 855/1690 cut-off events. [2024-05-12 13:17:53,236 INFO L125 PetriNetUnfolderBase]: For 19013/19027 co-relation queries the response was YES. [2024-05-12 13:17:53,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7304 conditions, 1690 events. 855/1690 cut-off events. For 19013/19027 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10171 event pairs, 183 based on Foata normal form. 15/1643 useless extension candidates. Maximal degree in co-relation 7248. Up to 1195 conditions per place. [2024-05-12 13:17:53,246 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 103 selfloop transitions, 30 changer transitions 0/154 dead transitions. [2024-05-12 13:17:53,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 154 transitions, 1435 flow [2024-05-12 13:17:53,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:17:53,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:17:53,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-05-12 13:17:53,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4875 [2024-05-12 13:17:53,247 INFO L175 Difference]: Start difference. First operand has 122 places, 122 transitions, 975 flow. Second operand 8 states and 156 transitions. [2024-05-12 13:17:53,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 154 transitions, 1435 flow [2024-05-12 13:17:53,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 154 transitions, 1350 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-05-12 13:17:53,267 INFO L231 Difference]: Finished difference. Result has 126 places, 127 transitions, 1010 flow [2024-05-12 13:17:53,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1010, PETRI_PLACES=126, PETRI_TRANSITIONS=127} [2024-05-12 13:17:53,268 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 82 predicate places. [2024-05-12 13:17:53,268 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 127 transitions, 1010 flow [2024-05-12 13:17:53,268 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:17:53,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:53,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:53,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-12 13:17:53,269 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:17:53,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:53,269 INFO L85 PathProgramCache]: Analyzing trace with hash -556550395, now seen corresponding path program 3 times [2024-05-12 13:17:53,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:53,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864797691] [2024-05-12 13:17:53,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:53,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:54,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:17:54,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:54,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864797691] [2024-05-12 13:17:54,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864797691] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:54,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:54,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:17:54,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418045206] [2024-05-12 13:17:54,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:54,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:17:54,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:54,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:17:54,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:17:54,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:17:54,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 127 transitions, 1010 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:17:54,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:54,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:17:54,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:54,405 INFO L124 PetriNetUnfolderBase]: 866/1719 cut-off events. [2024-05-12 13:17:54,405 INFO L125 PetriNetUnfolderBase]: For 20397/20411 co-relation queries the response was YES. [2024-05-12 13:17:54,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7540 conditions, 1719 events. 866/1719 cut-off events. For 20397/20411 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10414 event pairs, 189 based on Foata normal form. 15/1669 useless extension candidates. Maximal degree in co-relation 7482. Up to 1207 conditions per place. [2024-05-12 13:17:54,416 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 106 selfloop transitions, 30 changer transitions 0/157 dead transitions. [2024-05-12 13:17:54,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 157 transitions, 1469 flow [2024-05-12 13:17:54,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:17:54,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:17:54,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2024-05-12 13:17:54,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49375 [2024-05-12 13:17:54,427 INFO L175 Difference]: Start difference. First operand has 126 places, 127 transitions, 1010 flow. Second operand 8 states and 158 transitions. [2024-05-12 13:17:54,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 157 transitions, 1469 flow [2024-05-12 13:17:54,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 157 transitions, 1421 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-05-12 13:17:54,458 INFO L231 Difference]: Finished difference. Result has 130 places, 130 transitions, 1058 flow [2024-05-12 13:17:54,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=964, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1058, PETRI_PLACES=130, PETRI_TRANSITIONS=130} [2024-05-12 13:17:54,459 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 86 predicate places. [2024-05-12 13:17:54,459 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 130 transitions, 1058 flow [2024-05-12 13:17:54,459 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:17:54,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:54,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:54,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-12 13:17:54,460 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:17:54,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:54,460 INFO L85 PathProgramCache]: Analyzing trace with hash -646108821, now seen corresponding path program 4 times [2024-05-12 13:17:54,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:54,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450752589] [2024-05-12 13:17:54,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:54,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:55,235 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:17:55,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:55,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450752589] [2024-05-12 13:17:55,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450752589] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:55,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:55,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:17:55,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479150920] [2024-05-12 13:17:55,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:55,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:17:55,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:55,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:17:55,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:17:55,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:17:55,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 130 transitions, 1058 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:17:55,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:55,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:17:55,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:55,655 INFO L124 PetriNetUnfolderBase]: 864/1722 cut-off events. [2024-05-12 13:17:55,656 INFO L125 PetriNetUnfolderBase]: For 21138/21152 co-relation queries the response was YES. [2024-05-12 13:17:55,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7613 conditions, 1722 events. 864/1722 cut-off events. For 21138/21152 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10515 event pairs, 186 based on Foata normal form. 15/1669 useless extension candidates. Maximal degree in co-relation 7553. Up to 1205 conditions per place. [2024-05-12 13:17:55,664 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 104 selfloop transitions, 31 changer transitions 0/156 dead transitions. [2024-05-12 13:17:55,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 156 transitions, 1428 flow [2024-05-12 13:17:55,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:17:55,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:17:55,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-05-12 13:17:55,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4875 [2024-05-12 13:17:55,666 INFO L175 Difference]: Start difference. First operand has 130 places, 130 transitions, 1058 flow. Second operand 8 states and 156 transitions. [2024-05-12 13:17:55,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 156 transitions, 1428 flow [2024-05-12 13:17:55,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 156 transitions, 1368 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-05-12 13:17:55,691 INFO L231 Difference]: Finished difference. Result has 134 places, 130 transitions, 1065 flow [2024-05-12 13:17:55,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=998, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1065, PETRI_PLACES=134, PETRI_TRANSITIONS=130} [2024-05-12 13:17:55,692 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 90 predicate places. [2024-05-12 13:17:55,692 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 130 transitions, 1065 flow [2024-05-12 13:17:55,692 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:17:55,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:55,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:55,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-12 13:17:55,693 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:17:55,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:55,693 INFO L85 PathProgramCache]: Analyzing trace with hash -646109131, now seen corresponding path program 6 times [2024-05-12 13:17:55,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:55,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041265446] [2024-05-12 13:17:55,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:55,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:56,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:17:56,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:56,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041265446] [2024-05-12 13:17:56,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041265446] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:56,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:56,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:17:56,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374569618] [2024-05-12 13:17:56,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:56,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:17:56,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:56,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:17:56,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:17:56,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:17:56,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 130 transitions, 1065 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:17:56,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:56,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:17:56,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:56,895 INFO L124 PetriNetUnfolderBase]: 926/1788 cut-off events. [2024-05-12 13:17:56,895 INFO L125 PetriNetUnfolderBase]: For 22089/22093 co-relation queries the response was YES. [2024-05-12 13:17:56,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8055 conditions, 1788 events. 926/1788 cut-off events. For 22089/22093 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10658 event pairs, 188 based on Foata normal form. 5/1724 useless extension candidates. Maximal degree in co-relation 7994. Up to 1268 conditions per place. [2024-05-12 13:17:56,905 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 106 selfloop transitions, 43 changer transitions 0/157 dead transitions. [2024-05-12 13:17:56,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 157 transitions, 1471 flow [2024-05-12 13:17:56,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:17:56,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:17:56,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-05-12 13:17:56,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2024-05-12 13:17:56,907 INFO L175 Difference]: Start difference. First operand has 134 places, 130 transitions, 1065 flow. Second operand 8 states and 150 transitions. [2024-05-12 13:17:56,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 157 transitions, 1471 flow [2024-05-12 13:17:56,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 157 transitions, 1400 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-05-12 13:17:56,934 INFO L231 Difference]: Finished difference. Result has 136 places, 130 transitions, 1085 flow [2024-05-12 13:17:56,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=994, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1085, PETRI_PLACES=136, PETRI_TRANSITIONS=130} [2024-05-12 13:17:56,934 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 92 predicate places. [2024-05-12 13:17:56,935 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 130 transitions, 1085 flow [2024-05-12 13:17:56,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:17:56,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:56,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:17:56,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-12 13:17:56,935 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:17:56,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:56,936 INFO L85 PathProgramCache]: Analyzing trace with hash -645739735, now seen corresponding path program 1 times [2024-05-12 13:17:56,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:56,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610437063] [2024-05-12 13:17:56,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:56,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:58,058 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:17:58,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:58,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610437063] [2024-05-12 13:17:58,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610437063] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:58,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:58,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:17:58,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333178196] [2024-05-12 13:17:58,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:58,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:17:58,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:58,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:17:58,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:17:58,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:17:58,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 130 transitions, 1085 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:17:58,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:58,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:17:58,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:17:58,508 INFO L124 PetriNetUnfolderBase]: 860/1684 cut-off events. [2024-05-12 13:17:58,508 INFO L125 PetriNetUnfolderBase]: For 22493/22508 co-relation queries the response was YES. [2024-05-12 13:17:58,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7574 conditions, 1684 events. 860/1684 cut-off events. For 22493/22508 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10279 event pairs, 203 based on Foata normal form. 16/1638 useless extension candidates. Maximal degree in co-relation 7512. Up to 1301 conditions per place. [2024-05-12 13:17:58,519 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 126 selfloop transitions, 15 changer transitions 0/162 dead transitions. [2024-05-12 13:17:58,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 162 transitions, 1493 flow [2024-05-12 13:17:58,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:17:58,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:17:58,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-05-12 13:17:58,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46944444444444444 [2024-05-12 13:17:58,520 INFO L175 Difference]: Start difference. First operand has 136 places, 130 transitions, 1085 flow. Second operand 9 states and 169 transitions. [2024-05-12 13:17:58,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 162 transitions, 1493 flow [2024-05-12 13:17:58,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 162 transitions, 1391 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-05-12 13:17:58,546 INFO L231 Difference]: Finished difference. Result has 137 places, 132 transitions, 1034 flow [2024-05-12 13:17:58,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=983, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1034, PETRI_PLACES=137, PETRI_TRANSITIONS=132} [2024-05-12 13:17:58,546 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 93 predicate places. [2024-05-12 13:17:58,546 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 132 transitions, 1034 flow [2024-05-12 13:17:58,546 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:17:58,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:17:58,546 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:17:58,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-12 13:17:58,547 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:17:58,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:17:58,547 INFO L85 PathProgramCache]: Analyzing trace with hash 740062081, now seen corresponding path program 1 times [2024-05-12 13:17:58,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:17:58,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329975430] [2024-05-12 13:17:58,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:17:58,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:17:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:17:59,704 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:17:59,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:17:59,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329975430] [2024-05-12 13:17:59,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329975430] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:17:59,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:17:59,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:17:59,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704365001] [2024-05-12 13:17:59,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:17:59,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:17:59,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:17:59,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:17:59,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:17:59,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:17:59,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 132 transitions, 1034 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:17:59,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:17:59,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:17:59,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:00,375 INFO L124 PetriNetUnfolderBase]: 861/1639 cut-off events. [2024-05-12 13:18:00,376 INFO L125 PetriNetUnfolderBase]: For 23306/23312 co-relation queries the response was YES. [2024-05-12 13:18:00,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7622 conditions, 1639 events. 861/1639 cut-off events. For 23306/23312 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9740 event pairs, 197 based on Foata normal form. 7/1601 useless extension candidates. Maximal degree in co-relation 7559. Up to 1246 conditions per place. [2024-05-12 13:18:00,386 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 118 selfloop transitions, 34 changer transitions 0/171 dead transitions. [2024-05-12 13:18:00,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 171 transitions, 1508 flow [2024-05-12 13:18:00,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:18:00,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:18:00,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-05-12 13:18:00,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2024-05-12 13:18:00,387 INFO L175 Difference]: Start difference. First operand has 137 places, 132 transitions, 1034 flow. Second operand 9 states and 177 transitions. [2024-05-12 13:18:00,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 171 transitions, 1508 flow [2024-05-12 13:18:00,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 171 transitions, 1424 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-05-12 13:18:00,417 INFO L231 Difference]: Finished difference. Result has 137 places, 137 transitions, 1093 flow [2024-05-12 13:18:00,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1093, PETRI_PLACES=137, PETRI_TRANSITIONS=137} [2024-05-12 13:18:00,418 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 93 predicate places. [2024-05-12 13:18:00,418 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 137 transitions, 1093 flow [2024-05-12 13:18:00,418 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:18:00,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:00,418 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:18:00,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-12 13:18:00,419 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:18:00,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:00,419 INFO L85 PathProgramCache]: Analyzing trace with hash 735599228, now seen corresponding path program 1 times [2024-05-12 13:18:00,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:00,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188510799] [2024-05-12 13:18:00,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:00,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:01,204 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:18:01,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:01,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188510799] [2024-05-12 13:18:01,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188510799] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:01,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:01,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:01,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749232137] [2024-05-12 13:18:01,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:01,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:01,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:01,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:01,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:01,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:01,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 137 transitions, 1093 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:01,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:01,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:18:01,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:01,775 INFO L124 PetriNetUnfolderBase]: 950/1750 cut-off events. [2024-05-12 13:18:01,775 INFO L125 PetriNetUnfolderBase]: For 25553/25557 co-relation queries the response was YES. [2024-05-12 13:18:01,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8286 conditions, 1750 events. 950/1750 cut-off events. For 25553/25557 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10230 event pairs, 219 based on Foata normal form. 6/1712 useless extension candidates. Maximal degree in co-relation 8222. Up to 1373 conditions per place. [2024-05-12 13:18:01,787 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 131 selfloop transitions, 35 changer transitions 0/174 dead transitions. [2024-05-12 13:18:01,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 174 transitions, 1579 flow [2024-05-12 13:18:01,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:18:01,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:18:01,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-05-12 13:18:01,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46944444444444444 [2024-05-12 13:18:01,788 INFO L175 Difference]: Start difference. First operand has 137 places, 137 transitions, 1093 flow. Second operand 9 states and 169 transitions. [2024-05-12 13:18:01,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 174 transitions, 1579 flow [2024-05-12 13:18:01,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 174 transitions, 1482 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-05-12 13:18:01,826 INFO L231 Difference]: Finished difference. Result has 140 places, 139 transitions, 1102 flow [2024-05-12 13:18:01,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=996, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1102, PETRI_PLACES=140, PETRI_TRANSITIONS=139} [2024-05-12 13:18:01,826 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 96 predicate places. [2024-05-12 13:18:01,826 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 139 transitions, 1102 flow [2024-05-12 13:18:01,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:01,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:01,827 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:18:01,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-12 13:18:01,827 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:18:01,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:01,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1099639820, now seen corresponding path program 2 times [2024-05-12 13:18:01,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:01,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098379115] [2024-05-12 13:18:01,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:01,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:02,765 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:18:02,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:02,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098379115] [2024-05-12 13:18:02,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098379115] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:02,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:02,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:02,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651938622] [2024-05-12 13:18:02,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:02,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:02,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:02,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:02,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:02,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:02,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 139 transitions, 1102 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:02,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:02,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:18:02,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:03,381 INFO L124 PetriNetUnfolderBase]: 1120/2085 cut-off events. [2024-05-12 13:18:03,382 INFO L125 PetriNetUnfolderBase]: For 30187/30187 co-relation queries the response was YES. [2024-05-12 13:18:03,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9852 conditions, 2085 events. 1120/2085 cut-off events. For 30187/30187 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12788 event pairs, 252 based on Foata normal form. 2/2029 useless extension candidates. Maximal degree in co-relation 9787. Up to 1539 conditions per place. [2024-05-12 13:18:03,398 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 140 selfloop transitions, 57 changer transitions 0/205 dead transitions. [2024-05-12 13:18:03,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 205 transitions, 2072 flow [2024-05-12 13:18:03,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:18:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:18:03,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-05-12 13:18:03,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625 [2024-05-12 13:18:03,399 INFO L175 Difference]: Start difference. First operand has 140 places, 139 transitions, 1102 flow. Second operand 10 states and 185 transitions. [2024-05-12 13:18:03,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 205 transitions, 2072 flow [2024-05-12 13:18:03,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 205 transitions, 1918 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-05-12 13:18:03,445 INFO L231 Difference]: Finished difference. Result has 147 places, 169 transitions, 1488 flow [2024-05-12 13:18:03,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1488, PETRI_PLACES=147, PETRI_TRANSITIONS=169} [2024-05-12 13:18:03,445 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 103 predicate places. [2024-05-12 13:18:03,446 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 169 transitions, 1488 flow [2024-05-12 13:18:03,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:03,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:03,446 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:18:03,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-12 13:18:03,446 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:18:03,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:03,446 INFO L85 PathProgramCache]: Analyzing trace with hash 191480784, now seen corresponding path program 3 times [2024-05-12 13:18:03,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:03,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319393026] [2024-05-12 13:18:03,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:03,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:04,298 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:18:04,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:04,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319393026] [2024-05-12 13:18:04,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319393026] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:04,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:04,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:04,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699672] [2024-05-12 13:18:04,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:04,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:04,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:04,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:04,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:04,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:04,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 169 transitions, 1488 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:04,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:04,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:18:04,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:04,910 INFO L124 PetriNetUnfolderBase]: 1340/2530 cut-off events. [2024-05-12 13:18:04,910 INFO L125 PetriNetUnfolderBase]: For 35490/35490 co-relation queries the response was YES. [2024-05-12 13:18:04,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12062 conditions, 2530 events. 1340/2530 cut-off events. For 35490/35490 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 16434 event pairs, 363 based on Foata normal form. 2/2452 useless extension candidates. Maximal degree in co-relation 11992. Up to 1793 conditions per place. [2024-05-12 13:18:04,925 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 157 selfloop transitions, 78 changer transitions 0/243 dead transitions. [2024-05-12 13:18:04,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 243 transitions, 2547 flow [2024-05-12 13:18:04,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:18:04,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:18:04,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-05-12 13:18:04,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-05-12 13:18:04,927 INFO L175 Difference]: Start difference. First operand has 147 places, 169 transitions, 1488 flow. Second operand 10 states and 190 transitions. [2024-05-12 13:18:04,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 243 transitions, 2547 flow [2024-05-12 13:18:04,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 243 transitions, 2489 flow, removed 28 selfloop flow, removed 1 redundant places. [2024-05-12 13:18:04,984 INFO L231 Difference]: Finished difference. Result has 159 places, 202 transitions, 2059 flow [2024-05-12 13:18:04,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1458, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2059, PETRI_PLACES=159, PETRI_TRANSITIONS=202} [2024-05-12 13:18:04,984 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 115 predicate places. [2024-05-12 13:18:04,984 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 202 transitions, 2059 flow [2024-05-12 13:18:04,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:04,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:04,985 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:18:04,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-12 13:18:04,985 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:18:04,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:04,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1710511585, now seen corresponding path program 1 times [2024-05-12 13:18:04,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:04,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041649629] [2024-05-12 13:18:04,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:04,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:05,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:18:05,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:05,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041649629] [2024-05-12 13:18:05,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041649629] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:05,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:05,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:05,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373941047] [2024-05-12 13:18:05,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:05,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:05,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:05,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:05,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:05,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:05,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 202 transitions, 2059 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:05,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:05,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:18:05,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:06,472 INFO L124 PetriNetUnfolderBase]: 1351/2563 cut-off events. [2024-05-12 13:18:06,472 INFO L125 PetriNetUnfolderBase]: For 38473/38473 co-relation queries the response was YES. [2024-05-12 13:18:06,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12918 conditions, 2563 events. 1351/2563 cut-off events. For 38473/38473 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 16758 event pairs, 438 based on Foata normal form. 1/2483 useless extension candidates. Maximal degree in co-relation 12842. Up to 2054 conditions per place. [2024-05-12 13:18:06,491 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 191 selfloop transitions, 44 changer transitions 0/243 dead transitions. [2024-05-12 13:18:06,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 243 transitions, 2741 flow [2024-05-12 13:18:06,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:18:06,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:18:06,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-05-12 13:18:06,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.455 [2024-05-12 13:18:06,493 INFO L175 Difference]: Start difference. First operand has 159 places, 202 transitions, 2059 flow. Second operand 10 states and 182 transitions. [2024-05-12 13:18:06,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 243 transitions, 2741 flow [2024-05-12 13:18:06,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 243 transitions, 2690 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-05-12 13:18:06,562 INFO L231 Difference]: Finished difference. Result has 168 places, 210 transitions, 2219 flow [2024-05-12 13:18:06,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2010, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2219, PETRI_PLACES=168, PETRI_TRANSITIONS=210} [2024-05-12 13:18:06,562 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 124 predicate places. [2024-05-12 13:18:06,562 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 210 transitions, 2219 flow [2024-05-12 13:18:06,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:06,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:06,563 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:18:06,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-12 13:18:06,563 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:18:06,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:06,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1710775984, now seen corresponding path program 4 times [2024-05-12 13:18:06,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:06,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683024378] [2024-05-12 13:18:06,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:06,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:18:07,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:07,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683024378] [2024-05-12 13:18:07,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683024378] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:07,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:07,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:07,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485338253] [2024-05-12 13:18:07,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:07,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:07,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:07,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:07,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:07,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:07,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 210 transitions, 2219 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:07,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:07,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:18:07,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:07,968 INFO L124 PetriNetUnfolderBase]: 1347/2561 cut-off events. [2024-05-12 13:18:07,968 INFO L125 PetriNetUnfolderBase]: For 39097/39097 co-relation queries the response was YES. [2024-05-12 13:18:07,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13015 conditions, 2561 events. 1347/2561 cut-off events. For 39097/39097 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 16836 event pairs, 385 based on Foata normal form. 2/2481 useless extension candidates. Maximal degree in co-relation 12935. Up to 1807 conditions per place. [2024-05-12 13:18:07,990 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 162 selfloop transitions, 77 changer transitions 0/247 dead transitions. [2024-05-12 13:18:07,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 247 transitions, 2841 flow [2024-05-12 13:18:07,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:18:07,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:18:07,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-05-12 13:18:07,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-05-12 13:18:07,992 INFO L175 Difference]: Start difference. First operand has 168 places, 210 transitions, 2219 flow. Second operand 10 states and 190 transitions. [2024-05-12 13:18:07,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 247 transitions, 2841 flow [2024-05-12 13:18:08,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 247 transitions, 2727 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-05-12 13:18:08,070 INFO L231 Difference]: Finished difference. Result has 173 places, 210 transitions, 2267 flow [2024-05-12 13:18:08,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2105, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2267, PETRI_PLACES=173, PETRI_TRANSITIONS=210} [2024-05-12 13:18:08,071 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 129 predicate places. [2024-05-12 13:18:08,071 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 210 transitions, 2267 flow [2024-05-12 13:18:08,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:08,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:08,072 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:18:08,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-12 13:18:08,072 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:18:08,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:08,073 INFO L85 PathProgramCache]: Analyzing trace with hash -2061759398, now seen corresponding path program 5 times [2024-05-12 13:18:08,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:08,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315201220] [2024-05-12 13:18:08,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:08,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:08,955 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:18:08,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:08,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315201220] [2024-05-12 13:18:08,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315201220] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:08,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:08,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:08,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710915209] [2024-05-12 13:18:08,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:08,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:08,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:08,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:08,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:09,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:09,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 210 transitions, 2267 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:09,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:09,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:18:09,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:09,688 INFO L124 PetriNetUnfolderBase]: 1535/2910 cut-off events. [2024-05-12 13:18:09,688 INFO L125 PetriNetUnfolderBase]: For 44564/44564 co-relation queries the response was YES. [2024-05-12 13:18:09,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14990 conditions, 2910 events. 1535/2910 cut-off events. For 44564/44564 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 19756 event pairs, 404 based on Foata normal form. 2/2818 useless extension candidates. Maximal degree in co-relation 14909. Up to 2032 conditions per place. [2024-05-12 13:18:09,711 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 179 selfloop transitions, 86 changer transitions 0/273 dead transitions. [2024-05-12 13:18:09,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 273 transitions, 3359 flow [2024-05-12 13:18:09,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:18:09,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:18:09,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2024-05-12 13:18:09,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48 [2024-05-12 13:18:09,712 INFO L175 Difference]: Start difference. First operand has 173 places, 210 transitions, 2267 flow. Second operand 10 states and 192 transitions. [2024-05-12 13:18:09,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 273 transitions, 3359 flow [2024-05-12 13:18:09,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 273 transitions, 3208 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-05-12 13:18:09,796 INFO L231 Difference]: Finished difference. Result has 179 places, 236 transitions, 2714 flow [2024-05-12 13:18:09,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2132, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2714, PETRI_PLACES=179, PETRI_TRANSITIONS=236} [2024-05-12 13:18:09,797 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 135 predicate places. [2024-05-12 13:18:09,797 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 236 transitions, 2714 flow [2024-05-12 13:18:09,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:09,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:09,797 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:18:09,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-12 13:18:09,797 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:18:09,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:09,797 INFO L85 PathProgramCache]: Analyzing trace with hash -2061751679, now seen corresponding path program 2 times [2024-05-12 13:18:09,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:09,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422764845] [2024-05-12 13:18:09,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:09,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:10,596 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:18:10,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:10,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422764845] [2024-05-12 13:18:10,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422764845] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:10,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:10,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:10,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685338898] [2024-05-12 13:18:10,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:10,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:10,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:10,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:10,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:10,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:10,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 236 transitions, 2714 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:10,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:10,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:18:10,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:11,327 INFO L124 PetriNetUnfolderBase]: 1553/2957 cut-off events. [2024-05-12 13:18:11,327 INFO L125 PetriNetUnfolderBase]: For 48320/48320 co-relation queries the response was YES. [2024-05-12 13:18:11,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15651 conditions, 2957 events. 1553/2957 cut-off events. For 48320/48320 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 20198 event pairs, 523 based on Foata normal form. 1/2860 useless extension candidates. Maximal degree in co-relation 15567. Up to 2353 conditions per place. [2024-05-12 13:18:11,347 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 216 selfloop transitions, 49 changer transitions 0/273 dead transitions. [2024-05-12 13:18:11,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 273 transitions, 3423 flow [2024-05-12 13:18:11,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:18:11,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:18:11,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-05-12 13:18:11,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.455 [2024-05-12 13:18:11,349 INFO L175 Difference]: Start difference. First operand has 179 places, 236 transitions, 2714 flow. Second operand 10 states and 182 transitions. [2024-05-12 13:18:11,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 273 transitions, 3423 flow [2024-05-12 13:18:11,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 273 transitions, 3307 flow, removed 27 selfloop flow, removed 5 redundant places. [2024-05-12 13:18:11,449 INFO L231 Difference]: Finished difference. Result has 185 places, 242 transitions, 2784 flow [2024-05-12 13:18:11,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2598, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2784, PETRI_PLACES=185, PETRI_TRANSITIONS=242} [2024-05-12 13:18:11,449 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 141 predicate places. [2024-05-12 13:18:11,449 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 242 transitions, 2784 flow [2024-05-12 13:18:11,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:11,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:11,450 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:18:11,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-05-12 13:18:11,450 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:18:11,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:11,450 INFO L85 PathProgramCache]: Analyzing trace with hash -2061751958, now seen corresponding path program 6 times [2024-05-12 13:18:11,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:11,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476263845] [2024-05-12 13:18:11,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:11,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:12,280 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:18:12,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:12,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476263845] [2024-05-12 13:18:12,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476263845] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:12,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:12,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:12,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229020566] [2024-05-12 13:18:12,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:12,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:12,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:12,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:12,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:12,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:12,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 242 transitions, 2784 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:12,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:12,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:18:12,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:13,004 INFO L124 PetriNetUnfolderBase]: 1549/2933 cut-off events. [2024-05-12 13:18:13,004 INFO L125 PetriNetUnfolderBase]: For 48098/48098 co-relation queries the response was YES. [2024-05-12 13:18:13,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15638 conditions, 2933 events. 1549/2933 cut-off events. For 48098/48098 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 19894 event pairs, 392 based on Foata normal form. 2/2839 useless extension candidates. Maximal degree in co-relation 15551. Up to 2057 conditions per place. [2024-05-12 13:18:13,027 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 178 selfloop transitions, 90 changer transitions 0/276 dead transitions. [2024-05-12 13:18:13,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 276 transitions, 3452 flow [2024-05-12 13:18:13,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:18:13,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:18:13,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-05-12 13:18:13,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-05-12 13:18:13,029 INFO L175 Difference]: Start difference. First operand has 185 places, 242 transitions, 2784 flow. Second operand 10 states and 190 transitions. [2024-05-12 13:18:13,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 276 transitions, 3452 flow [2024-05-12 13:18:13,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 276 transitions, 3354 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-05-12 13:18:13,141 INFO L231 Difference]: Finished difference. Result has 190 places, 242 transitions, 2877 flow [2024-05-12 13:18:13,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2686, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2877, PETRI_PLACES=190, PETRI_TRANSITIONS=242} [2024-05-12 13:18:13,142 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 146 predicate places. [2024-05-12 13:18:13,142 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 242 transitions, 2877 flow [2024-05-12 13:18:13,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:13,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:13,143 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:18:13,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-12 13:18:13,143 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:18:13,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:13,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1544751477, now seen corresponding path program 3 times [2024-05-12 13:18:13,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:13,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624800625] [2024-05-12 13:18:13,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:13,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:13,934 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:18:13,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:13,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624800625] [2024-05-12 13:18:13,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624800625] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:13,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:13,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:13,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111038904] [2024-05-12 13:18:13,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:13,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:13,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:13,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:13,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:14,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:14,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 242 transitions, 2877 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:14,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:14,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:18:14,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:14,578 INFO L124 PetriNetUnfolderBase]: 1639/3127 cut-off events. [2024-05-12 13:18:14,578 INFO L125 PetriNetUnfolderBase]: For 51295/51295 co-relation queries the response was YES. [2024-05-12 13:18:14,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16573 conditions, 3127 events. 1639/3127 cut-off events. For 51295/51295 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 21611 event pairs, 509 based on Foata normal form. 1/3020 useless extension candidates. Maximal degree in co-relation 16486. Up to 2344 conditions per place. [2024-05-12 13:18:14,602 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 225 selfloop transitions, 59 changer transitions 0/292 dead transitions. [2024-05-12 13:18:14,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 292 transitions, 3792 flow [2024-05-12 13:18:14,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:18:14,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:18:14,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-05-12 13:18:14,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47 [2024-05-12 13:18:14,604 INFO L175 Difference]: Start difference. First operand has 190 places, 242 transitions, 2877 flow. Second operand 10 states and 188 transitions. [2024-05-12 13:18:14,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 292 transitions, 3792 flow [2024-05-12 13:18:14,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 292 transitions, 3667 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-05-12 13:18:14,707 INFO L231 Difference]: Finished difference. Result has 197 places, 255 transitions, 3043 flow [2024-05-12 13:18:14,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2752, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3043, PETRI_PLACES=197, PETRI_TRANSITIONS=255} [2024-05-12 13:18:14,708 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 153 predicate places. [2024-05-12 13:18:14,708 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 255 transitions, 3043 flow [2024-05-12 13:18:14,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:14,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:14,708 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:18:14,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-05-12 13:18:14,709 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:18:14,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:14,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1888368338, now seen corresponding path program 7 times [2024-05-12 13:18:14,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:14,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038224883] [2024-05-12 13:18:14,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:14,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:15,498 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:18:15,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:15,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038224883] [2024-05-12 13:18:15,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038224883] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:15,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:15,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:15,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364638821] [2024-05-12 13:18:15,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:15,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:15,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:15,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:15,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:15,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:15,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 255 transitions, 3043 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:15,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:15,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:18:15,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:16,253 INFO L124 PetriNetUnfolderBase]: 1735/3289 cut-off events. [2024-05-12 13:18:16,253 INFO L125 PetriNetUnfolderBase]: For 60334/60334 co-relation queries the response was YES. [2024-05-12 13:18:16,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18012 conditions, 3289 events. 1735/3289 cut-off events. For 60334/60334 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 22885 event pairs, 424 based on Foata normal form. 2/3185 useless extension candidates. Maximal degree in co-relation 17921. Up to 1961 conditions per place. [2024-05-12 13:18:16,280 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 188 selfloop transitions, 109 changer transitions 0/305 dead transitions. [2024-05-12 13:18:16,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 305 transitions, 4110 flow [2024-05-12 13:18:16,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:18:16,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:18:16,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions. [2024-05-12 13:18:16,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49 [2024-05-12 13:18:16,282 INFO L175 Difference]: Start difference. First operand has 197 places, 255 transitions, 3043 flow. Second operand 10 states and 196 transitions. [2024-05-12 13:18:16,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 305 transitions, 4110 flow [2024-05-12 13:18:16,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 305 transitions, 4045 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-05-12 13:18:16,406 INFO L231 Difference]: Finished difference. Result has 205 places, 265 transitions, 3428 flow [2024-05-12 13:18:16,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2978, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3428, PETRI_PLACES=205, PETRI_TRANSITIONS=265} [2024-05-12 13:18:16,407 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 161 predicate places. [2024-05-12 13:18:16,407 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 265 transitions, 3428 flow [2024-05-12 13:18:16,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:16,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:16,408 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:18:16,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-05-12 13:18:16,408 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:18:16,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:16,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1888375778, now seen corresponding path program 8 times [2024-05-12 13:18:16,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:16,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784802305] [2024-05-12 13:18:16,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:16,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:17,179 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:18:17,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:17,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784802305] [2024-05-12 13:18:17,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784802305] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:17,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:17,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:17,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351430371] [2024-05-12 13:18:17,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:17,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:17,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:17,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:17,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:17,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:17,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 265 transitions, 3428 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:17,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:17,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:18:17,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:17,888 INFO L124 PetriNetUnfolderBase]: 1731/3283 cut-off events. [2024-05-12 13:18:17,889 INFO L125 PetriNetUnfolderBase]: For 62983/62983 co-relation queries the response was YES. [2024-05-12 13:18:17,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18835 conditions, 3283 events. 1731/3283 cut-off events. For 62983/62983 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 22810 event pairs, 424 based on Foata normal form. 2/3179 useless extension candidates. Maximal degree in co-relation 18740. Up to 1958 conditions per place. [2024-05-12 13:18:17,916 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 185 selfloop transitions, 110 changer transitions 0/303 dead transitions. [2024-05-12 13:18:17,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 303 transitions, 4258 flow [2024-05-12 13:18:17,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:18:17,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:18:17,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2024-05-12 13:18:17,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4825 [2024-05-12 13:18:17,918 INFO L175 Difference]: Start difference. First operand has 205 places, 265 transitions, 3428 flow. Second operand 10 states and 193 transitions. [2024-05-12 13:18:17,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 303 transitions, 4258 flow [2024-05-12 13:18:18,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 303 transitions, 4043 flow, removed 48 selfloop flow, removed 5 redundant places. [2024-05-12 13:18:18,071 INFO L231 Difference]: Finished difference. Result has 210 places, 265 transitions, 3438 flow [2024-05-12 13:18:18,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3213, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3438, PETRI_PLACES=210, PETRI_TRANSITIONS=265} [2024-05-12 13:18:18,071 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 166 predicate places. [2024-05-12 13:18:18,071 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 265 transitions, 3438 flow [2024-05-12 13:18:18,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:18,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:18,072 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:18:18,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-12 13:18:18,072 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:18:18,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:18,072 INFO L85 PathProgramCache]: Analyzing trace with hash -401436545, now seen corresponding path program 4 times [2024-05-12 13:18:18,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:18,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647359419] [2024-05-12 13:18:18,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:18,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:18,958 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:18:18,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:18,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647359419] [2024-05-12 13:18:18,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647359419] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:18,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:18,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:18,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29464542] [2024-05-12 13:18:18,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:18,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:18,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:18,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:18,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:19,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:19,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 265 transitions, 3438 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:19,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:19,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:18:19,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:19,662 INFO L124 PetriNetUnfolderBase]: 1742/3330 cut-off events. [2024-05-12 13:18:19,663 INFO L125 PetriNetUnfolderBase]: For 62493/62493 co-relation queries the response was YES. [2024-05-12 13:18:19,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18759 conditions, 3330 events. 1742/3330 cut-off events. For 62493/62493 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 23337 event pairs, 519 based on Foata normal form. 1/3212 useless extension candidates. Maximal degree in co-relation 18663. Up to 2498 conditions per place. [2024-05-12 13:18:19,692 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 228 selfloop transitions, 66 changer transitions 0/302 dead transitions. [2024-05-12 13:18:19,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 302 transitions, 4288 flow [2024-05-12 13:18:19,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:18:19,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:18:19,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-05-12 13:18:19,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675 [2024-05-12 13:18:19,694 INFO L175 Difference]: Start difference. First operand has 210 places, 265 transitions, 3438 flow. Second operand 10 states and 187 transitions. [2024-05-12 13:18:19,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 302 transitions, 4288 flow [2024-05-12 13:18:19,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 302 transitions, 4077 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-05-12 13:18:19,844 INFO L231 Difference]: Finished difference. Result has 214 places, 268 transitions, 3422 flow [2024-05-12 13:18:19,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3227, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3422, PETRI_PLACES=214, PETRI_TRANSITIONS=268} [2024-05-12 13:18:19,844 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 170 predicate places. [2024-05-12 13:18:19,845 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 268 transitions, 3422 flow [2024-05-12 13:18:19,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:19,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:19,845 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:18:19,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-05-12 13:18:19,845 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:18:19,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:19,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1545010668, now seen corresponding path program 9 times [2024-05-12 13:18:19,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:19,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569369207] [2024-05-12 13:18:19,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:19,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:20,641 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:18:20,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:20,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569369207] [2024-05-12 13:18:20,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569369207] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:20,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:20,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:20,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429201036] [2024-05-12 13:18:20,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:20,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:20,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:20,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:20,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:20,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:20,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 268 transitions, 3422 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:20,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:20,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:18:20,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:21,361 INFO L124 PetriNetUnfolderBase]: 1738/3230 cut-off events. [2024-05-12 13:18:21,361 INFO L125 PetriNetUnfolderBase]: For 61045/61045 co-relation queries the response was YES. [2024-05-12 13:18:21,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18428 conditions, 3230 events. 1738/3230 cut-off events. For 61045/61045 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 22047 event pairs, 324 based on Foata normal form. 2/3142 useless extension candidates. Maximal degree in co-relation 18330. Up to 1972 conditions per place. [2024-05-12 13:18:21,391 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 172 selfloop transitions, 124 changer transitions 0/304 dead transitions. [2024-05-12 13:18:21,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 304 transitions, 4162 flow [2024-05-12 13:18:21,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:18:21,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:18:21,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-05-12 13:18:21,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4775 [2024-05-12 13:18:21,392 INFO L175 Difference]: Start difference. First operand has 214 places, 268 transitions, 3422 flow. Second operand 10 states and 191 transitions. [2024-05-12 13:18:21,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 304 transitions, 4162 flow [2024-05-12 13:18:21,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 304 transitions, 4039 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-05-12 13:18:21,602 INFO L231 Difference]: Finished difference. Result has 219 places, 268 transitions, 3552 flow [2024-05-12 13:18:21,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3299, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3552, PETRI_PLACES=219, PETRI_TRANSITIONS=268} [2024-05-12 13:18:21,603 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 175 predicate places. [2024-05-12 13:18:21,603 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 268 transitions, 3552 flow [2024-05-12 13:18:21,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:21,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:21,603 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:18:21,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-05-12 13:18:21,603 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:18:21,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:21,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1545020588, now seen corresponding path program 1 times [2024-05-12 13:18:21,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:21,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173764405] [2024-05-12 13:18:21,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:21,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:22,420 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:18:22,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:22,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173764405] [2024-05-12 13:18:22,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173764405] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:22,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:22,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:22,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099051593] [2024-05-12 13:18:22,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:22,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:22,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:22,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:22,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:22,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:18:22,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 268 transitions, 3552 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:18:22,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:22,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:18:22,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:23,192 INFO L124 PetriNetUnfolderBase]: 1620/3107 cut-off events. [2024-05-12 13:18:23,192 INFO L125 PetriNetUnfolderBase]: For 63566/63618 co-relation queries the response was YES. [2024-05-12 13:18:23,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17738 conditions, 3107 events. 1620/3107 cut-off events. For 63566/63618 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 21738 event pairs, 559 based on Foata normal form. 39/3045 useless extension candidates. Maximal degree in co-relation 17639. Up to 2409 conditions per place. [2024-05-12 13:18:23,225 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 237 selfloop transitions, 26 changer transitions 0/303 dead transitions. [2024-05-12 13:18:23,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 303 transitions, 4234 flow [2024-05-12 13:18:23,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:18:23,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:18:23,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-05-12 13:18:23,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4725 [2024-05-12 13:18:23,227 INFO L175 Difference]: Start difference. First operand has 219 places, 268 transitions, 3552 flow. Second operand 10 states and 189 transitions. [2024-05-12 13:18:23,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 303 transitions, 4234 flow [2024-05-12 13:18:23,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 303 transitions, 4091 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-05-12 13:18:23,398 INFO L231 Difference]: Finished difference. Result has 224 places, 270 transitions, 3490 flow [2024-05-12 13:18:23,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3409, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3490, PETRI_PLACES=224, PETRI_TRANSITIONS=270} [2024-05-12 13:18:23,398 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 180 predicate places. [2024-05-12 13:18:23,398 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 270 transitions, 3490 flow [2024-05-12 13:18:23,399 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:18:23,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:23,399 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:18:23,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-05-12 13:18:23,399 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:18:23,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:23,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1545020247, now seen corresponding path program 5 times [2024-05-12 13:18:23,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:23,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410890809] [2024-05-12 13:18:23,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:23,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:24,178 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:18:24,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:24,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410890809] [2024-05-12 13:18:24,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410890809] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:24,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:24,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:24,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732308605] [2024-05-12 13:18:24,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:24,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:24,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:24,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:24,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:24,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:24,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 270 transitions, 3490 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:24,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:24,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:18:24,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:24,892 INFO L124 PetriNetUnfolderBase]: 1747/3326 cut-off events. [2024-05-12 13:18:24,892 INFO L125 PetriNetUnfolderBase]: For 64731/64731 co-relation queries the response was YES. [2024-05-12 13:18:24,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18647 conditions, 3326 events. 1747/3326 cut-off events. For 64731/64731 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 23193 event pairs, 514 based on Foata normal form. 1/3212 useless extension candidates. Maximal degree in co-relation 18547. Up to 2507 conditions per place. [2024-05-12 13:18:24,923 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 223 selfloop transitions, 72 changer transitions 0/303 dead transitions. [2024-05-12 13:18:24,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 303 transitions, 4216 flow [2024-05-12 13:18:24,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:18:24,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:18:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-05-12 13:18:24,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625 [2024-05-12 13:18:24,924 INFO L175 Difference]: Start difference. First operand has 224 places, 270 transitions, 3490 flow. Second operand 10 states and 185 transitions. [2024-05-12 13:18:24,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 303 transitions, 4216 flow [2024-05-12 13:18:25,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 303 transitions, 3950 flow, removed 20 selfloop flow, removed 9 redundant places. [2024-05-12 13:18:25,100 INFO L231 Difference]: Finished difference. Result has 225 places, 270 transitions, 3373 flow [2024-05-12 13:18:25,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3224, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3373, PETRI_PLACES=225, PETRI_TRANSITIONS=270} [2024-05-12 13:18:25,101 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 181 predicate places. [2024-05-12 13:18:25,101 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 270 transitions, 3373 flow [2024-05-12 13:18:25,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:25,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:25,101 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:18:25,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-05-12 13:18:25,101 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:18:25,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:25,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1265873321, now seen corresponding path program 6 times [2024-05-12 13:18:25,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:25,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914572464] [2024-05-12 13:18:25,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:25,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:25,895 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:18:25,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:25,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914572464] [2024-05-12 13:18:25,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914572464] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:25,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:25,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:25,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285726907] [2024-05-12 13:18:25,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:25,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:25,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:25,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:25,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:26,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:26,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 270 transitions, 3373 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:26,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:26,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:18:26,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:26,719 INFO L124 PetriNetUnfolderBase]: 1772/3361 cut-off events. [2024-05-12 13:18:26,719 INFO L125 PetriNetUnfolderBase]: For 63947/63947 co-relation queries the response was YES. [2024-05-12 13:18:26,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18804 conditions, 3361 events. 1772/3361 cut-off events. For 63947/63947 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 23442 event pairs, 423 based on Foata normal form. 1/3249 useless extension candidates. Maximal degree in co-relation 18704. Up to 2689 conditions per place. [2024-05-12 13:18:26,749 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 246 selfloop transitions, 53 changer transitions 0/307 dead transitions. [2024-05-12 13:18:26,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 307 transitions, 4235 flow [2024-05-12 13:18:26,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:18:26,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:18:26,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2024-05-12 13:18:26,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44 [2024-05-12 13:18:26,750 INFO L175 Difference]: Start difference. First operand has 225 places, 270 transitions, 3373 flow. Second operand 10 states and 176 transitions. [2024-05-12 13:18:26,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 307 transitions, 4235 flow [2024-05-12 13:18:26,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 307 transitions, 4068 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-05-12 13:18:26,931 INFO L231 Difference]: Finished difference. Result has 227 places, 281 transitions, 3508 flow [2024-05-12 13:18:26,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3224, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3508, PETRI_PLACES=227, PETRI_TRANSITIONS=281} [2024-05-12 13:18:26,932 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 183 predicate places. [2024-05-12 13:18:26,932 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 281 transitions, 3508 flow [2024-05-12 13:18:26,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:26,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:26,933 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:18:26,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-05-12 13:18:26,933 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:18:26,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:26,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1265881040, now seen corresponding path program 10 times [2024-05-12 13:18:26,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:26,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616971336] [2024-05-12 13:18:26,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:26,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:27,701 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:18:27,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:27,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616971336] [2024-05-12 13:18:27,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616971336] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:27,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:27,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:27,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758716158] [2024-05-12 13:18:27,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:27,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:27,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:27,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:27,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:27,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:27,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 281 transitions, 3508 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:27,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:27,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:18:27,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:28,474 INFO L124 PetriNetUnfolderBase]: 1768/3324 cut-off events. [2024-05-12 13:18:28,474 INFO L125 PetriNetUnfolderBase]: For 65103/65103 co-relation queries the response was YES. [2024-05-12 13:18:28,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18682 conditions, 3324 events. 1768/3324 cut-off events. For 65103/65103 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 23065 event pairs, 408 based on Foata normal form. 2/3230 useless extension candidates. Maximal degree in co-relation 18580. Up to 2028 conditions per place. [2024-05-12 13:18:28,502 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 187 selfloop transitions, 119 changer transitions 0/314 dead transitions. [2024-05-12 13:18:28,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 314 transitions, 4252 flow [2024-05-12 13:18:28,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:18:28,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:18:28,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-05-12 13:18:28,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2024-05-12 13:18:28,503 INFO L175 Difference]: Start difference. First operand has 227 places, 281 transitions, 3508 flow. Second operand 9 states and 172 transitions. [2024-05-12 13:18:28,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 314 transitions, 4252 flow [2024-05-12 13:18:28,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 314 transitions, 4138 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-05-12 13:18:28,674 INFO L231 Difference]: Finished difference. Result has 231 places, 281 transitions, 3652 flow [2024-05-12 13:18:28,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3394, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3652, PETRI_PLACES=231, PETRI_TRANSITIONS=281} [2024-05-12 13:18:28,675 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 187 predicate places. [2024-05-12 13:18:28,675 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 281 transitions, 3652 flow [2024-05-12 13:18:28,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:28,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:28,675 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:18:28,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-05-12 13:18:28,676 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:18:28,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:28,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1012092405, now seen corresponding path program 7 times [2024-05-12 13:18:28,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:28,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704640401] [2024-05-12 13:18:28,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:28,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:29,471 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:18:29,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:29,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704640401] [2024-05-12 13:18:29,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704640401] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:29,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:29,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:29,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928402673] [2024-05-12 13:18:29,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:29,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:29,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:29,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:29,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:29,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:29,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 281 transitions, 3652 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:29,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:29,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:18:29,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:30,206 INFO L124 PetriNetUnfolderBase]: 1805/3432 cut-off events. [2024-05-12 13:18:30,207 INFO L125 PetriNetUnfolderBase]: For 71478/71478 co-relation queries the response was YES. [2024-05-12 13:18:30,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19731 conditions, 3432 events. 1805/3432 cut-off events. For 71478/71478 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 24149 event pairs, 467 based on Foata normal form. 1/3311 useless extension candidates. Maximal degree in co-relation 19627. Up to 2461 conditions per place. [2024-05-12 13:18:30,238 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 220 selfloop transitions, 91 changer transitions 0/319 dead transitions. [2024-05-12 13:18:30,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 319 transitions, 4710 flow [2024-05-12 13:18:30,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:18:30,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:18:30,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-05-12 13:18:30,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-05-12 13:18:30,239 INFO L175 Difference]: Start difference. First operand has 231 places, 281 transitions, 3652 flow. Second operand 9 states and 170 transitions. [2024-05-12 13:18:30,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 319 transitions, 4710 flow [2024-05-12 13:18:30,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 319 transitions, 4461 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-05-12 13:18:30,429 INFO L231 Difference]: Finished difference. Result has 232 places, 287 transitions, 3713 flow [2024-05-12 13:18:30,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3411, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3713, PETRI_PLACES=232, PETRI_TRANSITIONS=287} [2024-05-12 13:18:30,430 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 188 predicate places. [2024-05-12 13:18:30,430 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 287 transitions, 3713 flow [2024-05-12 13:18:30,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:30,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:30,430 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:18:30,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-05-12 13:18:30,431 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:18:30,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:30,431 INFO L85 PathProgramCache]: Analyzing trace with hash 913920218, now seen corresponding path program 11 times [2024-05-12 13:18:30,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:30,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730339254] [2024-05-12 13:18:30,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:30,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:31,200 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:18:31,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:31,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730339254] [2024-05-12 13:18:31,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730339254] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:31,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:31,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:31,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362882680] [2024-05-12 13:18:31,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:31,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:31,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:31,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:31,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:31,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:31,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 287 transitions, 3713 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:31,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:31,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:18:31,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:31,987 INFO L124 PetriNetUnfolderBase]: 1853/3403 cut-off events. [2024-05-12 13:18:31,988 INFO L125 PetriNetUnfolderBase]: For 72351/72351 co-relation queries the response was YES. [2024-05-12 13:18:32,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20093 conditions, 3403 events. 1853/3403 cut-off events. For 72351/72351 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 23231 event pairs, 256 based on Foata normal form. 2/3319 useless extension candidates. Maximal degree in co-relation 19989. Up to 1876 conditions per place. [2024-05-12 13:18:32,021 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 174 selfloop transitions, 143 changer transitions 0/325 dead transitions. [2024-05-12 13:18:32,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 325 transitions, 4661 flow [2024-05-12 13:18:32,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:18:32,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:18:32,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-05-12 13:18:32,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48055555555555557 [2024-05-12 13:18:32,022 INFO L175 Difference]: Start difference. First operand has 232 places, 287 transitions, 3713 flow. Second operand 9 states and 173 transitions. [2024-05-12 13:18:32,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 325 transitions, 4661 flow [2024-05-12 13:18:32,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 325 transitions, 4559 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-05-12 13:18:32,223 INFO L231 Difference]: Finished difference. Result has 236 places, 291 transitions, 3987 flow [2024-05-12 13:18:32,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3613, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3987, PETRI_PLACES=236, PETRI_TRANSITIONS=291} [2024-05-12 13:18:32,224 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 192 predicate places. [2024-05-12 13:18:32,224 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 291 transitions, 3987 flow [2024-05-12 13:18:32,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:32,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:32,225 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:18:32,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-05-12 13:18:32,225 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:18:32,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:32,225 INFO L85 PathProgramCache]: Analyzing trace with hash 913929797, now seen corresponding path program 8 times [2024-05-12 13:18:32,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:32,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712290581] [2024-05-12 13:18:32,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:32,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:18:33,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:33,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712290581] [2024-05-12 13:18:33,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712290581] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:33,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:33,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:33,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038983921] [2024-05-12 13:18:33,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:33,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:33,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:33,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:33,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:33,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:33,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 291 transitions, 3987 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:33,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:33,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:18:33,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:33,832 INFO L124 PetriNetUnfolderBase]: 1851/3495 cut-off events. [2024-05-12 13:18:33,833 INFO L125 PetriNetUnfolderBase]: For 72964/72964 co-relation queries the response was YES. [2024-05-12 13:18:33,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20835 conditions, 3495 events. 1851/3495 cut-off events. For 72964/72964 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 24514 event pairs, 472 based on Foata normal form. 1/3378 useless extension candidates. Maximal degree in co-relation 20730. Up to 2533 conditions per place. [2024-05-12 13:18:33,869 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 215 selfloop transitions, 99 changer transitions 0/322 dead transitions. [2024-05-12 13:18:33,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 322 transitions, 4841 flow [2024-05-12 13:18:33,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:18:33,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:18:33,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-05-12 13:18:33,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-05-12 13:18:33,870 INFO L175 Difference]: Start difference. First operand has 236 places, 291 transitions, 3987 flow. Second operand 9 states and 168 transitions. [2024-05-12 13:18:33,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 322 transitions, 4841 flow [2024-05-12 13:18:34,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 322 transitions, 4667 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-05-12 13:18:34,104 INFO L231 Difference]: Finished difference. Result has 239 places, 291 transitions, 4021 flow [2024-05-12 13:18:34,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3815, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4021, PETRI_PLACES=239, PETRI_TRANSITIONS=291} [2024-05-12 13:18:34,104 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 195 predicate places. [2024-05-12 13:18:34,105 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 291 transitions, 4021 flow [2024-05-12 13:18:34,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:34,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:34,105 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:18:34,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-05-12 13:18:34,106 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:18:34,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:34,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1011825216, now seen corresponding path program 12 times [2024-05-12 13:18:34,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:34,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293066541] [2024-05-12 13:18:34,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:34,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:34,880 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:18:34,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:34,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293066541] [2024-05-12 13:18:34,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293066541] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:34,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:34,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:34,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918271743] [2024-05-12 13:18:34,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:34,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:34,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:34,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:34,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:34,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:34,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 291 transitions, 4021 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:34,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:34,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:18:34,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:35,650 INFO L124 PetriNetUnfolderBase]: 1873/3522 cut-off events. [2024-05-12 13:18:35,651 INFO L125 PetriNetUnfolderBase]: For 72210/72210 co-relation queries the response was YES. [2024-05-12 13:18:35,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21112 conditions, 3522 events. 1873/3522 cut-off events. For 72210/72210 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 24674 event pairs, 380 based on Foata normal form. 2/3416 useless extension candidates. Maximal degree in co-relation 21006. Up to 1891 conditions per place. [2024-05-12 13:18:35,685 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 190 selfloop transitions, 129 changer transitions 0/327 dead transitions. [2024-05-12 13:18:35,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 327 transitions, 4939 flow [2024-05-12 13:18:35,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:18:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:18:35,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-05-12 13:18:35,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2024-05-12 13:18:35,687 INFO L175 Difference]: Start difference. First operand has 239 places, 291 transitions, 4021 flow. Second operand 9 states and 174 transitions. [2024-05-12 13:18:35,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 327 transitions, 4939 flow [2024-05-12 13:18:35,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 327 transitions, 4760 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-05-12 13:18:35,903 INFO L231 Difference]: Finished difference. Result has 240 places, 293 transitions, 4152 flow [2024-05-12 13:18:35,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3844, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4152, PETRI_PLACES=240, PETRI_TRANSITIONS=293} [2024-05-12 13:18:35,903 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 196 predicate places. [2024-05-12 13:18:35,903 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 293 transitions, 4152 flow [2024-05-12 13:18:35,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:35,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:35,904 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:18:35,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-05-12 13:18:35,904 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:18:35,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:35,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1576324849, now seen corresponding path program 9 times [2024-05-12 13:18:35,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:35,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676492237] [2024-05-12 13:18:35,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:35,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:36,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:18:36,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:36,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676492237] [2024-05-12 13:18:36,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676492237] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:36,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:36,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:36,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584468486] [2024-05-12 13:18:36,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:36,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:36,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:36,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:36,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:36,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:36,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 293 transitions, 4152 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:36,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:36,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:18:36,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:37,647 INFO L124 PetriNetUnfolderBase]: 1871/3554 cut-off events. [2024-05-12 13:18:37,647 INFO L125 PetriNetUnfolderBase]: For 72062/72062 co-relation queries the response was YES. [2024-05-12 13:18:37,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21394 conditions, 3554 events. 1871/3554 cut-off events. For 72062/72062 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 25093 event pairs, 500 based on Foata normal form. 1/3435 useless extension candidates. Maximal degree in co-relation 21288. Up to 2565 conditions per place. [2024-05-12 13:18:37,684 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 230 selfloop transitions, 85 changer transitions 0/323 dead transitions. [2024-05-12 13:18:37,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 323 transitions, 4910 flow [2024-05-12 13:18:37,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:18:37,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:18:37,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-05-12 13:18:37,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46944444444444444 [2024-05-12 13:18:37,685 INFO L175 Difference]: Start difference. First operand has 240 places, 293 transitions, 4152 flow. Second operand 9 states and 169 transitions. [2024-05-12 13:18:37,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 323 transitions, 4910 flow [2024-05-12 13:18:37,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 323 transitions, 4623 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-05-12 13:18:37,891 INFO L231 Difference]: Finished difference. Result has 242 places, 293 transitions, 4043 flow [2024-05-12 13:18:37,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3865, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4043, PETRI_PLACES=242, PETRI_TRANSITIONS=293} [2024-05-12 13:18:37,892 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 198 predicate places. [2024-05-12 13:18:37,892 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 293 transitions, 4043 flow [2024-05-12 13:18:37,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:37,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:37,894 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:18:37,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-05-12 13:18:37,894 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:18:37,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:37,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1576593960, now seen corresponding path program 2 times [2024-05-12 13:18:37,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:37,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795055188] [2024-05-12 13:18:37,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:37,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:38,716 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:18:38,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:38,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795055188] [2024-05-12 13:18:38,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795055188] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:38,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:38,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:38,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345520727] [2024-05-12 13:18:38,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:38,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:38,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:38,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:38,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:38,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:18:38,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 293 transitions, 4043 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:18:38,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:38,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:18:38,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:39,501 INFO L124 PetriNetUnfolderBase]: 1742/3344 cut-off events. [2024-05-12 13:18:39,501 INFO L125 PetriNetUnfolderBase]: For 67859/67900 co-relation queries the response was YES. [2024-05-12 13:18:39,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19644 conditions, 3344 events. 1742/3344 cut-off events. For 67859/67900 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 23816 event pairs, 545 based on Foata normal form. 26/3257 useless extension candidates. Maximal degree in co-relation 19538. Up to 2532 conditions per place. [2024-05-12 13:18:39,533 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 242 selfloop transitions, 32 changer transitions 0/325 dead transitions. [2024-05-12 13:18:39,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 325 transitions, 4743 flow [2024-05-12 13:18:39,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:18:39,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:18:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-05-12 13:18:39,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-05-12 13:18:39,535 INFO L175 Difference]: Start difference. First operand has 242 places, 293 transitions, 4043 flow. Second operand 9 states and 171 transitions. [2024-05-12 13:18:39,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 325 transitions, 4743 flow [2024-05-12 13:18:39,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 325 transitions, 4482 flow, removed 9 selfloop flow, removed 10 redundant places. [2024-05-12 13:18:39,743 INFO L231 Difference]: Finished difference. Result has 241 places, 295 transitions, 3882 flow [2024-05-12 13:18:39,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3782, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3882, PETRI_PLACES=241, PETRI_TRANSITIONS=295} [2024-05-12 13:18:39,743 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 197 predicate places. [2024-05-12 13:18:39,743 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 295 transitions, 3882 flow [2024-05-12 13:18:39,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:18:39,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:39,744 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:18:39,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-05-12 13:18:39,744 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:18:39,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:39,744 INFO L85 PathProgramCache]: Analyzing trace with hash 913660748, now seen corresponding path program 13 times [2024-05-12 13:18:39,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:39,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100576251] [2024-05-12 13:18:39,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:39,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:40,515 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:18:40,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:40,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100576251] [2024-05-12 13:18:40,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100576251] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:40,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:40,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:40,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101883346] [2024-05-12 13:18:40,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:40,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:40,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:40,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:40,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:40,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:40,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 295 transitions, 3882 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:40,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:40,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:18:40,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:41,273 INFO L124 PetriNetUnfolderBase]: 1878/3566 cut-off events. [2024-05-12 13:18:41,273 INFO L125 PetriNetUnfolderBase]: For 66844/66844 co-relation queries the response was YES. [2024-05-12 13:18:41,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20591 conditions, 3566 events. 1878/3566 cut-off events. For 66844/66844 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 25314 event pairs, 389 based on Foata normal form. 2/3447 useless extension candidates. Maximal degree in co-relation 20485. Up to 1902 conditions per place. [2024-05-12 13:18:41,311 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 194 selfloop transitions, 127 changer transitions 0/329 dead transitions. [2024-05-12 13:18:41,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 329 transitions, 4668 flow [2024-05-12 13:18:41,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:18:41,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:18:41,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-05-12 13:18:41,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2024-05-12 13:18:41,312 INFO L175 Difference]: Start difference. First operand has 241 places, 295 transitions, 3882 flow. Second operand 9 states and 175 transitions. [2024-05-12 13:18:41,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 329 transitions, 4668 flow [2024-05-12 13:18:41,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 329 transitions, 4566 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-05-12 13:18:41,518 INFO L231 Difference]: Finished difference. Result has 243 places, 295 transitions, 4042 flow [2024-05-12 13:18:41,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3780, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4042, PETRI_PLACES=243, PETRI_TRANSITIONS=295} [2024-05-12 13:18:41,519 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 199 predicate places. [2024-05-12 13:18:41,519 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 295 transitions, 4042 flow [2024-05-12 13:18:41,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:41,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:41,520 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:18:41,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-05-12 13:18:41,520 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:18:41,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:41,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1824478508, now seen corresponding path program 14 times [2024-05-12 13:18:41,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:41,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622665482] [2024-05-12 13:18:41,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:41,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:42,312 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:18:42,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:42,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622665482] [2024-05-12 13:18:42,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622665482] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:42,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:42,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:42,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019973987] [2024-05-12 13:18:42,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:42,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:42,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:42,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:42,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:42,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:42,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 295 transitions, 4042 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:42,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:42,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:18:42,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:43,046 INFO L124 PetriNetUnfolderBase]: 1916/3657 cut-off events. [2024-05-12 13:18:43,046 INFO L125 PetriNetUnfolderBase]: For 70418/70418 co-relation queries the response was YES. [2024-05-12 13:18:43,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21451 conditions, 3657 events. 1916/3657 cut-off events. For 70418/70418 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 25734 event pairs, 406 based on Foata normal form. 2/3529 useless extension candidates. Maximal degree in co-relation 21344. Up to 1777 conditions per place. [2024-05-12 13:18:43,091 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 189 selfloop transitions, 136 changer transitions 0/333 dead transitions. [2024-05-12 13:18:43,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 333 transitions, 5006 flow [2024-05-12 13:18:43,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:18:43,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:18:43,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-05-12 13:18:43,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2024-05-12 13:18:43,093 INFO L175 Difference]: Start difference. First operand has 243 places, 295 transitions, 4042 flow. Second operand 9 states and 175 transitions. [2024-05-12 13:18:43,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 333 transitions, 5006 flow [2024-05-12 13:18:43,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 333 transitions, 4653 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-05-12 13:18:43,315 INFO L231 Difference]: Finished difference. Result has 242 places, 299 transitions, 4040 flow [2024-05-12 13:18:43,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3691, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4040, PETRI_PLACES=242, PETRI_TRANSITIONS=299} [2024-05-12 13:18:43,315 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 198 predicate places. [2024-05-12 13:18:43,315 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 299 transitions, 4040 flow [2024-05-12 13:18:43,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:43,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:43,316 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:18:43,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-05-12 13:18:43,316 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:18:43,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:43,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1824485948, now seen corresponding path program 15 times [2024-05-12 13:18:43,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:43,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925542237] [2024-05-12 13:18:43,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:43,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:44,147 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:18:44,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:44,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925542237] [2024-05-12 13:18:44,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925542237] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:44,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:44,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:44,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209191237] [2024-05-12 13:18:44,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:44,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:44,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:44,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:44,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:44,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:44,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 299 transitions, 4040 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:44,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:44,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:18:44,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:44,888 INFO L124 PetriNetUnfolderBase]: 1938/3697 cut-off events. [2024-05-12 13:18:44,888 INFO L125 PetriNetUnfolderBase]: For 70180/70180 co-relation queries the response was YES. [2024-05-12 13:18:44,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21614 conditions, 3697 events. 1938/3697 cut-off events. For 70180/70180 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 26018 event pairs, 406 based on Foata normal form. 2/3569 useless extension candidates. Maximal degree in co-relation 21507. Up to 1795 conditions per place. [2024-05-12 13:18:44,926 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 192 selfloop transitions, 136 changer transitions 0/336 dead transitions. [2024-05-12 13:18:44,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 336 transitions, 4984 flow [2024-05-12 13:18:44,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:18:44,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:18:44,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-05-12 13:18:44,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2024-05-12 13:18:44,927 INFO L175 Difference]: Start difference. First operand has 242 places, 299 transitions, 4040 flow. Second operand 9 states and 177 transitions. [2024-05-12 13:18:44,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 336 transitions, 4984 flow [2024-05-12 13:18:45,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 336 transitions, 4683 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-05-12 13:18:45,204 INFO L231 Difference]: Finished difference. Result has 245 places, 301 transitions, 4054 flow [2024-05-12 13:18:45,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3747, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4054, PETRI_PLACES=245, PETRI_TRANSITIONS=301} [2024-05-12 13:18:45,204 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 201 predicate places. [2024-05-12 13:18:45,204 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 301 transitions, 4054 flow [2024-05-12 13:18:45,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:45,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:45,205 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:18:45,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-05-12 13:18:45,205 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:18:45,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:45,206 INFO L85 PathProgramCache]: Analyzing trace with hash 2138454227, now seen corresponding path program 10 times [2024-05-12 13:18:45,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:45,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478598037] [2024-05-12 13:18:45,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:45,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:46,122 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:18:46,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:46,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478598037] [2024-05-12 13:18:46,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478598037] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:46,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:46,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:46,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824270003] [2024-05-12 13:18:46,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:46,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:46,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:46,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:46,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:46,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:46,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 301 transitions, 4054 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:46,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:46,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:18:46,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:46,956 INFO L124 PetriNetUnfolderBase]: 1978/3827 cut-off events. [2024-05-12 13:18:46,956 INFO L125 PetriNetUnfolderBase]: For 73200/73200 co-relation queries the response was YES. [2024-05-12 13:18:46,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22157 conditions, 3827 events. 1978/3827 cut-off events. For 73200/73200 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 27623 event pairs, 344 based on Foata normal form. 1/3664 useless extension candidates. Maximal degree in co-relation 22049. Up to 2531 conditions per place. [2024-05-12 13:18:46,992 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 227 selfloop transitions, 107 changer transitions 0/342 dead transitions. [2024-05-12 13:18:46,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 342 transitions, 5302 flow [2024-05-12 13:18:46,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:18:46,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:18:46,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-05-12 13:18:46,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2024-05-12 13:18:46,994 INFO L175 Difference]: Start difference. First operand has 245 places, 301 transitions, 4054 flow. Second operand 9 states and 174 transitions. [2024-05-12 13:18:46,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 342 transitions, 5302 flow [2024-05-12 13:18:47,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 342 transitions, 5021 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-05-12 13:18:47,191 INFO L231 Difference]: Finished difference. Result has 248 places, 309 transitions, 4140 flow [2024-05-12 13:18:47,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3773, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4140, PETRI_PLACES=248, PETRI_TRANSITIONS=309} [2024-05-12 13:18:47,192 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 204 predicate places. [2024-05-12 13:18:47,192 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 309 transitions, 4140 flow [2024-05-12 13:18:47,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:47,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:47,192 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:18:47,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-05-12 13:18:47,193 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:18:47,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:47,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1824755338, now seen corresponding path program 3 times [2024-05-12 13:18:47,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:47,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76032000] [2024-05-12 13:18:47,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:47,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:48,055 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:18:48,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:48,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76032000] [2024-05-12 13:18:48,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76032000] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:48,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:48,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:48,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857278417] [2024-05-12 13:18:48,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:48,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:48,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:48,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:48,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:48,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:18:48,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 309 transitions, 4140 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:18:48,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:48,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:18:48,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:48,846 INFO L124 PetriNetUnfolderBase]: 1841/3670 cut-off events. [2024-05-12 13:18:48,847 INFO L125 PetriNetUnfolderBase]: For 73683/73752 co-relation queries the response was YES. [2024-05-12 13:18:48,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20607 conditions, 3670 events. 1841/3670 cut-off events. For 73683/73752 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 27006 event pairs, 531 based on Foata normal form. 46/3561 useless extension candidates. Maximal degree in co-relation 20498. Up to 2528 conditions per place. [2024-05-12 13:18:48,899 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 247 selfloop transitions, 42 changer transitions 0/344 dead transitions. [2024-05-12 13:18:48,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 344 transitions, 5004 flow [2024-05-12 13:18:48,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:18:48,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:18:48,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2024-05-12 13:18:48,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49444444444444446 [2024-05-12 13:18:48,901 INFO L175 Difference]: Start difference. First operand has 248 places, 309 transitions, 4140 flow. Second operand 9 states and 178 transitions. [2024-05-12 13:18:48,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 344 transitions, 5004 flow [2024-05-12 13:18:49,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 344 transitions, 4896 flow, removed 23 selfloop flow, removed 3 redundant places. [2024-05-12 13:18:49,145 INFO L231 Difference]: Finished difference. Result has 254 places, 313 transitions, 4173 flow [2024-05-12 13:18:49,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4032, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4173, PETRI_PLACES=254, PETRI_TRANSITIONS=313} [2024-05-12 13:18:49,145 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 210 predicate places. [2024-05-12 13:18:49,145 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 313 transitions, 4173 flow [2024-05-12 13:18:49,145 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:18:49,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:49,146 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:18:49,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-05-12 13:18:49,146 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:18:49,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:49,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1824486227, now seen corresponding path program 11 times [2024-05-12 13:18:49,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:49,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532007147] [2024-05-12 13:18:49,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:49,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:49,925 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:18:49,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:49,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532007147] [2024-05-12 13:18:49,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532007147] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:49,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:49,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:49,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787411803] [2024-05-12 13:18:49,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:49,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:49,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:49,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:49,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:49,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:49,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 313 transitions, 4173 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:49,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:49,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:18:49,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:50,657 INFO L124 PetriNetUnfolderBase]: 2003/3853 cut-off events. [2024-05-12 13:18:50,657 INFO L125 PetriNetUnfolderBase]: For 75780/75780 co-relation queries the response was YES. [2024-05-12 13:18:50,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22323 conditions, 3853 events. 2003/3853 cut-off events. For 75780/75780 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 27638 event pairs, 377 based on Foata normal form. 1/3701 useless extension candidates. Maximal degree in co-relation 22212. Up to 2565 conditions per place. [2024-05-12 13:18:50,696 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 236 selfloop transitions, 102 changer transitions 0/346 dead transitions. [2024-05-12 13:18:50,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 346 transitions, 5129 flow [2024-05-12 13:18:50,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:18:50,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:18:50,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-05-12 13:18:50,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2024-05-12 13:18:50,698 INFO L175 Difference]: Start difference. First operand has 254 places, 313 transitions, 4173 flow. Second operand 9 states and 172 transitions. [2024-05-12 13:18:50,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 346 transitions, 5129 flow [2024-05-12 13:18:50,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 346 transitions, 5069 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-05-12 13:18:50,938 INFO L231 Difference]: Finished difference. Result has 258 places, 315 transitions, 4362 flow [2024-05-12 13:18:50,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4113, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4362, PETRI_PLACES=258, PETRI_TRANSITIONS=315} [2024-05-12 13:18:50,939 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 214 predicate places. [2024-05-12 13:18:50,939 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 315 transitions, 4362 flow [2024-05-12 13:18:50,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:50,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:50,939 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:18:50,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-05-12 13:18:50,940 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:18:50,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:50,940 INFO L85 PathProgramCache]: Analyzing trace with hash -2145084888, now seen corresponding path program 4 times [2024-05-12 13:18:50,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:50,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855822147] [2024-05-12 13:18:50,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:50,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:51,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:18:51,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:51,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855822147] [2024-05-12 13:18:51,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855822147] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:51,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:51,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:51,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683175851] [2024-05-12 13:18:51,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:51,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:51,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:51,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:51,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:52,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:18:52,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 315 transitions, 4362 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:18:52,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:52,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:18:52,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:52,973 INFO L124 PetriNetUnfolderBase]: 1860/3666 cut-off events. [2024-05-12 13:18:52,973 INFO L125 PetriNetUnfolderBase]: For 78387/78455 co-relation queries the response was YES. [2024-05-12 13:18:52,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21236 conditions, 3666 events. 1860/3666 cut-off events. For 78387/78455 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 26984 event pairs, 666 based on Foata normal form. 45/3555 useless extension candidates. Maximal degree in co-relation 21123. Up to 2750 conditions per place. [2024-05-12 13:18:53,011 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 275 selfloop transitions, 16 changer transitions 0/347 dead transitions. [2024-05-12 13:18:53,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 347 transitions, 5108 flow [2024-05-12 13:18:53,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:18:53,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:18:53,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-05-12 13:18:53,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46944444444444444 [2024-05-12 13:18:53,013 INFO L175 Difference]: Start difference. First operand has 258 places, 315 transitions, 4362 flow. Second operand 9 states and 169 transitions. [2024-05-12 13:18:53,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 347 transitions, 5108 flow [2024-05-12 13:18:53,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 347 transitions, 4820 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-05-12 13:18:53,214 INFO L231 Difference]: Finished difference. Result has 260 places, 317 transitions, 4143 flow [2024-05-12 13:18:53,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4074, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4143, PETRI_PLACES=260, PETRI_TRANSITIONS=317} [2024-05-12 13:18:53,215 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 216 predicate places. [2024-05-12 13:18:53,215 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 317 transitions, 4143 flow [2024-05-12 13:18:53,216 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:18:53,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:53,216 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:18:53,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-05-12 13:18:53,216 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:18:53,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:53,217 INFO L85 PathProgramCache]: Analyzing trace with hash -63937860, now seen corresponding path program 5 times [2024-05-12 13:18:53,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:53,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477358533] [2024-05-12 13:18:53,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:53,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:54,079 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:18:54,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:54,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477358533] [2024-05-12 13:18:54,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477358533] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:54,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:54,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:54,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850844612] [2024-05-12 13:18:54,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:54,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:54,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:54,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:54,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:54,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:18:54,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 317 transitions, 4143 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:18:54,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:54,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:18:54,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:54,841 INFO L124 PetriNetUnfolderBase]: 1873/3692 cut-off events. [2024-05-12 13:18:54,841 INFO L125 PetriNetUnfolderBase]: For 79151/79220 co-relation queries the response was YES. [2024-05-12 13:18:54,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20881 conditions, 3692 events. 1873/3692 cut-off events. For 79151/79220 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 26897 event pairs, 515 based on Foata normal form. 46/3590 useless extension candidates. Maximal degree in co-relation 20768. Up to 2563 conditions per place. [2024-05-12 13:18:54,880 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 243 selfloop transitions, 51 changer transitions 0/350 dead transitions. [2024-05-12 13:18:54,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 350 transitions, 5007 flow [2024-05-12 13:18:54,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:18:54,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:18:54,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-05-12 13:18:54,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-05-12 13:18:54,882 INFO L175 Difference]: Start difference. First operand has 260 places, 317 transitions, 4143 flow. Second operand 9 states and 176 transitions. [2024-05-12 13:18:54,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 350 transitions, 5007 flow [2024-05-12 13:18:55,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 350 transitions, 4958 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-05-12 13:18:55,139 INFO L231 Difference]: Finished difference. Result has 262 places, 319 transitions, 4233 flow [2024-05-12 13:18:55,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4094, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4233, PETRI_PLACES=262, PETRI_TRANSITIONS=319} [2024-05-12 13:18:55,140 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 218 predicate places. [2024-05-12 13:18:55,140 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 319 transitions, 4233 flow [2024-05-12 13:18:55,140 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:18:55,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:55,140 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:18:55,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-05-12 13:18:55,140 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:18:55,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:55,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1824754997, now seen corresponding path program 12 times [2024-05-12 13:18:55,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:55,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211233420] [2024-05-12 13:18:55,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:55,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:55,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:18:55,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:55,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211233420] [2024-05-12 13:18:55,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211233420] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:55,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:55,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:55,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959904967] [2024-05-12 13:18:55,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:55,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:55,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:55,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:55,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:56,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:56,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 319 transitions, 4233 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:56,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:56,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:18:56,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:56,823 INFO L124 PetriNetUnfolderBase]: 2036/3910 cut-off events. [2024-05-12 13:18:56,823 INFO L125 PetriNetUnfolderBase]: For 82436/82436 co-relation queries the response was YES. [2024-05-12 13:18:56,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22621 conditions, 3910 events. 2036/3910 cut-off events. For 82436/82436 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 28070 event pairs, 377 based on Foata normal form. 1/3756 useless extension candidates. Maximal degree in co-relation 22507. Up to 2611 conditions per place. [2024-05-12 13:18:56,863 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 243 selfloop transitions, 102 changer transitions 0/353 dead transitions. [2024-05-12 13:18:56,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 353 transitions, 5315 flow [2024-05-12 13:18:56,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:18:56,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:18:56,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-05-12 13:18:56,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2024-05-12 13:18:56,864 INFO L175 Difference]: Start difference. First operand has 262 places, 319 transitions, 4233 flow. Second operand 9 states and 174 transitions. [2024-05-12 13:18:56,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 353 transitions, 5315 flow [2024-05-12 13:18:57,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 353 transitions, 5210 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-05-12 13:18:57,138 INFO L231 Difference]: Finished difference. Result has 265 places, 321 transitions, 4373 flow [2024-05-12 13:18:57,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4128, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4373, PETRI_PLACES=265, PETRI_TRANSITIONS=321} [2024-05-12 13:18:57,139 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 221 predicate places. [2024-05-12 13:18:57,139 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 321 transitions, 4373 flow [2024-05-12 13:18:57,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:57,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:57,140 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:18:57,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-05-12 13:18:57,140 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:18:57,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:57,140 INFO L85 PathProgramCache]: Analyzing trace with hash -73202210, now seen corresponding path program 16 times [2024-05-12 13:18:57,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:57,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393042484] [2024-05-12 13:18:57,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:57,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:57,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:18:57,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:57,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393042484] [2024-05-12 13:18:57,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393042484] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:57,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:57,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:57,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946003499] [2024-05-12 13:18:57,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:57,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:57,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:57,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:57,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:58,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:58,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 321 transitions, 4373 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:58,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:58,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:18:58,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:18:58,759 INFO L124 PetriNetUnfolderBase]: 2058/3919 cut-off events. [2024-05-12 13:18:58,759 INFO L125 PetriNetUnfolderBase]: For 87689/87689 co-relation queries the response was YES. [2024-05-12 13:18:58,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23031 conditions, 3919 events. 2058/3919 cut-off events. For 87689/87689 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 27919 event pairs, 413 based on Foata normal form. 2/3781 useless extension candidates. Maximal degree in co-relation 22916. Up to 1965 conditions per place. [2024-05-12 13:18:58,799 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 213 selfloop transitions, 137 changer transitions 0/358 dead transitions. [2024-05-12 13:18:58,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 358 transitions, 5369 flow [2024-05-12 13:18:58,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:18:58,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:18:58,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2024-05-12 13:18:58,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49444444444444446 [2024-05-12 13:18:58,801 INFO L175 Difference]: Start difference. First operand has 265 places, 321 transitions, 4373 flow. Second operand 9 states and 178 transitions. [2024-05-12 13:18:58,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 358 transitions, 5369 flow [2024-05-12 13:18:59,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 358 transitions, 5088 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-05-12 13:18:59,097 INFO L231 Difference]: Finished difference. Result has 267 places, 323 transitions, 4403 flow [2024-05-12 13:18:59,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4092, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4403, PETRI_PLACES=267, PETRI_TRANSITIONS=323} [2024-05-12 13:18:59,097 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 223 predicate places. [2024-05-12 13:18:59,098 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 323 transitions, 4403 flow [2024-05-12 13:18:59,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:59,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:18:59,098 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:18:59,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-05-12 13:18:59,098 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:18:59,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:18:59,098 INFO L85 PathProgramCache]: Analyzing trace with hash -73201931, now seen corresponding path program 13 times [2024-05-12 13:18:59,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:18:59,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147388298] [2024-05-12 13:18:59,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:18:59,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:18:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:18:59,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:18:59,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:18:59,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147388298] [2024-05-12 13:18:59,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147388298] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:18:59,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:18:59,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:18:59,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169712715] [2024-05-12 13:18:59,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:18:59,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:18:59,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:18:59,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:18:59,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:18:59,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:18:59,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 323 transitions, 4403 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:18:59,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:18:59,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:19:00,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:00,733 INFO L124 PetriNetUnfolderBase]: 2056/3952 cut-off events. [2024-05-12 13:19:00,733 INFO L125 PetriNetUnfolderBase]: For 87093/87093 co-relation queries the response was YES. [2024-05-12 13:19:00,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23202 conditions, 3952 events. 2056/3952 cut-off events. For 87093/87093 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 28424 event pairs, 378 based on Foata normal form. 1/3796 useless extension candidates. Maximal degree in co-relation 23086. Up to 2643 conditions per place. [2024-05-12 13:19:00,771 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 242 selfloop transitions, 104 changer transitions 0/354 dead transitions. [2024-05-12 13:19:00,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 354 transitions, 5345 flow [2024-05-12 13:19:00,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:19:00,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:19:00,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-05-12 13:19:00,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675 [2024-05-12 13:19:00,773 INFO L175 Difference]: Start difference. First operand has 267 places, 323 transitions, 4403 flow. Second operand 10 states and 187 transitions. [2024-05-12 13:19:00,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 354 transitions, 5345 flow [2024-05-12 13:19:01,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 354 transitions, 5038 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-05-12 13:19:01,067 INFO L231 Difference]: Finished difference. Result has 271 places, 323 transitions, 4309 flow [2024-05-12 13:19:01,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4096, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4309, PETRI_PLACES=271, PETRI_TRANSITIONS=323} [2024-05-12 13:19:01,067 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 227 predicate places. [2024-05-12 13:19:01,068 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 323 transitions, 4309 flow [2024-05-12 13:19:01,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:19:01,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:01,068 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:19:01,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-05-12 13:19:01,068 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:19:01,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:01,068 INFO L85 PathProgramCache]: Analyzing trace with hash 2138444927, now seen corresponding path program 14 times [2024-05-12 13:19:01,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:01,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914582383] [2024-05-12 13:19:01,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:01,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19:01,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:19:01,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:01,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914582383] [2024-05-12 13:19:01,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914582383] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:01,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:01,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:19:01,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525738837] [2024-05-12 13:19:01,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:01,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:19:01,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:01,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:19:01,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:19:01,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:19:01,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 323 transitions, 4309 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:19:01,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:01,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:19:01,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:02,731 INFO L124 PetriNetUnfolderBase]: 2054/3974 cut-off events. [2024-05-12 13:19:02,732 INFO L125 PetriNetUnfolderBase]: For 85777/85777 co-relation queries the response was YES. [2024-05-12 13:19:02,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22766 conditions, 3974 events. 2054/3974 cut-off events. For 85777/85777 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 28887 event pairs, 348 based on Foata normal form. 1/3803 useless extension candidates. Maximal degree in co-relation 22649. Up to 2641 conditions per place. [2024-05-12 13:19:02,769 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 234 selfloop transitions, 112 changer transitions 0/354 dead transitions. [2024-05-12 13:19:02,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 354 transitions, 5253 flow [2024-05-12 13:19:02,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:19:02,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:19:02,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-05-12 13:19:02,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-05-12 13:19:02,770 INFO L175 Difference]: Start difference. First operand has 271 places, 323 transitions, 4309 flow. Second operand 9 states and 171 transitions. [2024-05-12 13:19:02,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 354 transitions, 5253 flow [2024-05-12 13:19:03,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 354 transitions, 5015 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-05-12 13:19:03,121 INFO L231 Difference]: Finished difference. Result has 271 places, 323 transitions, 4300 flow [2024-05-12 13:19:03,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4071, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4300, PETRI_PLACES=271, PETRI_TRANSITIONS=323} [2024-05-12 13:19:03,121 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 227 predicate places. [2024-05-12 13:19:03,121 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 323 transitions, 4300 flow [2024-05-12 13:19:03,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:19:03,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:03,121 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:19:03,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-05-12 13:19:03,122 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:19:03,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:03,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1834009427, now seen corresponding path program 15 times [2024-05-12 13:19:03,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:03,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742617216] [2024-05-12 13:19:03,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:03,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19:03,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:19:03,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:03,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742617216] [2024-05-12 13:19:03,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742617216] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:03,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:03,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:19:03,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001068052] [2024-05-12 13:19:03,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:03,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:19:03,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:03,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:19:03,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:19:03,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:19:03,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 323 transitions, 4300 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:19:03,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:03,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:19:03,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:04,761 INFO L124 PetriNetUnfolderBase]: 2052/3866 cut-off events. [2024-05-12 13:19:04,762 INFO L125 PetriNetUnfolderBase]: For 85139/85139 co-relation queries the response was YES. [2024-05-12 13:19:04,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22604 conditions, 3866 events. 2052/3866 cut-off events. For 85139/85139 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 27269 event pairs, 326 based on Foata normal form. 1/3730 useless extension candidates. Maximal degree in co-relation 22486. Up to 2639 conditions per place. [2024-05-12 13:19:04,807 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 219 selfloop transitions, 126 changer transitions 0/353 dead transitions. [2024-05-12 13:19:04,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 353 transitions, 5126 flow [2024-05-12 13:19:04,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:19:04,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:19:04,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-05-12 13:19:04,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46944444444444444 [2024-05-12 13:19:04,809 INFO L175 Difference]: Start difference. First operand has 271 places, 323 transitions, 4300 flow. Second operand 9 states and 169 transitions. [2024-05-12 13:19:04,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 353 transitions, 5126 flow [2024-05-12 13:19:05,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 353 transitions, 4864 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-05-12 13:19:05,150 INFO L231 Difference]: Finished difference. Result has 272 places, 323 transitions, 4295 flow [2024-05-12 13:19:05,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4038, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4295, PETRI_PLACES=272, PETRI_TRANSITIONS=323} [2024-05-12 13:19:05,151 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 228 predicate places. [2024-05-12 13:19:05,151 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 323 transitions, 4295 flow [2024-05-12 13:19:05,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:19:05,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:05,151 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:19:05,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-05-12 13:19:05,151 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:19:05,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:05,151 INFO L85 PathProgramCache]: Analyzing trace with hash 883211874, now seen corresponding path program 17 times [2024-05-12 13:19:05,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:05,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164699018] [2024-05-12 13:19:05,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:05,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19:05,936 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:19:05,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:05,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164699018] [2024-05-12 13:19:05,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164699018] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:05,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:05,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:19:05,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750608079] [2024-05-12 13:19:05,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:05,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:19:05,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:05,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:19:05,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:19:06,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:19:06,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 323 transitions, 4295 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:19:06,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:06,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:19:06,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:06,757 INFO L124 PetriNetUnfolderBase]: 2048/3776 cut-off events. [2024-05-12 13:19:06,758 INFO L125 PetriNetUnfolderBase]: For 84926/84926 co-relation queries the response was YES. [2024-05-12 13:19:06,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22403 conditions, 3776 events. 2048/3776 cut-off events. For 84926/84926 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 26030 event pairs, 238 based on Foata normal form. 2/3672 useless extension candidates. Maximal degree in co-relation 22284. Up to 1953 conditions per place. [2024-05-12 13:19:06,803 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 187 selfloop transitions, 161 changer transitions 0/356 dead transitions. [2024-05-12 13:19:06,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 356 transitions, 5139 flow [2024-05-12 13:19:06,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:19:06,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:19:06,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-05-12 13:19:06,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48055555555555557 [2024-05-12 13:19:06,805 INFO L175 Difference]: Start difference. First operand has 272 places, 323 transitions, 4295 flow. Second operand 9 states and 173 transitions. [2024-05-12 13:19:06,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 356 transitions, 5139 flow [2024-05-12 13:19:07,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 356 transitions, 4851 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-05-12 13:19:07,368 INFO L231 Difference]: Finished difference. Result has 272 places, 323 transitions, 4334 flow [2024-05-12 13:19:07,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4007, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4334, PETRI_PLACES=272, PETRI_TRANSITIONS=323} [2024-05-12 13:19:07,371 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 228 predicate places. [2024-05-12 13:19:07,371 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 323 transitions, 4334 flow [2024-05-12 13:19:07,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:19:07,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:07,371 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:19:07,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-05-12 13:19:07,371 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:19:07,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:07,372 INFO L85 PathProgramCache]: Analyzing trace with hash 2138454568, now seen corresponding path program 6 times [2024-05-12 13:19:07,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:07,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900218841] [2024-05-12 13:19:07,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:07,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19:08,165 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:19:08,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:08,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900218841] [2024-05-12 13:19:08,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900218841] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:08,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:08,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:19:08,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132261616] [2024-05-12 13:19:08,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:08,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:19:08,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:08,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:19:08,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:19:08,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:19:08,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 323 transitions, 4334 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:19:08,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:08,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:19:08,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:08,965 INFO L124 PetriNetUnfolderBase]: 1889/3729 cut-off events. [2024-05-12 13:19:08,965 INFO L125 PetriNetUnfolderBase]: For 86316/86385 co-relation queries the response was YES. [2024-05-12 13:19:08,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21353 conditions, 3729 events. 1889/3729 cut-off events. For 86316/86385 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 27313 event pairs, 516 based on Foata normal form. 46/3625 useless extension candidates. Maximal degree in co-relation 21233. Up to 2589 conditions per place. [2024-05-12 13:19:09,009 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 248 selfloop transitions, 48 changer transitions 0/353 dead transitions. [2024-05-12 13:19:09,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 353 transitions, 5062 flow [2024-05-12 13:19:09,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:19:09,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:19:09,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-05-12 13:19:09,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-05-12 13:19:09,010 INFO L175 Difference]: Start difference. First operand has 272 places, 323 transitions, 4334 flow. Second operand 9 states and 176 transitions. [2024-05-12 13:19:09,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 353 transitions, 5062 flow [2024-05-12 13:19:09,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 353 transitions, 4687 flow, removed 11 selfloop flow, removed 10 redundant places. [2024-05-12 13:19:09,305 INFO L231 Difference]: Finished difference. Result has 271 places, 323 transitions, 4060 flow [2024-05-12 13:19:09,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3959, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4060, PETRI_PLACES=271, PETRI_TRANSITIONS=323} [2024-05-12 13:19:09,305 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 227 predicate places. [2024-05-12 13:19:09,305 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 323 transitions, 4060 flow [2024-05-12 13:19:09,305 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:19:09,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:09,306 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:19:09,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-05-12 13:19:09,306 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:19:09,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:09,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1456905528, now seen corresponding path program 1 times [2024-05-12 13:19:09,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:09,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165826818] [2024-05-12 13:19:09,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:09,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19:10,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:19:10,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:10,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165826818] [2024-05-12 13:19:10,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165826818] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:10,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:10,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:19:10,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980136987] [2024-05-12 13:19:10,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:10,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:19:10,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:10,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:19:10,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:19:10,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:19:10,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 323 transitions, 4060 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:19:10,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:10,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:19:10,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:11,268 INFO L124 PetriNetUnfolderBase]: 1889/3616 cut-off events. [2024-05-12 13:19:11,268 INFO L125 PetriNetUnfolderBase]: For 82533/82600 co-relation queries the response was YES. [2024-05-12 13:19:11,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20261 conditions, 3616 events. 1889/3616 cut-off events. For 82533/82600 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 26013 event pairs, 638 based on Foata normal form. 45/3538 useless extension candidates. Maximal degree in co-relation 20140. Up to 2746 conditions per place. [2024-05-12 13:19:11,306 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 285 selfloop transitions, 28 changer transitions 0/370 dead transitions. [2024-05-12 13:19:11,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 370 transitions, 4976 flow [2024-05-12 13:19:11,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:19:11,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:19:11,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-05-12 13:19:11,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675 [2024-05-12 13:19:11,308 INFO L175 Difference]: Start difference. First operand has 271 places, 323 transitions, 4060 flow. Second operand 10 states and 187 transitions. [2024-05-12 13:19:11,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 370 transitions, 4976 flow [2024-05-12 13:19:11,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 370 transitions, 4846 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-05-12 13:19:11,582 INFO L231 Difference]: Finished difference. Result has 277 places, 333 transitions, 4157 flow [2024-05-12 13:19:11,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3930, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4157, PETRI_PLACES=277, PETRI_TRANSITIONS=333} [2024-05-12 13:19:11,583 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 233 predicate places. [2024-05-12 13:19:11,583 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 333 transitions, 4157 flow [2024-05-12 13:19:11,583 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:19:11,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:11,583 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:19:11,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-05-12 13:19:11,583 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:19:11,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:11,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1562772667, now seen corresponding path program 1 times [2024-05-12 13:19:11,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:11,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760540596] [2024-05-12 13:19:11,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:11,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19:11,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:19:11,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:11,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760540596] [2024-05-12 13:19:11,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760540596] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:11,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:11,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 13:19:11,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21811562] [2024-05-12 13:19:11,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:11,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 13:19:11,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:11,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 13:19:11,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 13:19:11,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 40 [2024-05-12 13:19:11,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 333 transitions, 4157 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:19:11,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:11,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 40 [2024-05-12 13:19:11,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:11,835 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([314] L772-->L775: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][214], [Black: 764#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 506#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 509#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 510#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1021#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd2~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y$r_buff1_thd1~0 0)), Black: 508#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1020#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd2~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y$r_buff1_thd1~0 0)), Black: 1022#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd2~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y$r_buff1_thd1~0 0)), Black: 1024#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1023#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1019#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd2~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y$r_buff1_thd1~0 0)), Black: 261#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 779#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 526#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 522#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 524#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 480#true, Black: 277#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 794#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 1014#true, Black: 293#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), P1Thread1of1ForFork0InUse, Black: 809#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 553#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), P0Thread1of1ForFork1InUse, 1036#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 552#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 554#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 182#true, Black: 51#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), 609#true, Black: 307#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~a~0 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 824#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~a~0 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 569#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 571#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 321#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~a~0 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 839#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 587#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 830#true, 353#true, Black: 79#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 81#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= |#ghost~multithreaded| 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0)), Black: 335#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 852#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 599#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 90#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 601#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 600#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 349#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 501#true, 8#L775true, Black: 865#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 104#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0)), Black: 100#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 36#L796true, Black: 361#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 615#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 616#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 878#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 112#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~a~0 1) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 114#(and (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 373#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 856#true, 216#true, Black: 891#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 125#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 385#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 869#true, Black: 643#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 136#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 904#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 398#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 593#true, Black: 147#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 919#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 377#true, Black: 153#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0)), Black: 410#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 673#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 932#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 163#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 422#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 945#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 176#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 435#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 12#L829true, Black: 189#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 958#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 185#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$r_buff0_thd0~0 0) (= |#ghost~multithreaded| 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 699#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 697#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 458#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0)), Black: 201#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 448#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff1_thd1~0 (* 256 (div ~y$r_buff1_thd1~0 256))) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 971#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 717#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 212#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 984#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 470#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 734#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 220#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0)), Black: 224#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 997#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 493#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 488#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 749#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 487#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 489#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 491#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= |#ghost~multithreaded| 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 1010#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 243#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0))]) [2024-05-12 13:19:11,837 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-05-12 13:19:11,838 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-05-12 13:19:11,838 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-05-12 13:19:11,838 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-05-12 13:19:11,839 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([322] L799-->L806: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd2~0_22 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_33 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse2 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_71 256) 0))))) (and (= (ite .cse0 0 v_~y$r_buff0_thd2~0_33) v_~y$r_buff0_thd2~0_32) (= (ite .cse1 0 v_~y$w_buff0_used~0_78) v_~y$w_buff0_used~0_77) (= v_~y$w_buff1_used~0_70 (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_71)) (= v_~y$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_32 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_70 256) 0)) .cse4)) 0 v_~y$r_buff1_thd2~0_22)) (= (ite .cse1 v_~y$w_buff0~0_45 (ite .cse2 v_~y$w_buff1~0_38 v_~y~0_59)) v_~y~0_58)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_45, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_33, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_71} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_45, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_32, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_70} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][222], [Black: 764#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 506#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 509#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 510#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1021#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd2~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y$r_buff1_thd1~0 0)), Black: 508#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1020#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd2~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y$r_buff1_thd1~0 0)), Black: 1022#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd2~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y$r_buff1_thd1~0 0)), Black: 1024#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1023#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1019#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd2~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y$r_buff1_thd1~0 0)), Black: 261#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 779#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 526#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 522#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 524#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 480#true, 21#L806true, Black: 277#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 794#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 1014#true, Black: 293#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), P1Thread1of1ForFork0InUse, Black: 809#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 553#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), P0Thread1of1ForFork1InUse, Black: 552#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 554#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 182#true, Black: 51#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), 609#true, Black: 307#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~a~0 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 824#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~a~0 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 569#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 571#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 321#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~a~0 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 839#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 587#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 830#true, 353#true, Black: 79#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 81#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= |#ghost~multithreaded| 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0)), Black: 335#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 852#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 599#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 90#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 601#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 600#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 349#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 501#true, Black: 865#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 104#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0)), Black: 100#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 361#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 615#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 616#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 878#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 112#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~a~0 1) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 114#(and (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 373#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 856#true, 216#true, Black: 891#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 125#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 385#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 869#true, Black: 643#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 136#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 904#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 398#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 593#true, Black: 147#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 919#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 377#true, Black: 153#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0)), Black: 410#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 673#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 932#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 163#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 422#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 945#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 176#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 435#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 12#L829true, Black: 189#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 958#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 185#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$r_buff0_thd0~0 0) (= |#ghost~multithreaded| 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 699#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 697#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 458#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0)), 1038#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 201#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 448#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff1_thd1~0 (* 256 (div ~y$r_buff1_thd1~0 256))) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 971#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 717#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 212#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 984#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 470#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 734#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 220#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0)), Black: 224#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 997#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 493#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), 5#L770true, Black: 488#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 749#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 487#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 489#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 491#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= |#ghost~multithreaded| 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 1010#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 243#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~a~0 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0))]) [2024-05-12 13:19:11,840 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-05-12 13:19:11,840 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-05-12 13:19:11,841 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-05-12 13:19:11,841 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-05-12 13:19:11,904 INFO L124 PetriNetUnfolderBase]: 599/1337 cut-off events. [2024-05-12 13:19:11,905 INFO L125 PetriNetUnfolderBase]: For 64374/64521 co-relation queries the response was YES. [2024-05-12 13:19:11,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8245 conditions, 1337 events. 599/1337 cut-off events. For 64374/64521 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8655 event pairs, 134 based on Foata normal form. 138/1346 useless extension candidates. Maximal degree in co-relation 8118. Up to 319 conditions per place. [2024-05-12 13:19:11,917 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 66 selfloop transitions, 50 changer transitions 0/311 dead transitions. [2024-05-12 13:19:11,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 311 transitions, 3981 flow [2024-05-12 13:19:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 13:19:11,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 13:19:11,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2024-05-12 13:19:11,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6875 [2024-05-12 13:19:11,918 INFO L175 Difference]: Start difference. First operand has 277 places, 333 transitions, 4157 flow. Second operand 4 states and 110 transitions. [2024-05-12 13:19:11,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 311 transitions, 3981 flow [2024-05-12 13:19:12,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 311 transitions, 3773 flow, removed 19 selfloop flow, removed 23 redundant places. [2024-05-12 13:19:12,132 INFO L231 Difference]: Finished difference. Result has 259 places, 298 transitions, 3681 flow [2024-05-12 13:19:12,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3449, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3681, PETRI_PLACES=259, PETRI_TRANSITIONS=298} [2024-05-12 13:19:12,133 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 215 predicate places. [2024-05-12 13:19:12,133 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 298 transitions, 3681 flow [2024-05-12 13:19:12,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:19:12,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:12,134 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:19:12,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-05-12 13:19:12,134 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:19:12,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:12,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1293070026, now seen corresponding path program 1 times [2024-05-12 13:19:12,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:12,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666844999] [2024-05-12 13:19:12,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:12,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19:13,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:19:13,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:13,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666844999] [2024-05-12 13:19:13,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666844999] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:13,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:13,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:19:13,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405999350] [2024-05-12 13:19:13,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:13,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:19:13,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:13,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:19:13,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:19:13,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:19:13,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 298 transitions, 3681 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:13,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:13,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:19:13,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:14,084 INFO L124 PetriNetUnfolderBase]: 1056/1937 cut-off events. [2024-05-12 13:19:14,084 INFO L125 PetriNetUnfolderBase]: For 71573/71573 co-relation queries the response was YES. [2024-05-12 13:19:14,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12375 conditions, 1937 events. 1056/1937 cut-off events. For 71573/71573 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 10867 event pairs, 255 based on Foata normal form. 1/1856 useless extension candidates. Maximal degree in co-relation 12258. Up to 1641 conditions per place. [2024-05-12 13:19:14,103 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 275 selfloop transitions, 48 changer transitions 0/332 dead transitions. [2024-05-12 13:19:14,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 332 transitions, 4497 flow [2024-05-12 13:19:14,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:19:14,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:19:14,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 185 transitions. [2024-05-12 13:19:14,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2024-05-12 13:19:14,105 INFO L175 Difference]: Start difference. First operand has 259 places, 298 transitions, 3681 flow. Second operand 11 states and 185 transitions. [2024-05-12 13:19:14,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 332 transitions, 4497 flow [2024-05-12 13:19:14,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 332 transitions, 4495 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 13:19:14,375 INFO L231 Difference]: Finished difference. Result has 271 places, 306 transitions, 3884 flow [2024-05-12 13:19:14,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3679, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3884, PETRI_PLACES=271, PETRI_TRANSITIONS=306} [2024-05-12 13:19:14,376 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 227 predicate places. [2024-05-12 13:19:14,376 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 306 transitions, 3884 flow [2024-05-12 13:19:14,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:14,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:14,377 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:19:14,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-05-12 13:19:14,377 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:19:14,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:14,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1289815826, now seen corresponding path program 2 times [2024-05-12 13:19:14,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:14,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931319548] [2024-05-12 13:19:14,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:14,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19:15,430 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:19:15,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:15,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931319548] [2024-05-12 13:19:15,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931319548] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:15,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:15,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:19:15,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224587424] [2024-05-12 13:19:15,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:15,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:19:15,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:15,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:19:15,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:19:15,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:19:15,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 306 transitions, 3884 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:15,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:15,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:19:15,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:16,061 INFO L124 PetriNetUnfolderBase]: 1089/1994 cut-off events. [2024-05-12 13:19:16,061 INFO L125 PetriNetUnfolderBase]: For 74957/74957 co-relation queries the response was YES. [2024-05-12 13:19:16,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13166 conditions, 1994 events. 1089/1994 cut-off events. For 74957/74957 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 11244 event pairs, 257 based on Foata normal form. 1/1908 useless extension candidates. Maximal degree in co-relation 13044. Up to 1679 conditions per place. [2024-05-12 13:19:16,081 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 282 selfloop transitions, 59 changer transitions 0/350 dead transitions. [2024-05-12 13:19:16,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 350 transitions, 4952 flow [2024-05-12 13:19:16,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:19:16,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:19:16,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 185 transitions. [2024-05-12 13:19:16,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2024-05-12 13:19:16,082 INFO L175 Difference]: Start difference. First operand has 271 places, 306 transitions, 3884 flow. Second operand 11 states and 185 transitions. [2024-05-12 13:19:16,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 350 transitions, 4952 flow [2024-05-12 13:19:16,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 350 transitions, 4772 flow, removed 36 selfloop flow, removed 7 redundant places. [2024-05-12 13:19:16,372 INFO L231 Difference]: Finished difference. Result has 278 places, 326 transitions, 4187 flow [2024-05-12 13:19:16,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3760, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4187, PETRI_PLACES=278, PETRI_TRANSITIONS=326} [2024-05-12 13:19:16,373 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 234 predicate places. [2024-05-12 13:19:16,373 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 326 transitions, 4187 flow [2024-05-12 13:19:16,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:16,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:16,374 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:19:16,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-05-12 13:19:16,374 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:19:16,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:16,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1294608364, now seen corresponding path program 1 times [2024-05-12 13:19:16,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:16,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054568643] [2024-05-12 13:19:16,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:16,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19:17,190 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:19:17,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:17,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054568643] [2024-05-12 13:19:17,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054568643] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:17,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:17,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:19:17,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250251777] [2024-05-12 13:19:17,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:17,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:19:17,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:17,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:19:17,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:19:17,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:19:17,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 326 transitions, 4187 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:17,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:17,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:19:17,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:17,874 INFO L124 PetriNetUnfolderBase]: 1134/2070 cut-off events. [2024-05-12 13:19:17,874 INFO L125 PetriNetUnfolderBase]: For 81093/81093 co-relation queries the response was YES. [2024-05-12 13:19:17,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13986 conditions, 2070 events. 1134/2070 cut-off events. For 81093/81093 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 11761 event pairs, 265 based on Foata normal form. 2/1979 useless extension candidates. Maximal degree in co-relation 13860. Up to 1746 conditions per place. [2024-05-12 13:19:17,893 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 296 selfloop transitions, 62 changer transitions 0/367 dead transitions. [2024-05-12 13:19:17,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 367 transitions, 5284 flow [2024-05-12 13:19:17,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:19:17,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:19:17,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 185 transitions. [2024-05-12 13:19:17,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2024-05-12 13:19:17,894 INFO L175 Difference]: Start difference. First operand has 278 places, 326 transitions, 4187 flow. Second operand 11 states and 185 transitions. [2024-05-12 13:19:17,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 367 transitions, 5284 flow [2024-05-12 13:19:18,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 367 transitions, 5170 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-05-12 13:19:18,336 INFO L231 Difference]: Finished difference. Result has 285 places, 340 transitions, 4505 flow [2024-05-12 13:19:18,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4073, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4505, PETRI_PLACES=285, PETRI_TRANSITIONS=340} [2024-05-12 13:19:18,337 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 241 predicate places. [2024-05-12 13:19:18,337 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 340 transitions, 4505 flow [2024-05-12 13:19:18,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:18,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:18,337 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:19:18,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-05-12 13:19:18,337 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:19:18,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:18,338 INFO L85 PathProgramCache]: Analyzing trace with hash -2035936242, now seen corresponding path program 3 times [2024-05-12 13:19:18,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:18,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476023362] [2024-05-12 13:19:18,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:18,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19:19,275 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:19:19,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:19,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476023362] [2024-05-12 13:19:19,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476023362] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:19,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:19,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:19:19,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288538807] [2024-05-12 13:19:19,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:19,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:19:19,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:19,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:19:19,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:19:19,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:19:19,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 340 transitions, 4505 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:19,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:19,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:19:19,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:19,950 INFO L124 PetriNetUnfolderBase]: 1166/2126 cut-off events. [2024-05-12 13:19:19,951 INFO L125 PetriNetUnfolderBase]: For 81888/81888 co-relation queries the response was YES. [2024-05-12 13:19:19,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14484 conditions, 2126 events. 1166/2126 cut-off events. For 81888/81888 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 12146 event pairs, 283 based on Foata normal form. 1/2025 useless extension candidates. Maximal degree in co-relation 14356. Up to 1812 conditions per place. [2024-05-12 13:19:19,971 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 307 selfloop transitions, 67 changer transitions 0/383 dead transitions. [2024-05-12 13:19:19,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 383 transitions, 5609 flow [2024-05-12 13:19:19,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:19:19,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:19:19,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 184 transitions. [2024-05-12 13:19:19,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-05-12 13:19:19,972 INFO L175 Difference]: Start difference. First operand has 285 places, 340 transitions, 4505 flow. Second operand 11 states and 184 transitions. [2024-05-12 13:19:19,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 383 transitions, 5609 flow [2024-05-12 13:19:20,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 383 transitions, 5454 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-05-12 13:19:20,268 INFO L231 Difference]: Finished difference. Result has 292 places, 360 transitions, 4811 flow [2024-05-12 13:19:20,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4358, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4811, PETRI_PLACES=292, PETRI_TRANSITIONS=360} [2024-05-12 13:19:20,269 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 248 predicate places. [2024-05-12 13:19:20,269 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 360 transitions, 4811 flow [2024-05-12 13:19:20,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:20,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:20,269 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:19:20,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-05-12 13:19:20,269 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:19:20,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:20,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1687791976, now seen corresponding path program 2 times [2024-05-12 13:19:20,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:20,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630857419] [2024-05-12 13:19:20,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:20,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19:21,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:19:21,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:21,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630857419] [2024-05-12 13:19:21,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630857419] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:21,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:21,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:19:21,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825620757] [2024-05-12 13:19:21,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:21,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:19:21,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:21,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:19:21,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:19:21,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:19:21,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 360 transitions, 4811 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:21,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:21,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:19:21,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:21,694 INFO L124 PetriNetUnfolderBase]: 1186/2160 cut-off events. [2024-05-12 13:19:21,694 INFO L125 PetriNetUnfolderBase]: For 87368/87368 co-relation queries the response was YES. [2024-05-12 13:19:21,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14849 conditions, 2160 events. 1186/2160 cut-off events. For 87368/87368 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 12412 event pairs, 274 based on Foata normal form. 2/2055 useless extension candidates. Maximal degree in co-relation 14718. Up to 1819 conditions per place. [2024-05-12 13:19:21,716 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 316 selfloop transitions, 68 changer transitions 0/393 dead transitions. [2024-05-12 13:19:21,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 393 transitions, 5832 flow [2024-05-12 13:19:21,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:19:21,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:19:21,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 185 transitions. [2024-05-12 13:19:21,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2024-05-12 13:19:21,717 INFO L175 Difference]: Start difference. First operand has 292 places, 360 transitions, 4811 flow. Second operand 11 states and 185 transitions. [2024-05-12 13:19:21,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 393 transitions, 5832 flow [2024-05-12 13:19:22,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 393 transitions, 5701 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-05-12 13:19:22,037 INFO L231 Difference]: Finished difference. Result has 299 places, 368 transitions, 5005 flow [2024-05-12 13:19:22,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4680, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5005, PETRI_PLACES=299, PETRI_TRANSITIONS=368} [2024-05-12 13:19:22,037 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 255 predicate places. [2024-05-12 13:19:22,037 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 368 transitions, 5005 flow [2024-05-12 13:19:22,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:22,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:22,037 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:19:22,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-05-12 13:19:22,038 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:19:22,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:22,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1511428082, now seen corresponding path program 3 times [2024-05-12 13:19:22,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:22,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805156393] [2024-05-12 13:19:22,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:22,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19:22,824 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:19:22,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:22,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805156393] [2024-05-12 13:19:22,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805156393] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:22,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:22,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:19:22,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990862908] [2024-05-12 13:19:22,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:22,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:19:22,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:22,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:19:22,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:19:22,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:19:22,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 368 transitions, 5005 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:22,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:22,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:19:22,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:23,486 INFO L124 PetriNetUnfolderBase]: 1212/2203 cut-off events. [2024-05-12 13:19:23,486 INFO L125 PetriNetUnfolderBase]: For 95440/95440 co-relation queries the response was YES. [2024-05-12 13:19:23,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15482 conditions, 2203 events. 1212/2203 cut-off events. For 95440/95440 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 12702 event pairs, 250 based on Foata normal form. 2/2096 useless extension candidates. Maximal degree in co-relation 15348. Up to 1699 conditions per place. [2024-05-12 13:19:23,510 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 294 selfloop transitions, 96 changer transitions 0/399 dead transitions. [2024-05-12 13:19:23,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 399 transitions, 6145 flow [2024-05-12 13:19:23,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:19:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:19:23,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 191 transitions. [2024-05-12 13:19:23,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4340909090909091 [2024-05-12 13:19:23,511 INFO L175 Difference]: Start difference. First operand has 299 places, 368 transitions, 5005 flow. Second operand 11 states and 191 transitions. [2024-05-12 13:19:23,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 399 transitions, 6145 flow [2024-05-12 13:19:23,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 399 transitions, 5933 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-05-12 13:19:23,902 INFO L231 Difference]: Finished difference. Result has 301 places, 372 transitions, 5096 flow [2024-05-12 13:19:23,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4793, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5096, PETRI_PLACES=301, PETRI_TRANSITIONS=372} [2024-05-12 13:19:23,903 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 257 predicate places. [2024-05-12 13:19:23,903 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 372 transitions, 5096 flow [2024-05-12 13:19:23,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:23,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:23,903 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:19:23,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-05-12 13:19:23,903 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:19:23,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:23,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1486223842, now seen corresponding path program 1 times [2024-05-12 13:19:23,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:23,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490470847] [2024-05-12 13:19:23,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:23,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19: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:19:24,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:24,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490470847] [2024-05-12 13:19:24,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490470847] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:24,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:24,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:19:24,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467153090] [2024-05-12 13:19:24,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:24,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:19:24,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:24,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:19:24,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:19:24,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:19:24,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 372 transitions, 5096 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:24,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:24,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:19:24,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:25,255 INFO L124 PetriNetUnfolderBase]: 1217/2211 cut-off events. [2024-05-12 13:19:25,255 INFO L125 PetriNetUnfolderBase]: For 95535/95535 co-relation queries the response was YES. [2024-05-12 13:19:25,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15600 conditions, 2211 events. 1217/2211 cut-off events. For 95535/95535 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 12744 event pairs, 301 based on Foata normal form. 1/2106 useless extension candidates. Maximal degree in co-relation 15466. Up to 1928 conditions per place. [2024-05-12 13:19:25,278 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 339 selfloop transitions, 48 changer transitions 0/396 dead transitions. [2024-05-12 13:19:25,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 396 transitions, 6008 flow [2024-05-12 13:19:25,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:19:25,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:19:25,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 179 transitions. [2024-05-12 13:19:25,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4068181818181818 [2024-05-12 13:19:25,279 INFO L175 Difference]: Start difference. First operand has 301 places, 372 transitions, 5096 flow. Second operand 11 states and 179 transitions. [2024-05-12 13:19:25,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 396 transitions, 6008 flow [2024-05-12 13:19:25,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 396 transitions, 5853 flow, removed 23 selfloop flow, removed 7 redundant places. [2024-05-12 13:19:25,770 INFO L231 Difference]: Finished difference. Result has 305 places, 374 transitions, 5078 flow [2024-05-12 13:19:25,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4941, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5078, PETRI_PLACES=305, PETRI_TRANSITIONS=374} [2024-05-12 13:19:25,770 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 261 predicate places. [2024-05-12 13:19:25,770 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 374 transitions, 5078 flow [2024-05-12 13:19:25,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:25,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:25,771 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:19:25,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-05-12 13:19:25,771 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:19:25,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:25,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1486518962, now seen corresponding path program 4 times [2024-05-12 13:19:25,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:25,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760644450] [2024-05-12 13:19:25,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:25,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19:26,604 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:19:26,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:26,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760644450] [2024-05-12 13:19:26,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760644450] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:26,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:26,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:19:26,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939624503] [2024-05-12 13:19:26,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:26,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:19:26,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:26,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:19:26,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:19:26,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:19:26,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 374 transitions, 5078 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:26,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:26,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:19:26,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:27,302 INFO L124 PetriNetUnfolderBase]: 1228/2225 cut-off events. [2024-05-12 13:19:27,303 INFO L125 PetriNetUnfolderBase]: For 99673/99673 co-relation queries the response was YES. [2024-05-12 13:19:27,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15770 conditions, 2225 events. 1228/2225 cut-off events. For 99673/99673 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 12820 event pairs, 231 based on Foata normal form. 2/2117 useless extension candidates. Maximal degree in co-relation 15634. Up to 1717 conditions per place. [2024-05-12 13:19:27,327 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 289 selfloop transitions, 105 changer transitions 0/403 dead transitions. [2024-05-12 13:19:27,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 403 transitions, 6180 flow [2024-05-12 13:19:27,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:19:27,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:19:27,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2024-05-12 13:19:27,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2024-05-12 13:19:27,328 INFO L175 Difference]: Start difference. First operand has 305 places, 374 transitions, 5078 flow. Second operand 11 states and 190 transitions. [2024-05-12 13:19:27,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 403 transitions, 6180 flow [2024-05-12 13:19:27,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 403 transitions, 6063 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-05-12 13:19:27,748 INFO L231 Difference]: Finished difference. Result has 307 places, 376 transitions, 5228 flow [2024-05-12 13:19:27,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4961, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5228, PETRI_PLACES=307, PETRI_TRANSITIONS=376} [2024-05-12 13:19:27,749 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 263 predicate places. [2024-05-12 13:19:27,749 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 376 transitions, 5228 flow [2024-05-12 13:19:27,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:27,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:27,749 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:19:27,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-05-12 13:19:27,750 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:19:27,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:27,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2063431844, now seen corresponding path program 5 times [2024-05-12 13:19:27,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:27,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362843019] [2024-05-12 13:19:27,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:27,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19:28,587 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:19:28,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:28,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362843019] [2024-05-12 13:19:28,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362843019] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:28,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:28,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:19:28,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972689637] [2024-05-12 13:19:28,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:28,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:19:28,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:28,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:19:28,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:19:28,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:19:28,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 376 transitions, 5228 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:28,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:28,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:19:28,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:29,197 INFO L124 PetriNetUnfolderBase]: 1224/2219 cut-off events. [2024-05-12 13:19:29,197 INFO L125 PetriNetUnfolderBase]: For 98095/98095 co-relation queries the response was YES. [2024-05-12 13:19:29,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15766 conditions, 2219 events. 1224/2219 cut-off events. For 98095/98095 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 12802 event pairs, 230 based on Foata normal form. 2/2111 useless extension candidates. Maximal degree in co-relation 15629. Up to 1714 conditions per place. [2024-05-12 13:19:29,220 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 278 selfloop transitions, 115 changer transitions 0/402 dead transitions. [2024-05-12 13:19:29,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 402 transitions, 6138 flow [2024-05-12 13:19:29,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:19:29,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:19:29,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 188 transitions. [2024-05-12 13:19:29,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42727272727272725 [2024-05-12 13:19:29,221 INFO L175 Difference]: Start difference. First operand has 307 places, 376 transitions, 5228 flow. Second operand 11 states and 188 transitions. [2024-05-12 13:19:29,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 402 transitions, 6138 flow [2024-05-12 13:19:29,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 402 transitions, 5851 flow, removed 37 selfloop flow, removed 9 redundant places. [2024-05-12 13:19:29,632 INFO L231 Difference]: Finished difference. Result has 309 places, 376 transitions, 5178 flow [2024-05-12 13:19:29,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4941, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5178, PETRI_PLACES=309, PETRI_TRANSITIONS=376} [2024-05-12 13:19:29,632 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 265 predicate places. [2024-05-12 13:19:29,632 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 376 transitions, 5178 flow [2024-05-12 13:19:29,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:29,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:29,633 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:19:29,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-05-12 13:19:29,633 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:19:29,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:29,633 INFO L85 PathProgramCache]: Analyzing trace with hash 414336094, now seen corresponding path program 4 times [2024-05-12 13:19:29,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:29,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745109137] [2024-05-12 13:19:29,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:29,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19:30,575 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:19:30,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:30,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745109137] [2024-05-12 13:19:30,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745109137] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:30,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:30,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:19:30,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804863606] [2024-05-12 13:19:30,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:30,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:19:30,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:30,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:19:30,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:19:30,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:19:30,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 376 transitions, 5178 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:30,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:30,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:19:30,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:31,372 INFO L124 PetriNetUnfolderBase]: 1261/2280 cut-off events. [2024-05-12 13:19:31,372 INFO L125 PetriNetUnfolderBase]: For 97407/97407 co-relation queries the response was YES. [2024-05-12 13:19:31,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16118 conditions, 2280 events. 1261/2280 cut-off events. For 97407/97407 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13194 event pairs, 197 based on Foata normal form. 1/2159 useless extension candidates. Maximal degree in co-relation 15980. Up to 1935 conditions per place. [2024-05-12 13:19:31,395 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 334 selfloop transitions, 79 changer transitions 0/422 dead transitions. [2024-05-12 13:19:31,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 422 transitions, 6424 flow [2024-05-12 13:19:31,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:19:31,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:19:31,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 185 transitions. [2024-05-12 13:19:31,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2024-05-12 13:19:31,400 INFO L175 Difference]: Start difference. First operand has 309 places, 376 transitions, 5178 flow. Second operand 11 states and 185 transitions. [2024-05-12 13:19:31,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 422 transitions, 6424 flow [2024-05-12 13:19:31,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 422 transitions, 6183 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-05-12 13:19:31,834 INFO L231 Difference]: Finished difference. Result has 312 places, 401 transitions, 5498 flow [2024-05-12 13:19:31,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4937, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5498, PETRI_PLACES=312, PETRI_TRANSITIONS=401} [2024-05-12 13:19:31,834 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 268 predicate places. [2024-05-12 13:19:31,835 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 401 transitions, 5498 flow [2024-05-12 13:19:31,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:31,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:31,835 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:19:31,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-05-12 13:19:31,835 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:19:31,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:31,836 INFO L85 PathProgramCache]: Analyzing trace with hash 503712732, now seen corresponding path program 6 times [2024-05-12 13:19:31,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:31,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874681501] [2024-05-12 13:19:31,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:31,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19:32,639 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:19:32,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:32,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874681501] [2024-05-12 13:19:32,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874681501] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:32,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:32,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:19:32,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581541012] [2024-05-12 13:19:32,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:32,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:19:32,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:32,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:19:32,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:19:32,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:19:32,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 401 transitions, 5498 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:32,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:32,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:19:32,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:33,445 INFO L124 PetriNetUnfolderBase]: 1278/2309 cut-off events. [2024-05-12 13:19:33,445 INFO L125 PetriNetUnfolderBase]: For 102950/102950 co-relation queries the response was YES. [2024-05-12 13:19:33,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16388 conditions, 2309 events. 1278/2309 cut-off events. For 102950/102950 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 13391 event pairs, 181 based on Foata normal form. 2/2185 useless extension candidates. Maximal degree in co-relation 16247. Up to 1960 conditions per place. [2024-05-12 13:19:33,470 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 353 selfloop transitions, 68 changer transitions 0/430 dead transitions. [2024-05-12 13:19:33,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 430 transitions, 6534 flow [2024-05-12 13:19:33,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:19:33,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:19:33,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 185 transitions. [2024-05-12 13:19:33,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2024-05-12 13:19:33,471 INFO L175 Difference]: Start difference. First operand has 312 places, 401 transitions, 5498 flow. Second operand 11 states and 185 transitions. [2024-05-12 13:19:33,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 430 transitions, 6534 flow [2024-05-12 13:19:33,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 430 transitions, 6418 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-05-12 13:19:34,002 INFO L231 Difference]: Finished difference. Result has 318 places, 407 transitions, 5634 flow [2024-05-12 13:19:34,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5382, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5634, PETRI_PLACES=318, PETRI_TRANSITIONS=407} [2024-05-12 13:19:34,003 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 274 predicate places. [2024-05-12 13:19:34,003 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 407 transitions, 5634 flow [2024-05-12 13:19:34,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:34,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:34,003 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:19:34,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-05-12 13:19:34,004 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:19:34,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:34,004 INFO L85 PathProgramCache]: Analyzing trace with hash 421011262, now seen corresponding path program 2 times [2024-05-12 13:19:34,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:34,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107851433] [2024-05-12 13:19:34,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:34,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19:34,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:19:34,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:34,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107851433] [2024-05-12 13:19:34,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107851433] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:34,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:34,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:19:34,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027897655] [2024-05-12 13:19:34,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:34,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:19:34,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:34,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:19:34,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:19:34,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:19:34,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 407 transitions, 5634 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:34,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:34,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:19:34,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:35,486 INFO L124 PetriNetUnfolderBase]: 1284/2320 cut-off events. [2024-05-12 13:19:35,486 INFO L125 PetriNetUnfolderBase]: For 102881/102881 co-relation queries the response was YES. [2024-05-12 13:19:35,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16519 conditions, 2320 events. 1284/2320 cut-off events. For 102881/102881 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 13490 event pairs, 270 based on Foata normal form. 1/2198 useless extension candidates. Maximal degree in co-relation 16377. Up to 2032 conditions per place. [2024-05-12 13:19:35,511 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 373 selfloop transitions, 49 changer transitions 0/431 dead transitions. [2024-05-12 13:19:35,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 431 transitions, 6616 flow [2024-05-12 13:19:35,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:19:35,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:19:35,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 179 transitions. [2024-05-12 13:19:35,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4068181818181818 [2024-05-12 13:19:35,513 INFO L175 Difference]: Start difference. First operand has 318 places, 407 transitions, 5634 flow. Second operand 11 states and 179 transitions. [2024-05-12 13:19:35,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 431 transitions, 6616 flow [2024-05-12 13:19:35,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 431 transitions, 6408 flow, removed 18 selfloop flow, removed 10 redundant places. [2024-05-12 13:19:35,911 INFO L231 Difference]: Finished difference. Result has 319 places, 411 transitions, 5583 flow [2024-05-12 13:19:35,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5426, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5583, PETRI_PLACES=319, PETRI_TRANSITIONS=411} [2024-05-12 13:19:35,912 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 275 predicate places. [2024-05-12 13:19:35,912 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 411 transitions, 5583 flow [2024-05-12 13:19:35,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:35,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:35,912 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:19:35,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-05-12 13:19:35,913 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:19:35,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:35,913 INFO L85 PathProgramCache]: Analyzing trace with hash 299877744, now seen corresponding path program 7 times [2024-05-12 13:19:35,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:35,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349218523] [2024-05-12 13:19:35,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:35,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19:36,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:19:36,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:36,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349218523] [2024-05-12 13:19:36,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349218523] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:36,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:36,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:19:36,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782150972] [2024-05-12 13:19:36,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:36,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:19:36,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:36,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:19:36,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:19:36,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:19:36,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 411 transitions, 5583 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:36,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:36,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:19:36,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:37,441 INFO L124 PetriNetUnfolderBase]: 1319/2378 cut-off events. [2024-05-12 13:19:37,442 INFO L125 PetriNetUnfolderBase]: For 114375/114375 co-relation queries the response was YES. [2024-05-12 13:19:37,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17087 conditions, 2378 events. 1319/2378 cut-off events. For 114375/114375 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 13854 event pairs, 176 based on Foata normal form. 2/2249 useless extension candidates. Maximal degree in co-relation 16944. Up to 1912 conditions per place. [2024-05-12 13:19:37,469 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 332 selfloop transitions, 105 changer transitions 0/446 dead transitions. [2024-05-12 13:19:37,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 446 transitions, 6881 flow [2024-05-12 13:19:37,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:19:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:19:37,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2024-05-12 13:19:37,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2024-05-12 13:19:37,470 INFO L175 Difference]: Start difference. First operand has 319 places, 411 transitions, 5583 flow. Second operand 11 states and 190 transitions. [2024-05-12 13:19:37,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 446 transitions, 6881 flow [2024-05-12 13:19:37,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 446 transitions, 6764 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-05-12 13:19:37,937 INFO L231 Difference]: Finished difference. Result has 322 places, 421 transitions, 5894 flow [2024-05-12 13:19:37,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5466, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5894, PETRI_PLACES=322, PETRI_TRANSITIONS=421} [2024-05-12 13:19:37,938 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 278 predicate places. [2024-05-12 13:19:37,938 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 421 transitions, 5894 flow [2024-05-12 13:19:37,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:37,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:37,938 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:19:37,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-05-12 13:19:37,938 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:19:37,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:37,939 INFO L85 PathProgramCache]: Analyzing trace with hash 299638734, now seen corresponding path program 8 times [2024-05-12 13:19:37,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:37,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213429278] [2024-05-12 13:19:37,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:37,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19:38,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:19:38,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:38,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213429278] [2024-05-12 13:19:38,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213429278] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:38,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:38,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:19:38,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825602431] [2024-05-12 13:19:38,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:38,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:19:38,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:38,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:19:38,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:19:38,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:19:38,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 421 transitions, 5894 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:38,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:38,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:19:38,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:39,436 INFO L124 PetriNetUnfolderBase]: 1330/2398 cut-off events. [2024-05-12 13:19:39,436 INFO L125 PetriNetUnfolderBase]: For 119236/119236 co-relation queries the response was YES. [2024-05-12 13:19:39,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17586 conditions, 2398 events. 1330/2398 cut-off events. For 119236/119236 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 14017 event pairs, 192 based on Foata normal form. 2/2268 useless extension candidates. Maximal degree in co-relation 17441. Up to 1922 conditions per place. [2024-05-12 13:19:39,460 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 343 selfloop transitions, 96 changer transitions 0/448 dead transitions. [2024-05-12 13:19:39,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 448 transitions, 7102 flow [2024-05-12 13:19:39,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:19:39,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:19:39,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2024-05-12 13:19:39,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2024-05-12 13:19:39,461 INFO L175 Difference]: Start difference. First operand has 322 places, 421 transitions, 5894 flow. Second operand 11 states and 192 transitions. [2024-05-12 13:19:39,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 448 transitions, 7102 flow [2024-05-12 13:19:39,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 448 transitions, 6935 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-05-12 13:19:39,916 INFO L231 Difference]: Finished difference. Result has 326 places, 423 transitions, 5994 flow [2024-05-12 13:19:39,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5731, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5994, PETRI_PLACES=326, PETRI_TRANSITIONS=423} [2024-05-12 13:19:39,916 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 282 predicate places. [2024-05-12 13:19:39,916 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 423 transitions, 5994 flow [2024-05-12 13:19:39,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:39,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:39,916 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:19:39,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-05-12 13:19:39,917 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:19:39,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:39,917 INFO L85 PathProgramCache]: Analyzing trace with hash 510199482, now seen corresponding path program 9 times [2024-05-12 13:19:39,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:39,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677990626] [2024-05-12 13:19:39,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:39,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19:40,699 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:19:40,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:40,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677990626] [2024-05-12 13:19:40,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677990626] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:40,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:40,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:19:40,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251573797] [2024-05-12 13:19:40,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:40,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:19:40,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:40,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:19:40,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:19:40,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:19:40,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 423 transitions, 5994 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:40,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:40,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:19:40,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:41,447 INFO L124 PetriNetUnfolderBase]: 1326/2389 cut-off events. [2024-05-12 13:19:41,447 INFO L125 PetriNetUnfolderBase]: For 115181/115181 co-relation queries the response was YES. [2024-05-12 13:19:41,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17460 conditions, 2389 events. 1326/2389 cut-off events. For 115181/115181 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 13934 event pairs, 176 based on Foata normal form. 2/2259 useless extension candidates. Maximal degree in co-relation 17313. Up to 1919 conditions per place. [2024-05-12 13:19:41,474 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 338 selfloop transitions, 100 changer transitions 0/447 dead transitions. [2024-05-12 13:19:41,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 447 transitions, 6982 flow [2024-05-12 13:19:41,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:19:41,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:19:41,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2024-05-12 13:19:41,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2024-05-12 13:19:41,475 INFO L175 Difference]: Start difference. First operand has 326 places, 423 transitions, 5994 flow. Second operand 11 states and 190 transitions. [2024-05-12 13:19:41,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 447 transitions, 6982 flow [2024-05-12 13:19:41,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 447 transitions, 6735 flow, removed 44 selfloop flow, removed 8 redundant places. [2024-05-12 13:19:41,993 INFO L231 Difference]: Finished difference. Result has 329 places, 423 transitions, 5956 flow [2024-05-12 13:19:41,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5747, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5956, PETRI_PLACES=329, PETRI_TRANSITIONS=423} [2024-05-12 13:19:41,993 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 285 predicate places. [2024-05-12 13:19:41,994 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 423 transitions, 5956 flow [2024-05-12 13:19:41,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:41,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:41,994 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:19:41,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-05-12 13:19:41,994 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:19:41,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:41,995 INFO L85 PathProgramCache]: Analyzing trace with hash 650998402, now seen corresponding path program 3 times [2024-05-12 13:19:41,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:41,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787626602] [2024-05-12 13:19:41,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:41,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19:42,861 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:19:42,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:42,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787626602] [2024-05-12 13:19:42,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787626602] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:42,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:42,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:19:42,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957108160] [2024-05-12 13:19:42,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:42,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:19:42,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:42,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:19:42,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:19:42,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:19:42,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 423 transitions, 5956 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:42,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:42,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:19:42,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:43,589 INFO L124 PetriNetUnfolderBase]: 1338/2408 cut-off events. [2024-05-12 13:19:43,589 INFO L125 PetriNetUnfolderBase]: For 116596/116596 co-relation queries the response was YES. [2024-05-12 13:19:43,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17579 conditions, 2408 events. 1338/2408 cut-off events. For 116596/116596 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 14063 event pairs, 280 based on Foata normal form. 1/2280 useless extension candidates. Maximal degree in co-relation 17431. Up to 2025 conditions per place. [2024-05-12 13:19:43,617 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 357 selfloop transitions, 82 changer transitions 0/448 dead transitions. [2024-05-12 13:19:43,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 448 transitions, 7168 flow [2024-05-12 13:19:43,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:19:43,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:19:43,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 183 transitions. [2024-05-12 13:19:43,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4159090909090909 [2024-05-12 13:19:43,618 INFO L175 Difference]: Start difference. First operand has 329 places, 423 transitions, 5956 flow. Second operand 11 states and 183 transitions. [2024-05-12 13:19:43,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 448 transitions, 7168 flow [2024-05-12 13:19:44,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 448 transitions, 6940 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-05-12 13:19:44,120 INFO L231 Difference]: Finished difference. Result has 330 places, 427 transitions, 5977 flow [2024-05-12 13:19:44,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5728, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5977, PETRI_PLACES=330, PETRI_TRANSITIONS=427} [2024-05-12 13:19:44,121 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 286 predicate places. [2024-05-12 13:19:44,121 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 427 transitions, 5977 flow [2024-05-12 13:19:44,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:44,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:44,121 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:19:44,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-05-12 13:19:44,122 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:19:44,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:44,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1598475558, now seen corresponding path program 1 times [2024-05-12 13:19:44,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:44,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273903251] [2024-05-12 13:19:44,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:44,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19:45,259 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:19:45,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:45,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273903251] [2024-05-12 13:19:45,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273903251] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:45,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:45,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:19:45,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369979867] [2024-05-12 13:19:45,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:45,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:19:45,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:45,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:19:45,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:19:45,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:19:45,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 427 transitions, 5977 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:19:45,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:45,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:19:45,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:45,899 INFO L124 PetriNetUnfolderBase]: 1287/2357 cut-off events. [2024-05-12 13:19:45,900 INFO L125 PetriNetUnfolderBase]: For 118991/118994 co-relation queries the response was YES. [2024-05-12 13:19:45,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17089 conditions, 2357 events. 1287/2357 cut-off events. For 118991/118994 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 14080 event pairs, 327 based on Foata normal form. 4/2228 useless extension candidates. Maximal degree in co-relation 16940. Up to 1950 conditions per place. [2024-05-12 13:19:45,927 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 363 selfloop transitions, 24 changer transitions 0/449 dead transitions. [2024-05-12 13:19:45,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 449 transitions, 6881 flow [2024-05-12 13:19:45,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:19:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:19:45,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 186 transitions. [2024-05-12 13:19:45,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42272727272727273 [2024-05-12 13:19:45,928 INFO L175 Difference]: Start difference. First operand has 330 places, 427 transitions, 5977 flow. Second operand 11 states and 186 transitions. [2024-05-12 13:19:45,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 449 transitions, 6881 flow [2024-05-12 13:19:46,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 449 transitions, 6744 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-05-12 13:19:46,441 INFO L231 Difference]: Finished difference. Result has 334 places, 429 transitions, 5925 flow [2024-05-12 13:19:46,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5840, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5925, PETRI_PLACES=334, PETRI_TRANSITIONS=429} [2024-05-12 13:19:46,442 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 290 predicate places. [2024-05-12 13:19:46,442 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 429 transitions, 5925 flow [2024-05-12 13:19:46,442 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:19:46,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:46,442 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:19:46,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-05-12 13:19:46,442 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:19:46,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:46,442 INFO L85 PathProgramCache]: Analyzing trace with hash 642647622, now seen corresponding path program 10 times [2024-05-12 13:19:46,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:46,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257593387] [2024-05-12 13:19:46,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:46,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19:47,312 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:19:47,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:47,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257593387] [2024-05-12 13:19:47,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257593387] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:47,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:47,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:19:47,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414319465] [2024-05-12 13:19:47,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:47,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:19:47,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:47,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:19:47,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:19:47,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:19:47,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 429 transitions, 5925 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:47,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:47,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:19:47,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:48,071 INFO L124 PetriNetUnfolderBase]: 1400/2509 cut-off events. [2024-05-12 13:19:48,072 INFO L125 PetriNetUnfolderBase]: For 146996/146996 co-relation queries the response was YES. [2024-05-12 13:19:48,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19062 conditions, 2509 events. 1400/2509 cut-off events. For 146996/146996 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 14761 event pairs, 205 based on Foata normal form. 2/2374 useless extension candidates. Maximal degree in co-relation 18911. Up to 1687 conditions per place. [2024-05-12 13:19:48,102 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 323 selfloop transitions, 133 changer transitions 0/465 dead transitions. [2024-05-12 13:19:48,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 465 transitions, 7695 flow [2024-05-12 13:19:48,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:19:48,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:19:48,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2024-05-12 13:19:48,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-05-12 13:19:48,104 INFO L175 Difference]: Start difference. First operand has 334 places, 429 transitions, 5925 flow. Second operand 11 states and 198 transitions. [2024-05-12 13:19:48,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 465 transitions, 7695 flow [2024-05-12 13:19:48,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 465 transitions, 7636 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-05-12 13:19:48,769 INFO L231 Difference]: Finished difference. Result has 337 places, 437 transitions, 6397 flow [2024-05-12 13:19:48,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5866, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6397, PETRI_PLACES=337, PETRI_TRANSITIONS=437} [2024-05-12 13:19:48,769 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 293 predicate places. [2024-05-12 13:19:48,770 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 437 transitions, 6397 flow [2024-05-12 13:19:48,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:48,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:48,770 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:19:48,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-05-12 13:19:48,770 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:19:48,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:48,770 INFO L85 PathProgramCache]: Analyzing trace with hash 642655992, now seen corresponding path program 11 times [2024-05-12 13:19:48,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:48,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410440559] [2024-05-12 13:19:48,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:48,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19:49,566 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:19:49,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:49,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410440559] [2024-05-12 13:19:49,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410440559] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:49,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:49,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:19:49,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200268544] [2024-05-12 13:19:49,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:49,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:19:49,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:49,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:19:49,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:19:49,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:19:49,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 437 transitions, 6397 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:49,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:49,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:19:49,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:50,353 INFO L124 PetriNetUnfolderBase]: 1396/2503 cut-off events. [2024-05-12 13:19:50,353 INFO L125 PetriNetUnfolderBase]: For 146022/146022 co-relation queries the response was YES. [2024-05-12 13:19:50,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19249 conditions, 2503 events. 1396/2503 cut-off events. For 146022/146022 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 14725 event pairs, 204 based on Foata normal form. 2/2368 useless extension candidates. Maximal degree in co-relation 19097. Up to 1684 conditions per place. [2024-05-12 13:19:50,379 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 321 selfloop transitions, 134 changer transitions 0/464 dead transitions. [2024-05-12 13:19:50,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 464 transitions, 7753 flow [2024-05-12 13:19:50,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:19:50,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:19:50,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions. [2024-05-12 13:19:50,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44545454545454544 [2024-05-12 13:19:50,381 INFO L175 Difference]: Start difference. First operand has 337 places, 437 transitions, 6397 flow. Second operand 11 states and 196 transitions. [2024-05-12 13:19:50,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 464 transitions, 7753 flow [2024-05-12 13:19:51,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 464 transitions, 7414 flow, removed 69 selfloop flow, removed 6 redundant places. [2024-05-12 13:19:51,132 INFO L231 Difference]: Finished difference. Result has 342 places, 437 transitions, 6331 flow [2024-05-12 13:19:51,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6058, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6331, PETRI_PLACES=342, PETRI_TRANSITIONS=437} [2024-05-12 13:19:51,133 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 298 predicate places. [2024-05-12 13:19:51,133 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 437 transitions, 6331 flow [2024-05-12 13:19:51,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:51,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:51,133 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:19:51,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-05-12 13:19:51,133 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:19:51,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:51,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1598167976, now seen corresponding path program 12 times [2024-05-12 13:19:51,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:51,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272700535] [2024-05-12 13:19:51,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:51,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19:51,942 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:19:51,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:51,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272700535] [2024-05-12 13:19:51,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272700535] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:51,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:51,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:19:51,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364999071] [2024-05-12 13:19:51,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:51,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:19:51,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:51,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:19:51,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:19:52,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:19:52,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 437 transitions, 6331 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:52,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:52,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:19:52,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:52,739 INFO L124 PetriNetUnfolderBase]: 1407/2520 cut-off events. [2024-05-12 13:19:52,739 INFO L125 PetriNetUnfolderBase]: For 146577/146577 co-relation queries the response was YES. [2024-05-12 13:19:52,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19255 conditions, 2520 events. 1407/2520 cut-off events. For 146577/146577 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 14815 event pairs, 161 based on Foata normal form. 2/2384 useless extension candidates. Maximal degree in co-relation 19102. Up to 1694 conditions per place. [2024-05-12 13:19:52,768 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 301 selfloop transitions, 155 changer transitions 0/465 dead transitions. [2024-05-12 13:19:52,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 465 transitions, 7751 flow [2024-05-12 13:19:52,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:19:52,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:19:52,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2024-05-12 13:19:52,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43863636363636366 [2024-05-12 13:19:52,770 INFO L175 Difference]: Start difference. First operand has 342 places, 437 transitions, 6331 flow. Second operand 11 states and 193 transitions. [2024-05-12 13:19:52,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 465 transitions, 7751 flow [2024-05-12 13:19:53,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 465 transitions, 7494 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-05-12 13:19:53,607 INFO L231 Difference]: Finished difference. Result has 345 places, 439 transitions, 6451 flow [2024-05-12 13:19:53,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6076, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6451, PETRI_PLACES=345, PETRI_TRANSITIONS=439} [2024-05-12 13:19:53,607 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 301 predicate places. [2024-05-12 13:19:53,607 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 439 transitions, 6451 flow [2024-05-12 13:19:53,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:53,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:53,607 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:19:53,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-05-12 13:19:53,608 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:19:53,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:53,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1598464646, now seen corresponding path program 13 times [2024-05-12 13:19:53,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:53,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834391070] [2024-05-12 13:19:53,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:53,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19:54,419 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:19:54,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:54,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834391070] [2024-05-12 13:19:54,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834391070] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:54,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:54,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:19:54,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105464599] [2024-05-12 13:19:54,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:54,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:19:54,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:54,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:19:54,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:19:54,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:19:54,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 439 transitions, 6451 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:54,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:54,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:19:54,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:55,166 INFO L124 PetriNetUnfolderBase]: 1418/2540 cut-off events. [2024-05-12 13:19:55,166 INFO L125 PetriNetUnfolderBase]: For 151438/151438 co-relation queries the response was YES. [2024-05-12 13:19:55,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19553 conditions, 2540 events. 1418/2540 cut-off events. For 151438/151438 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 14955 event pairs, 151 based on Foata normal form. 2/2403 useless extension candidates. Maximal degree in co-relation 19399. Up to 1704 conditions per place. [2024-05-12 13:19:55,200 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 274 selfloop transitions, 183 changer transitions 0/466 dead transitions. [2024-05-12 13:19:55,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 466 transitions, 7713 flow [2024-05-12 13:19:55,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:19:55,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:19:55,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 191 transitions. [2024-05-12 13:19:55,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4340909090909091 [2024-05-12 13:19:55,201 INFO L175 Difference]: Start difference. First operand has 345 places, 439 transitions, 6451 flow. Second operand 11 states and 191 transitions. [2024-05-12 13:19:55,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 466 transitions, 7713 flow [2024-05-12 13:19:56,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 466 transitions, 7331 flow, removed 25 selfloop flow, removed 10 redundant places. [2024-05-12 13:19:56,131 INFO L231 Difference]: Finished difference. Result has 346 places, 441 transitions, 6504 flow [2024-05-12 13:19:56,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6077, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=181, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6504, PETRI_PLACES=346, PETRI_TRANSITIONS=441} [2024-05-12 13:19:56,132 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 302 predicate places. [2024-05-12 13:19:56,132 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 441 transitions, 6504 flow [2024-05-12 13:19:56,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:56,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:56,132 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:19:56,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-05-12 13:19:56,132 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:19:56,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:56,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1598464956, now seen corresponding path program 4 times [2024-05-12 13:19:56,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:56,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324658954] [2024-05-12 13:19:56,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:56,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19:57,012 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:19:57,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:57,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324658954] [2024-05-12 13:19:57,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324658954] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:57,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:57,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:19:57,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701122169] [2024-05-12 13:19:57,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:57,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:19:57,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:57,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:19:57,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:19:57,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:19:57,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 441 transitions, 6504 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:57,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:57,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:19:57,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:19:57,713 INFO L124 PetriNetUnfolderBase]: 1423/2546 cut-off events. [2024-05-12 13:19:57,713 INFO L125 PetriNetUnfolderBase]: For 149518/149518 co-relation queries the response was YES. [2024-05-12 13:19:57,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19633 conditions, 2546 events. 1423/2546 cut-off events. For 149518/149518 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 14985 event pairs, 290 based on Foata normal form. 1/2411 useless extension candidates. Maximal degree in co-relation 19478. Up to 2154 conditions per place. [2024-05-12 13:19:57,744 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 378 selfloop transitions, 77 changer transitions 0/464 dead transitions. [2024-05-12 13:19:57,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 464 transitions, 7722 flow [2024-05-12 13:19:57,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:19:57,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:19:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 184 transitions. [2024-05-12 13:19:57,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-05-12 13:19:57,745 INFO L175 Difference]: Start difference. First operand has 346 places, 441 transitions, 6504 flow. Second operand 11 states and 184 transitions. [2024-05-12 13:19:57,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 464 transitions, 7722 flow [2024-05-12 13:19:58,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 464 transitions, 7392 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-05-12 13:19:58,538 INFO L231 Difference]: Finished difference. Result has 349 places, 443 transitions, 6371 flow [2024-05-12 13:19:58,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6174, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6371, PETRI_PLACES=349, PETRI_TRANSITIONS=443} [2024-05-12 13:19:58,539 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 305 predicate places. [2024-05-12 13:19:58,539 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 443 transitions, 6371 flow [2024-05-12 13:19:58,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:58,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:19:58,539 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:19:58,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-05-12 13:19:58,540 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:19:58,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:19:58,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1598176656, now seen corresponding path program 5 times [2024-05-12 13:19:58,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:19:58,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815503535] [2024-05-12 13:19:58,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:19:58,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:19:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:19:59,449 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:19:59,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:19:59,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815503535] [2024-05-12 13:19:59,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815503535] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:19:59,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:19:59,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:19:59,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019348072] [2024-05-12 13:19:59,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:19:59,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:19:59,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:19:59,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:19:59,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:19:59,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:19:59,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 443 transitions, 6371 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:19:59,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:19:59,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:19:59,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:20:00,354 INFO L124 PetriNetUnfolderBase]: 1428/2554 cut-off events. [2024-05-12 13:20:00,354 INFO L125 PetriNetUnfolderBase]: For 150898/150898 co-relation queries the response was YES. [2024-05-12 13:20:00,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19365 conditions, 2554 events. 1428/2554 cut-off events. For 150898/150898 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 15037 event pairs, 290 based on Foata normal form. 1/2419 useless extension candidates. Maximal degree in co-relation 19209. Up to 2160 conditions per place. [2024-05-12 13:20:00,388 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 384 selfloop transitions, 73 changer transitions 0/466 dead transitions. [2024-05-12 13:20:00,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 466 transitions, 7599 flow [2024-05-12 13:20:00,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:20:00,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:20:00,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 185 transitions. [2024-05-12 13:20:00,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2024-05-12 13:20:00,390 INFO L175 Difference]: Start difference. First operand has 349 places, 443 transitions, 6371 flow. Second operand 11 states and 185 transitions. [2024-05-12 13:20:00,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 466 transitions, 7599 flow [2024-05-12 13:20:01,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 466 transitions, 7442 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-05-12 13:20:01,222 INFO L231 Difference]: Finished difference. Result has 352 places, 445 transitions, 6407 flow [2024-05-12 13:20:01,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6216, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6407, PETRI_PLACES=352, PETRI_TRANSITIONS=445} [2024-05-12 13:20:01,222 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 308 predicate places. [2024-05-12 13:20:01,222 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 445 transitions, 6407 flow [2024-05-12 13:20:01,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:01,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:20:01,223 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:20:01,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-05-12 13:20:01,223 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:20:01,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:20:01,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1589893766, now seen corresponding path program 14 times [2024-05-12 13:20:01,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:20:01,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038734098] [2024-05-12 13:20:01,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:20:01,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:20:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:20:02,020 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:20:02,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:20:02,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038734098] [2024-05-12 13:20:02,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038734098] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:20:02,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:20:02,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:20:02,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475272160] [2024-05-12 13:20:02,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:20:02,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:20:02,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:20:02,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:20:02,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:20:02,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:20:02,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 445 transitions, 6407 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:02,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:20:02,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:20:02,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:20:02,851 INFO L124 PetriNetUnfolderBase]: 1424/2550 cut-off events. [2024-05-12 13:20:02,852 INFO L125 PetriNetUnfolderBase]: For 150497/150497 co-relation queries the response was YES. [2024-05-12 13:20:02,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19156 conditions, 2550 events. 1424/2550 cut-off events. For 150497/150497 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 15023 event pairs, 207 based on Foata normal form. 2/2413 useless extension candidates. Maximal degree in co-relation 18999. Up to 1717 conditions per place. [2024-05-12 13:20:02,878 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 321 selfloop transitions, 140 changer transitions 0/470 dead transitions. [2024-05-12 13:20:02,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 470 transitions, 7619 flow [2024-05-12 13:20:02,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:20:02,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:20:02,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2024-05-12 13:20:02,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43863636363636366 [2024-05-12 13:20:02,879 INFO L175 Difference]: Start difference. First operand has 352 places, 445 transitions, 6407 flow. Second operand 11 states and 193 transitions. [2024-05-12 13:20:02,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 470 transitions, 7619 flow [2024-05-12 13:20:03,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 470 transitions, 7435 flow, removed 36 selfloop flow, removed 8 redundant places. [2024-05-12 13:20:03,614 INFO L231 Difference]: Finished difference. Result has 355 places, 445 transitions, 6508 flow [2024-05-12 13:20:03,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6223, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6508, PETRI_PLACES=355, PETRI_TRANSITIONS=445} [2024-05-12 13:20:03,614 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 311 predicate places. [2024-05-12 13:20:03,614 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 445 transitions, 6508 flow [2024-05-12 13:20:03,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:03,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:20:03,615 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:20:03,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-05-12 13:20:03,615 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:20:03,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:20:03,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1598176346, now seen corresponding path program 15 times [2024-05-12 13:20:03,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:20:03,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409601292] [2024-05-12 13:20:03,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:20:03,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:20:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:20:04,407 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:20:04,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:20:04,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409601292] [2024-05-12 13:20:04,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409601292] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:20:04,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:20:04,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:20:04,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917587368] [2024-05-12 13:20:04,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:20:04,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:20:04,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:20:04,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:20:04,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:20:04,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:20:04,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 445 transitions, 6508 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:04,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:20:04,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:20:04,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:20:05,122 INFO L124 PetriNetUnfolderBase]: 1420/2544 cut-off events. [2024-05-12 13:20:05,122 INFO L125 PetriNetUnfolderBase]: For 146473/146473 co-relation queries the response was YES. [2024-05-12 13:20:05,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19108 conditions, 2544 events. 1420/2544 cut-off events. For 146473/146473 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 14999 event pairs, 160 based on Foata normal form. 2/2407 useless extension candidates. Maximal degree in co-relation 18950. Up to 1714 conditions per place. [2024-05-12 13:20:05,152 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 305 selfloop transitions, 156 changer transitions 0/470 dead transitions. [2024-05-12 13:20:05,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 470 transitions, 7552 flow [2024-05-12 13:20:05,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:20:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:20:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2024-05-12 13:20:05,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43863636363636366 [2024-05-12 13:20:05,153 INFO L175 Difference]: Start difference. First operand has 355 places, 445 transitions, 6508 flow. Second operand 11 states and 193 transitions. [2024-05-12 13:20:05,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 470 transitions, 7552 flow [2024-05-12 13:20:05,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 470 transitions, 7214 flow, removed 22 selfloop flow, removed 11 redundant places. [2024-05-12 13:20:05,882 INFO L231 Difference]: Finished difference. Result has 355 places, 445 transitions, 6487 flow [2024-05-12 13:20:05,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6170, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6487, PETRI_PLACES=355, PETRI_TRANSITIONS=445} [2024-05-12 13:20:05,883 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 311 predicate places. [2024-05-12 13:20:05,883 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 445 transitions, 6487 flow [2024-05-12 13:20:05,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:05,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:20:05,883 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:20:05,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-05-12 13:20:05,883 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:20:05,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:20:05,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1379802978, now seen corresponding path program 6 times [2024-05-12 13:20:05,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:20:05,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43915383] [2024-05-12 13:20:05,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:20:05,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:20:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:20:06,792 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:20:06,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:20:06,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43915383] [2024-05-12 13:20:06,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43915383] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:20:06,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:20:06,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:20:06,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873716076] [2024-05-12 13:20:06,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:20:06,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:20:06,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:20:06,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:20:06,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:20:06,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:20:06,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 445 transitions, 6487 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:06,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:20:06,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:20:06,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:20:07,577 INFO L124 PetriNetUnfolderBase]: 1418/2539 cut-off events. [2024-05-12 13:20:07,577 INFO L125 PetriNetUnfolderBase]: For 140978/140978 co-relation queries the response was YES. [2024-05-12 13:20:07,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18967 conditions, 2539 events. 1418/2539 cut-off events. For 140978/140978 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 14969 event pairs, 288 based on Foata normal form. 1/2404 useless extension candidates. Maximal degree in co-relation 18808. Up to 2146 conditions per place. [2024-05-12 13:20:07,610 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 388 selfloop transitions, 68 changer transitions 0/465 dead transitions. [2024-05-12 13:20:07,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 465 transitions, 7501 flow [2024-05-12 13:20:07,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:20:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:20:07,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 185 transitions. [2024-05-12 13:20:07,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2024-05-12 13:20:07,611 INFO L175 Difference]: Start difference. First operand has 355 places, 445 transitions, 6487 flow. Second operand 11 states and 185 transitions. [2024-05-12 13:20:07,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 465 transitions, 7501 flow [2024-05-12 13:20:08,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 465 transitions, 7086 flow, removed 9 selfloop flow, removed 11 redundant places. [2024-05-12 13:20:08,350 INFO L231 Difference]: Finished difference. Result has 355 places, 445 transitions, 6213 flow [2024-05-12 13:20:08,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6072, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6213, PETRI_PLACES=355, PETRI_TRANSITIONS=445} [2024-05-12 13:20:08,351 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 311 predicate places. [2024-05-12 13:20:08,351 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 445 transitions, 6213 flow [2024-05-12 13:20:08,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:08,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:20:08,351 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:20:08,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-05-12 13:20:08,351 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:20:08,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:20:08,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1328560590, now seen corresponding path program 5 times [2024-05-12 13:20:08,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:20:08,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091959904] [2024-05-12 13:20:08,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:20:08,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:20:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:20:09,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:20:09,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:20:09,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091959904] [2024-05-12 13:20:09,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091959904] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:20:09,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:20:09,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:20:09,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79280090] [2024-05-12 13:20:09,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:20:09,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:20:09,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:20:09,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:20:09,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:20:09,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:20:09,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 445 transitions, 6213 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:09,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:20:09,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:20:09,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:20:10,266 INFO L124 PetriNetUnfolderBase]: 1416/2537 cut-off events. [2024-05-12 13:20:10,266 INFO L125 PetriNetUnfolderBase]: For 138865/138865 co-relation queries the response was YES. [2024-05-12 13:20:10,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18442 conditions, 2537 events. 1416/2537 cut-off events. For 138865/138865 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 14979 event pairs, 315 based on Foata normal form. 1/2401 useless extension candidates. Maximal degree in co-relation 18282. Up to 2132 conditions per place. [2024-05-12 13:20:10,299 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 350 selfloop transitions, 112 changer transitions 0/471 dead transitions. [2024-05-12 13:20:10,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 471 transitions, 7313 flow [2024-05-12 13:20:10,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:20:10,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:20:10,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-05-12 13:20:10,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-05-12 13:20:10,302 INFO L175 Difference]: Start difference. First operand has 355 places, 445 transitions, 6213 flow. Second operand 10 states and 170 transitions. [2024-05-12 13:20:10,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 471 transitions, 7313 flow [2024-05-12 13:20:11,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 471 transitions, 7086 flow, removed 6 selfloop flow, removed 12 redundant places. [2024-05-12 13:20:11,162 INFO L231 Difference]: Finished difference. Result has 353 places, 447 transitions, 6311 flow [2024-05-12 13:20:11,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5986, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6311, PETRI_PLACES=353, PETRI_TRANSITIONS=447} [2024-05-12 13:20:11,163 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 309 predicate places. [2024-05-12 13:20:11,163 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 447 transitions, 6311 flow [2024-05-12 13:20:11,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:11,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:20:11,164 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:20:11,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-05-12 13:20:11,164 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:20:11,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:20:11,165 INFO L85 PathProgramCache]: Analyzing trace with hash 77102180, now seen corresponding path program 16 times [2024-05-12 13:20:11,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:20:11,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359834008] [2024-05-12 13:20:11,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:20:11,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:20:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:20:11,963 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:20:11,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:20:11,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359834008] [2024-05-12 13:20:11,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359834008] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:20:11,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:20:11,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:20:11,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720090063] [2024-05-12 13:20:11,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:20:11,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:20:11,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:20:11,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:20:11,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:20:12,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:20:12,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 447 transitions, 6311 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:12,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:20:12,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:20:12,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:20:12,770 INFO L124 PetriNetUnfolderBase]: 1427/2553 cut-off events. [2024-05-12 13:20:12,771 INFO L125 PetriNetUnfolderBase]: For 146221/146221 co-relation queries the response was YES. [2024-05-12 13:20:12,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18778 conditions, 2553 events. 1427/2553 cut-off events. For 146221/146221 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 15073 event pairs, 278 based on Foata normal form. 2/2419 useless extension candidates. Maximal degree in co-relation 18617. Up to 2063 conditions per place. [2024-05-12 13:20:12,804 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 365 selfloop transitions, 100 changer transitions 0/474 dead transitions. [2024-05-12 13:20:12,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 474 transitions, 7423 flow [2024-05-12 13:20:12,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:20:12,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:20:12,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-05-12 13:20:12,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-05-12 13:20:12,805 INFO L175 Difference]: Start difference. First operand has 353 places, 447 transitions, 6311 flow. Second operand 10 states and 170 transitions. [2024-05-12 13:20:12,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 474 transitions, 7423 flow [2024-05-12 13:20:13,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 474 transitions, 7162 flow, removed 35 selfloop flow, removed 8 redundant places. [2024-05-12 13:20:13,574 INFO L231 Difference]: Finished difference. Result has 355 places, 449 transitions, 6342 flow [2024-05-12 13:20:13,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6058, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6342, PETRI_PLACES=355, PETRI_TRANSITIONS=449} [2024-05-12 13:20:13,574 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 311 predicate places. [2024-05-12 13:20:13,575 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 449 transitions, 6342 flow [2024-05-12 13:20:13,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:13,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:20:13,575 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:20:13,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-05-12 13:20:13,575 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:20:13,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:20:13,575 INFO L85 PathProgramCache]: Analyzing trace with hash -587375196, now seen corresponding path program 17 times [2024-05-12 13:20:13,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:20:13,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438578960] [2024-05-12 13:20:13,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:20:13,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:20:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:20:14,425 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:20:14,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:20:14,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438578960] [2024-05-12 13:20:14,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438578960] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:20:14,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:20:14,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:20:14,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213641807] [2024-05-12 13:20:14,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:20:14,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:20:14,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:20:14,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:20:14,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:20:14,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:20:14,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 449 transitions, 6342 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:14,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:20:14,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:20:14,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:20:15,264 INFO L124 PetriNetUnfolderBase]: 1495/2668 cut-off events. [2024-05-12 13:20:15,265 INFO L125 PetriNetUnfolderBase]: For 154051/154051 co-relation queries the response was YES. [2024-05-12 13:20:15,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19893 conditions, 2668 events. 1495/2668 cut-off events. For 154051/154051 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 15851 event pairs, 205 based on Foata normal form. 2/2518 useless extension candidates. Maximal degree in co-relation 19731. Up to 2174 conditions per place. [2024-05-12 13:20:15,297 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 381 selfloop transitions, 105 changer transitions 0/495 dead transitions. [2024-05-12 13:20:15,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 495 transitions, 8142 flow [2024-05-12 13:20:15,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:20:15,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:20:15,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 188 transitions. [2024-05-12 13:20:15,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42727272727272725 [2024-05-12 13:20:15,298 INFO L175 Difference]: Start difference. First operand has 355 places, 449 transitions, 6342 flow. Second operand 11 states and 188 transitions. [2024-05-12 13:20:15,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 495 transitions, 8142 flow [2024-05-12 13:20:16,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 495 transitions, 7864 flow, removed 48 selfloop flow, removed 8 redundant places. [2024-05-12 13:20:16,121 INFO L231 Difference]: Finished difference. Result has 360 places, 473 transitions, 6781 flow [2024-05-12 13:20:16,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6118, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6781, PETRI_PLACES=360, PETRI_TRANSITIONS=473} [2024-05-12 13:20:16,122 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 316 predicate places. [2024-05-12 13:20:16,122 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 473 transitions, 6781 flow [2024-05-12 13:20:16,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:16,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:20:16,122 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:20:16,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-05-12 13:20:16,122 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:20:16,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:20:16,122 INFO L85 PathProgramCache]: Analyzing trace with hash 270913368, now seen corresponding path program 7 times [2024-05-12 13:20:16,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:20:16,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591119518] [2024-05-12 13:20:16,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:20:16,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:20:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:20:16,964 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:20:16,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:20:16,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591119518] [2024-05-12 13:20:16,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591119518] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:20:16,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:20:16,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:20:16,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947817001] [2024-05-12 13:20:16,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:20:16,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:20:16,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:20:16,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:20:16,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:20:17,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:20:17,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 473 transitions, 6781 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:17,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:20:17,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:20:17,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:20:17,848 INFO L124 PetriNetUnfolderBase]: 1502/2683 cut-off events. [2024-05-12 13:20:17,849 INFO L125 PetriNetUnfolderBase]: For 145385/145385 co-relation queries the response was YES. [2024-05-12 13:20:17,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19898 conditions, 2683 events. 1502/2683 cut-off events. For 145385/145385 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 15966 event pairs, 233 based on Foata normal form. 1/2530 useless extension candidates. Maximal degree in co-relation 19733. Up to 2375 conditions per place. [2024-05-12 13:20:17,883 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 437 selfloop transitions, 49 changer transitions 0/495 dead transitions. [2024-05-12 13:20:17,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 495 transitions, 7901 flow [2024-05-12 13:20:17,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:20:17,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:20:17,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 175 transitions. [2024-05-12 13:20:17,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2024-05-12 13:20:17,884 INFO L175 Difference]: Start difference. First operand has 360 places, 473 transitions, 6781 flow. Second operand 11 states and 175 transitions. [2024-05-12 13:20:17,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 495 transitions, 7901 flow [2024-05-12 13:20:18,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 495 transitions, 7777 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-05-12 13:20:18,751 INFO L231 Difference]: Finished difference. Result has 365 places, 479 transitions, 6848 flow [2024-05-12 13:20:18,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6657, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6848, PETRI_PLACES=365, PETRI_TRANSITIONS=479} [2024-05-12 13:20:18,751 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 321 predicate places. [2024-05-12 13:20:18,751 INFO L495 AbstractCegarLoop]: Abstraction has has 365 places, 479 transitions, 6848 flow [2024-05-12 13:20:18,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:18,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:20:18,752 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:20:18,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-05-12 13:20:18,752 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:20:18,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:20:18,752 INFO L85 PathProgramCache]: Analyzing trace with hash -587605836, now seen corresponding path program 18 times [2024-05-12 13:20:18,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:20:18,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651693942] [2024-05-12 13:20:18,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:20:18,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:20:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:20:19,537 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:20:19,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:20:19,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651693942] [2024-05-12 13:20:19,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651693942] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:20:19,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:20:19,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:20:19,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971299441] [2024-05-12 13:20:19,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:20:19,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:20:19,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:20:19,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:20:19,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:20:19,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:20:19,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 479 transitions, 6848 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:19,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:20:19,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:20:19,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:20:20,455 INFO L124 PetriNetUnfolderBase]: 1498/2675 cut-off events. [2024-05-12 13:20:20,455 INFO L125 PetriNetUnfolderBase]: For 142917/142917 co-relation queries the response was YES. [2024-05-12 13:20:20,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19719 conditions, 2675 events. 1498/2675 cut-off events. For 142917/142917 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 15899 event pairs, 273 based on Foata normal form. 2/2529 useless extension candidates. Maximal degree in co-relation 19552. Up to 1865 conditions per place. [2024-05-12 13:20:20,483 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 326 selfloop transitions, 169 changer transitions 0/504 dead transitions. [2024-05-12 13:20:20,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 504 transitions, 8128 flow [2024-05-12 13:20:20,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:20:20,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:20:20,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-05-12 13:20:20,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-05-12 13:20:20,484 INFO L175 Difference]: Start difference. First operand has 365 places, 479 transitions, 6848 flow. Second operand 10 states and 175 transitions. [2024-05-12 13:20:20,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 504 transitions, 8128 flow [2024-05-12 13:20:21,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 504 transitions, 7990 flow, removed 29 selfloop flow, removed 8 redundant places. [2024-05-12 13:20:21,224 INFO L231 Difference]: Finished difference. Result has 367 places, 479 transitions, 7068 flow [2024-05-12 13:20:21,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6710, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7068, PETRI_PLACES=367, PETRI_TRANSITIONS=479} [2024-05-12 13:20:21,225 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 323 predicate places. [2024-05-12 13:20:21,225 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 479 transitions, 7068 flow [2024-05-12 13:20:21,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:21,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:20:21,225 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:20:21,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-05-12 13:20:21,225 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:20:21,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:20:21,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1473763598, now seen corresponding path program 19 times [2024-05-12 13:20:21,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:20:21,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81992139] [2024-05-12 13:20:21,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:20:21,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:20:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:20:22,024 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:20:22,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:20:22,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81992139] [2024-05-12 13:20:22,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81992139] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:20:22,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:20:22,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:20:22,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181089266] [2024-05-12 13:20:22,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:20:22,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:20:22,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:20:22,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:20:22,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:20:22,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:20:22,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 479 transitions, 7068 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:22,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:20:22,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:20:22,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:20:22,859 INFO L124 PetriNetUnfolderBase]: 1494/2669 cut-off events. [2024-05-12 13:20:22,859 INFO L125 PetriNetUnfolderBase]: For 139431/139431 co-relation queries the response was YES. [2024-05-12 13:20:22,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19874 conditions, 2669 events. 1494/2669 cut-off events. For 139431/139431 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 15887 event pairs, 224 based on Foata normal form. 2/2523 useless extension candidates. Maximal degree in co-relation 19706. Up to 1862 conditions per place. [2024-05-12 13:20:22,892 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 299 selfloop transitions, 195 changer transitions 0/503 dead transitions. [2024-05-12 13:20:22,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 503 transitions, 8174 flow [2024-05-12 13:20:22,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:20:22,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:20:22,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-05-12 13:20:22,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43 [2024-05-12 13:20:22,893 INFO L175 Difference]: Start difference. First operand has 367 places, 479 transitions, 7068 flow. Second operand 10 states and 172 transitions. [2024-05-12 13:20:22,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 503 transitions, 8174 flow [2024-05-12 13:20:23,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 503 transitions, 7788 flow, removed 24 selfloop flow, removed 10 redundant places. [2024-05-12 13:20:23,635 INFO L231 Difference]: Finished difference. Result has 367 places, 479 transitions, 7092 flow [2024-05-12 13:20:23,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6682, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7092, PETRI_PLACES=367, PETRI_TRANSITIONS=479} [2024-05-12 13:20:23,636 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 323 predicate places. [2024-05-12 13:20:23,636 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 479 transitions, 7092 flow [2024-05-12 13:20:23,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:23,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:20:23,636 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:20:23,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-05-12 13:20:23,636 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:20:23,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:20:23,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1733243574, now seen corresponding path program 20 times [2024-05-12 13:20:23,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:20:23,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159873067] [2024-05-12 13:20:23,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:20:23,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:20:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:20:24,528 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:20:24,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:20:24,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159873067] [2024-05-12 13:20:24,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159873067] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:20:24,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:20:24,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:20:24,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402162010] [2024-05-12 13:20:24,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:20:24,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:20:24,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:20:24,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:20:24,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:20:24,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:20:24,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 479 transitions, 7092 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:24,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:20:24,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:20:24,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:20:25,338 INFO L124 PetriNetUnfolderBase]: 1535/2731 cut-off events. [2024-05-12 13:20:25,338 INFO L125 PetriNetUnfolderBase]: For 152281/152281 co-relation queries the response was YES. [2024-05-12 13:20:25,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20751 conditions, 2731 events. 1535/2731 cut-off events. For 152281/152281 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 16260 event pairs, 161 based on Foata normal form. 2/2578 useless extension candidates. Maximal degree in co-relation 20584. Up to 1625 conditions per place. [2024-05-12 13:20:25,374 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 291 selfloop transitions, 209 changer transitions 0/509 dead transitions. [2024-05-12 13:20:25,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 509 transitions, 8698 flow [2024-05-12 13:20:25,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:20:25,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:20:25,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2024-05-12 13:20:25,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44 [2024-05-12 13:20:25,375 INFO L175 Difference]: Start difference. First operand has 367 places, 479 transitions, 7092 flow. Second operand 10 states and 176 transitions. [2024-05-12 13:20:25,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 509 transitions, 8698 flow [2024-05-12 13:20:26,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 509 transitions, 8303 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-05-12 13:20:26,239 INFO L231 Difference]: Finished difference. Result has 368 places, 485 transitions, 7285 flow [2024-05-12 13:20:26,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6705, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7285, PETRI_PLACES=368, PETRI_TRANSITIONS=485} [2024-05-12 13:20:26,240 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 324 predicate places. [2024-05-12 13:20:26,240 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 485 transitions, 7285 flow [2024-05-12 13:20:26,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:26,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:20:26,240 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:20:26,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-05-12 13:20:26,240 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:20:26,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:20:26,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1733235204, now seen corresponding path program 21 times [2024-05-12 13:20:26,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:20:26,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414928885] [2024-05-12 13:20:26,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:20:26,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:20:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:20:27,071 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:20:27,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:20:27,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414928885] [2024-05-12 13:20:27,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414928885] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:20:27,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:20:27,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:20:27,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623489872] [2024-05-12 13:20:27,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:20:27,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:20:27,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:20:27,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:20:27,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:20:27,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:20:27,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 485 transitions, 7285 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:27,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:20:27,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:20:27,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:20:27,847 INFO L124 PetriNetUnfolderBase]: 1546/2751 cut-off events. [2024-05-12 13:20:27,847 INFO L125 PetriNetUnfolderBase]: For 151433/151433 co-relation queries the response was YES. [2024-05-12 13:20:27,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21032 conditions, 2751 events. 1546/2751 cut-off events. For 151433/151433 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 16419 event pairs, 161 based on Foata normal form. 2/2597 useless extension candidates. Maximal degree in co-relation 20865. Up to 1635 conditions per place. [2024-05-12 13:20:27,882 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 294 selfloop transitions, 209 changer transitions 0/512 dead transitions. [2024-05-12 13:20:27,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 512 transitions, 8801 flow [2024-05-12 13:20:27,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:20:27,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:20:27,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-05-12 13:20:27,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445 [2024-05-12 13:20:27,883 INFO L175 Difference]: Start difference. First operand has 368 places, 485 transitions, 7285 flow. Second operand 10 states and 178 transitions. [2024-05-12 13:20:27,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 512 transitions, 8801 flow [2024-05-12 13:20:28,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 512 transitions, 8613 flow, removed 34 selfloop flow, removed 6 redundant places. [2024-05-12 13:20:28,710 INFO L231 Difference]: Finished difference. Result has 372 places, 487 transitions, 7581 flow [2024-05-12 13:20:28,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7109, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=207, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7581, PETRI_PLACES=372, PETRI_TRANSITIONS=487} [2024-05-12 13:20:28,710 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 328 predicate places. [2024-05-12 13:20:28,710 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 487 transitions, 7581 flow [2024-05-12 13:20:28,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:28,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:20:28,710 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:20:28,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-05-12 13:20:28,711 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:20:28,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:20:28,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1302042004, now seen corresponding path program 22 times [2024-05-12 13:20:28,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:20:28,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875988075] [2024-05-12 13:20:28,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:20:28,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:20:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:20:29,518 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:20:29,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:20:29,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875988075] [2024-05-12 13:20:29,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875988075] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:20:29,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:20:29,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:20:29,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897970492] [2024-05-12 13:20:29,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:20:29,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:20:29,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:20:29,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:20:29,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:20:29,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:20:29,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 487 transitions, 7581 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:29,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:20:29,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:20:29,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:20:30,422 INFO L124 PetriNetUnfolderBase]: 1572/2797 cut-off events. [2024-05-12 13:20:30,422 INFO L125 PetriNetUnfolderBase]: For 160249/160249 co-relation queries the response was YES. [2024-05-12 13:20:30,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22018 conditions, 2797 events. 1572/2797 cut-off events. For 160249/160249 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 16756 event pairs, 221 based on Foata normal form. 2/2641 useless extension candidates. Maximal degree in co-relation 21850. Up to 1658 conditions per place. [2024-05-12 13:20:30,461 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 317 selfloop transitions, 191 changer transitions 0/517 dead transitions. [2024-05-12 13:20:30,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 517 transitions, 9339 flow [2024-05-12 13:20:30,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:20:30,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:20:30,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-05-12 13:20:30,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4525 [2024-05-12 13:20:30,462 INFO L175 Difference]: Start difference. First operand has 372 places, 487 transitions, 7581 flow. Second operand 10 states and 181 transitions. [2024-05-12 13:20:30,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 517 transitions, 9339 flow [2024-05-12 13:20:31,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 517 transitions, 9030 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-05-12 13:20:31,426 INFO L231 Difference]: Finished difference. Result has 375 places, 491 transitions, 7784 flow [2024-05-12 13:20:31,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7282, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7784, PETRI_PLACES=375, PETRI_TRANSITIONS=491} [2024-05-12 13:20:31,426 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 331 predicate places. [2024-05-12 13:20:31,426 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 491 transitions, 7784 flow [2024-05-12 13:20:31,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:31,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:20:31,426 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:20:31,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-05-12 13:20:31,427 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:20:31,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:20:31,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1733234894, now seen corresponding path program 8 times [2024-05-12 13:20:31,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:20:31,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257133216] [2024-05-12 13:20:31,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:20:31,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:20:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:20:32,237 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:20:32,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:20:32,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257133216] [2024-05-12 13:20:32,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257133216] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:20:32,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:20:32,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:20:32,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578277713] [2024-05-12 13:20:32,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:20:32,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:20:32,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:20:32,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:20:32,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:20:32,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:20:32,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 491 transitions, 7784 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:32,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:20:32,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:20:32,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:20:33,074 INFO L124 PetriNetUnfolderBase]: 1591/2825 cut-off events. [2024-05-12 13:20:33,074 INFO L125 PetriNetUnfolderBase]: For 165723/165723 co-relation queries the response was YES. [2024-05-12 13:20:33,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22470 conditions, 2825 events. 1591/2825 cut-off events. For 165723/165723 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 16925 event pairs, 316 based on Foata normal form. 1/2671 useless extension candidates. Maximal degree in co-relation 22302. Up to 2328 conditions per place. [2024-05-12 13:20:33,108 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 409 selfloop transitions, 99 changer transitions 0/517 dead transitions. [2024-05-12 13:20:33,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 517 transitions, 9374 flow [2024-05-12 13:20:33,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:20:33,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:20:33,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-05-12 13:20:33,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-05-12 13:20:33,109 INFO L175 Difference]: Start difference. First operand has 375 places, 491 transitions, 7784 flow. Second operand 10 states and 170 transitions. [2024-05-12 13:20:33,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 517 transitions, 9374 flow [2024-05-12 13:20:34,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 517 transitions, 8622 flow, removed 29 selfloop flow, removed 10 redundant places. [2024-05-12 13:20:34,155 INFO L231 Difference]: Finished difference. Result has 375 places, 497 transitions, 7384 flow [2024-05-12 13:20:34,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7036, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7384, PETRI_PLACES=375, PETRI_TRANSITIONS=497} [2024-05-12 13:20:34,155 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 331 predicate places. [2024-05-12 13:20:34,156 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 497 transitions, 7384 flow [2024-05-12 13:20:34,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:34,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:20:34,156 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:20:34,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-05-12 13:20:34,156 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:20:34,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:20:34,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1732935992, now seen corresponding path program 2 times [2024-05-12 13:20:34,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:20:34,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344389848] [2024-05-12 13:20:34,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:20:34,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:20:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:20:35,111 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:20:35,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:20:35,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344389848] [2024-05-12 13:20:35,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344389848] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:20:35,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:20:35,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:20:35,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445782854] [2024-05-12 13:20:35,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:20:35,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:20:35,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:20:35,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:20:35,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:20:35,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:20:35,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 497 transitions, 7384 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:20:35,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:20:35,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:20:35,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:20:35,992 INFO L124 PetriNetUnfolderBase]: 1526/2759 cut-off events. [2024-05-12 13:20:35,992 INFO L125 PetriNetUnfolderBase]: For 160772/160775 co-relation queries the response was YES. [2024-05-12 13:20:36,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21074 conditions, 2759 events. 1526/2759 cut-off events. For 160772/160775 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 16847 event pairs, 364 based on Foata normal form. 4/2604 useless extension candidates. Maximal degree in co-relation 20907. Up to 2286 conditions per place. [2024-05-12 13:20:36,027 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 415 selfloop transitions, 32 changer transitions 0/517 dead transitions. [2024-05-12 13:20:36,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 517 transitions, 8406 flow [2024-05-12 13:20:36,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:20:36,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:20:36,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-05-12 13:20:36,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-05-12 13:20:36,028 INFO L175 Difference]: Start difference. First operand has 375 places, 497 transitions, 7384 flow. Second operand 10 states and 170 transitions. [2024-05-12 13:20:36,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 517 transitions, 8406 flow [2024-05-12 13:20:37,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 517 transitions, 8300 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-05-12 13:20:37,110 INFO L231 Difference]: Finished difference. Result has 379 places, 499 transitions, 7386 flow [2024-05-12 13:20:37,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7278, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7386, PETRI_PLACES=379, PETRI_TRANSITIONS=499} [2024-05-12 13:20:37,111 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 335 predicate places. [2024-05-12 13:20:37,111 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 499 transitions, 7386 flow [2024-05-12 13:20:37,111 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:20:37,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:20:37,111 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:20:37,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-05-12 13:20:37,111 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:20:37,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:20:37,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1301811364, now seen corresponding path program 23 times [2024-05-12 13:20:37,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:20:37,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345473733] [2024-05-12 13:20:37,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:20:37,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:20:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:20:37,921 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:20:37,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:20:37,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345473733] [2024-05-12 13:20:37,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345473733] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:20:37,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:20:37,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:20:37,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56780635] [2024-05-12 13:20:37,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:20:37,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:20:37,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:20:37,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:20:37,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:20:38,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:20:38,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 499 transitions, 7386 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:38,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:20:38,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:20:38,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:20:38,826 INFO L124 PetriNetUnfolderBase]: 1593/2827 cut-off events. [2024-05-12 13:20:38,826 INFO L125 PetriNetUnfolderBase]: For 156277/156277 co-relation queries the response was YES. [2024-05-12 13:20:38,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21522 conditions, 2827 events. 1593/2827 cut-off events. For 156277/156277 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 16924 event pairs, 227 based on Foata normal form. 2/2670 useless extension candidates. Maximal degree in co-relation 21354. Up to 1694 conditions per place. [2024-05-12 13:20:38,859 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 316 selfloop transitions, 197 changer transitions 0/522 dead transitions. [2024-05-12 13:20:38,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 522 transitions, 8694 flow [2024-05-12 13:20:38,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:20:38,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:20:38,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2024-05-12 13:20:38,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44 [2024-05-12 13:20:38,861 INFO L175 Difference]: Start difference. First operand has 379 places, 499 transitions, 7386 flow. Second operand 10 states and 176 transitions. [2024-05-12 13:20:38,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 522 transitions, 8694 flow [2024-05-12 13:20:39,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 522 transitions, 8580 flow, removed 28 selfloop flow, removed 8 redundant places. [2024-05-12 13:20:39,730 INFO L231 Difference]: Finished difference. Result has 381 places, 499 transitions, 7676 flow [2024-05-12 13:20:39,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7274, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=197, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7676, PETRI_PLACES=381, PETRI_TRANSITIONS=499} [2024-05-12 13:20:39,730 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 337 predicate places. [2024-05-12 13:20:39,731 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 499 transitions, 7676 flow [2024-05-12 13:20:39,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:39,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:20:39,731 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:20:39,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-05-12 13:20:39,731 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:20:39,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:20:39,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1621430524, now seen corresponding path program 24 times [2024-05-12 13:20:39,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:20:39,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739495153] [2024-05-12 13:20:39,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:20:39,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:20:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:20:40,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:20:40,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:20:40,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739495153] [2024-05-12 13:20:40,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739495153] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:20:40,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:20:40,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:20:40,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912949518] [2024-05-12 13:20:40,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:20:40,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:20:40,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:20:40,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:20:40,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:20:40,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:20:40,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 499 transitions, 7676 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:40,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:20:40,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:20:40,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:20:41,377 INFO L124 PetriNetUnfolderBase]: 1589/2821 cut-off events. [2024-05-12 13:20:41,378 INFO L125 PetriNetUnfolderBase]: For 150979/150979 co-relation queries the response was YES. [2024-05-12 13:20:41,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21753 conditions, 2821 events. 1589/2821 cut-off events. For 150979/150979 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 16876 event pairs, 220 based on Foata normal form. 2/2664 useless extension candidates. Maximal degree in co-relation 21584. Up to 1691 conditions per place. [2024-05-12 13:20:41,505 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 321 selfloop transitions, 193 changer transitions 0/523 dead transitions. [2024-05-12 13:20:41,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 523 transitions, 8990 flow [2024-05-12 13:20:41,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:20:41,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:20:41,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-05-12 13:20:41,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445 [2024-05-12 13:20:41,507 INFO L175 Difference]: Start difference. First operand has 381 places, 499 transitions, 7676 flow. Second operand 10 states and 178 transitions. [2024-05-12 13:20:41,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 523 transitions, 8990 flow [2024-05-12 13:20:42,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 523 transitions, 8547 flow, removed 18 selfloop flow, removed 10 redundant places. [2024-05-12 13:20:42,341 INFO L231 Difference]: Finished difference. Result has 381 places, 499 transitions, 7629 flow [2024-05-12 13:20:42,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7235, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7629, PETRI_PLACES=381, PETRI_TRANSITIONS=499} [2024-05-12 13:20:42,342 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 337 predicate places. [2024-05-12 13:20:42,342 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 499 transitions, 7629 flow [2024-05-12 13:20:42,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:42,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:20:42,342 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:20:42,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-05-12 13:20:42,342 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:20:42,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:20:42,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1621895606, now seen corresponding path program 9 times [2024-05-12 13:20:42,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:20:42,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693068976] [2024-05-12 13:20:42,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:20:42,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:20:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:20:43,173 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:20:43,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:20:43,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693068976] [2024-05-12 13:20:43,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693068976] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:20:43,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:20:43,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:20:43,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753078471] [2024-05-12 13:20:43,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:20:43,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:20:43,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:20:43,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:20:43,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:20:43,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:20:43,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 499 transitions, 7629 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:43,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:20:43,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:20:43,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:20:44,001 INFO L124 PetriNetUnfolderBase]: 1594/2829 cut-off events. [2024-05-12 13:20:44,001 INFO L125 PetriNetUnfolderBase]: For 147208/147208 co-relation queries the response was YES. [2024-05-12 13:20:44,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21762 conditions, 2829 events. 1594/2829 cut-off events. For 147208/147208 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 16933 event pairs, 314 based on Foata normal form. 1/2674 useless extension candidates. Maximal degree in co-relation 21593. Up to 2331 conditions per place. [2024-05-12 13:20:44,039 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 392 selfloop transitions, 119 changer transitions 0/520 dead transitions. [2024-05-12 13:20:44,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 520 transitions, 8965 flow [2024-05-12 13:20:44,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:20:44,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:20:44,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2024-05-12 13:20:44,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4175 [2024-05-12 13:20:44,041 INFO L175 Difference]: Start difference. First operand has 381 places, 499 transitions, 7629 flow. Second operand 10 states and 167 transitions. [2024-05-12 13:20:44,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 520 transitions, 8965 flow [2024-05-12 13:20:44,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 520 transitions, 8564 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-05-12 13:20:44,997 INFO L231 Difference]: Finished difference. Result has 381 places, 501 transitions, 7524 flow [2024-05-12 13:20:44,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7230, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7524, PETRI_PLACES=381, PETRI_TRANSITIONS=501} [2024-05-12 13:20:44,997 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 337 predicate places. [2024-05-12 13:20:44,997 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 501 transitions, 7524 flow [2024-05-12 13:20:44,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:44,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:20:44,998 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:20:44,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-05-12 13:20:44,998 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:20:44,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:20:44,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1732946904, now seen corresponding path program 25 times [2024-05-12 13:20:44,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:20:44,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302984650] [2024-05-12 13:20:44,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:20:44,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:20:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:20:45,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:20:45,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:20:45,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302984650] [2024-05-12 13:20:45,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302984650] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:20:45,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:20:45,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:20:45,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117726782] [2024-05-12 13:20:45,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:20:45,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:20:45,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:20:45,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:20:45,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:20:45,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:20:45,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 501 transitions, 7524 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:45,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:20:45,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:20:45,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:20:46,634 INFO L124 PetriNetUnfolderBase]: 1590/2823 cut-off events. [2024-05-12 13:20:46,634 INFO L125 PetriNetUnfolderBase]: For 141759/141759 co-relation queries the response was YES. [2024-05-12 13:20:46,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21206 conditions, 2823 events. 1590/2823 cut-off events. For 141759/141759 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 16905 event pairs, 141 based on Foata normal form. 2/2666 useless extension candidates. Maximal degree in co-relation 21037. Up to 1696 conditions per place. [2024-05-12 13:20:46,670 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 267 selfloop transitions, 247 changer transitions 0/523 dead transitions. [2024-05-12 13:20:46,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 523 transitions, 8664 flow [2024-05-12 13:20:46,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:20:46,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:20:46,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions. [2024-05-12 13:20:46,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4325 [2024-05-12 13:20:46,671 INFO L175 Difference]: Start difference. First operand has 381 places, 501 transitions, 7524 flow. Second operand 10 states and 173 transitions. [2024-05-12 13:20:46,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 523 transitions, 8664 flow [2024-05-12 13:20:47,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 523 transitions, 8397 flow, removed 37 selfloop flow, removed 8 redundant places. [2024-05-12 13:20:47,453 INFO L231 Difference]: Finished difference. Result has 383 places, 501 transitions, 7759 flow [2024-05-12 13:20:47,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7257, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=247, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7759, PETRI_PLACES=383, PETRI_TRANSITIONS=501} [2024-05-12 13:20:47,453 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 339 predicate places. [2024-05-12 13:20:47,453 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 501 transitions, 7759 flow [2024-05-12 13:20:47,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:47,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:20:47,454 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:20:47,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-05-12 13:20:47,454 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:20:47,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:20:47,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1732946594, now seen corresponding path program 10 times [2024-05-12 13:20:47,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:20:47,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446901020] [2024-05-12 13:20:47,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:20:47,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:20:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:20:48,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:20:48,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:20:48,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446901020] [2024-05-12 13:20:48,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446901020] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:20:48,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:20:48,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:20:48,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657111122] [2024-05-12 13:20:48,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:20:48,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:20:48,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:20:48,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:20:48,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:20:48,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:20:48,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 501 transitions, 7759 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:48,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:20:48,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:20:48,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:20:49,126 INFO L124 PetriNetUnfolderBase]: 1602/2857 cut-off events. [2024-05-12 13:20:49,127 INFO L125 PetriNetUnfolderBase]: For 136767/136767 co-relation queries the response was YES. [2024-05-12 13:20:49,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21811 conditions, 2857 events. 1602/2857 cut-off events. For 136767/136767 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 17232 event pairs, 240 based on Foata normal form. 1/2697 useless extension candidates. Maximal degree in co-relation 21642. Up to 2452 conditions per place. [2024-05-12 13:20:49,164 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 447 selfloop transitions, 90 changer transitions 0/546 dead transitions. [2024-05-12 13:20:49,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 546 transitions, 9480 flow [2024-05-12 13:20:49,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:20:49,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:20:49,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 181 transitions. [2024-05-12 13:20:49,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4113636363636364 [2024-05-12 13:20:49,165 INFO L175 Difference]: Start difference. First operand has 383 places, 501 transitions, 7759 flow. Second operand 11 states and 181 transitions. [2024-05-12 13:20:49,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 546 transitions, 9480 flow [2024-05-12 13:20:49,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 546 transitions, 8888 flow, removed 19 selfloop flow, removed 11 redundant places. [2024-05-12 13:20:49,944 INFO L231 Difference]: Finished difference. Result has 387 places, 524 transitions, 7804 flow [2024-05-12 13:20:49,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7198, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7804, PETRI_PLACES=387, PETRI_TRANSITIONS=524} [2024-05-12 13:20:49,944 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 343 predicate places. [2024-05-12 13:20:49,944 INFO L495 AbstractCegarLoop]: Abstraction has has 387 places, 524 transitions, 7804 flow [2024-05-12 13:20:49,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:49,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:20:49,944 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:20:49,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-05-12 13:20:49,945 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:20:49,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:20:49,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1613553506, now seen corresponding path program 11 times [2024-05-12 13:20:49,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:20:49,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936212346] [2024-05-12 13:20:49,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:20:49,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:20:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:20:50,798 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:20:50,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:20:50,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936212346] [2024-05-12 13:20:50,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936212346] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:20:50,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:20:50,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:20:50,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830722535] [2024-05-12 13:20:50,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:20:50,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:20:50,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:20:50,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:20:50,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:20:50,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:20:50,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 524 transitions, 7804 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:50,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:20:50,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:20:50,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:20:51,638 INFO L124 PetriNetUnfolderBase]: 1600/2846 cut-off events. [2024-05-12 13:20:51,638 INFO L125 PetriNetUnfolderBase]: For 130046/130046 co-relation queries the response was YES. [2024-05-12 13:20:51,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21143 conditions, 2846 events. 1600/2846 cut-off events. For 130046/130046 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 17083 event pairs, 313 based on Foata normal form. 1/2691 useless extension candidates. Maximal degree in co-relation 20970. Up to 2336 conditions per place. [2024-05-12 13:20:51,674 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 419 selfloop transitions, 114 changer transitions 0/542 dead transitions. [2024-05-12 13:20:51,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 542 transitions, 8966 flow [2024-05-12 13:20:51,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:20:51,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:20:51,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-05-12 13:20:51,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4225 [2024-05-12 13:20:51,675 INFO L175 Difference]: Start difference. First operand has 387 places, 524 transitions, 7804 flow. Second operand 10 states and 169 transitions. [2024-05-12 13:20:51,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 542 transitions, 8966 flow [2024-05-12 13:20:52,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 542 transitions, 8833 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-05-12 13:20:52,452 INFO L231 Difference]: Finished difference. Result has 391 places, 524 transitions, 7909 flow [2024-05-12 13:20:52,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7671, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7909, PETRI_PLACES=391, PETRI_TRANSITIONS=524} [2024-05-12 13:20:52,452 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 347 predicate places. [2024-05-12 13:20:52,453 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 524 transitions, 7909 flow [2024-05-12 13:20:52,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:52,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:20:52,453 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:20:52,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-05-12 13:20:52,453 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:20:52,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:20:52,453 INFO L85 PathProgramCache]: Analyzing trace with hash 724259640, now seen corresponding path program 26 times [2024-05-12 13:20:52,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:20:52,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807206826] [2024-05-12 13:20:52,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:20:52,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:20:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:20:53,283 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:20:53,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:20:53,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807206826] [2024-05-12 13:20:53,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807206826] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:20:53,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:20:53,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:20:53,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594201491] [2024-05-12 13:20:53,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:20:53,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:20:53,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:20:53,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:20:53,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:20:53,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:20:53,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 524 transitions, 7909 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:53,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:20:53,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:20:53,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:20:54,103 INFO L124 PetriNetUnfolderBase]: 1619/2874 cut-off events. [2024-05-12 13:20:54,103 INFO L125 PetriNetUnfolderBase]: For 140889/140889 co-relation queries the response was YES. [2024-05-12 13:20:54,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21631 conditions, 2874 events. 1619/2874 cut-off events. For 140889/140889 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 17290 event pairs, 247 based on Foata normal form. 2/2715 useless extension candidates. Maximal degree in co-relation 21457. Up to 1526 conditions per place. [2024-05-12 13:20:54,142 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 326 selfloop transitions, 214 changer transitions 0/549 dead transitions. [2024-05-12 13:20:54,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 549 transitions, 9359 flow [2024-05-12 13:20:54,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:20:54,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:20:54,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2024-05-12 13:20:54,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4425 [2024-05-12 13:20:54,143 INFO L175 Difference]: Start difference. First operand has 391 places, 524 transitions, 7909 flow. Second operand 10 states and 177 transitions. [2024-05-12 13:20:54,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 549 transitions, 9359 flow [2024-05-12 13:20:55,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 549 transitions, 9004 flow, removed 10 selfloop flow, removed 11 redundant places. [2024-05-12 13:20:55,082 INFO L231 Difference]: Finished difference. Result has 390 places, 528 transitions, 8085 flow [2024-05-12 13:20:55,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7556, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8085, PETRI_PLACES=390, PETRI_TRANSITIONS=528} [2024-05-12 13:20:55,082 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 346 predicate places. [2024-05-12 13:20:55,082 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 528 transitions, 8085 flow [2024-05-12 13:20:55,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:55,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:20:55,083 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:20:55,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-05-12 13:20:55,083 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:20:55,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:20:55,083 INFO L85 PathProgramCache]: Analyzing trace with hash 716612952, now seen corresponding path program 27 times [2024-05-12 13:20:55,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:20:55,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067730600] [2024-05-12 13:20:55,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:20:55,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:20:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:20:55,938 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:20:55,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:20:55,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067730600] [2024-05-12 13:20:55,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067730600] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:20:55,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:20:55,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:20:55,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494599234] [2024-05-12 13:20:55,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:20:55,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:20:55,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:20:55,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:20:55,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:20:56,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:20:56,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 528 transitions, 8085 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:56,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:20:56,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:20:56,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:20:56,823 INFO L124 PetriNetUnfolderBase]: 1645/2917 cut-off events. [2024-05-12 13:20:56,824 INFO L125 PetriNetUnfolderBase]: For 150813/150813 co-relation queries the response was YES. [2024-05-12 13:20:56,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22552 conditions, 2917 events. 1645/2917 cut-off events. For 150813/150813 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 17567 event pairs, 248 based on Foata normal form. 2/2756 useless extension candidates. Maximal degree in co-relation 22378. Up to 1549 conditions per place. [2024-05-12 13:20:56,863 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 335 selfloop transitions, 211 changer transitions 0/555 dead transitions. [2024-05-12 13:20:56,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 555 transitions, 9731 flow [2024-05-12 13:20:56,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:20:56,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:20:56,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-05-12 13:20:56,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4525 [2024-05-12 13:20:56,864 INFO L175 Difference]: Start difference. First operand has 390 places, 528 transitions, 8085 flow. Second operand 10 states and 181 transitions. [2024-05-12 13:20:56,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 555 transitions, 9731 flow [2024-05-12 13:20:57,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 555 transitions, 9275 flow, removed 33 selfloop flow, removed 7 redundant places. [2024-05-12 13:20:57,808 INFO L231 Difference]: Finished difference. Result has 393 places, 532 transitions, 8156 flow [2024-05-12 13:20:57,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7645, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=207, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8156, PETRI_PLACES=393, PETRI_TRANSITIONS=532} [2024-05-12 13:20:57,809 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 349 predicate places. [2024-05-12 13:20:57,809 INFO L495 AbstractCegarLoop]: Abstraction has has 393 places, 532 transitions, 8156 flow [2024-05-12 13:20:57,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:57,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:20:57,809 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:20:57,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-05-12 13:20:57,809 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:20:57,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:20:57,810 INFO L85 PathProgramCache]: Analyzing trace with hash 724656522, now seen corresponding path program 28 times [2024-05-12 13:20:57,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:20:57,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263886270] [2024-05-12 13:20:57,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:20:57,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:20:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:20:58,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:20:58,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:20:58,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263886270] [2024-05-12 13:20:58,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263886270] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:20:58,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:20:58,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:20:58,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390342792] [2024-05-12 13:20:58,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:20:58,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:20:58,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:20:58,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:20:58,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:20:58,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:20:58,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 532 transitions, 8156 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:20:58,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:20:58,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:20:58,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:20:59,601 INFO L124 PetriNetUnfolderBase]: 1671/2963 cut-off events. [2024-05-12 13:20:59,602 INFO L125 PetriNetUnfolderBase]: For 161797/161797 co-relation queries the response was YES. [2024-05-12 13:20:59,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23003 conditions, 2963 events. 1671/2963 cut-off events. For 161797/161797 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 17933 event pairs, 249 based on Foata normal form. 2/2800 useless extension candidates. Maximal degree in co-relation 22828. Up to 1572 conditions per place. [2024-05-12 13:20:59,640 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 338 selfloop transitions, 213 changer transitions 0/560 dead transitions. [2024-05-12 13:20:59,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 560 transitions, 9982 flow [2024-05-12 13:20:59,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:20:59,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:20:59,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-05-12 13:20:59,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4575 [2024-05-12 13:20:59,641 INFO L175 Difference]: Start difference. First operand has 393 places, 532 transitions, 8156 flow. Second operand 10 states and 183 transitions. [2024-05-12 13:20:59,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 560 transitions, 9982 flow [2024-05-12 13:21:00,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 560 transitions, 9553 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-05-12 13:21:00,619 INFO L231 Difference]: Finished difference. Result has 397 places, 536 transitions, 8250 flow [2024-05-12 13:21:00,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7731, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=209, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8250, PETRI_PLACES=397, PETRI_TRANSITIONS=536} [2024-05-12 13:21:00,620 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 353 predicate places. [2024-05-12 13:21:00,620 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 536 transitions, 8250 flow [2024-05-12 13:21:00,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:00,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:21:00,620 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:21:00,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-05-12 13:21:00,620 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:21:00,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:21:00,621 INFO L85 PathProgramCache]: Analyzing trace with hash 732542220, now seen corresponding path program 29 times [2024-05-12 13:21:00,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:21:00,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840898824] [2024-05-12 13:21:00,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:21:00,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:21:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:21:01,449 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:21:01,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:21:01,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840898824] [2024-05-12 13:21:01,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840898824] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:21:01,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:21:01,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:21:01,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366719076] [2024-05-12 13:21:01,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:21:01,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:21:01,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:21:01,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:21:01,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:21:01,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:21:01,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 536 transitions, 8250 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:01,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:21:01,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:21:01,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:21:02,462 INFO L124 PetriNetUnfolderBase]: 1682/2983 cut-off events. [2024-05-12 13:21:02,463 INFO L125 PetriNetUnfolderBase]: For 165425/165425 co-relation queries the response was YES. [2024-05-12 13:21:02,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23150 conditions, 2983 events. 1682/2983 cut-off events. For 165425/165425 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 18075 event pairs, 249 based on Foata normal form. 2/2819 useless extension candidates. Maximal degree in co-relation 22974. Up to 1582 conditions per place. [2024-05-12 13:21:02,504 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 340 selfloop transitions, 214 changer transitions 0/563 dead transitions. [2024-05-12 13:21:02,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 563 transitions, 10048 flow [2024-05-12 13:21:02,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:21:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:21:02,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-05-12 13:21:02,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625 [2024-05-12 13:21:02,505 INFO L175 Difference]: Start difference. First operand has 397 places, 536 transitions, 8250 flow. Second operand 10 states and 185 transitions. [2024-05-12 13:21:02,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 563 transitions, 10048 flow [2024-05-12 13:21:03,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 563 transitions, 9615 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-05-12 13:21:03,511 INFO L231 Difference]: Finished difference. Result has 401 places, 538 transitions, 8298 flow [2024-05-12 13:21:03,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7819, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8298, PETRI_PLACES=401, PETRI_TRANSITIONS=538} [2024-05-12 13:21:03,511 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 357 predicate places. [2024-05-12 13:21:03,511 INFO L495 AbstractCegarLoop]: Abstraction has has 401 places, 538 transitions, 8298 flow [2024-05-12 13:21:03,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:03,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:21:03,512 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:21:03,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-05-12 13:21:03,512 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:21:03,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:21:03,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1867572058, now seen corresponding path program 30 times [2024-05-12 13:21:03,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:21:03,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353774947] [2024-05-12 13:21:03,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:21:03,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:21:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:21:04,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:21:04,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:21:04,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353774947] [2024-05-12 13:21:04,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353774947] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:21:04,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:21:04,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:21:04,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304711026] [2024-05-12 13:21:04,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:21:04,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:21:04,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:21:04,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:21:04,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:21:04,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:21:04,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 538 transitions, 8298 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:04,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:21:04,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:21:04,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:21:05,293 INFO L124 PetriNetUnfolderBase]: 1708/3026 cut-off events. [2024-05-12 13:21:05,293 INFO L125 PetriNetUnfolderBase]: For 177882/177882 co-relation queries the response was YES. [2024-05-12 13:21:05,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23654 conditions, 3026 events. 1708/3026 cut-off events. For 177882/177882 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 18334 event pairs, 180 based on Foata normal form. 2/2860 useless extension candidates. Maximal degree in co-relation 23477. Up to 1605 conditions per place. [2024-05-12 13:21:05,335 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 309 selfloop transitions, 248 changer transitions 0/566 dead transitions. [2024-05-12 13:21:05,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 566 transitions, 10156 flow [2024-05-12 13:21:05,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:21:05,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:21:05,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-05-12 13:21:05,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4525 [2024-05-12 13:21:05,336 INFO L175 Difference]: Start difference. First operand has 401 places, 538 transitions, 8298 flow. Second operand 10 states and 181 transitions. [2024-05-12 13:21:05,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 566 transitions, 10156 flow [2024-05-12 13:21:06,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 566 transitions, 9720 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-05-12 13:21:06,504 INFO L231 Difference]: Finished difference. Result has 405 places, 542 transitions, 8463 flow [2024-05-12 13:21:06,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7866, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=244, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8463, PETRI_PLACES=405, PETRI_TRANSITIONS=542} [2024-05-12 13:21:06,505 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 361 predicate places. [2024-05-12 13:21:06,505 INFO L495 AbstractCegarLoop]: Abstraction has has 405 places, 542 transitions, 8463 flow [2024-05-12 13:21:06,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:06,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:21:06,505 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:21:06,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-05-12 13:21:06,505 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:21:06,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:21:06,506 INFO L85 PathProgramCache]: Analyzing trace with hash -909163314, now seen corresponding path program 31 times [2024-05-12 13:21:06,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:21:06,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82128928] [2024-05-12 13:21:06,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:21:06,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:21:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:21:07,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:21:07,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:21:07,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82128928] [2024-05-12 13:21:07,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82128928] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:21:07,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:21:07,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:21:07,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540332373] [2024-05-12 13:21:07,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:21:07,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:21:07,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:21:07,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:21:07,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:21:07,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:21:07,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 542 transitions, 8463 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:07,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:21:07,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:21:07,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:21:08,265 INFO L124 PetriNetUnfolderBase]: 1704/3023 cut-off events. [2024-05-12 13:21:08,265 INFO L125 PetriNetUnfolderBase]: For 173843/173843 co-relation queries the response was YES. [2024-05-12 13:21:08,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23533 conditions, 3023 events. 1704/3023 cut-off events. For 173843/173843 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 18374 event pairs, 252 based on Foata normal form. 2/2857 useless extension candidates. Maximal degree in co-relation 23355. Up to 1602 conditions per place. [2024-05-12 13:21:08,307 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 333 selfloop transitions, 222 changer transitions 0/564 dead transitions. [2024-05-12 13:21:08,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 564 transitions, 9863 flow [2024-05-12 13:21:08,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:21:08,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:21:08,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2024-05-12 13:21:08,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4475 [2024-05-12 13:21:08,308 INFO L175 Difference]: Start difference. First operand has 405 places, 542 transitions, 8463 flow. Second operand 10 states and 179 transitions. [2024-05-12 13:21:08,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 564 transitions, 9863 flow [2024-05-12 13:21:09,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 564 transitions, 9290 flow, removed 30 selfloop flow, removed 8 redundant places. [2024-05-12 13:21:09,477 INFO L231 Difference]: Finished difference. Result has 407 places, 542 transitions, 8339 flow [2024-05-12 13:21:09,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7890, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=222, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8339, PETRI_PLACES=407, PETRI_TRANSITIONS=542} [2024-05-12 13:21:09,478 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 363 predicate places. [2024-05-12 13:21:09,478 INFO L495 AbstractCegarLoop]: Abstraction has has 407 places, 542 transitions, 8339 flow [2024-05-12 13:21:09,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:09,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:21:09,478 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:21:09,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-05-12 13:21:09,478 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:21:09,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:21:09,478 INFO L85 PathProgramCache]: Analyzing trace with hash 724953192, now seen corresponding path program 32 times [2024-05-12 13:21:09,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:21:09,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324952999] [2024-05-12 13:21:09,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:21:09,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:21:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:21:10,310 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:21:10,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:21:10,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324952999] [2024-05-12 13:21:10,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324952999] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:21:10,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:21:10,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:21:10,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61198895] [2024-05-12 13:21:10,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:21:10,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:21:10,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:21:10,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:21:10,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:21:10,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:21:10,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 542 transitions, 8339 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:10,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:21:10,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:21:10,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:21:11,191 INFO L124 PetriNetUnfolderBase]: 1700/3014 cut-off events. [2024-05-12 13:21:11,192 INFO L125 PetriNetUnfolderBase]: For 166864/166864 co-relation queries the response was YES. [2024-05-12 13:21:11,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23135 conditions, 3014 events. 1700/3014 cut-off events. For 166864/166864 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 18296 event pairs, 248 based on Foata normal form. 2/2848 useless extension candidates. Maximal degree in co-relation 22956. Up to 1599 conditions per place. [2024-05-12 13:21:11,233 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 334 selfloop transitions, 221 changer transitions 0/564 dead transitions. [2024-05-12 13:21:11,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 564 transitions, 9741 flow [2024-05-12 13:21:11,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:21:11,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:21:11,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions. [2024-05-12 13:21:11,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-05-12 13:21:11,235 INFO L175 Difference]: Start difference. First operand has 407 places, 542 transitions, 8339 flow. Second operand 10 states and 180 transitions. [2024-05-12 13:21:11,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 564 transitions, 9741 flow [2024-05-12 13:21:12,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 564 transitions, 9264 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-05-12 13:21:12,422 INFO L231 Difference]: Finished difference. Result has 408 places, 542 transitions, 8309 flow [2024-05-12 13:21:12,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7862, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=221, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8309, PETRI_PLACES=408, PETRI_TRANSITIONS=542} [2024-05-12 13:21:12,423 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 364 predicate places. [2024-05-12 13:21:12,423 INFO L495 AbstractCegarLoop]: Abstraction has has 408 places, 542 transitions, 8309 flow [2024-05-12 13:21:12,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:12,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:21:12,423 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:21:12,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-05-12 13:21:12,423 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:21:12,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:21:12,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1991903888, now seen corresponding path program 3 times [2024-05-12 13:21:12,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:21:12,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303725876] [2024-05-12 13:21:12,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:21:12,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:21:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:21:13,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:21:13,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:21:13,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303725876] [2024-05-12 13:21:13,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303725876] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:21:13,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:21:13,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:21:13,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892351481] [2024-05-12 13:21:13,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:21:13,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:21:13,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:21:13,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:21:13,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:21:13,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:21:13,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 542 transitions, 8309 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:21:13,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:21:13,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:21:13,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:21:14,324 INFO L124 PetriNetUnfolderBase]: 1625/2938 cut-off events. [2024-05-12 13:21:14,324 INFO L125 PetriNetUnfolderBase]: For 165582/165585 co-relation queries the response was YES. [2024-05-12 13:21:14,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22472 conditions, 2938 events. 1625/2938 cut-off events. For 165582/165585 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 18235 event pairs, 378 based on Foata normal form. 4/2773 useless extension candidates. Maximal degree in co-relation 22292. Up to 2372 conditions per place. [2024-05-12 13:21:14,363 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 429 selfloop transitions, 50 changer transitions 0/560 dead transitions. [2024-05-12 13:21:14,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 560 transitions, 9389 flow [2024-05-12 13:21:14,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:21:14,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:21:14,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-05-12 13:21:14,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.435 [2024-05-12 13:21:14,364 INFO L175 Difference]: Start difference. First operand has 408 places, 542 transitions, 8309 flow. Second operand 10 states and 174 transitions. [2024-05-12 13:21:14,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 560 transitions, 9389 flow [2024-05-12 13:21:15,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 560 transitions, 8931 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-05-12 13:21:15,519 INFO L231 Difference]: Finished difference. Result has 408 places, 544 transitions, 7992 flow [2024-05-12 13:21:15,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7851, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7992, PETRI_PLACES=408, PETRI_TRANSITIONS=544} [2024-05-12 13:21:15,520 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 364 predicate places. [2024-05-12 13:21:15,520 INFO L495 AbstractCegarLoop]: Abstraction has has 408 places, 544 transitions, 7992 flow [2024-05-12 13:21:15,520 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:21:15,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:21:15,520 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:21:15,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-05-12 13:21:15,520 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:21:15,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:21:15,521 INFO L85 PathProgramCache]: Analyzing trace with hash -2092963064, now seen corresponding path program 4 times [2024-05-12 13:21:15,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:21:15,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470111253] [2024-05-12 13:21:15,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:21:15,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:21:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:21:16,643 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:21:16,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:21:16,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470111253] [2024-05-12 13:21:16,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470111253] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:21:16,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:21:16,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:21:16,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043598861] [2024-05-12 13:21:16,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:21:16,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:21:16,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:21:16,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:21:16,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:21:16,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:21:16,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 544 transitions, 7992 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:21:16,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:21:16,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:21:16,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:21:17,641 INFO L124 PetriNetUnfolderBase]: 1631/2947 cut-off events. [2024-05-12 13:21:17,641 INFO L125 PetriNetUnfolderBase]: For 166278/166281 co-relation queries the response was YES. [2024-05-12 13:21:17,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21993 conditions, 2947 events. 1631/2947 cut-off events. For 166278/166281 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 18285 event pairs, 378 based on Foata normal form. 4/2781 useless extension candidates. Maximal degree in co-relation 21812. Up to 2381 conditions per place. [2024-05-12 13:21:17,679 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 427 selfloop transitions, 54 changer transitions 0/562 dead transitions. [2024-05-12 13:21:17,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 562 transitions, 9080 flow [2024-05-12 13:21:17,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:21:17,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:21:17,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions. [2024-05-12 13:21:17,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4325 [2024-05-12 13:21:17,680 INFO L175 Difference]: Start difference. First operand has 408 places, 544 transitions, 7992 flow. Second operand 10 states and 173 transitions. [2024-05-12 13:21:17,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 562 transitions, 9080 flow [2024-05-12 13:21:18,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 562 transitions, 8959 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-05-12 13:21:18,670 INFO L231 Difference]: Finished difference. Result has 410 places, 546 transitions, 8024 flow [2024-05-12 13:21:18,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7871, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=490, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8024, PETRI_PLACES=410, PETRI_TRANSITIONS=546} [2024-05-12 13:21:18,671 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 366 predicate places. [2024-05-12 13:21:18,671 INFO L495 AbstractCegarLoop]: Abstraction has has 410 places, 546 transitions, 8024 flow [2024-05-12 13:21:18,671 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:21:18,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:21:18,671 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:21:18,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-05-12 13:21:18,671 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:21:18,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:21:18,672 INFO L85 PathProgramCache]: Analyzing trace with hash 732841060, now seen corresponding path program 12 times [2024-05-12 13:21:18,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:21:18,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453476024] [2024-05-12 13:21:18,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:21:18,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:21:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:21:19,504 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:21:19,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:21:19,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453476024] [2024-05-12 13:21:19,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453476024] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:21:19,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:21:19,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:21:19,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471045565] [2024-05-12 13:21:19,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:21:19,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:21:19,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:21:19,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:21:19,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:21:19,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:21:19,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 546 transitions, 8024 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:19,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:21:19,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:21:19,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:21:20,357 INFO L124 PetriNetUnfolderBase]: 1724/3054 cut-off events. [2024-05-12 13:21:20,357 INFO L125 PetriNetUnfolderBase]: For 175010/175010 co-relation queries the response was YES. [2024-05-12 13:21:20,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23046 conditions, 3054 events. 1724/3054 cut-off events. For 175010/175010 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 18552 event pairs, 258 based on Foata normal form. 1/2884 useless extension candidates. Maximal degree in co-relation 22864. Up to 2369 conditions per place. [2024-05-12 13:21:20,403 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 432 selfloop transitions, 129 changer transitions 0/570 dead transitions. [2024-05-12 13:21:20,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 570 transitions, 9750 flow [2024-05-12 13:21:20,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:21:20,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:21:20,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-05-12 13:21:20,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.435 [2024-05-12 13:21:20,405 INFO L175 Difference]: Start difference. First operand has 410 places, 546 transitions, 8024 flow. Second operand 10 states and 174 transitions. [2024-05-12 13:21:20,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 570 transitions, 9750 flow [2024-05-12 13:21:21,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 570 transitions, 9617 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-05-12 13:21:21,728 INFO L231 Difference]: Finished difference. Result has 412 places, 552 transitions, 8296 flow [2024-05-12 13:21:21,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7891, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8296, PETRI_PLACES=412, PETRI_TRANSITIONS=552} [2024-05-12 13:21:21,729 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 368 predicate places. [2024-05-12 13:21:21,729 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 552 transitions, 8296 flow [2024-05-12 13:21:21,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:21,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:21:21,729 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:21:21,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-05-12 13:21:21,729 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:21:21,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:21:21,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1982073230, now seen corresponding path program 13 times [2024-05-12 13:21:21,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:21:21,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498723327] [2024-05-12 13:21:21,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:21:21,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:21:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:21:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:21:22,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:21:22,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498723327] [2024-05-12 13:21:22,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498723327] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:21:22,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:21:22,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:21:22,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784376553] [2024-05-12 13:21:22,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:21:22,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:21:22,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:21:22,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:21:22,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:21:22,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:21:22,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 552 transitions, 8296 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:22,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:21:22,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:21:22,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:21:23,422 INFO L124 PetriNetUnfolderBase]: 1743/3084 cut-off events. [2024-05-12 13:21:23,422 INFO L125 PetriNetUnfolderBase]: For 189122/189122 co-relation queries the response was YES. [2024-05-12 13:21:23,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23770 conditions, 3084 events. 1743/3084 cut-off events. For 189122/189122 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 18732 event pairs, 258 based on Foata normal form. 1/2914 useless extension candidates. Maximal degree in co-relation 23587. Up to 2391 conditions per place. [2024-05-12 13:21:23,465 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 406 selfloop transitions, 162 changer transitions 0/577 dead transitions. [2024-05-12 13:21:23,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 577 transitions, 10242 flow [2024-05-12 13:21:23,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:21:23,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:21:23,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions. [2024-05-12 13:21:23,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4325 [2024-05-12 13:21:23,467 INFO L175 Difference]: Start difference. First operand has 412 places, 552 transitions, 8296 flow. Second operand 10 states and 173 transitions. [2024-05-12 13:21:23,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 577 transitions, 10242 flow [2024-05-12 13:21:24,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 577 transitions, 9961 flow, removed 35 selfloop flow, removed 6 redundant places. [2024-05-12 13:21:24,683 INFO L231 Difference]: Finished difference. Result has 416 places, 558 transitions, 8494 flow [2024-05-12 13:21:24,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8027, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8494, PETRI_PLACES=416, PETRI_TRANSITIONS=558} [2024-05-12 13:21:24,684 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 372 predicate places. [2024-05-12 13:21:24,684 INFO L495 AbstractCegarLoop]: Abstraction has has 416 places, 558 transitions, 8494 flow [2024-05-12 13:21:24,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:24,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:21:24,684 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:21:24,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2024-05-12 13:21:24,685 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:21:24,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:21:24,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1877403088, now seen corresponding path program 33 times [2024-05-12 13:21:24,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:21:24,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256998110] [2024-05-12 13:21:24,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:21:24,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:21:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:21:25,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:21:25,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:21:25,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256998110] [2024-05-12 13:21:25,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256998110] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:21:25,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:21:25,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:21:25,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668646199] [2024-05-12 13:21:25,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:21:25,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:21:25,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:21:25,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:21:25,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:21:25,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:21:25,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 558 transitions, 8494 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:25,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:21:25,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:21:25,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:21:26,364 INFO L124 PetriNetUnfolderBase]: 1739/3075 cut-off events. [2024-05-12 13:21:26,365 INFO L125 PetriNetUnfolderBase]: For 186177/186177 co-relation queries the response was YES. [2024-05-12 13:21:26,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23598 conditions, 3075 events. 1739/3075 cut-off events. For 186177/186177 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 18680 event pairs, 147 based on Foata normal form. 2/2907 useless extension candidates. Maximal degree in co-relation 23414. Up to 1663 conditions per place. [2024-05-12 13:21:26,408 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 273 selfloop transitions, 297 changer transitions 0/579 dead transitions. [2024-05-12 13:21:26,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 579 transitions, 9932 flow [2024-05-12 13:21:26,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:21:26,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:21:26,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-05-12 13:21:26,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-05-12 13:21:26,409 INFO L175 Difference]: Start difference. First operand has 416 places, 558 transitions, 8494 flow. Second operand 10 states and 175 transitions. [2024-05-12 13:21:26,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 579 transitions, 9932 flow [2024-05-12 13:21:27,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 579 transitions, 9642 flow, removed 37 selfloop flow, removed 5 redundant places. [2024-05-12 13:21:27,601 INFO L231 Difference]: Finished difference. Result has 421 places, 558 transitions, 8803 flow [2024-05-12 13:21:27,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8204, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=297, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8803, PETRI_PLACES=421, PETRI_TRANSITIONS=558} [2024-05-12 13:21:27,602 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 377 predicate places. [2024-05-12 13:21:27,602 INFO L495 AbstractCegarLoop]: Abstraction has has 421 places, 558 transitions, 8803 flow [2024-05-12 13:21:27,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:27,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:21:27,602 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:21:27,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2024-05-12 13:21:27,603 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:21:27,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:21:27,603 INFO L85 PathProgramCache]: Analyzing trace with hash -2085096338, now seen corresponding path program 14 times [2024-05-12 13:21:27,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:21:27,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105487754] [2024-05-12 13:21:27,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:21:27,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:21:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:21:28,427 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:21:28,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:21:28,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105487754] [2024-05-12 13:21:28,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105487754] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:21:28,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:21:28,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:21:28,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457401068] [2024-05-12 13:21:28,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:21:28,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:21:28,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:21:28,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:21:28,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:21:28,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:21:28,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 558 transitions, 8803 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:28,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:21:28,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:21:28,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:21:29,340 INFO L124 PetriNetUnfolderBase]: 1737/3078 cut-off events. [2024-05-12 13:21:29,340 INFO L125 PetriNetUnfolderBase]: For 182822/182822 co-relation queries the response was YES. [2024-05-12 13:21:29,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24082 conditions, 3078 events. 1737/3078 cut-off events. For 182822/182822 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 18748 event pairs, 257 based on Foata normal form. 1/2908 useless extension candidates. Maximal degree in co-relation 23897. Up to 2383 conditions per place. [2024-05-12 13:21:29,380 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 404 selfloop transitions, 163 changer transitions 0/576 dead transitions. [2024-05-12 13:21:29,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 576 transitions, 10415 flow [2024-05-12 13:21:29,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:21:29,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:21:29,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-05-12 13:21:29,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4275 [2024-05-12 13:21:29,381 INFO L175 Difference]: Start difference. First operand has 421 places, 558 transitions, 8803 flow. Second operand 10 states and 171 transitions. [2024-05-12 13:21:29,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 576 transitions, 10415 flow [2024-05-12 13:21:30,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 576 transitions, 9780 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-05-12 13:21:30,689 INFO L231 Difference]: Finished difference. Result has 422 places, 558 transitions, 8499 flow [2024-05-12 13:21:30,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8168, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8499, PETRI_PLACES=422, PETRI_TRANSITIONS=558} [2024-05-12 13:21:30,690 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 378 predicate places. [2024-05-12 13:21:30,690 INFO L495 AbstractCegarLoop]: Abstraction has has 422 places, 558 transitions, 8499 flow [2024-05-12 13:21:30,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:30,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:21:30,690 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:21:30,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2024-05-12 13:21:30,690 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:21:30,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:21:30,691 INFO L85 PathProgramCache]: Analyzing trace with hash 2017664636, now seen corresponding path program 15 times [2024-05-12 13:21:30,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:21:30,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355246995] [2024-05-12 13:21:30,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:21:30,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:21:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:21:31,519 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:21:31,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:21:31,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355246995] [2024-05-12 13:21:31,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355246995] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:21:31,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:21:31,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:21:31,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864726384] [2024-05-12 13:21:31,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:21:31,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:21:31,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:21:31,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:21:31,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:21:31,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:21:31,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 558 transitions, 8499 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:31,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:21:31,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:21:31,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:21:32,371 INFO L124 PetriNetUnfolderBase]: 1742/3083 cut-off events. [2024-05-12 13:21:32,371 INFO L125 PetriNetUnfolderBase]: For 184255/184255 co-relation queries the response was YES. [2024-05-12 13:21:32,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23527 conditions, 3083 events. 1742/3083 cut-off events. For 184255/184255 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 18736 event pairs, 257 based on Foata normal form. 1/2913 useless extension candidates. Maximal degree in co-relation 23341. Up to 2389 conditions per place. [2024-05-12 13:21:32,416 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 428 selfloop transitions, 140 changer transitions 0/577 dead transitions. [2024-05-12 13:21:32,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 577 transitions, 9969 flow [2024-05-12 13:21:32,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:21:32,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:21:32,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-05-12 13:21:32,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43 [2024-05-12 13:21:32,417 INFO L175 Difference]: Start difference. First operand has 422 places, 558 transitions, 8499 flow. Second operand 10 states and 172 transitions. [2024-05-12 13:21:32,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 577 transitions, 9969 flow [2024-05-12 13:21:33,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 577 transitions, 9734 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-05-12 13:21:33,666 INFO L231 Difference]: Finished difference. Result has 425 places, 560 transitions, 8597 flow [2024-05-12 13:21:33,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8266, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8597, PETRI_PLACES=425, PETRI_TRANSITIONS=560} [2024-05-12 13:21:33,667 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 381 predicate places. [2024-05-12 13:21:33,667 INFO L495 AbstractCegarLoop]: Abstraction has has 425 places, 560 transitions, 8597 flow [2024-05-12 13:21:33,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:33,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:21:33,667 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:21:33,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2024-05-12 13:21:33,667 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:21:33,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:21:33,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1869894722, now seen corresponding path program 5 times [2024-05-12 13:21:33,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:21:33,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449292361] [2024-05-12 13:21:33,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:21:33,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:21:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:21:34,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:21:34,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:21:34,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449292361] [2024-05-12 13:21:34,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449292361] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:21:34,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:21:34,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:21:34,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992946890] [2024-05-12 13:21:34,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:21:34,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:21:34,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:21:34,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:21:34,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:21:34,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:21:34,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 560 transitions, 8597 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:21:34,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:21:34,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:21:34,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:21:35,741 INFO L124 PetriNetUnfolderBase]: 1667/3007 cut-off events. [2024-05-12 13:21:35,741 INFO L125 PetriNetUnfolderBase]: For 189452/189456 co-relation queries the response was YES. [2024-05-12 13:21:35,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22897 conditions, 3007 events. 1667/3007 cut-off events. For 189452/189456 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 18752 event pairs, 482 based on Foata normal form. 4/2836 useless extension candidates. Maximal degree in co-relation 22710. Up to 2513 conditions per place. [2024-05-12 13:21:35,786 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 473 selfloop transitions, 19 changer transitions 0/580 dead transitions. [2024-05-12 13:21:35,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 580 transitions, 9723 flow [2024-05-12 13:21:35,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:21:35,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:21:35,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2024-05-12 13:21:35,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41363636363636364 [2024-05-12 13:21:35,788 INFO L175 Difference]: Start difference. First operand has 425 places, 560 transitions, 8597 flow. Second operand 11 states and 182 transitions. [2024-05-12 13:21:35,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 580 transitions, 9723 flow [2024-05-12 13:21:37,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 580 transitions, 9439 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-05-12 13:21:37,320 INFO L231 Difference]: Finished difference. Result has 429 places, 562 transitions, 8401 flow [2024-05-12 13:21:37,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8313, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8401, PETRI_PLACES=429, PETRI_TRANSITIONS=562} [2024-05-12 13:21:37,321 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 385 predicate places. [2024-05-12 13:21:37,321 INFO L495 AbstractCegarLoop]: Abstraction has has 429 places, 562 transitions, 8401 flow [2024-05-12 13:21:37,321 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:21:37,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:21:37,321 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:21:37,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2024-05-12 13:21:37,321 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:21:37,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:21:37,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1001712822, now seen corresponding path program 34 times [2024-05-12 13:21:37,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:21:37,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146653881] [2024-05-12 13:21:37,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:21:37,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:21:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:21:38,139 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:21:38,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:21:38,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146653881] [2024-05-12 13:21:38,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146653881] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:21:38,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:21:38,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:21:38,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429610899] [2024-05-12 13:21:38,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:21:38,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:21:38,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:21:38,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:21:38,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:21:38,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:21:38,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 562 transitions, 8401 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:38,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:21:38,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:21:38,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:21:39,114 INFO L124 PetriNetUnfolderBase]: 1759/3109 cut-off events. [2024-05-12 13:21:39,114 INFO L125 PetriNetUnfolderBase]: For 195068/195068 co-relation queries the response was YES. [2024-05-12 13:21:39,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23533 conditions, 3109 events. 1759/3109 cut-off events. For 195068/195068 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 18937 event pairs, 178 based on Foata normal form. 2/2939 useless extension candidates. Maximal degree in co-relation 23345. Up to 1687 conditions per place. [2024-05-12 13:21:39,162 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 323 selfloop transitions, 253 changer transitions 0/585 dead transitions. [2024-05-12 13:21:39,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 585 transitions, 9903 flow [2024-05-12 13:21:39,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:21:39,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:21:39,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2024-05-12 13:21:39,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44 [2024-05-12 13:21:39,163 INFO L175 Difference]: Start difference. First operand has 429 places, 562 transitions, 8401 flow. Second operand 10 states and 176 transitions. [2024-05-12 13:21:39,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 585 transitions, 9903 flow [2024-05-12 13:21:40,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 585 transitions, 9837 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-05-12 13:21:40,364 INFO L231 Difference]: Finished difference. Result has 430 places, 564 transitions, 8890 flow [2024-05-12 13:21:40,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8335, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=251, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8890, PETRI_PLACES=430, PETRI_TRANSITIONS=564} [2024-05-12 13:21:40,364 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 386 predicate places. [2024-05-12 13:21:40,364 INFO L495 AbstractCegarLoop]: Abstraction has has 430 places, 564 transitions, 8890 flow [2024-05-12 13:21:40,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:40,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:21:40,364 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:21:40,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2024-05-12 13:21:40,365 INFO L420 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:21:40,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:21:40,365 INFO L85 PathProgramCache]: Analyzing trace with hash -2073121658, now seen corresponding path program 16 times [2024-05-12 13:21:40,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:21:40,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043443863] [2024-05-12 13:21:40,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:21:40,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:21:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:21:41,327 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:21:41,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:21:41,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043443863] [2024-05-12 13:21:41,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043443863] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:21:41,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:21:41,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:21:41,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290957105] [2024-05-12 13:21:41,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:21:41,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:21:41,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:21:41,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:21:41,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:21:41,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:21:41,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 564 transitions, 8890 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:41,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:21:41,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:21:41,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:21:42,362 INFO L124 PetriNetUnfolderBase]: 1757/3117 cut-off events. [2024-05-12 13:21:42,362 INFO L125 PetriNetUnfolderBase]: For 191818/191818 co-relation queries the response was YES. [2024-05-12 13:21:42,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24228 conditions, 3117 events. 1757/3117 cut-off events. For 191818/191818 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 19102 event pairs, 510 based on Foata normal form. 1/2951 useless extension candidates. Maximal degree in co-relation 24039. Up to 2811 conditions per place. [2024-05-12 13:21:42,408 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 554 selfloop transitions, 17 changer transitions 0/580 dead transitions. [2024-05-12 13:21:42,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 580 transitions, 10122 flow [2024-05-12 13:21:42,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:21:42,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:21:42,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2024-05-12 13:21:42,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.395 [2024-05-12 13:21:42,409 INFO L175 Difference]: Start difference. First operand has 430 places, 564 transitions, 8890 flow. Second operand 10 states and 158 transitions. [2024-05-12 13:21:42,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 580 transitions, 10122 flow [2024-05-12 13:21:43,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 580 transitions, 9508 flow, removed 30 selfloop flow, removed 9 redundant places. [2024-05-12 13:21:43,549 INFO L231 Difference]: Finished difference. Result has 431 places, 564 transitions, 8315 flow [2024-05-12 13:21:43,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8276, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8315, PETRI_PLACES=431, PETRI_TRANSITIONS=564} [2024-05-12 13:21:43,549 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 387 predicate places. [2024-05-12 13:21:43,549 INFO L495 AbstractCegarLoop]: Abstraction has has 431 places, 564 transitions, 8315 flow [2024-05-12 13:21:43,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:43,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:21:43,550 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:21:43,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2024-05-12 13:21:43,550 INFO L420 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:21:43,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:21:43,550 INFO L85 PathProgramCache]: Analyzing trace with hash 732830830, now seen corresponding path program 17 times [2024-05-12 13:21:43,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:21:43,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107753] [2024-05-12 13:21:43,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:21:43,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:21:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:21:44,450 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:21:44,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:21:44,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107753] [2024-05-12 13:21:44,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107753] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:21:44,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:21:44,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:21:44,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697896797] [2024-05-12 13:21:44,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:21:44,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:21:44,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:21:44,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:21:44,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:21:44,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:21:44,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 564 transitions, 8315 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:44,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:21:44,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:21:44,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:21:45,384 INFO L124 PetriNetUnfolderBase]: 1762/3117 cut-off events. [2024-05-12 13:21:45,384 INFO L125 PetriNetUnfolderBase]: For 192033/192033 co-relation queries the response was YES. [2024-05-12 13:21:45,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23376 conditions, 3117 events. 1762/3117 cut-off events. For 192033/192033 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 18981 event pairs, 257 based on Foata normal form. 1/2945 useless extension candidates. Maximal degree in co-relation 23186. Up to 2419 conditions per place. [2024-05-12 13:21:45,429 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 438 selfloop transitions, 137 changer transitions 0/584 dead transitions. [2024-05-12 13:21:45,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 584 transitions, 10009 flow [2024-05-12 13:21:45,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:21:45,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:21:45,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-05-12 13:21:45,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-05-12 13:21:45,430 INFO L175 Difference]: Start difference. First operand has 431 places, 564 transitions, 8315 flow. Second operand 10 states and 175 transitions. [2024-05-12 13:21:45,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 584 transitions, 10009 flow [2024-05-12 13:21:46,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 584 transitions, 9959 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-05-12 13:21:46,669 INFO L231 Difference]: Finished difference. Result has 431 places, 566 transitions, 8590 flow [2024-05-12 13:21:46,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8265, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8590, PETRI_PLACES=431, PETRI_TRANSITIONS=566} [2024-05-12 13:21:46,669 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 387 predicate places. [2024-05-12 13:21:46,669 INFO L495 AbstractCegarLoop]: Abstraction has has 431 places, 566 transitions, 8590 flow [2024-05-12 13:21:46,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:46,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:21:46,670 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:21:46,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2024-05-12 13:21:46,670 INFO L420 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:21:46,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:21:46,670 INFO L85 PathProgramCache]: Analyzing trace with hash 732841432, now seen corresponding path program 6 times [2024-05-12 13:21:46,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:21:46,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696319360] [2024-05-12 13:21:46,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:21:46,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:21:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:21:47,660 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:21:47,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:21:47,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696319360] [2024-05-12 13:21:47,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696319360] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:21:47,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:21:47,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:21:47,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086561486] [2024-05-12 13:21:47,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:21:47,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:21:47,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:21:47,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:21:47,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:21:47,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:21:47,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 566 transitions, 8590 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:21:47,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:21:47,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:21:47,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:21:48,593 INFO L124 PetriNetUnfolderBase]: 1677/3024 cut-off events. [2024-05-12 13:21:48,593 INFO L125 PetriNetUnfolderBase]: For 192466/192469 co-relation queries the response was YES. [2024-05-12 13:21:48,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22821 conditions, 3024 events. 1677/3024 cut-off events. For 192466/192469 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 18823 event pairs, 377 based on Foata normal form. 4/2856 useless extension candidates. Maximal degree in co-relation 22630. Up to 2433 conditions per place. [2024-05-12 13:21:48,639 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 448 selfloop transitions, 47 changer transitions 0/584 dead transitions. [2024-05-12 13:21:48,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 584 transitions, 9714 flow [2024-05-12 13:21:48,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:21:48,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:21:48,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-05-12 13:21:48,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-05-12 13:21:48,640 INFO L175 Difference]: Start difference. First operand has 431 places, 566 transitions, 8590 flow. Second operand 10 states and 175 transitions. [2024-05-12 13:21:48,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 584 transitions, 9714 flow [2024-05-12 13:21:49,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 584 transitions, 9423 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-05-12 13:21:49,953 INFO L231 Difference]: Finished difference. Result has 434 places, 568 transitions, 8446 flow [2024-05-12 13:21:49,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8299, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8446, PETRI_PLACES=434, PETRI_TRANSITIONS=568} [2024-05-12 13:21:49,953 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 390 predicate places. [2024-05-12 13:21:49,953 INFO L495 AbstractCegarLoop]: Abstraction has has 434 places, 568 transitions, 8446 flow [2024-05-12 13:21:49,954 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:21:49,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:21:49,954 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:21:49,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2024-05-12 13:21:49,954 INFO L420 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:21:49,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:21:49,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1859705270, now seen corresponding path program 18 times [2024-05-12 13:21:49,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:21:49,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531027224] [2024-05-12 13:21:49,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:21:49,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:21:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:21:50,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:21:50,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:21:50,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531027224] [2024-05-12 13:21:50,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531027224] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:21:50,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:21:50,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:21:50,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213421105] [2024-05-12 13:21:50,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:21:50,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:21:50,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:21:50,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:21:50,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:21:50,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:21:50,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 568 transitions, 8446 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:50,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:21:50,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:21:50,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:21:51,801 INFO L124 PetriNetUnfolderBase]: 1765/3122 cut-off events. [2024-05-12 13:21:51,801 INFO L125 PetriNetUnfolderBase]: For 195191/195191 co-relation queries the response was YES. [2024-05-12 13:21:51,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23469 conditions, 3122 events. 1765/3122 cut-off events. For 195191/195191 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 19005 event pairs, 257 based on Foata normal form. 1/2950 useless extension candidates. Maximal degree in co-relation 23277. Up to 2422 conditions per place. [2024-05-12 13:21:51,870 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 428 selfloop transitions, 151 changer transitions 0/588 dead transitions. [2024-05-12 13:21:51,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 588 transitions, 10158 flow [2024-05-12 13:21:51,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:21:51,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:21:51,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions. [2024-05-12 13:21:51,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4325 [2024-05-12 13:21:51,871 INFO L175 Difference]: Start difference. First operand has 434 places, 568 transitions, 8446 flow. Second operand 10 states and 173 transitions. [2024-05-12 13:21:51,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 588 transitions, 10158 flow [2024-05-12 13:21:53,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 588 transitions, 10031 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-05-12 13:21:53,264 INFO L231 Difference]: Finished difference. Result has 436 places, 570 transitions, 8674 flow [2024-05-12 13:21:53,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8319, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8674, PETRI_PLACES=436, PETRI_TRANSITIONS=570} [2024-05-12 13:21:53,265 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 392 predicate places. [2024-05-12 13:21:53,265 INFO L495 AbstractCegarLoop]: Abstraction has has 436 places, 570 transitions, 8674 flow [2024-05-12 13:21:53,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:53,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:21:53,265 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:21:53,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2024-05-12 13:21:53,265 INFO L420 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:21:53,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:21:53,265 INFO L85 PathProgramCache]: Analyzing trace with hash 732542530, now seen corresponding path program 19 times [2024-05-12 13:21:53,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:21:53,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251057402] [2024-05-12 13:21:53,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:21:53,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:21:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:21:54,097 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:21:54,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:21:54,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251057402] [2024-05-12 13:21:54,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251057402] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:21:54,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:21:54,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:21:54,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747338091] [2024-05-12 13:21:54,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:21:54,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:21:54,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:21:54,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:21:54,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:21:54,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:21:54,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 570 transitions, 8674 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:54,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:21:54,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:21:54,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:21:55,003 INFO L124 PetriNetUnfolderBase]: 1763/3119 cut-off events. [2024-05-12 13:21:55,003 INFO L125 PetriNetUnfolderBase]: For 193713/193713 co-relation queries the response was YES. [2024-05-12 13:21:55,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23562 conditions, 3119 events. 1763/3119 cut-off events. For 193713/193713 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 19005 event pairs, 257 based on Foata normal form. 1/2947 useless extension candidates. Maximal degree in co-relation 23369. Up to 2420 conditions per place. [2024-05-12 13:21:55,066 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 440 selfloop transitions, 138 changer transitions 0/587 dead transitions. [2024-05-12 13:21:55,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 587 transitions, 10130 flow [2024-05-12 13:21:55,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:21:55,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:21:55,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-05-12 13:21:55,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-05-12 13:21:55,067 INFO L175 Difference]: Start difference. First operand has 436 places, 570 transitions, 8674 flow. Second operand 10 states and 175 transitions. [2024-05-12 13:21:55,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 587 transitions, 10130 flow [2024-05-12 13:21:56,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 587 transitions, 9552 flow, removed 34 selfloop flow, removed 10 redundant places. [2024-05-12 13:21:56,297 INFO L231 Difference]: Finished difference. Result has 436 places, 570 transitions, 8377 flow [2024-05-12 13:21:56,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8096, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8377, PETRI_PLACES=436, PETRI_TRANSITIONS=570} [2024-05-12 13:21:56,298 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 392 predicate places. [2024-05-12 13:21:56,298 INFO L495 AbstractCegarLoop]: Abstraction has has 436 places, 570 transitions, 8377 flow [2024-05-12 13:21:56,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:56,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:21:56,299 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:21:56,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2024-05-12 13:21:56,299 INFO L420 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:21:56,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:21:56,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1991914490, now seen corresponding path program 20 times [2024-05-12 13:21:56,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:21:56,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489570633] [2024-05-12 13:21:56,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:21:56,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:21:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:21:57,148 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:21:57,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:21:57,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489570633] [2024-05-12 13:21:57,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489570633] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:21:57,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:21:57,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:21:57,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536492933] [2024-05-12 13:21:57,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:21:57,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:21:57,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:21:57,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:21:57,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:21:57,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:21:57,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 570 transitions, 8377 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:57,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:21:57,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:21:57,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:21:58,069 INFO L124 PetriNetUnfolderBase]: 1768/3127 cut-off events. [2024-05-12 13:21:58,069 INFO L125 PetriNetUnfolderBase]: For 195320/195320 co-relation queries the response was YES. [2024-05-12 13:21:58,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23446 conditions, 3127 events. 1768/3127 cut-off events. For 195320/195320 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 19044 event pairs, 257 based on Foata normal form. 1/2955 useless extension candidates. Maximal degree in co-relation 23252. Up to 2426 conditions per place. [2024-05-12 13:21:58,117 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 428 selfloop transitions, 152 changer transitions 0/589 dead transitions. [2024-05-12 13:21:58,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 589 transitions, 9885 flow [2024-05-12 13:21:58,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:21:58,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:21:58,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions. [2024-05-12 13:21:58,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4325 [2024-05-12 13:21:58,118 INFO L175 Difference]: Start difference. First operand has 436 places, 570 transitions, 8377 flow. Second operand 10 states and 173 transitions. [2024-05-12 13:21:58,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 589 transitions, 9885 flow [2024-05-12 13:21:59,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 589 transitions, 9584 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-05-12 13:21:59,458 INFO L231 Difference]: Finished difference. Result has 436 places, 572 transitions, 8431 flow [2024-05-12 13:21:59,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8080, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8431, PETRI_PLACES=436, PETRI_TRANSITIONS=572} [2024-05-12 13:21:59,459 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 392 predicate places. [2024-05-12 13:21:59,459 INFO L495 AbstractCegarLoop]: Abstraction has has 436 places, 572 transitions, 8431 flow [2024-05-12 13:21:59,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:21:59,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:21:59,459 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:21:59,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2024-05-12 13:21:59,459 INFO L420 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:21:59,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:21:59,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1867283758, now seen corresponding path program 35 times [2024-05-12 13:21:59,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:21:59,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509004052] [2024-05-12 13:21:59,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:21:59,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:21:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:22:00,292 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:22:00,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:22:00,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509004052] [2024-05-12 13:22:00,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509004052] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:22:00,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:22:00,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:22:00,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286900780] [2024-05-12 13:22:00,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:22:00,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:22:00,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:22:00,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:22:00,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:22:00,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:22:00,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 572 transitions, 8431 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:22:00,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:22:00,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:22:00,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:22:01,237 INFO L124 PetriNetUnfolderBase]: 1764/3118 cut-off events. [2024-05-12 13:22:01,237 INFO L125 PetriNetUnfolderBase]: For 190577/190577 co-relation queries the response was YES. [2024-05-12 13:22:01,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23236 conditions, 3118 events. 1764/3118 cut-off events. For 190577/190577 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 19022 event pairs, 177 based on Foata normal form. 2/2948 useless extension candidates. Maximal degree in co-relation 23041. Up to 1699 conditions per place. [2024-05-12 13:22:01,282 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 333 selfloop transitions, 251 changer transitions 0/593 dead transitions. [2024-05-12 13:22:01,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 593 transitions, 9709 flow [2024-05-12 13:22:01,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:22:01,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:22:01,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2024-05-12 13:22:01,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4425 [2024-05-12 13:22:01,283 INFO L175 Difference]: Start difference. First operand has 436 places, 572 transitions, 8431 flow. Second operand 10 states and 177 transitions. [2024-05-12 13:22:01,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 593 transitions, 9709 flow [2024-05-12 13:22:02,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 593 transitions, 9356 flow, removed 30 selfloop flow, removed 7 redundant places. [2024-05-12 13:22:02,476 INFO L231 Difference]: Finished difference. Result has 439 places, 572 transitions, 8585 flow [2024-05-12 13:22:02,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8078, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=251, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8585, PETRI_PLACES=439, PETRI_TRANSITIONS=572} [2024-05-12 13:22:02,477 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 395 predicate places. [2024-05-12 13:22:02,478 INFO L495 AbstractCegarLoop]: Abstraction has has 439 places, 572 transitions, 8585 flow [2024-05-12 13:22:02,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:22:02,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:22:02,478 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:22:02,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2024-05-12 13:22:02,478 INFO L420 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:22:02,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:22:02,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1859406740, now seen corresponding path program 21 times [2024-05-12 13:22:02,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:22:02,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352651907] [2024-05-12 13:22:02,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:22:02,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:22:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:22:03,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:22:03,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:22:03,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352651907] [2024-05-12 13:22:03,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352651907] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:22:03,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:22:03,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:22:03,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40609244] [2024-05-12 13:22:03,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:22:03,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:22:03,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:22:03,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:22:03,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:22:03,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:22:03,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 572 transitions, 8585 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:22:03,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:22:03,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:22:03,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:22:04,423 INFO L124 PetriNetUnfolderBase]: 1762/3121 cut-off events. [2024-05-12 13:22:04,423 INFO L125 PetriNetUnfolderBase]: For 186195/186195 co-relation queries the response was YES. [2024-05-12 13:22:04,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23526 conditions, 3121 events. 1762/3121 cut-off events. For 186195/186195 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 19070 event pairs, 256 based on Foata normal form. 1/2949 useless extension candidates. Maximal degree in co-relation 23330. Up to 2418 conditions per place. [2024-05-12 13:22:04,470 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 424 selfloop transitions, 155 changer transitions 0/588 dead transitions. [2024-05-12 13:22:04,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 588 transitions, 9833 flow [2024-05-12 13:22:04,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:22:04,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:22:04,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-05-12 13:22:04,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-05-12 13:22:04,471 INFO L175 Difference]: Start difference. First operand has 439 places, 572 transitions, 8585 flow. Second operand 10 states and 170 transitions. [2024-05-12 13:22:04,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 588 transitions, 9833 flow [2024-05-12 13:22:05,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 588 transitions, 9280 flow, removed 16 selfloop flow, removed 10 redundant places. [2024-05-12 13:22:05,809 INFO L231 Difference]: Finished difference. Result has 439 places, 572 transitions, 8347 flow [2024-05-12 13:22:05,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8032, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8347, PETRI_PLACES=439, PETRI_TRANSITIONS=572} [2024-05-12 13:22:05,809 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 395 predicate places. [2024-05-12 13:22:05,809 INFO L495 AbstractCegarLoop]: Abstraction has has 439 places, 572 transitions, 8347 flow [2024-05-12 13:22:05,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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:22:05,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:22:05,810 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:22:05,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2024-05-12 13:22:05,810 INFO L420 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:22:05,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:22:05,810 INFO L85 PathProgramCache]: Analyzing trace with hash -39954794, now seen corresponding path program 1 times [2024-05-12 13:22:05,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:22:05,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124542990] [2024-05-12 13:22:05,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:22:05,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:22:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:22:06,936 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:22:06,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:22:06,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124542990] [2024-05-12 13:22:06,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124542990] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:22:06,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:22:06,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:22:06,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856835045] [2024-05-12 13:22:06,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:22:06,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:22:06,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:22:06,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:22:06,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:22:07,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:22:07,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 572 transitions, 8347 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:22:07,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:22:07,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:22:07,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:22:07,963 INFO L124 PetriNetUnfolderBase]: 1571/2893 cut-off events. [2024-05-12 13:22:07,964 INFO L125 PetriNetUnfolderBase]: For 191292/191334 co-relation queries the response was YES. [2024-05-12 13:22:07,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21973 conditions, 2893 events. 1571/2893 cut-off events. For 191292/191334 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 18375 event pairs, 249 based on Foata normal form. 17/2711 useless extension candidates. Maximal degree in co-relation 21776. Up to 2302 conditions per place. [2024-05-12 13:22:08,006 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 450 selfloop transitions, 75 changer transitions 0/599 dead transitions. [2024-05-12 13:22:08,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 599 transitions, 9537 flow [2024-05-12 13:22:08,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:22:08,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:22:08,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2024-05-12 13:22:08,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.465 [2024-05-12 13:22:08,007 INFO L175 Difference]: Start difference. First operand has 439 places, 572 transitions, 8347 flow. Second operand 10 states and 186 transitions. [2024-05-12 13:22:08,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 599 transitions, 9537 flow [2024-05-12 13:22:09,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 599 transitions, 9176 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-05-12 13:22:09,322 INFO L231 Difference]: Finished difference. Result has 439 places, 575 transitions, 8209 flow [2024-05-12 13:22:09,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7986, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8209, PETRI_PLACES=439, PETRI_TRANSITIONS=575} [2024-05-12 13:22:09,322 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 395 predicate places. [2024-05-12 13:22:09,322 INFO L495 AbstractCegarLoop]: Abstraction has has 439 places, 575 transitions, 8209 flow [2024-05-12 13:22:09,322 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:22:09,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:22:09,322 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:22:09,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2024-05-12 13:22:09,323 INFO L420 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:22:09,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:22:09,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1908054724, now seen corresponding path program 2 times [2024-05-12 13:22:09,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:22:09,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981680929] [2024-05-12 13:22:09,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:22:09,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:22:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:22:10,273 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:22:10,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:22:10,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981680929] [2024-05-12 13:22:10,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981680929] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:22:10,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:22:10,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:22:10,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771933218] [2024-05-12 13:22:10,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:22:10,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:22:10,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:22:10,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:22:10,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:22:10,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:22:10,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 575 transitions, 8209 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:22:10,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:22:10,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:22:10,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:22:11,331 INFO L124 PetriNetUnfolderBase]: 1619/2995 cut-off events. [2024-05-12 13:22:11,331 INFO L125 PetriNetUnfolderBase]: For 216212/216264 co-relation queries the response was YES. [2024-05-12 13:22:11,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22510 conditions, 2995 events. 1619/2995 cut-off events. For 216212/216264 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 19226 event pairs, 239 based on Foata normal form. 17/2800 useless extension candidates. Maximal degree in co-relation 22312. Up to 2361 conditions per place. [2024-05-12 13:22:11,374 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 461 selfloop transitions, 76 changer transitions 0/611 dead transitions. [2024-05-12 13:22:11,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 611 transitions, 9463 flow [2024-05-12 13:22:11,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:22:11,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:22:11,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions. [2024-05-12 13:22:11,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45681818181818185 [2024-05-12 13:22:11,375 INFO L175 Difference]: Start difference. First operand has 439 places, 575 transitions, 8209 flow. Second operand 11 states and 201 transitions. [2024-05-12 13:22:11,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 611 transitions, 9463 flow [2024-05-12 13:22:12,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 611 transitions, 9324 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-05-12 13:22:12,562 INFO L231 Difference]: Finished difference. Result has 444 places, 578 transitions, 8272 flow [2024-05-12 13:22:12,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8070, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=499, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8272, PETRI_PLACES=444, PETRI_TRANSITIONS=578} [2024-05-12 13:22:12,562 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 400 predicate places. [2024-05-12 13:22:12,562 INFO L495 AbstractCegarLoop]: Abstraction has has 444 places, 578 transitions, 8272 flow [2024-05-12 13:22:12,562 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:22:12,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:22:12,563 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:22:12,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2024-05-12 13:22:12,563 INFO L420 AbstractCegarLoop]: === Iteration 144 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:22:12,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:22:12,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1818476194, now seen corresponding path program 3 times [2024-05-12 13:22:12,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:22:12,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715180735] [2024-05-12 13:22:12,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:22:12,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:22:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:22:13,557 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:22:13,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:22:13,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715180735] [2024-05-12 13:22:13,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715180735] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:22:13,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:22:13,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:22:13,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962496548] [2024-05-12 13:22:13,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:22:13,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:22:13,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:22:13,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:22:13,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:22:13,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:22:13,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 578 transitions, 8272 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:22:13,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:22:13,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:22:13,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:22:14,590 INFO L124 PetriNetUnfolderBase]: 1632/3017 cut-off events. [2024-05-12 13:22:14,590 INFO L125 PetriNetUnfolderBase]: For 210171/210228 co-relation queries the response was YES. [2024-05-12 13:22:14,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22677 conditions, 3017 events. 1632/3017 cut-off events. For 210171/210228 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 19490 event pairs, 268 based on Foata normal form. 19/2830 useless extension candidates. Maximal degree in co-relation 22477. Up to 2396 conditions per place. [2024-05-12 13:22:14,637 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 454 selfloop transitions, 83 changer transitions 0/611 dead transitions. [2024-05-12 13:22:14,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 611 transitions, 9518 flow [2024-05-12 13:22:14,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:22:14,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:22:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2024-05-12 13:22:14,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-05-12 13:22:14,639 INFO L175 Difference]: Start difference. First operand has 444 places, 578 transitions, 8272 flow. Second operand 11 states and 198 transitions. [2024-05-12 13:22:14,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 611 transitions, 9518 flow [2024-05-12 13:22:15,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 611 transitions, 9350 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-05-12 13:22:15,963 INFO L231 Difference]: Finished difference. Result has 447 places, 580 transitions, 8314 flow [2024-05-12 13:22:15,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8104, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8314, PETRI_PLACES=447, PETRI_TRANSITIONS=580} [2024-05-12 13:22:15,964 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 403 predicate places. [2024-05-12 13:22:15,964 INFO L495 AbstractCegarLoop]: Abstraction has has 447 places, 580 transitions, 8314 flow [2024-05-12 13:22:15,964 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:22:15,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:22:15,965 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:22:15,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2024-05-12 13:22:15,965 INFO L420 AbstractCegarLoop]: === Iteration 145 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:22:15,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:22:15,966 INFO L85 PathProgramCache]: Analyzing trace with hash -2105912438, now seen corresponding path program 1 times [2024-05-12 13:22:15,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:22:15,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117685145] [2024-05-12 13:22:15,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:22:15,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:22:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:22:17,124 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:22:17,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:22:17,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117685145] [2024-05-12 13:22:17,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117685145] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:22:17,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:22:17,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:22:17,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343598858] [2024-05-12 13:22:17,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:22:17,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:22:17,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:22:17,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:22:17,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:22:17,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:22:17,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 580 transitions, 8314 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:22:17,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:22:17,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:22:17,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:22:18,240 INFO L124 PetriNetUnfolderBase]: 1836/3268 cut-off events. [2024-05-12 13:22:18,241 INFO L125 PetriNetUnfolderBase]: For 198393/198393 co-relation queries the response was YES. [2024-05-12 13:22:18,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23774 conditions, 3268 events. 1836/3268 cut-off events. For 198393/198393 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 20350 event pairs, 383 based on Foata normal form. 1/3094 useless extension candidates. Maximal degree in co-relation 23573. Up to 2851 conditions per place. [2024-05-12 13:22:18,290 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 512 selfloop transitions, 87 changer transitions 0/608 dead transitions. [2024-05-12 13:22:18,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 608 transitions, 9678 flow [2024-05-12 13:22:18,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:22:18,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:22:18,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 199 transitions. [2024-05-12 13:22:18,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41458333333333336 [2024-05-12 13:22:18,291 INFO L175 Difference]: Start difference. First operand has 447 places, 580 transitions, 8314 flow. Second operand 12 states and 199 transitions. [2024-05-12 13:22:18,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 608 transitions, 9678 flow [2024-05-12 13:22:19,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 608 transitions, 9494 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-05-12 13:22:19,422 INFO L231 Difference]: Finished difference. Result has 450 places, 582 transitions, 8362 flow [2024-05-12 13:22:19,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8130, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8362, PETRI_PLACES=450, PETRI_TRANSITIONS=582} [2024-05-12 13:22:19,423 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 406 predicate places. [2024-05-12 13:22:19,423 INFO L495 AbstractCegarLoop]: Abstraction has has 450 places, 582 transitions, 8362 flow [2024-05-12 13:22:19,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:22:19,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:22:19,424 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:22:19,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2024-05-12 13:22:19,424 INFO L420 AbstractCegarLoop]: === Iteration 146 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:22:19,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:22:19,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1489751872, now seen corresponding path program 4 times [2024-05-12 13:22:19,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:22:19,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632268736] [2024-05-12 13:22:19,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:22:19,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:22:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:22:20,417 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:22:20,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:22:20,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632268736] [2024-05-12 13:22:20,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632268736] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:22:20,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:22:20,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:22:20,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852945598] [2024-05-12 13:22:20,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:22:20,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:22:20,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:22:20,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:22:20,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:22:20,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:22:20,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 582 transitions, 8362 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:22:20,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:22:20,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:22:20,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:22:21,598 INFO L124 PetriNetUnfolderBase]: 1678/3121 cut-off events. [2024-05-12 13:22:21,599 INFO L125 PetriNetUnfolderBase]: For 208042/208084 co-relation queries the response was YES. [2024-05-12 13:22:21,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22909 conditions, 3121 events. 1678/3121 cut-off events. For 208042/208084 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 20381 event pairs, 206 based on Foata normal form. 17/2926 useless extension candidates. Maximal degree in co-relation 22707. Up to 2391 conditions per place. [2024-05-12 13:22:21,646 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 471 selfloop transitions, 80 changer transitions 0/625 dead transitions. [2024-05-12 13:22:21,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 625 transitions, 9698 flow [2024-05-12 13:22:21,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:22:21,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:22:21,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2024-05-12 13:22:21,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4590909090909091 [2024-05-12 13:22:21,647 INFO L175 Difference]: Start difference. First operand has 450 places, 582 transitions, 8362 flow. Second operand 11 states and 202 transitions. [2024-05-12 13:22:21,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 625 transitions, 9698 flow [2024-05-12 13:22:23,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 625 transitions, 9492 flow, removed 19 selfloop flow, removed 10 redundant places. [2024-05-12 13:22:23,055 INFO L231 Difference]: Finished difference. Result has 453 places, 591 transitions, 8439 flow [2024-05-12 13:22:23,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8156, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8439, PETRI_PLACES=453, PETRI_TRANSITIONS=591} [2024-05-12 13:22:23,056 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 409 predicate places. [2024-05-12 13:22:23,056 INFO L495 AbstractCegarLoop]: Abstraction has has 453 places, 591 transitions, 8439 flow [2024-05-12 13:22:23,056 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:22:23,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:22:23,056 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:22:23,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2024-05-12 13:22:23,056 INFO L420 AbstractCegarLoop]: === Iteration 147 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:22:23,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:22:23,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1818470242, now seen corresponding path program 2 times [2024-05-12 13:22:23,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:22:23,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896477250] [2024-05-12 13:22:23,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:22:23,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:22:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:22:24,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:22:24,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:22:24,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896477250] [2024-05-12 13:22:24,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896477250] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:22:24,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:22:24,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:22:24,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546802893] [2024-05-12 13:22:24,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:22:24,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:22:24,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:22:24,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:22:24,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:22:24,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:22:24,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 591 transitions, 8439 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:22:24,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:22:24,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:22:24,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:22:25,366 INFO L124 PetriNetUnfolderBase]: 1889/3383 cut-off events. [2024-05-12 13:22:25,367 INFO L125 PetriNetUnfolderBase]: For 207539/207539 co-relation queries the response was YES. [2024-05-12 13:22:25,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24683 conditions, 3383 events. 1889/3383 cut-off events. For 207539/207539 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 21329 event pairs, 393 based on Foata normal form. 1/3201 useless extension candidates. Maximal degree in co-relation 24478. Up to 2942 conditions per place. [2024-05-12 13:22:25,411 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 521 selfloop transitions, 93 changer transitions 0/623 dead transitions. [2024-05-12 13:22:25,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 623 transitions, 9877 flow [2024-05-12 13:22:25,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:22:25,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:22:25,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 199 transitions. [2024-05-12 13:22:25,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41458333333333336 [2024-05-12 13:22:25,412 INFO L175 Difference]: Start difference. First operand has 453 places, 591 transitions, 8439 flow. Second operand 12 states and 199 transitions. [2024-05-12 13:22:25,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 623 transitions, 9877 flow [2024-05-12 13:22:26,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 623 transitions, 9738 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-05-12 13:22:26,863 INFO L231 Difference]: Finished difference. Result has 458 places, 595 transitions, 8566 flow [2024-05-12 13:22:26,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8300, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8566, PETRI_PLACES=458, PETRI_TRANSITIONS=595} [2024-05-12 13:22:26,863 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 414 predicate places. [2024-05-12 13:22:26,864 INFO L495 AbstractCegarLoop]: Abstraction has has 458 places, 595 transitions, 8566 flow [2024-05-12 13:22:26,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:22:26,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:22:26,864 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:22:26,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2024-05-12 13:22:26,864 INFO L420 AbstractCegarLoop]: === Iteration 148 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:22:26,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:22:26,865 INFO L85 PathProgramCache]: Analyzing trace with hash 2099470376, now seen corresponding path program 5 times [2024-05-12 13:22:26,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:22:26,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088145251] [2024-05-12 13:22:26,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:22:26,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:22:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:22:27,985 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:22:27,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:22:27,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088145251] [2024-05-12 13:22:27,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088145251] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:22:27,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:22:27,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:22:27,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388015363] [2024-05-12 13:22:27,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:22:27,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:22:27,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:22:27,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:22:27,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:22:28,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:22:28,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 595 transitions, 8566 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:22:28,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:22:28,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:22:28,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:22:29,140 INFO L124 PetriNetUnfolderBase]: 1749/3278 cut-off events. [2024-05-12 13:22:29,140 INFO L125 PetriNetUnfolderBase]: For 217110/217152 co-relation queries the response was YES. [2024-05-12 13:22:29,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24151 conditions, 3278 events. 1749/3278 cut-off events. For 217110/217152 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 21780 event pairs, 290 based on Foata normal form. 17/3071 useless extension candidates. Maximal degree in co-relation 23945. Up to 2556 conditions per place. [2024-05-12 13:22:29,192 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 483 selfloop transitions, 78 changer transitions 0/635 dead transitions. [2024-05-12 13:22:29,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 635 transitions, 9934 flow [2024-05-12 13:22:29,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:22:29,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:22:29,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions. [2024-05-12 13:22:29,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45681818181818185 [2024-05-12 13:22:29,193 INFO L175 Difference]: Start difference. First operand has 458 places, 595 transitions, 8566 flow. Second operand 11 states and 201 transitions. [2024-05-12 13:22:29,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 635 transitions, 9934 flow [2024-05-12 13:22:31,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 635 transitions, 9718 flow, removed 19 selfloop flow, removed 10 redundant places. [2024-05-12 13:22:31,121 INFO L231 Difference]: Finished difference. Result has 460 places, 604 transitions, 8642 flow [2024-05-12 13:22:31,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8350, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8642, PETRI_PLACES=460, PETRI_TRANSITIONS=604} [2024-05-12 13:22:31,122 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 416 predicate places. [2024-05-12 13:22:31,122 INFO L495 AbstractCegarLoop]: Abstraction has has 460 places, 604 transitions, 8642 flow [2024-05-12 13:22:31,122 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:22:31,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:22:31,122 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:22:31,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2024-05-12 13:22:31,122 INFO L420 AbstractCegarLoop]: === Iteration 149 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:22:31,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:22:31,123 INFO L85 PathProgramCache]: Analyzing trace with hash -36217146, now seen corresponding path program 6 times [2024-05-12 13:22:31,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:22:31,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451501823] [2024-05-12 13:22:31,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:22:31,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:22:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:22:32,172 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:22:32,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:22:32,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451501823] [2024-05-12 13:22:32,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451501823] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:22:32,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:22:32,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:22:32,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601110283] [2024-05-12 13:22:32,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:22:32,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:22:32,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:22:32,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:22:32,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:22:32,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:22:32,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 604 transitions, 8642 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:22:32,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:22:32,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:22:32,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:22:33,318 INFO L124 PetriNetUnfolderBase]: 1786/3366 cut-off events. [2024-05-12 13:22:33,318 INFO L125 PetriNetUnfolderBase]: For 223566/223623 co-relation queries the response was YES. [2024-05-12 13:22:33,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24718 conditions, 3366 events. 1786/3366 cut-off events. For 223566/223623 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 22617 event pairs, 319 based on Foata normal form. 22/3156 useless extension candidates. Maximal degree in co-relation 24510. Up to 2663 conditions per place. [2024-05-12 13:22:33,370 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 482 selfloop transitions, 80 changer transitions 0/636 dead transitions. [2024-05-12 13:22:33,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 636 transitions, 9956 flow [2024-05-12 13:22:33,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:22:33,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:22:33,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2024-05-12 13:22:33,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-05-12 13:22:33,371 INFO L175 Difference]: Start difference. First operand has 460 places, 604 transitions, 8642 flow. Second operand 11 states and 198 transitions. [2024-05-12 13:22:33,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 470 places, 636 transitions, 9956 flow [2024-05-12 13:22:35,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 636 transitions, 9792 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-05-12 13:22:35,014 INFO L231 Difference]: Finished difference. Result has 463 places, 607 transitions, 8699 flow [2024-05-12 13:22:35,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8478, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8699, PETRI_PLACES=463, PETRI_TRANSITIONS=607} [2024-05-12 13:22:35,014 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 419 predicate places. [2024-05-12 13:22:35,014 INFO L495 AbstractCegarLoop]: Abstraction has has 463 places, 607 transitions, 8699 flow [2024-05-12 13:22:35,014 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:22:35,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:22:35,014 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:22:35,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2024-05-12 13:22:35,015 INFO L420 AbstractCegarLoop]: === Iteration 150 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:22:35,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:22:35,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1477938910, now seen corresponding path program 7 times [2024-05-12 13:22:35,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:22:35,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286496152] [2024-05-12 13:22:35,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:22:35,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:22:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:22:36,044 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:22:36,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:22:36,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286496152] [2024-05-12 13:22:36,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286496152] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:22:36,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:22:36,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:22:36,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16801772] [2024-05-12 13:22:36,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:22:36,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:22:36,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:22:36,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:22:36,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:22:36,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:22:36,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 607 transitions, 8699 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:22:36,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:22:36,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:22:36,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:22:37,268 INFO L124 PetriNetUnfolderBase]: 1801/3400 cut-off events. [2024-05-12 13:22:37,268 INFO L125 PetriNetUnfolderBase]: For 227587/227635 co-relation queries the response was YES. [2024-05-12 13:22:37,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24946 conditions, 3400 events. 1801/3400 cut-off events. For 227587/227635 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 22894 event pairs, 330 based on Foata normal form. 17/3186 useless extension candidates. Maximal degree in co-relation 24737. Up to 2742 conditions per place. [2024-05-12 13:22:37,326 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 503 selfloop transitions, 64 changer transitions 0/641 dead transitions. [2024-05-12 13:22:37,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 641 transitions, 10106 flow [2024-05-12 13:22:37,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:22:37,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:22:37,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 195 transitions. [2024-05-12 13:22:37,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2024-05-12 13:22:37,328 INFO L175 Difference]: Start difference. First operand has 463 places, 607 transitions, 8699 flow. Second operand 11 states and 195 transitions. [2024-05-12 13:22:37,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 641 transitions, 10106 flow [2024-05-12 13:22:38,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 464 places, 641 transitions, 9925 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-05-12 13:22:38,986 INFO L231 Difference]: Finished difference. Result has 466 places, 613 transitions, 8791 flow [2024-05-12 13:22:38,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8518, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8791, PETRI_PLACES=466, PETRI_TRANSITIONS=613} [2024-05-12 13:22:38,987 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 422 predicate places. [2024-05-12 13:22:38,987 INFO L495 AbstractCegarLoop]: Abstraction has has 466 places, 613 transitions, 8791 flow [2024-05-12 13:22:38,987 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:22:38,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:22:38,987 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:22:38,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2024-05-12 13:22:38,988 INFO L420 AbstractCegarLoop]: === Iteration 151 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:22:38,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:22:38,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1503119311, now seen corresponding path program 1 times [2024-05-12 13:22:38,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:22:38,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720766636] [2024-05-12 13:22:38,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:22:38,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:22:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:22:39,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:22:39,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:22:39,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720766636] [2024-05-12 13:22:39,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720766636] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:22:39,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:22:39,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:22:39,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517436801] [2024-05-12 13:22:39,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:22:39,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:22:39,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:22:39,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:22:39,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:22:39,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:22:39,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 613 transitions, 8791 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:22:39,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:22:39,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:22:39,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:22:41,029 INFO L124 PetriNetUnfolderBase]: 2017/3669 cut-off events. [2024-05-12 13:22:41,029 INFO L125 PetriNetUnfolderBase]: For 230584/230584 co-relation queries the response was YES. [2024-05-12 13:22:41,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26517 conditions, 3669 events. 2017/3669 cut-off events. For 230584/230584 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 23931 event pairs, 432 based on Foata normal form. 2/3472 useless extension candidates. Maximal degree in co-relation 26306. Up to 3160 conditions per place. [2024-05-12 13:22:41,089 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 555 selfloop transitions, 80 changer transitions 0/644 dead transitions. [2024-05-12 13:22:41,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 644 transitions, 10269 flow [2024-05-12 13:22:41,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:22:41,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:22:41,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 200 transitions. [2024-05-12 13:22:41,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-05-12 13:22:41,091 INFO L175 Difference]: Start difference. First operand has 466 places, 613 transitions, 8791 flow. Second operand 12 states and 200 transitions. [2024-05-12 13:22:41,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 644 transitions, 10269 flow [2024-05-12 13:22:42,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 470 places, 644 transitions, 10126 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-05-12 13:22:42,832 INFO L231 Difference]: Finished difference. Result has 471 places, 615 transitions, 8868 flow [2024-05-12 13:22:42,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8648, PETRI_DIFFERENCE_MINUEND_PLACES=459, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=533, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8868, PETRI_PLACES=471, PETRI_TRANSITIONS=615} [2024-05-12 13:22:42,832 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 427 predicate places. [2024-05-12 13:22:42,832 INFO L495 AbstractCegarLoop]: Abstraction has has 471 places, 615 transitions, 8868 flow [2024-05-12 13:22:42,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:22:42,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:22:42,833 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:22:42,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2024-05-12 13:22:42,833 INFO L420 AbstractCegarLoop]: === Iteration 152 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:22:42,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:22:42,833 INFO L85 PathProgramCache]: Analyzing trace with hash -952933880, now seen corresponding path program 8 times [2024-05-12 13:22:42,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:22:42,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138026343] [2024-05-12 13:22:42,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:22:42,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:22:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:22:43,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:22:43,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:22:43,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138026343] [2024-05-12 13:22:43,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138026343] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:22:43,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:22:43,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:22:43,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602769359] [2024-05-12 13:22:43,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:22:43,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:22:43,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:22:43,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:22:43,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:22:43,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:22:43,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 615 transitions, 8868 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:22:43,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:22:43,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:22:43,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:22:45,188 INFO L124 PetriNetUnfolderBase]: 1895/3614 cut-off events. [2024-05-12 13:22:45,188 INFO L125 PetriNetUnfolderBase]: For 234430/234481 co-relation queries the response was YES. [2024-05-12 13:22:45,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26003 conditions, 3614 events. 1895/3614 cut-off events. For 234430/234481 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 24920 event pairs, 338 based on Foata normal form. 17/3383 useless extension candidates. Maximal degree in co-relation 25791. Up to 2800 conditions per place. [2024-05-12 13:22:45,246 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 504 selfloop transitions, 78 changer transitions 0/656 dead transitions. [2024-05-12 13:22:45,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 656 transitions, 10318 flow [2024-05-12 13:22:45,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:22:45,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:22:45,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions. [2024-05-12 13:22:45,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45681818181818185 [2024-05-12 13:22:45,247 INFO L175 Difference]: Start difference. First operand has 471 places, 615 transitions, 8868 flow. Second operand 11 states and 201 transitions. [2024-05-12 13:22:45,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 656 transitions, 10318 flow [2024-05-12 13:22:47,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 656 transitions, 10124 flow, removed 20 selfloop flow, removed 10 redundant places. [2024-05-12 13:22:47,121 INFO L231 Difference]: Finished difference. Result has 473 places, 627 transitions, 9030 flow [2024-05-12 13:22:47,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8674, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9030, PETRI_PLACES=473, PETRI_TRANSITIONS=627} [2024-05-12 13:22:47,122 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 429 predicate places. [2024-05-12 13:22:47,122 INFO L495 AbstractCegarLoop]: Abstraction has has 473 places, 627 transitions, 9030 flow [2024-05-12 13:22:47,122 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:22:47,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:22:47,122 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:22:47,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2024-05-12 13:22:47,123 INFO L420 AbstractCegarLoop]: === Iteration 153 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:22:47,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:22:47,123 INFO L85 PathProgramCache]: Analyzing trace with hash -782158414, now seen corresponding path program 9 times [2024-05-12 13:22:47,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:22:47,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067081380] [2024-05-12 13:22:47,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:22:47,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:22:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:22:48,090 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:22:48,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:22:48,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067081380] [2024-05-12 13:22:48,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067081380] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:22:48,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:22:48,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:22:48,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681284106] [2024-05-12 13:22:48,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:22:48,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:22:48,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:22:48,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:22:48,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:22:48,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:22:48,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 627 transitions, 9030 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:22:48,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:22:48,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:22:48,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:22:49,460 INFO L124 PetriNetUnfolderBase]: 1923/3681 cut-off events. [2024-05-12 13:22:49,460 INFO L125 PetriNetUnfolderBase]: For 241798/241861 co-relation queries the response was YES. [2024-05-12 13:22:49,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26551 conditions, 3681 events. 1923/3681 cut-off events. For 241798/241861 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 25539 event pairs, 374 based on Foata normal form. 21/3450 useless extension candidates. Maximal degree in co-relation 26337. Up to 2953 conditions per place. [2024-05-12 13:22:49,520 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 522 selfloop transitions, 64 changer transitions 0/660 dead transitions. [2024-05-12 13:22:49,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 660 transitions, 10460 flow [2024-05-12 13:22:49,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:22:49,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:22:49,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 195 transitions. [2024-05-12 13:22:49,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2024-05-12 13:22:49,521 INFO L175 Difference]: Start difference. First operand has 473 places, 627 transitions, 9030 flow. Second operand 11 states and 195 transitions. [2024-05-12 13:22:49,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 660 transitions, 10460 flow [2024-05-12 13:22:51,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 660 transitions, 10296 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-05-12 13:22:51,317 INFO L231 Difference]: Finished difference. Result has 477 places, 634 transitions, 9144 flow [2024-05-12 13:22:51,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8866, PETRI_DIFFERENCE_MINUEND_PLACES=465, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9144, PETRI_PLACES=477, PETRI_TRANSITIONS=634} [2024-05-12 13:22:51,317 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 433 predicate places. [2024-05-12 13:22:51,318 INFO L495 AbstractCegarLoop]: Abstraction has has 477 places, 634 transitions, 9144 flow [2024-05-12 13:22:51,318 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:22:51,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:22:51,318 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:22:51,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2024-05-12 13:22:51,318 INFO L420 AbstractCegarLoop]: === Iteration 154 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:22:51,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:22:51,318 INFO L85 PathProgramCache]: Analyzing trace with hash -94279446, now seen corresponding path program 3 times [2024-05-12 13:22:51,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:22:51,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702450241] [2024-05-12 13:22:51,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:22:51,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:22:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:22:52,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:22:52,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:22:52,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702450241] [2024-05-12 13:22:52,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702450241] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:22:52,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:22:52,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:22:52,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031857315] [2024-05-12 13:22:52,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:22:52,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:22:52,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:22:52,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:22:52,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:22:52,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:22:52,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 634 transitions, 9144 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:22:52,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:22:52,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:22:52,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:22:53,873 INFO L124 PetriNetUnfolderBase]: 2138/3951 cut-off events. [2024-05-12 13:22:53,873 INFO L125 PetriNetUnfolderBase]: For 237659/237659 co-relation queries the response was YES. [2024-05-12 13:22:53,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28279 conditions, 3951 events. 2138/3951 cut-off events. For 237659/237659 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 26601 event pairs, 473 based on Foata normal form. 1/3728 useless extension candidates. Maximal degree in co-relation 28063. Up to 3394 conditions per place. [2024-05-12 13:22:53,938 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 567 selfloop transitions, 88 changer transitions 0/664 dead transitions. [2024-05-12 13:22:53,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 664 transitions, 10662 flow [2024-05-12 13:22:53,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:22:53,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:22:53,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 199 transitions. [2024-05-12 13:22:53,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41458333333333336 [2024-05-12 13:22:53,939 INFO L175 Difference]: Start difference. First operand has 477 places, 634 transitions, 9144 flow. Second operand 12 states and 199 transitions. [2024-05-12 13:22:53,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 664 transitions, 10662 flow [2024-05-12 13:22:55,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 664 transitions, 10528 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-05-12 13:22:55,909 INFO L231 Difference]: Finished difference. Result has 482 places, 640 transitions, 9298 flow [2024-05-12 13:22:55,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9010, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9298, PETRI_PLACES=482, PETRI_TRANSITIONS=640} [2024-05-12 13:22:55,910 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 438 predicate places. [2024-05-12 13:22:55,910 INFO L495 AbstractCegarLoop]: Abstraction has has 482 places, 640 transitions, 9298 flow [2024-05-12 13:22:55,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:22:55,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:22:55,910 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:22:55,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2024-05-12 13:22:55,910 INFO L420 AbstractCegarLoop]: === Iteration 155 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:22:55,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:22:55,911 INFO L85 PathProgramCache]: Analyzing trace with hash -781942933, now seen corresponding path program 2 times [2024-05-12 13:22:55,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:22:55,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164465299] [2024-05-12 13:22:55,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:22:55,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:22:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:22:56,753 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:22:56,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:22:56,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164465299] [2024-05-12 13:22:56,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164465299] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:22:56,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:22:56,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:22:56,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958871996] [2024-05-12 13:22:56,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:22:56,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:22:56,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:22:56,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:22:56,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:22:56,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:22:56,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 640 transitions, 9298 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:22:56,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:22:56,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:22:56,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:22:58,217 INFO L124 PetriNetUnfolderBase]: 2152/3973 cut-off events. [2024-05-12 13:22:58,217 INFO L125 PetriNetUnfolderBase]: For 246570/246570 co-relation queries the response was YES. [2024-05-12 13:22:58,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28381 conditions, 3973 events. 2152/3973 cut-off events. For 246570/246570 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 26751 event pairs, 477 based on Foata normal form. 2/3752 useless extension candidates. Maximal degree in co-relation 28164. Up to 3401 conditions per place. [2024-05-12 13:22:58,275 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 582 selfloop transitions, 80 changer transitions 0/671 dead transitions. [2024-05-12 13:22:58,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 671 transitions, 10840 flow [2024-05-12 13:22:58,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:22:58,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:22:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 200 transitions. [2024-05-12 13:22:58,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-05-12 13:22:58,276 INFO L175 Difference]: Start difference. First operand has 482 places, 640 transitions, 9298 flow. Second operand 12 states and 200 transitions. [2024-05-12 13:22:58,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 671 transitions, 10840 flow [2024-05-12 13:23:00,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 671 transitions, 10634 flow, removed 20 selfloop flow, removed 10 redundant places. [2024-05-12 13:23:00,028 INFO L231 Difference]: Finished difference. Result has 484 places, 644 transitions, 9336 flow [2024-05-12 13:23:00,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9092, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9336, PETRI_PLACES=484, PETRI_TRANSITIONS=644} [2024-05-12 13:23:00,029 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 440 predicate places. [2024-05-12 13:23:00,029 INFO L495 AbstractCegarLoop]: Abstraction has has 484 places, 644 transitions, 9336 flow [2024-05-12 13:23:00,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:23:00,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:23:00,029 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:23:00,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2024-05-12 13:23:00,029 INFO L420 AbstractCegarLoop]: === Iteration 156 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:23:00,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:23:00,029 INFO L85 PathProgramCache]: Analyzing trace with hash 390155004, now seen corresponding path program 10 times [2024-05-12 13:23:00,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:23:00,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96424381] [2024-05-12 13:23:00,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:23:00,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:23:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:23:00,992 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:23:00,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:23:00,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96424381] [2024-05-12 13:23:00,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96424381] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:23:00,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:23:00,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:23:00,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112827913] [2024-05-12 13:23:00,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:23:00,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:23:00,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:23:00,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:23:00,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:23:01,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:23:01,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 644 transitions, 9336 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:23:01,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:23:01,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:23:01,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:23:02,451 INFO L124 PetriNetUnfolderBase]: 1962/3755 cut-off events. [2024-05-12 13:23:02,451 INFO L125 PetriNetUnfolderBase]: For 252480/252550 co-relation queries the response was YES. [2024-05-12 13:23:02,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27147 conditions, 3755 events. 1962/3755 cut-off events. For 252480/252550 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 26189 event pairs, 361 based on Foata normal form. 22/3515 useless extension candidates. Maximal degree in co-relation 26929. Up to 2997 conditions per place. [2024-05-12 13:23:02,504 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 518 selfloop transitions, 83 changer transitions 0/675 dead transitions. [2024-05-12 13:23:02,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 675 transitions, 10784 flow [2024-05-12 13:23:02,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:23:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:23:02,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions. [2024-05-12 13:23:02,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44545454545454544 [2024-05-12 13:23:02,506 INFO L175 Difference]: Start difference. First operand has 484 places, 644 transitions, 9336 flow. Second operand 11 states and 196 transitions. [2024-05-12 13:23:02,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 494 places, 675 transitions, 10784 flow [2024-05-12 13:23:04,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 485 places, 675 transitions, 10608 flow, removed 21 selfloop flow, removed 9 redundant places. [2024-05-12 13:23:04,161 INFO L231 Difference]: Finished difference. Result has 487 places, 649 transitions, 9447 flow [2024-05-12 13:23:04,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9160, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=644, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9447, PETRI_PLACES=487, PETRI_TRANSITIONS=649} [2024-05-12 13:23:04,161 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 443 predicate places. [2024-05-12 13:23:04,161 INFO L495 AbstractCegarLoop]: Abstraction has has 487 places, 649 transitions, 9447 flow [2024-05-12 13:23:04,162 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:23:04,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:23:04,162 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:23:04,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2024-05-12 13:23:04,162 INFO L420 AbstractCegarLoop]: === Iteration 157 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:23:04,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:23:04,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1145572335, now seen corresponding path program 3 times [2024-05-12 13:23:04,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:23:04,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960469459] [2024-05-12 13:23:04,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:23:04,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:23:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:23:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:23:04,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:23:04,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960469459] [2024-05-12 13:23:04,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960469459] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:23:04,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:23:04,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:23:04,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689171380] [2024-05-12 13:23:04,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:23:04,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:23:04,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:23:04,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:23:04,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:23:05,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:23:05,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 649 transitions, 9447 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:23:05,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:23:05,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:23:05,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:23:06,352 INFO L124 PetriNetUnfolderBase]: 2210/4079 cut-off events. [2024-05-12 13:23:06,352 INFO L125 PetriNetUnfolderBase]: For 290027/290027 co-relation queries the response was YES. [2024-05-12 13:23:06,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30152 conditions, 4079 events. 2210/4079 cut-off events. For 290027/290027 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 27659 event pairs, 425 based on Foata normal form. 2/3854 useless extension candidates. Maximal degree in co-relation 29932. Up to 3237 conditions per place. [2024-05-12 13:23:06,416 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 539 selfloop transitions, 137 changer transitions 0/685 dead transitions. [2024-05-12 13:23:06,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 685 transitions, 11645 flow [2024-05-12 13:23:06,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:23:06,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:23:06,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 208 transitions. [2024-05-12 13:23:06,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-05-12 13:23:06,417 INFO L175 Difference]: Start difference. First operand has 487 places, 649 transitions, 9447 flow. Second operand 12 states and 208 transitions. [2024-05-12 13:23:06,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 685 transitions, 11645 flow [2024-05-12 13:23:08,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 489 places, 685 transitions, 11389 flow, removed 22 selfloop flow, removed 9 redundant places. [2024-05-12 13:23:08,537 INFO L231 Difference]: Finished difference. Result has 490 places, 655 transitions, 9650 flow [2024-05-12 13:23:08,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9191, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9650, PETRI_PLACES=490, PETRI_TRANSITIONS=655} [2024-05-12 13:23:08,537 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 446 predicate places. [2024-05-12 13:23:08,537 INFO L495 AbstractCegarLoop]: Abstraction has has 490 places, 655 transitions, 9650 flow [2024-05-12 13:23:08,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:23:08,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:23:08,538 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:23:08,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2024-05-12 13:23:08,538 INFO L420 AbstractCegarLoop]: === Iteration 158 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:23:08,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:23:08,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1171729856, now seen corresponding path program 1 times [2024-05-12 13:23:08,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:23:08,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391806776] [2024-05-12 13:23:08,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:23:08,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:23:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:23:09,521 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:23:09,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:23:09,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391806776] [2024-05-12 13:23:09,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391806776] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:23:09,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:23:09,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:23:09,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85683649] [2024-05-12 13:23:09,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:23:09,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:23:09,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:23:09,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:23:09,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:23:09,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:23:09,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 655 transitions, 9650 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:23:09,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:23:09,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:23:09,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:23:10,856 INFO L124 PetriNetUnfolderBase]: 2216/4090 cut-off events. [2024-05-12 13:23:10,857 INFO L125 PetriNetUnfolderBase]: For 284323/284323 co-relation queries the response was YES. [2024-05-12 13:23:10,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30199 conditions, 4090 events. 2216/4090 cut-off events. For 284323/284323 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 27705 event pairs, 501 based on Foata normal form. 1/3861 useless extension candidates. Maximal degree in co-relation 29978. Up to 3580 conditions per place. [2024-05-12 13:23:10,927 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 618 selfloop transitions, 54 changer transitions 0/681 dead transitions. [2024-05-12 13:23:10,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 501 places, 681 transitions, 11178 flow [2024-05-12 13:23:10,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:23:10,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:23:10,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 193 transitions. [2024-05-12 13:23:10,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40208333333333335 [2024-05-12 13:23:10,928 INFO L175 Difference]: Start difference. First operand has 490 places, 655 transitions, 9650 flow. Second operand 12 states and 193 transitions. [2024-05-12 13:23:10,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 501 places, 681 transitions, 11178 flow [2024-05-12 13:23:13,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 681 transitions, 11012 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-05-12 13:23:13,261 INFO L231 Difference]: Finished difference. Result has 495 places, 657 transitions, 9651 flow [2024-05-12 13:23:13,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9484, PETRI_DIFFERENCE_MINUEND_PLACES=483, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9651, PETRI_PLACES=495, PETRI_TRANSITIONS=657} [2024-05-12 13:23:13,261 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 451 predicate places. [2024-05-12 13:23:13,261 INFO L495 AbstractCegarLoop]: Abstraction has has 495 places, 657 transitions, 9651 flow [2024-05-12 13:23:13,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:23:13,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:23:13,261 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:23:13,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2024-05-12 13:23:13,262 INFO L420 AbstractCegarLoop]: === Iteration 159 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:23:13,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:23:13,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1171404015, now seen corresponding path program 4 times [2024-05-12 13:23:13,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:23:13,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879727535] [2024-05-12 13:23:13,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:23:13,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:23:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:23:14,095 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:23:14,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:23:14,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879727535] [2024-05-12 13:23:14,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879727535] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:23:14,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:23:14,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:23:14,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190787103] [2024-05-12 13:23:14,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:23:14,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:23:14,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:23:14,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:23:14,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:23:14,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:23:14,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 657 transitions, 9651 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:23:14,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:23:14,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:23:14,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:23:15,394 INFO L124 PetriNetUnfolderBase]: 2227/4112 cut-off events. [2024-05-12 13:23:15,395 INFO L125 PetriNetUnfolderBase]: For 295291/295291 co-relation queries the response was YES. [2024-05-12 13:23:15,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30372 conditions, 4112 events. 2227/4112 cut-off events. For 295291/295291 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 27904 event pairs, 407 based on Foata normal form. 2/3885 useless extension candidates. Maximal degree in co-relation 30149. Up to 3256 conditions per place. [2024-05-12 13:23:15,461 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 531 selfloop transitions, 149 changer transitions 0/689 dead transitions. [2024-05-12 13:23:15,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 506 places, 689 transitions, 11749 flow [2024-05-12 13:23:15,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:23:15,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:23:15,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 207 transitions. [2024-05-12 13:23:15,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43125 [2024-05-12 13:23:15,462 INFO L175 Difference]: Start difference. First operand has 495 places, 657 transitions, 9651 flow. Second operand 12 states and 207 transitions. [2024-05-12 13:23:15,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 506 places, 689 transitions, 11749 flow [2024-05-12 13:23:17,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 497 places, 689 transitions, 11615 flow, removed 20 selfloop flow, removed 9 redundant places. [2024-05-12 13:23:17,609 INFO L231 Difference]: Finished difference. Result has 498 places, 659 transitions, 9880 flow [2024-05-12 13:23:17,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9517, PETRI_DIFFERENCE_MINUEND_PLACES=486, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=657, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9880, PETRI_PLACES=498, PETRI_TRANSITIONS=659} [2024-05-12 13:23:17,609 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 454 predicate places. [2024-05-12 13:23:17,610 INFO L495 AbstractCegarLoop]: Abstraction has has 498 places, 659 transitions, 9880 flow [2024-05-12 13:23:17,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:23:17,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:23:17,610 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:23:17,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2024-05-12 13:23:17,610 INFO L420 AbstractCegarLoop]: === Iteration 160 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:23:17,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:23:17,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1604170429, now seen corresponding path program 5 times [2024-05-12 13:23:17,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:23:17,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560682554] [2024-05-12 13:23:17,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:23:17,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:23:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:23:18,552 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:23:18,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:23:18,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560682554] [2024-05-12 13:23:18,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560682554] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:23:18,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:23:18,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:23:18,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164659115] [2024-05-12 13:23:18,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:23:18,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:23:18,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:23:18,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:23:18,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:23:18,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:23:18,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 498 places, 659 transitions, 9880 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:23:18,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:23:18,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:23:18,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:23:19,891 INFO L124 PetriNetUnfolderBase]: 2223/4109 cut-off events. [2024-05-12 13:23:19,891 INFO L125 PetriNetUnfolderBase]: For 285545/285545 co-relation queries the response was YES. [2024-05-12 13:23:19,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30314 conditions, 4109 events. 2223/4109 cut-off events. For 285545/285545 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 27932 event pairs, 432 based on Foata normal form. 2/3882 useless extension candidates. Maximal degree in co-relation 30090. Up to 3253 conditions per place. [2024-05-12 13:23:19,957 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 555 selfloop transitions, 125 changer transitions 0/689 dead transitions. [2024-05-12 13:23:19,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 509 places, 689 transitions, 11680 flow [2024-05-12 13:23:19,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:23:19,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:23:19,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 208 transitions. [2024-05-12 13:23:19,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-05-12 13:23:19,959 INFO L175 Difference]: Start difference. First operand has 498 places, 659 transitions, 9880 flow. Second operand 12 states and 208 transitions. [2024-05-12 13:23:19,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 509 places, 689 transitions, 11680 flow [2024-05-12 13:23:22,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 499 places, 689 transitions, 11342 flow, removed 38 selfloop flow, removed 10 redundant places. [2024-05-12 13:23:22,414 INFO L231 Difference]: Finished difference. Result has 500 places, 659 transitions, 9799 flow [2024-05-12 13:23:22,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9542, PETRI_DIFFERENCE_MINUEND_PLACES=488, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=534, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9799, PETRI_PLACES=500, PETRI_TRANSITIONS=659} [2024-05-12 13:23:22,415 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 456 predicate places. [2024-05-12 13:23:22,415 INFO L495 AbstractCegarLoop]: Abstraction has has 500 places, 659 transitions, 9799 flow [2024-05-12 13:23:22,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:23:22,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:23:22,416 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:23:22,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2024-05-12 13:23:22,416 INFO L420 AbstractCegarLoop]: === Iteration 161 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:23:22,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:23:22,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1611589039, now seen corresponding path program 6 times [2024-05-12 13:23:22,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:23:22,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119781050] [2024-05-12 13:23:22,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:23:22,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:23:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:23:23,274 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:23:23,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:23:23,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119781050] [2024-05-12 13:23:23,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119781050] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:23:23,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:23:23,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:23:23,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13027558] [2024-05-12 13:23:23,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:23:23,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:23:23,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:23:23,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:23:23,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:23:23,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:23:23,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 659 transitions, 9799 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:23:23,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:23:23,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:23:23,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:23:24,633 INFO L124 PetriNetUnfolderBase]: 2219/4099 cut-off events. [2024-05-12 13:23:24,633 INFO L125 PetriNetUnfolderBase]: For 271662/271662 co-relation queries the response was YES. [2024-05-12 13:23:24,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29868 conditions, 4099 events. 2219/4099 cut-off events. For 271662/271662 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 27808 event pairs, 406 based on Foata normal form. 2/3872 useless extension candidates. Maximal degree in co-relation 29643. Up to 3250 conditions per place. [2024-05-12 13:23:24,703 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 516 selfloop transitions, 162 changer transitions 0/687 dead transitions. [2024-05-12 13:23:24,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 687 transitions, 11331 flow [2024-05-12 13:23:24,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:23:24,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:23:24,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 204 transitions. [2024-05-12 13:23:24,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-05-12 13:23:24,704 INFO L175 Difference]: Start difference. First operand has 500 places, 659 transitions, 9799 flow. Second operand 12 states and 204 transitions. [2024-05-12 13:23:24,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 511 places, 687 transitions, 11331 flow [2024-05-12 13:23:26,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 499 places, 687 transitions, 10913 flow, removed 31 selfloop flow, removed 12 redundant places. [2024-05-12 13:23:26,971 INFO L231 Difference]: Finished difference. Result has 500 places, 659 transitions, 9712 flow [2024-05-12 13:23:26,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9381, PETRI_DIFFERENCE_MINUEND_PLACES=488, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9712, PETRI_PLACES=500, PETRI_TRANSITIONS=659} [2024-05-12 13:23:26,972 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 456 predicate places. [2024-05-12 13:23:26,972 INFO L495 AbstractCegarLoop]: Abstraction has has 500 places, 659 transitions, 9712 flow [2024-05-12 13:23:26,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:23:26,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:23:26,972 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:23:26,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2024-05-12 13:23:26,972 INFO L420 AbstractCegarLoop]: === Iteration 162 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:23:26,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:23:26,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1570351582, now seen corresponding path program 11 times [2024-05-12 13:23:26,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:23:26,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076953696] [2024-05-12 13:23:26,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:23:26,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:23:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:23:27,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:23:27,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:23:27,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076953696] [2024-05-12 13:23:27,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076953696] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:23:27,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:23:27,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:23:27,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991235518] [2024-05-12 13:23:27,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:23:27,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:23:27,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:23:27,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:23:27,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:23:28,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:23:28,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 659 transitions, 9712 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:23:28,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:23:28,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:23:28,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:23:29,467 INFO L124 PetriNetUnfolderBase]: 2058/3950 cut-off events. [2024-05-12 13:23:29,467 INFO L125 PetriNetUnfolderBase]: For 276095/276167 co-relation queries the response was YES. [2024-05-12 13:23:29,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28750 conditions, 3950 events. 2058/3950 cut-off events. For 276095/276167 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 27843 event pairs, 289 based on Foata normal form. 21/3691 useless extension candidates. Maximal degree in co-relation 28524. Up to 3131 conditions per place. [2024-05-12 13:23:29,531 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 539 selfloop transitions, 75 changer transitions 0/688 dead transitions. [2024-05-12 13:23:29,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 510 places, 688 transitions, 11124 flow [2024-05-12 13:23:29,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:23:29,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:23:29,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2024-05-12 13:23:29,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-05-12 13:23:29,532 INFO L175 Difference]: Start difference. First operand has 500 places, 659 transitions, 9712 flow. Second operand 11 states and 198 transitions. [2024-05-12 13:23:29,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 510 places, 688 transitions, 11124 flow [2024-05-12 13:23:31,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 499 places, 688 transitions, 10789 flow, removed 1 selfloop flow, removed 11 redundant places. [2024-05-12 13:23:31,695 INFO L231 Difference]: Finished difference. Result has 500 places, 663 transitions, 9613 flow [2024-05-12 13:23:31,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9377, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9613, PETRI_PLACES=500, PETRI_TRANSITIONS=663} [2024-05-12 13:23:31,695 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 456 predicate places. [2024-05-12 13:23:31,695 INFO L495 AbstractCegarLoop]: Abstraction has has 500 places, 663 transitions, 9613 flow [2024-05-12 13:23:31,696 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:23:31,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:23:31,696 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:23:31,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2024-05-12 13:23:31,696 INFO L420 AbstractCegarLoop]: === Iteration 163 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:23:31,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:23:31,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1683466176, now seen corresponding path program 12 times [2024-05-12 13:23:31,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:23:31,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639549670] [2024-05-12 13:23:31,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:23:31,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:23:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:23:32,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:23:32,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:23:32,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639549670] [2024-05-12 13:23:32,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639549670] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:23:32,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:23:32,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:23:32,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549002600] [2024-05-12 13:23:32,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:23:32,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:23:32,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:23:32,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:23:32,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:23:32,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:23:32,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 663 transitions, 9613 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:23:32,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:23:32,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:23:32,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:23:33,938 INFO L124 PetriNetUnfolderBase]: 2139/4107 cut-off events. [2024-05-12 13:23:33,938 INFO L125 PetriNetUnfolderBase]: For 283361/283439 co-relation queries the response was YES. [2024-05-12 13:23:33,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29633 conditions, 4107 events. 2139/4107 cut-off events. For 283361/283439 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 29390 event pairs, 292 based on Foata normal form. 21/3836 useless extension candidates. Maximal degree in co-relation 29406. Up to 3236 conditions per place. [2024-05-12 13:23:34,008 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 552 selfloop transitions, 78 changer transitions 0/704 dead transitions. [2024-05-12 13:23:34,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 509 places, 704 transitions, 11211 flow [2024-05-12 13:23:34,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:23:34,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:23:34,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-05-12 13:23:34,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4725 [2024-05-12 13:23:34,009 INFO L175 Difference]: Start difference. First operand has 500 places, 663 transitions, 9613 flow. Second operand 10 states and 189 transitions. [2024-05-12 13:23:34,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 509 places, 704 transitions, 11211 flow [2024-05-12 13:23:36,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 501 places, 704 transitions, 11064 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-05-12 13:23:36,208 INFO L231 Difference]: Finished difference. Result has 503 places, 679 transitions, 9913 flow [2024-05-12 13:23:36,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9466, PETRI_DIFFERENCE_MINUEND_PLACES=492, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=663, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9913, PETRI_PLACES=503, PETRI_TRANSITIONS=679} [2024-05-12 13:23:36,208 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 459 predicate places. [2024-05-12 13:23:36,209 INFO L495 AbstractCegarLoop]: Abstraction has has 503 places, 679 transitions, 9913 flow [2024-05-12 13:23:36,209 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:23:36,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:23:36,209 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:23:36,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2024-05-12 13:23:36,209 INFO L420 AbstractCegarLoop]: === Iteration 164 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:23:36,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:23:36,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1564394556, now seen corresponding path program 13 times [2024-05-12 13:23:36,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:23:36,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420467126] [2024-05-12 13:23:36,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:23:36,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:23:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:23:37,199 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:23:37,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:23:37,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420467126] [2024-05-12 13:23:37,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420467126] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:23:37,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:23:37,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:23:37,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485925068] [2024-05-12 13:23:37,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:23:37,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:23:37,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:23:37,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:23:37,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:23:37,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:23:37,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 679 transitions, 9913 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:23:37,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:23:37,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:23:37,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:23:38,762 INFO L124 PetriNetUnfolderBase]: 2185/4229 cut-off events. [2024-05-12 13:23:38,762 INFO L125 PetriNetUnfolderBase]: For 292064/292160 co-relation queries the response was YES. [2024-05-12 13:23:38,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30306 conditions, 4229 events. 2185/4229 cut-off events. For 292064/292160 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 30548 event pairs, 326 based on Foata normal form. 27/3950 useless extension candidates. Maximal degree in co-relation 30078. Up to 3408 conditions per place. [2024-05-12 13:23:38,836 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 573 selfloop transitions, 64 changer transitions 0/711 dead transitions. [2024-05-12 13:23:38,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 513 places, 711 transitions, 11431 flow [2024-05-12 13:23:38,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:23:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:23:38,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 195 transitions. [2024-05-12 13:23:38,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2024-05-12 13:23:38,837 INFO L175 Difference]: Start difference. First operand has 503 places, 679 transitions, 9913 flow. Second operand 11 states and 195 transitions. [2024-05-12 13:23:38,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 513 places, 711 transitions, 11431 flow [2024-05-12 13:23:41,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 506 places, 711 transitions, 11256 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-05-12 13:23:41,370 INFO L231 Difference]: Finished difference. Result has 508 places, 687 transitions, 10020 flow [2024-05-12 13:23:41,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9738, PETRI_DIFFERENCE_MINUEND_PLACES=496, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=617, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10020, PETRI_PLACES=508, PETRI_TRANSITIONS=687} [2024-05-12 13:23:41,370 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 464 predicate places. [2024-05-12 13:23:41,370 INFO L495 AbstractCegarLoop]: Abstraction has has 508 places, 687 transitions, 10020 flow [2024-05-12 13:23:41,370 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:23:41,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:23:41,370 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:23:41,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2024-05-12 13:23:41,371 INFO L420 AbstractCegarLoop]: === Iteration 165 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:23:41,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:23:41,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1680573504, now seen corresponding path program 4 times [2024-05-12 13:23:41,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:23:41,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911049073] [2024-05-12 13:23:41,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:23:41,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:23:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:23:42,474 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:23:42,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:23:42,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911049073] [2024-05-12 13:23:42,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911049073] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:23:42,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:23:42,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:23:42,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587769704] [2024-05-12 13:23:42,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:23:42,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:23:42,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:23:42,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:23:42,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:23:42,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:23:42,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 508 places, 687 transitions, 10020 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:23:42,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:23:42,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:23:42,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:23:44,084 INFO L124 PetriNetUnfolderBase]: 2397/4473 cut-off events. [2024-05-12 13:23:44,084 INFO L125 PetriNetUnfolderBase]: For 285953/285953 co-relation queries the response was YES. [2024-05-12 13:23:44,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32313 conditions, 4473 events. 2397/4473 cut-off events. For 285953/285953 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 31325 event pairs, 394 based on Foata normal form. 1/4213 useless extension candidates. Maximal degree in co-relation 32082. Up to 3848 conditions per place. [2024-05-12 13:23:44,158 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 621 selfloop transitions, 87 changer transitions 0/717 dead transitions. [2024-05-12 13:23:44,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 717 transitions, 11666 flow [2024-05-12 13:23:44,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:23:44,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:23:44,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 199 transitions. [2024-05-12 13:23:44,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41458333333333336 [2024-05-12 13:23:44,160 INFO L175 Difference]: Start difference. First operand has 508 places, 687 transitions, 10020 flow. Second operand 12 states and 199 transitions. [2024-05-12 13:23:44,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 717 transitions, 11666 flow [2024-05-12 13:23:46,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 511 places, 717 transitions, 11509 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-05-12 13:23:46,646 INFO L231 Difference]: Finished difference. Result has 512 places, 695 transitions, 10191 flow [2024-05-12 13:23:46,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9863, PETRI_DIFFERENCE_MINUEND_PLACES=500, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=10191, PETRI_PLACES=512, PETRI_TRANSITIONS=695} [2024-05-12 13:23:46,647 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 468 predicate places. [2024-05-12 13:23:46,647 INFO L495 AbstractCegarLoop]: Abstraction has has 512 places, 695 transitions, 10191 flow [2024-05-12 13:23:46,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:23:46,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:23:46,647 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:23:46,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2024-05-12 13:23:46,648 INFO L420 AbstractCegarLoop]: === Iteration 166 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:23:46,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:23:46,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1564179075, now seen corresponding path program 7 times [2024-05-12 13:23:46,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:23:46,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263968840] [2024-05-12 13:23:46,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:23:46,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:23:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:23:47,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:23:47,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:23:47,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263968840] [2024-05-12 13:23:47,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263968840] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:23:47,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:23:47,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:23:47,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490407848] [2024-05-12 13:23:47,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:23:47,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:23:47,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:23:47,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:23:47,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:23:47,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:23:47,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 695 transitions, 10191 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:23:47,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:23:47,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:23:47,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:23:48,960 INFO L124 PetriNetUnfolderBase]: 2414/4505 cut-off events. [2024-05-12 13:23:48,960 INFO L125 PetriNetUnfolderBase]: For 296899/296899 co-relation queries the response was YES. [2024-05-12 13:23:49,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32458 conditions, 4505 events. 2414/4505 cut-off events. For 296899/296899 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 31554 event pairs, 378 based on Foata normal form. 2/4240 useless extension candidates. Maximal degree in co-relation 32226. Up to 3859 conditions per place. [2024-05-12 13:23:49,041 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 637 selfloop transitions, 80 changer transitions 0/726 dead transitions. [2024-05-12 13:23:49,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 726 transitions, 11875 flow [2024-05-12 13:23:49,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:23:49,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:23:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 200 transitions. [2024-05-12 13:23:49,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-05-12 13:23:49,042 INFO L175 Difference]: Start difference. First operand has 512 places, 695 transitions, 10191 flow. Second operand 12 states and 200 transitions. [2024-05-12 13:23:49,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 523 places, 726 transitions, 11875 flow [2024-05-12 13:23:51,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 513 places, 726 transitions, 11669 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-05-12 13:23:51,653 INFO L231 Difference]: Finished difference. Result has 514 places, 701 transitions, 10269 flow [2024-05-12 13:23:51,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9985, PETRI_DIFFERENCE_MINUEND_PLACES=502, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=695, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=10269, PETRI_PLACES=514, PETRI_TRANSITIONS=701} [2024-05-12 13:23:51,654 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 470 predicate places. [2024-05-12 13:23:51,654 INFO L495 AbstractCegarLoop]: Abstraction has has 514 places, 701 transitions, 10269 flow [2024-05-12 13:23:51,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:23:51,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:23:51,654 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:23:51,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2024-05-12 13:23:51,654 INFO L420 AbstractCegarLoop]: === Iteration 167 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:23:51,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:23:51,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1371049792, now seen corresponding path program 14 times [2024-05-12 13:23:51,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:23:51,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541380486] [2024-05-12 13:23:51,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:23:51,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:23:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:23:52,746 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:23:52,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:23:52,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541380486] [2024-05-12 13:23:52,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541380486] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:23:52,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:23:52,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:23:52,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245478429] [2024-05-12 13:23:52,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:23:52,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:23:52,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:23:52,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:23:52,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:23:52,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:23:52,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 514 places, 701 transitions, 10269 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:23:52,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:23:52,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:23:52,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:23:54,281 INFO L124 PetriNetUnfolderBase]: 2240/4346 cut-off events. [2024-05-12 13:23:54,281 INFO L125 PetriNetUnfolderBase]: For 303181/303271 co-relation queries the response was YES. [2024-05-12 13:23:54,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31260 conditions, 4346 events. 2240/4346 cut-off events. For 303181/303271 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 31620 event pairs, 324 based on Foata normal form. 33/4059 useless extension candidates. Maximal degree in co-relation 31027. Up to 3495 conditions per place. [2024-05-12 13:23:54,354 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 583 selfloop transitions, 74 changer transitions 0/731 dead transitions. [2024-05-12 13:23:54,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 731 transitions, 11824 flow [2024-05-12 13:23:54,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:23:54,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:23:54,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions. [2024-05-12 13:23:54,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44772727272727275 [2024-05-12 13:23:54,356 INFO L175 Difference]: Start difference. First operand has 514 places, 701 transitions, 10269 flow. Second operand 11 states and 197 transitions. [2024-05-12 13:23:54,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 524 places, 731 transitions, 11824 flow [2024-05-12 13:23:56,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 731 transitions, 11630 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-05-12 13:23:56,869 INFO L231 Difference]: Finished difference. Result has 516 places, 707 transitions, 10357 flow [2024-05-12 13:23:56,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10075, PETRI_DIFFERENCE_MINUEND_PLACES=504, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10357, PETRI_PLACES=516, PETRI_TRANSITIONS=707} [2024-05-12 13:23:56,870 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 472 predicate places. [2024-05-12 13:23:56,870 INFO L495 AbstractCegarLoop]: Abstraction has has 516 places, 707 transitions, 10357 flow [2024-05-12 13:23:56,870 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:23:56,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:23:56,870 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:23:56,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2024-05-12 13:23:56,870 INFO L420 AbstractCegarLoop]: === Iteration 168 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:23:56,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:23:56,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1363684471, now seen corresponding path program 8 times [2024-05-12 13:23:56,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:23:56,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372175044] [2024-05-12 13:23:56,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:23:56,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:23:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:23:57,745 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:23:57,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:23:57,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372175044] [2024-05-12 13:23:57,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372175044] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:23:57,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:23:57,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:23:57,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342036265] [2024-05-12 13:23:57,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:23:57,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:23:57,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:23:57,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:23:57,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:23:57,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:23:57,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 707 transitions, 10357 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:23:57,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:23:57,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:23:57,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:23:59,353 INFO L124 PetriNetUnfolderBase]: 2495/4666 cut-off events. [2024-05-12 13:23:59,353 INFO L125 PetriNetUnfolderBase]: For 348649/348649 co-relation queries the response was YES. [2024-05-12 13:23:59,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34665 conditions, 4666 events. 2495/4666 cut-off events. For 348649/348649 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 33025 event pairs, 388 based on Foata normal form. 2/4388 useless extension candidates. Maximal degree in co-relation 34430. Up to 3801 conditions per place. [2024-05-12 13:23:59,434 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 612 selfloop transitions, 128 changer transitions 0/749 dead transitions. [2024-05-12 13:23:59,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 527 places, 749 transitions, 12815 flow [2024-05-12 13:23:59,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:23:59,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:23:59,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 209 transitions. [2024-05-12 13:23:59,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4354166666666667 [2024-05-12 13:23:59,435 INFO L175 Difference]: Start difference. First operand has 516 places, 707 transitions, 10357 flow. Second operand 12 states and 209 transitions. [2024-05-12 13:23:59,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 527 places, 749 transitions, 12815 flow [2024-05-12 13:24:02,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 749 transitions, 12555 flow, removed 25 selfloop flow, removed 10 redundant places. [2024-05-12 13:24:02,461 INFO L231 Difference]: Finished difference. Result has 520 places, 721 transitions, 10719 flow [2024-05-12 13:24:02,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10097, PETRI_DIFFERENCE_MINUEND_PLACES=506, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=707, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=10719, PETRI_PLACES=520, PETRI_TRANSITIONS=721} [2024-05-12 13:24:02,462 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 476 predicate places. [2024-05-12 13:24:02,462 INFO L495 AbstractCegarLoop]: Abstraction has has 520 places, 721 transitions, 10719 flow [2024-05-12 13:24:02,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:24:02,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:24:02,462 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:24:02,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167 [2024-05-12 13:24:02,462 INFO L420 AbstractCegarLoop]: === Iteration 169 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:24:02,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:24:02,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1370834311, now seen corresponding path program 9 times [2024-05-12 13:24:02,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:24:02,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720248998] [2024-05-12 13:24:02,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:24:02,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:24:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:24:03,316 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:24:03,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:24:03,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720248998] [2024-05-12 13:24:03,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720248998] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:24:03,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:24:03,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:24:03,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618187623] [2024-05-12 13:24:03,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:24:03,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:24:03,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:24:03,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:24:03,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:24:03,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:24:03,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 721 transitions, 10719 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:24:03,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:24:03,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:24:03,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:24:04,997 INFO L124 PetriNetUnfolderBase]: 2491/4666 cut-off events. [2024-05-12 13:24:04,997 INFO L125 PetriNetUnfolderBase]: For 331632/331632 co-relation queries the response was YES. [2024-05-12 13:24:05,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34412 conditions, 4666 events. 2491/4666 cut-off events. For 331632/331632 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 33046 event pairs, 392 based on Foata normal form. 2/4388 useless extension candidates. Maximal degree in co-relation 34174. Up to 3798 conditions per place. [2024-05-12 13:24:05,071 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 620 selfloop transitions, 120 changer transitions 0/749 dead transitions. [2024-05-12 13:24:05,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 749 transitions, 12663 flow [2024-05-12 13:24:05,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:24:05,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:24:05,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 209 transitions. [2024-05-12 13:24:05,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4354166666666667 [2024-05-12 13:24:05,077 INFO L175 Difference]: Start difference. First operand has 520 places, 721 transitions, 10719 flow. Second operand 12 states and 209 transitions. [2024-05-12 13:24:05,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 749 transitions, 12663 flow [2024-05-12 13:24:07,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 749 transitions, 12481 flow, removed 44 selfloop flow, removed 7 redundant places. [2024-05-12 13:24:07,883 INFO L231 Difference]: Finished difference. Result has 525 places, 721 transitions, 10786 flow [2024-05-12 13:24:07,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10537, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=721, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=10786, PETRI_PLACES=525, PETRI_TRANSITIONS=721} [2024-05-12 13:24:07,884 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 481 predicate places. [2024-05-12 13:24:07,884 INFO L495 AbstractCegarLoop]: Abstraction has has 525 places, 721 transitions, 10786 flow [2024-05-12 13:24:07,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:24:07,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:24:07,884 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:24:07,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2024-05-12 13:24:07,884 INFO L420 AbstractCegarLoop]: === Iteration 170 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:24:07,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:24:07,884 INFO L85 PathProgramCache]: Analyzing trace with hash 706285543, now seen corresponding path program 10 times [2024-05-12 13:24:07,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:24:07,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609078146] [2024-05-12 13:24:07,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:24:07,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:24:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:24:08,723 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:24:08,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:24:08,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609078146] [2024-05-12 13:24:08,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609078146] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:24:08,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:24:08,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:24:08,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659249407] [2024-05-12 13:24:08,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:24:08,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:24:08,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:24:08,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:24:08,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:24:08,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:24:08,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 721 transitions, 10786 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:24:08,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:24:08,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:24:08,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:24:10,347 INFO L124 PetriNetUnfolderBase]: 2502/4680 cut-off events. [2024-05-12 13:24:10,347 INFO L125 PetriNetUnfolderBase]: For 335751/335751 co-relation queries the response was YES. [2024-05-12 13:24:10,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34718 conditions, 4680 events. 2502/4680 cut-off events. For 335751/335751 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 33128 event pairs, 371 based on Foata normal form. 2/4401 useless extension candidates. Maximal degree in co-relation 34478. Up to 3808 conditions per place. [2024-05-12 13:24:10,629 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 594 selfloop transitions, 147 changer transitions 0/750 dead transitions. [2024-05-12 13:24:10,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 536 places, 750 transitions, 12794 flow [2024-05-12 13:24:10,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:24:10,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:24:10,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 206 transitions. [2024-05-12 13:24:10,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42916666666666664 [2024-05-12 13:24:10,631 INFO L175 Difference]: Start difference. First operand has 525 places, 721 transitions, 10786 flow. Second operand 12 states and 206 transitions. [2024-05-12 13:24:10,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 536 places, 750 transitions, 12794 flow [2024-05-12 13:24:13,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 750 transitions, 12476 flow, removed 14 selfloop flow, removed 11 redundant places. [2024-05-12 13:24:13,681 INFO L231 Difference]: Finished difference. Result has 526 places, 723 transitions, 10845 flow [2024-05-12 13:24:13,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10472, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=721, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=10845, PETRI_PLACES=526, PETRI_TRANSITIONS=723} [2024-05-12 13:24:13,682 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 482 predicate places. [2024-05-12 13:24:13,682 INFO L495 AbstractCegarLoop]: Abstraction has has 526 places, 723 transitions, 10845 flow [2024-05-12 13:24:13,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:24:13,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:24:13,682 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:24:13,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable169 [2024-05-12 13:24:13,683 INFO L420 AbstractCegarLoop]: === Iteration 171 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:24:13,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:24:13,683 INFO L85 PathProgramCache]: Analyzing trace with hash -526542732, now seen corresponding path program 2 times [2024-05-12 13:24:13,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:24:13,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874674264] [2024-05-12 13:24:13,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:24:13,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:24:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:24:14,692 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:24:14,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:24:14,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874674264] [2024-05-12 13:24:14,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874674264] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:24:14,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:24:14,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:24:14,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978293114] [2024-05-12 13:24:14,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:24:14,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:24:14,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:24:14,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:24:14,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:24:14,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:24:14,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 723 transitions, 10845 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:24:14,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:24:14,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:24:14,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:24:16,309 INFO L124 PetriNetUnfolderBase]: 2510/4695 cut-off events. [2024-05-12 13:24:16,309 INFO L125 PetriNetUnfolderBase]: For 329656/329656 co-relation queries the response was YES. [2024-05-12 13:24:16,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34862 conditions, 4695 events. 2510/4695 cut-off events. For 329656/329656 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 33277 event pairs, 507 based on Foata normal form. 1/4418 useless extension candidates. Maximal degree in co-relation 34621. Up to 4094 conditions per place. [2024-05-12 13:24:16,395 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 685 selfloop transitions, 55 changer transitions 0/749 dead transitions. [2024-05-12 13:24:16,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 749 transitions, 12511 flow [2024-05-12 13:24:16,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:24:16,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:24:16,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 193 transitions. [2024-05-12 13:24:16,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40208333333333335 [2024-05-12 13:24:16,396 INFO L175 Difference]: Start difference. First operand has 526 places, 723 transitions, 10845 flow. Second operand 12 states and 193 transitions. [2024-05-12 13:24:16,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 749 transitions, 12511 flow [2024-05-12 13:24:19,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 749 transitions, 12208 flow, removed 28 selfloop flow, removed 9 redundant places. [2024-05-12 13:24:19,547 INFO L231 Difference]: Finished difference. Result has 529 places, 727 transitions, 10733 flow [2024-05-12 13:24:19,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10542, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=10733, PETRI_PLACES=529, PETRI_TRANSITIONS=727} [2024-05-12 13:24:19,547 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 485 predicate places. [2024-05-12 13:24:19,547 INFO L495 AbstractCegarLoop]: Abstraction has has 529 places, 727 transitions, 10733 flow [2024-05-12 13:24:19,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:24:19,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:24:19,548 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:24:19,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2024-05-12 13:24:19,548 INFO L420 AbstractCegarLoop]: === Iteration 172 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:24:19,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:24:19,549 INFO L85 PathProgramCache]: Analyzing trace with hash 166438395, now seen corresponding path program 11 times [2024-05-12 13:24:19,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:24:19,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442818655] [2024-05-12 13:24:19,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:24:19,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:24:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:24:20,493 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:24:20,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:24:20,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442818655] [2024-05-12 13:24:20,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442818655] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:24:20,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:24:20,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:24:20,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227885777] [2024-05-12 13:24:20,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:24:20,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:24:20,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:24:20,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:24:20,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:24:20,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:24:20,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 727 transitions, 10733 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:24:20,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:24:20,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:24:20,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:24:22,146 INFO L124 PetriNetUnfolderBase]: 2506/4683 cut-off events. [2024-05-12 13:24:22,146 INFO L125 PetriNetUnfolderBase]: For 323079/323079 co-relation queries the response was YES. [2024-05-12 13:24:22,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34271 conditions, 4683 events. 2506/4683 cut-off events. For 323079/323079 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 33112 event pairs, 371 based on Foata normal form. 2/4402 useless extension candidates. Maximal degree in co-relation 34029. Up to 3817 conditions per place. [2024-05-12 13:24:22,230 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 607 selfloop transitions, 137 changer transitions 0/753 dead transitions. [2024-05-12 13:24:22,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 753 transitions, 12399 flow [2024-05-12 13:24:22,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:24:22,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:24:22,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 206 transitions. [2024-05-12 13:24:22,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42916666666666664 [2024-05-12 13:24:22,231 INFO L175 Difference]: Start difference. First operand has 529 places, 727 transitions, 10733 flow. Second operand 12 states and 206 transitions. [2024-05-12 13:24:22,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 753 transitions, 12399 flow [2024-05-12 13:24:25,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 530 places, 753 transitions, 12208 flow, removed 44 selfloop flow, removed 10 redundant places. [2024-05-12 13:24:25,221 INFO L231 Difference]: Finished difference. Result has 531 places, 727 transitions, 10825 flow [2024-05-12 13:24:25,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10542, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=590, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=10825, PETRI_PLACES=531, PETRI_TRANSITIONS=727} [2024-05-12 13:24:25,221 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 487 predicate places. [2024-05-12 13:24:25,222 INFO L495 AbstractCegarLoop]: Abstraction has has 531 places, 727 transitions, 10825 flow [2024-05-12 13:24:25,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:24:25,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:24:25,222 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:24:25,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2024-05-12 13:24:25,222 INFO L420 AbstractCegarLoop]: === Iteration 173 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:24:25,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:24:25,223 INFO L85 PathProgramCache]: Analyzing trace with hash 2041851780, now seen corresponding path program 15 times [2024-05-12 13:24:25,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:24:25,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338606207] [2024-05-12 13:24:25,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:24:25,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:24:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:24:26,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:24:26,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:24:26,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338606207] [2024-05-12 13:24:26,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338606207] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:24:26,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:24:26,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:24:26,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570457252] [2024-05-12 13:24:26,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:24:26,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:24:26,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:24:26,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:24:26,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:24:26,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:24:26,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 727 transitions, 10825 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:24:26,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:24:26,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:24:26,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:24:27,886 INFO L124 PetriNetUnfolderBase]: 2321/4497 cut-off events. [2024-05-12 13:24:27,886 INFO L125 PetriNetUnfolderBase]: For 329981/330077 co-relation queries the response was YES. [2024-05-12 13:24:27,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32955 conditions, 4497 events. 2321/4497 cut-off events. For 329981/330077 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 32910 event pairs, 346 based on Foata normal form. 33/4194 useless extension candidates. Maximal degree in co-relation 32712. Up to 3574 conditions per place. [2024-05-12 13:24:27,970 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 580 selfloop transitions, 100 changer transitions 0/754 dead transitions. [2024-05-12 13:24:27,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 754 transitions, 12400 flow [2024-05-12 13:24:27,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:24:27,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:24:27,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions. [2024-05-12 13:24:27,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44545454545454544 [2024-05-12 13:24:27,971 INFO L175 Difference]: Start difference. First operand has 531 places, 727 transitions, 10825 flow. Second operand 11 states and 196 transitions. [2024-05-12 13:24:27,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 754 transitions, 12400 flow [2024-05-12 13:24:31,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 754 transitions, 12067 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-05-12 13:24:31,230 INFO L231 Difference]: Finished difference. Result has 531 places, 730 transitions, 10781 flow [2024-05-12 13:24:31,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10492, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10781, PETRI_PLACES=531, PETRI_TRANSITIONS=730} [2024-05-12 13:24:31,231 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 487 predicate places. [2024-05-12 13:24:31,231 INFO L495 AbstractCegarLoop]: Abstraction has has 531 places, 730 transitions, 10781 flow [2024-05-12 13:24:31,231 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:24:31,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:24:31,231 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:24:31,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2024-05-12 13:24:31,231 INFO L420 AbstractCegarLoop]: === Iteration 174 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:24:31,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:24:31,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1996399525, now seen corresponding path program 12 times [2024-05-12 13:24:31,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:24:31,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848394518] [2024-05-12 13:24:31,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:24:31,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:24:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:24:32,090 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:24:32,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:24:32,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848394518] [2024-05-12 13:24:32,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848394518] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:24:32,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:24:32,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:24:32,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546168345] [2024-05-12 13:24:32,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:24:32,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:24:32,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:24:32,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:24:32,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:24:32,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:24:32,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 730 transitions, 10781 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:24:32,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:24:32,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:24:32,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:24:33,864 INFO L124 PetriNetUnfolderBase]: 2564/4788 cut-off events. [2024-05-12 13:24:33,864 INFO L125 PetriNetUnfolderBase]: For 380585/380585 co-relation queries the response was YES. [2024-05-12 13:24:33,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36344 conditions, 4788 events. 2564/4788 cut-off events. For 380585/380585 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 33982 event pairs, 410 based on Foata normal form. 2/4503 useless extension candidates. Maximal degree in co-relation 36099. Up to 3337 conditions per place. [2024-05-12 13:24:33,950 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 532 selfloop transitions, 223 changer transitions 0/764 dead transitions. [2024-05-12 13:24:33,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 764 transitions, 13265 flow [2024-05-12 13:24:33,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:24:33,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:24:33,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 211 transitions. [2024-05-12 13:24:33,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4395833333333333 [2024-05-12 13:24:33,951 INFO L175 Difference]: Start difference. First operand has 531 places, 730 transitions, 10781 flow. Second operand 12 states and 211 transitions. [2024-05-12 13:24:33,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 764 transitions, 13265 flow [2024-05-12 13:24:37,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 530 places, 764 transitions, 12875 flow, removed 29 selfloop flow, removed 12 redundant places. [2024-05-12 13:24:37,897 INFO L231 Difference]: Finished difference. Result has 531 places, 736 transitions, 11062 flow [2024-05-12 13:24:37,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10391, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=219, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11062, PETRI_PLACES=531, PETRI_TRANSITIONS=736} [2024-05-12 13:24:37,898 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 487 predicate places. [2024-05-12 13:24:37,898 INFO L495 AbstractCegarLoop]: Abstraction has has 531 places, 736 transitions, 11062 flow [2024-05-12 13:24:37,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:24:37,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:24:37,898 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:24:37,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173 [2024-05-12 13:24:37,898 INFO L420 AbstractCegarLoop]: === Iteration 175 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:24:37,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:24:37,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1559909267, now seen corresponding path program 13 times [2024-05-12 13:24:37,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:24:37,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789071204] [2024-05-12 13:24:37,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:24:37,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:24:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:24:38,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:24:38,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:24:38,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789071204] [2024-05-12 13:24:38,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789071204] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:24:38,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:24:38,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:24:38,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826954572] [2024-05-12 13:24:38,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:24:38,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:24:38,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:24:38,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:24:38,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:24:38,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:24:38,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 736 transitions, 11062 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:24:38,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:24:38,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:24:38,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:24:40,566 INFO L124 PetriNetUnfolderBase]: 2575/4802 cut-off events. [2024-05-12 13:24:40,567 INFO L125 PetriNetUnfolderBase]: For 383051/383051 co-relation queries the response was YES. [2024-05-12 13:24:40,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36632 conditions, 4802 events. 2575/4802 cut-off events. For 383051/383051 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 33973 event pairs, 408 based on Foata normal form. 2/4516 useless extension candidates. Maximal degree in co-relation 36386. Up to 3347 conditions per place. [2024-05-12 13:24:40,862 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 560 selfloop transitions, 197 changer transitions 0/766 dead transitions. [2024-05-12 13:24:40,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 766 transitions, 13146 flow [2024-05-12 13:24:40,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:24:40,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:24:40,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 211 transitions. [2024-05-12 13:24:40,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4395833333333333 [2024-05-12 13:24:40,864 INFO L175 Difference]: Start difference. First operand has 531 places, 736 transitions, 11062 flow. Second operand 12 states and 211 transitions. [2024-05-12 13:24:40,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 766 transitions, 13146 flow [2024-05-12 13:24:44,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 535 places, 766 transitions, 12916 flow, removed 42 selfloop flow, removed 7 redundant places. [2024-05-12 13:24:44,435 INFO L231 Difference]: Finished difference. Result has 536 places, 738 transitions, 11307 flow [2024-05-12 13:24:44,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10832, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=736, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11307, PETRI_PLACES=536, PETRI_TRANSITIONS=738} [2024-05-12 13:24:44,436 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 492 predicate places. [2024-05-12 13:24:44,436 INFO L495 AbstractCegarLoop]: Abstraction has has 536 places, 738 transitions, 11307 flow [2024-05-12 13:24:44,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:24:44,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:24:44,437 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:24:44,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2024-05-12 13:24:44,437 INFO L420 AbstractCegarLoop]: === Iteration 176 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:24:44,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:24:44,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1303149287, now seen corresponding path program 14 times [2024-05-12 13:24:44,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:24:44,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989868591] [2024-05-12 13:24:44,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:24:44,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:24:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:24:45,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:24:45,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:24:45,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989868591] [2024-05-12 13:24:45,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989868591] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:24:45,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:24:45,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:24:45,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154511471] [2024-05-12 13:24:45,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:24:45,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:24:45,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:24:45,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:24:45,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:24:45,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:24:45,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 536 places, 738 transitions, 11307 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:24:45,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:24:45,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:24:45,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:24:47,032 INFO L124 PetriNetUnfolderBase]: 2601/4851 cut-off events. [2024-05-12 13:24:47,032 INFO L125 PetriNetUnfolderBase]: For 409826/409826 co-relation queries the response was YES. [2024-05-12 13:24:47,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37685 conditions, 4851 events. 2601/4851 cut-off events. For 409826/409826 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 34470 event pairs, 403 based on Foata normal form. 2/4563 useless extension candidates. Maximal degree in co-relation 37437. Up to 3370 conditions per place. [2024-05-12 13:24:47,124 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 540 selfloop transitions, 223 changer transitions 0/772 dead transitions. [2024-05-12 13:24:47,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 772 transitions, 14037 flow [2024-05-12 13:24:47,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:24:47,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:24:47,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 215 transitions. [2024-05-12 13:24:47,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2024-05-12 13:24:47,125 INFO L175 Difference]: Start difference. First operand has 536 places, 738 transitions, 11307 flow. Second operand 12 states and 215 transitions. [2024-05-12 13:24:47,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 772 transitions, 14037 flow [2024-05-12 13:24:50,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 772 transitions, 13522 flow, removed 38 selfloop flow, removed 10 redundant places. [2024-05-12 13:24:50,878 INFO L231 Difference]: Finished difference. Result has 538 places, 742 transitions, 11379 flow [2024-05-12 13:24:50,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10796, PETRI_DIFFERENCE_MINUEND_PLACES=526, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=738, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=219, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11379, PETRI_PLACES=538, PETRI_TRANSITIONS=742} [2024-05-12 13:24:50,879 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 494 predicate places. [2024-05-12 13:24:50,879 INFO L495 AbstractCegarLoop]: Abstraction has has 538 places, 742 transitions, 11379 flow [2024-05-12 13:24:50,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:24:50,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:24:50,879 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:24:50,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175 [2024-05-12 13:24:50,879 INFO L420 AbstractCegarLoop]: === Iteration 177 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:24:50,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:24:50,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1552490657, now seen corresponding path program 15 times [2024-05-12 13:24:50,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:24:50,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215592723] [2024-05-12 13:24:50,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:24:50,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:24:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:24:51,788 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:24:51,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:24:51,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215592723] [2024-05-12 13:24:51,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215592723] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:24:51,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:24:51,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:24:51,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13907126] [2024-05-12 13:24:51,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:24:51,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:24:51,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:24:51,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:24:51,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:24:51,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:24:51,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 742 transitions, 11379 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:24:51,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:24:51,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:24:51,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:24:53,469 INFO L124 PetriNetUnfolderBase]: 2612/4871 cut-off events. [2024-05-12 13:24:53,469 INFO L125 PetriNetUnfolderBase]: For 415437/415437 co-relation queries the response was YES. [2024-05-12 13:24:53,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37620 conditions, 4871 events. 2612/4871 cut-off events. For 415437/415437 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 34608 event pairs, 414 based on Foata normal form. 2/4582 useless extension candidates. Maximal degree in co-relation 37372. Up to 3380 conditions per place. [2024-05-12 13:24:53,566 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 572 selfloop transitions, 193 changer transitions 0/774 dead transitions. [2024-05-12 13:24:53,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 774 transitions, 13781 flow [2024-05-12 13:24:53,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:24:53,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:24:53,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 214 transitions. [2024-05-12 13:24:53,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44583333333333336 [2024-05-12 13:24:53,567 INFO L175 Difference]: Start difference. First operand has 538 places, 742 transitions, 11379 flow. Second operand 12 states and 214 transitions. [2024-05-12 13:24:53,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 774 transitions, 13781 flow [2024-05-12 13:24:57,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 774 transitions, 13304 flow, removed 27 selfloop flow, removed 8 redundant places. [2024-05-12 13:24:57,390 INFO L231 Difference]: Finished difference. Result has 542 places, 744 transitions, 11364 flow [2024-05-12 13:24:57,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10906, PETRI_DIFFERENCE_MINUEND_PLACES=530, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=742, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11364, PETRI_PLACES=542, PETRI_TRANSITIONS=744} [2024-05-12 13:24:57,391 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 498 predicate places. [2024-05-12 13:24:57,391 INFO L495 AbstractCegarLoop]: Abstraction has has 542 places, 744 transitions, 11364 flow [2024-05-12 13:24:57,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:24:57,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:24:57,391 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:24:57,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2024-05-12 13:24:57,391 INFO L420 AbstractCegarLoop]: === Iteration 178 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:24:57,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:24:57,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1303139987, now seen corresponding path program 16 times [2024-05-12 13:24:57,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:24:57,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990842295] [2024-05-12 13:24:57,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:24:57,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:24:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:24:58,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:24:58,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:24:58,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990842295] [2024-05-12 13:24:58,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990842295] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:24:58,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:24:58,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:24:58,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892496067] [2024-05-12 13:24:58,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:24:58,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:24:58,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:24:58,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:24:58,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:24:58,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:24:58,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 744 transitions, 11364 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:24:58,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:24:58,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:24:58,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:24:59,997 INFO L124 PetriNetUnfolderBase]: 2608/4865 cut-off events. [2024-05-12 13:24:59,997 INFO L125 PetriNetUnfolderBase]: For 398553/398553 co-relation queries the response was YES. [2024-05-12 13:25:00,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37179 conditions, 4865 events. 2608/4865 cut-off events. For 398553/398553 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 34529 event pairs, 411 based on Foata normal form. 2/4576 useless extension candidates. Maximal degree in co-relation 36930. Up to 3377 conditions per place. [2024-05-12 13:25:00,103 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 539 selfloop transitions, 225 changer transitions 0/773 dead transitions. [2024-05-12 13:25:00,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 773 transitions, 13682 flow [2024-05-12 13:25:00,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:25:00,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:25:00,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 213 transitions. [2024-05-12 13:25:00,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44375 [2024-05-12 13:25:00,104 INFO L175 Difference]: Start difference. First operand has 542 places, 744 transitions, 11364 flow. Second operand 12 states and 213 transitions. [2024-05-12 13:25:00,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 773 transitions, 13682 flow [2024-05-12 13:25:04,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 773 transitions, 13065 flow, removed 52 selfloop flow, removed 10 redundant places. [2024-05-12 13:25:04,211 INFO L231 Difference]: Finished difference. Result has 544 places, 744 transitions, 11203 flow [2024-05-12 13:25:04,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10747, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=744, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=225, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11203, PETRI_PLACES=544, PETRI_TRANSITIONS=744} [2024-05-12 13:25:04,212 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 500 predicate places. [2024-05-12 13:25:04,212 INFO L495 AbstractCegarLoop]: Abstraction has has 544 places, 744 transitions, 11203 flow [2024-05-12 13:25:04,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:25:04,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:25:04,212 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:25:04,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable177 [2024-05-12 13:25:04,212 INFO L420 AbstractCegarLoop]: === Iteration 179 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:25:04,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:25:04,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1303139646, now seen corresponding path program 3 times [2024-05-12 13:25:04,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:25:04,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569137259] [2024-05-12 13:25:04,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:25:04,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:25:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:25:05,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:25:05,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:25:05,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569137259] [2024-05-12 13:25:05,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569137259] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:25:05,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:25:05,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:25:05,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107508820] [2024-05-12 13:25:05,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:25:05,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:25:05,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:25:05,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:25:05,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:25:05,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:25:05,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 744 transitions, 11203 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:25:05,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:25:05,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:25:05,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:25:07,245 INFO L124 PetriNetUnfolderBase]: 2614/4869 cut-off events. [2024-05-12 13:25:07,245 INFO L125 PetriNetUnfolderBase]: For 388281/388281 co-relation queries the response was YES. [2024-05-12 13:25:07,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37087 conditions, 4869 events. 2614/4869 cut-off events. For 388281/388281 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 34574 event pairs, 510 based on Foata normal form. 1/4582 useless extension candidates. Maximal degree in co-relation 36837. Up to 4152 conditions per place. [2024-05-12 13:25:07,330 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 660 selfloop transitions, 99 changer transitions 0/768 dead transitions. [2024-05-12 13:25:07,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 768 transitions, 12907 flow [2024-05-12 13:25:07,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:25:07,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:25:07,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 198 transitions. [2024-05-12 13:25:07,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-05-12 13:25:07,331 INFO L175 Difference]: Start difference. First operand has 544 places, 744 transitions, 11203 flow. Second operand 12 states and 198 transitions. [2024-05-12 13:25:07,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 768 transitions, 12907 flow [2024-05-12 13:25:11,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 768 transitions, 12451 flow, removed 1 selfloop flow, removed 11 redundant places. [2024-05-12 13:25:11,625 INFO L231 Difference]: Finished difference. Result has 545 places, 746 transitions, 11011 flow [2024-05-12 13:25:11,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10747, PETRI_DIFFERENCE_MINUEND_PLACES=533, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=744, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=645, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11011, PETRI_PLACES=545, PETRI_TRANSITIONS=746} [2024-05-12 13:25:11,626 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 501 predicate places. [2024-05-12 13:25:11,626 INFO L495 AbstractCegarLoop]: Abstraction has has 545 places, 746 transitions, 11011 flow [2024-05-12 13:25:11,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:25:11,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:25:11,627 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:25:11,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178 [2024-05-12 13:25:11,627 INFO L420 AbstractCegarLoop]: === Iteration 180 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:25:11,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:25:11,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1294202687, now seen corresponding path program 17 times [2024-05-12 13:25:11,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:25:11,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206180870] [2024-05-12 13:25:11,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:25:11,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:25:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:25:12,502 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:25:12,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:25:12,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206180870] [2024-05-12 13:25:12,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206180870] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:25:12,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:25:12,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:25:12,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904543112] [2024-05-12 13:25:12,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:25:12,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:25:12,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:25:12,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:25:12,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:25:12,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:25:12,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 746 transitions, 11011 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:25:12,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:25:12,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:25:12,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:25:14,194 INFO L124 PetriNetUnfolderBase]: 2640/4914 cut-off events. [2024-05-12 13:25:14,194 INFO L125 PetriNetUnfolderBase]: For 427176/427176 co-relation queries the response was YES. [2024-05-12 13:25:14,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37484 conditions, 4914 events. 2640/4914 cut-off events. For 427176/427176 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 34928 event pairs, 363 based on Foata normal form. 2/4622 useless extension candidates. Maximal degree in co-relation 37233. Up to 3409 conditions per place. [2024-05-12 13:25:14,285 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 513 selfloop transitions, 258 changer transitions 0/780 dead transitions. [2024-05-12 13:25:14,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 780 transitions, 13781 flow [2024-05-12 13:25:14,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:25:14,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:25:14,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 213 transitions. [2024-05-12 13:25:14,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44375 [2024-05-12 13:25:14,287 INFO L175 Difference]: Start difference. First operand has 545 places, 746 transitions, 11011 flow. Second operand 12 states and 213 transitions. [2024-05-12 13:25:14,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 780 transitions, 13781 flow [2024-05-12 13:25:19,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 780 transitions, 13539 flow, removed 24 selfloop flow, removed 10 redundant places. [2024-05-12 13:25:19,174 INFO L231 Difference]: Finished difference. Result has 547 places, 750 transitions, 11427 flow [2024-05-12 13:25:19,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10769, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=746, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=254, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11427, PETRI_PLACES=547, PETRI_TRANSITIONS=750} [2024-05-12 13:25:19,175 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 503 predicate places. [2024-05-12 13:25:19,175 INFO L495 AbstractCegarLoop]: Abstraction has has 547 places, 750 transitions, 11427 flow [2024-05-12 13:25:19,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:25:19,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:25:19,175 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:25:19,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable179 [2024-05-12 13:25:19,175 INFO L420 AbstractCegarLoop]: === Iteration 181 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:25:19,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:25:19,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1293874056, now seen corresponding path program 4 times [2024-05-12 13:25:19,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:25:19,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469266675] [2024-05-12 13:25:19,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:25:19,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:25:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:25:20,404 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:25:20,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:25:20,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469266675] [2024-05-12 13:25:20,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469266675] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:25:20,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:25:20,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:25:20,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218046410] [2024-05-12 13:25:20,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:25:20,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:25:20,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:25:20,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:25:20,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:25:20,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:25:20,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 750 transitions, 11427 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:25:20,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:25:20,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:25:20,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:25:22,257 INFO L124 PetriNetUnfolderBase]: 2654/4936 cut-off events. [2024-05-12 13:25:22,257 INFO L125 PetriNetUnfolderBase]: For 433740/433740 co-relation queries the response was YES. [2024-05-12 13:25:22,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38410 conditions, 4936 events. 2654/4936 cut-off events. For 433740/433740 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 35093 event pairs, 520 based on Foata normal form. 1/4645 useless extension candidates. Maximal degree in co-relation 38158. Up to 4174 conditions per place. [2024-05-12 13:25:22,352 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 644 selfloop transitions, 126 changer transitions 0/779 dead transitions. [2024-05-12 13:25:22,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 779 transitions, 13527 flow [2024-05-12 13:25:22,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-12 13:25:22,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-05-12 13:25:22,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 212 transitions. [2024-05-12 13:25:22,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076923076923077 [2024-05-12 13:25:22,353 INFO L175 Difference]: Start difference. First operand has 547 places, 750 transitions, 11427 flow. Second operand 13 states and 212 transitions. [2024-05-12 13:25:22,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 779 transitions, 13527 flow [2024-05-12 13:25:26,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 550 places, 779 transitions, 12958 flow, removed 29 selfloop flow, removed 9 redundant places. [2024-05-12 13:25:26,760 INFO L231 Difference]: Finished difference. Result has 551 places, 754 transitions, 11241 flow [2024-05-12 13:25:26,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10858, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=750, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=11241, PETRI_PLACES=551, PETRI_TRANSITIONS=754} [2024-05-12 13:25:26,760 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 507 predicate places. [2024-05-12 13:25:26,761 INFO L495 AbstractCegarLoop]: Abstraction has has 551 places, 754 transitions, 11241 flow [2024-05-12 13:25:26,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:25:26,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:25:26,761 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:25:26,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180 [2024-05-12 13:25:26,761 INFO L420 AbstractCegarLoop]: === Iteration 182 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:25:26,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:25:26,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1293873653, now seen corresponding path program 1 times [2024-05-12 13:25:26,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:25:26,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422597673] [2024-05-12 13:25:26,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:25:26,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:25:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:25:27,832 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:25:27,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:25:27,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422597673] [2024-05-12 13:25:27,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422597673] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:25:27,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:25:27,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:25:27,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691765585] [2024-05-12 13:25:27,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:25:27,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:25:27,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:25:27,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:25:27,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:25:28,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:25:28,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 754 transitions, 11241 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:25:28,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:25:28,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:25:28,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:25:29,699 INFO L124 PetriNetUnfolderBase]: 2580/4881 cut-off events. [2024-05-12 13:25:29,699 INFO L125 PetriNetUnfolderBase]: For 453863/453867 co-relation queries the response was YES. [2024-05-12 13:25:29,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37363 conditions, 4881 events. 2580/4881 cut-off events. For 453863/453867 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 35431 event pairs, 611 based on Foata normal form. 6/4590 useless extension candidates. Maximal degree in co-relation 37110. Up to 4044 conditions per place. [2024-05-12 13:25:29,787 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 654 selfloop transitions, 30 changer transitions 0/781 dead transitions. [2024-05-12 13:25:29,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 781 transitions, 12791 flow [2024-05-12 13:25:29,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:25:29,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:25:29,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 204 transitions. [2024-05-12 13:25:29,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-05-12 13:25:29,788 INFO L175 Difference]: Start difference. First operand has 551 places, 754 transitions, 11241 flow. Second operand 12 states and 204 transitions. [2024-05-12 13:25:29,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 781 transitions, 12791 flow [2024-05-12 13:25:33,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 781 transitions, 12575 flow, removed 29 selfloop flow, removed 9 redundant places. [2024-05-12 13:25:33,905 INFO L231 Difference]: Finished difference. Result has 554 places, 755 transitions, 11121 flow [2024-05-12 13:25:33,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11025, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=754, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11121, PETRI_PLACES=554, PETRI_TRANSITIONS=755} [2024-05-12 13:25:33,905 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 510 predicate places. [2024-05-12 13:25:33,905 INFO L495 AbstractCegarLoop]: Abstraction has has 554 places, 755 transitions, 11121 flow [2024-05-12 13:25:33,905 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:25:33,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:25:33,905 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:25:33,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181 [2024-05-12 13:25:33,906 INFO L420 AbstractCegarLoop]: === Iteration 183 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:25:33,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:25:33,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1293885557, now seen corresponding path program 18 times [2024-05-12 13:25:33,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:25:33,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419709843] [2024-05-12 13:25:33,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:25:33,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:25:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:25:34,768 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:25:34,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:25:34,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419709843] [2024-05-12 13:25:34,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419709843] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:25:34,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:25:34,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:25:34,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787408660] [2024-05-12 13:25:34,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:25:34,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:25:34,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:25:34,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:25:34,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:25:34,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:25:34,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 755 transitions, 11121 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:25:34,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:25:34,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:25:34,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:25:36,554 INFO L124 PetriNetUnfolderBase]: 2667/4968 cut-off events. [2024-05-12 13:25:36,555 INFO L125 PetriNetUnfolderBase]: For 433361/433361 co-relation queries the response was YES. [2024-05-12 13:25:36,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37789 conditions, 4968 events. 2667/4968 cut-off events. For 433361/433361 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 35415 event pairs, 351 based on Foata normal form. 2/4671 useless extension candidates. Maximal degree in co-relation 37534. Up to 3458 conditions per place. [2024-05-12 13:25:36,868 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 480 selfloop transitions, 293 changer transitions 0/782 dead transitions. [2024-05-12 13:25:36,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 782 transitions, 13161 flow [2024-05-12 13:25:36,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:25:36,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:25:36,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 208 transitions. [2024-05-12 13:25:36,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-05-12 13:25:36,869 INFO L175 Difference]: Start difference. First operand has 554 places, 755 transitions, 11121 flow. Second operand 12 states and 208 transitions. [2024-05-12 13:25:36,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 782 transitions, 13161 flow [2024-05-12 13:25:41,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 782 transitions, 13027 flow, removed 38 selfloop flow, removed 10 redundant places. [2024-05-12 13:25:41,107 INFO L231 Difference]: Finished difference. Result has 556 places, 755 transitions, 11579 flow [2024-05-12 13:25:41,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10987, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=755, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=293, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11579, PETRI_PLACES=556, PETRI_TRANSITIONS=755} [2024-05-12 13:25:41,108 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 512 predicate places. [2024-05-12 13:25:41,108 INFO L495 AbstractCegarLoop]: Abstraction has has 556 places, 755 transitions, 11579 flow [2024-05-12 13:25:41,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:25:41,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:25:41,109 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:25:41,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182 [2024-05-12 13:25:41,109 INFO L420 AbstractCegarLoop]: === Iteration 184 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:25:41,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:25:41,110 INFO L85 PathProgramCache]: Analyzing trace with hash 516941817, now seen corresponding path program 19 times [2024-05-12 13:25:41,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:25:41,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285667494] [2024-05-12 13:25:41,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:25:41,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:25:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:25:42,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:25:42,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:25:42,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285667494] [2024-05-12 13:25:42,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285667494] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:25:42,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:25:42,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:25:42,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058005622] [2024-05-12 13:25:42,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:25:42,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:25:42,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:25:42,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:25:42,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:25:42,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:25:42,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 755 transitions, 11579 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:25:42,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:25:42,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:25:42,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:25:43,817 INFO L124 PetriNetUnfolderBase]: 2678/4988 cut-off events. [2024-05-12 13:25:43,818 INFO L125 PetriNetUnfolderBase]: For 438683/438683 co-relation queries the response was YES. [2024-05-12 13:25:43,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38519 conditions, 4988 events. 2678/4988 cut-off events. For 438683/438683 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 35593 event pairs, 423 based on Foata normal form. 2/4690 useless extension candidates. Maximal degree in co-relation 38263. Up to 3468 conditions per place. [2024-05-12 13:25:43,912 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 581 selfloop transitions, 197 changer transitions 0/787 dead transitions. [2024-05-12 13:25:43,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 787 transitions, 14031 flow [2024-05-12 13:25:43,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:25:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:25:43,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 216 transitions. [2024-05-12 13:25:43,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-05-12 13:25:43,913 INFO L175 Difference]: Start difference. First operand has 556 places, 755 transitions, 11579 flow. Second operand 12 states and 216 transitions. [2024-05-12 13:25:43,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 787 transitions, 14031 flow [2024-05-12 13:25:48,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 787 transitions, 13431 flow, removed 1 selfloop flow, removed 11 redundant places. [2024-05-12 13:25:48,655 INFO L231 Difference]: Finished difference. Result has 557 places, 757 transitions, 11444 flow [2024-05-12 13:25:48,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10983, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=755, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11444, PETRI_PLACES=557, PETRI_TRANSITIONS=757} [2024-05-12 13:25:48,655 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 513 predicate places. [2024-05-12 13:25:48,655 INFO L495 AbstractCegarLoop]: Abstraction has has 557 places, 757 transitions, 11444 flow [2024-05-12 13:25:48,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:25:48,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:25:48,656 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:25:48,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2024-05-12 13:25:48,656 INFO L420 AbstractCegarLoop]: === Iteration 185 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:25:48,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:25:48,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1552499957, now seen corresponding path program 20 times [2024-05-12 13:25:48,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:25:48,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331623642] [2024-05-12 13:25:48,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:25:48,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:25:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:25:49,589 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:25:49,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:25:49,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331623642] [2024-05-12 13:25:49,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331623642] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:25:49,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:25:49,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:25:49,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21534309] [2024-05-12 13:25:49,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:25:49,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:25:49,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:25:49,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:25:49,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:25:49,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:25:49,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 757 transitions, 11444 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:25:49,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:25:49,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:25:49,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:25:51,478 INFO L124 PetriNetUnfolderBase]: 2674/4982 cut-off events. [2024-05-12 13:25:51,478 INFO L125 PetriNetUnfolderBase]: For 421265/421265 co-relation queries the response was YES. [2024-05-12 13:25:51,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37915 conditions, 4982 events. 2674/4982 cut-off events. For 421265/421265 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 35536 event pairs, 413 based on Foata normal form. 2/4684 useless extension candidates. Maximal degree in co-relation 37658. Up to 3465 conditions per place. [2024-05-12 13:25:51,561 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 579 selfloop transitions, 198 changer transitions 0/786 dead transitions. [2024-05-12 13:25:51,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 786 transitions, 13528 flow [2024-05-12 13:25:51,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:25:51,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:25:51,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 214 transitions. [2024-05-12 13:25:51,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44583333333333336 [2024-05-12 13:25:51,563 INFO L175 Difference]: Start difference. First operand has 557 places, 757 transitions, 11444 flow. Second operand 12 states and 214 transitions. [2024-05-12 13:25:51,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 786 transitions, 13528 flow [2024-05-12 13:25:56,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 786 transitions, 13006 flow, removed 48 selfloop flow, removed 10 redundant places. [2024-05-12 13:25:56,399 INFO L231 Difference]: Finished difference. Result has 559 places, 757 transitions, 11323 flow [2024-05-12 13:25:56,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10922, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=757, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=198, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11323, PETRI_PLACES=559, PETRI_TRANSITIONS=757} [2024-05-12 13:25:56,399 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 515 predicate places. [2024-05-12 13:25:56,399 INFO L495 AbstractCegarLoop]: Abstraction has has 559 places, 757 transitions, 11323 flow [2024-05-12 13:25:56,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:25:56,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:25:56,400 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:25:56,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2024-05-12 13:25:56,400 INFO L420 AbstractCegarLoop]: === Iteration 186 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:25:56,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:25:56,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1294202346, now seen corresponding path program 5 times [2024-05-12 13:25:56,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:25:56,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124040379] [2024-05-12 13:25:56,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:25:56,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:25:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:25:57,531 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:25:57,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:25:57,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124040379] [2024-05-12 13:25:57,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124040379] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:25:57,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:25:57,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:25:57,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385310120] [2024-05-12 13:25:57,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:25:57,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:25:57,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:25:57,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:25:57,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:25:57,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:25:57,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 757 transitions, 11323 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:25:57,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:25:57,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:25:57,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:25:59,538 INFO L124 PetriNetUnfolderBase]: 2680/4992 cut-off events. [2024-05-12 13:25:59,539 INFO L125 PetriNetUnfolderBase]: For 410083/410083 co-relation queries the response was YES. [2024-05-12 13:25:59,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37835 conditions, 4992 events. 2680/4992 cut-off events. For 410083/410083 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 35649 event pairs, 530 based on Foata normal form. 1/4696 useless extension candidates. Maximal degree in co-relation 37577. Up to 4258 conditions per place. [2024-05-12 13:25:59,635 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 664 selfloop transitions, 108 changer transitions 0/781 dead transitions. [2024-05-12 13:25:59,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 781 transitions, 13055 flow [2024-05-12 13:25:59,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:25:59,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:25:59,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 197 transitions. [2024-05-12 13:25:59,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41041666666666665 [2024-05-12 13:25:59,637 INFO L175 Difference]: Start difference. First operand has 559 places, 757 transitions, 11323 flow. Second operand 12 states and 197 transitions. [2024-05-12 13:25:59,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 781 transitions, 13055 flow [2024-05-12 13:26:03,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 781 transitions, 12635 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-05-12 13:26:03,370 INFO L231 Difference]: Finished difference. Result has 559 places, 759 transitions, 11187 flow [2024-05-12 13:26:03,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10903, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=757, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=649, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11187, PETRI_PLACES=559, PETRI_TRANSITIONS=759} [2024-05-12 13:26:03,371 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 515 predicate places. [2024-05-12 13:26:03,371 INFO L495 AbstractCegarLoop]: Abstraction has has 559 places, 759 transitions, 11187 flow [2024-05-12 13:26:03,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:26:03,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:26:03,371 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:26:03,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2024-05-12 13:26:03,371 INFO L420 AbstractCegarLoop]: === Iteration 187 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:26:03,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:26:03,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1987202755, now seen corresponding path program 21 times [2024-05-12 13:26:03,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:26:03,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137752598] [2024-05-12 13:26:03,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:26:03,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:26:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:26:04,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:26:04,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:26:04,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137752598] [2024-05-12 13:26:04,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137752598] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:26:04,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:26:04,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:26:04,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036934706] [2024-05-12 13:26:04,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:26:04,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:26:04,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:26:04,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:26:04,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:26:04,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:26:04,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 759 transitions, 11187 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:26:04,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:26:04,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:26:04,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:26:05,964 INFO L124 PetriNetUnfolderBase]: 2676/4985 cut-off events. [2024-05-12 13:26:05,964 INFO L125 PetriNetUnfolderBase]: For 404456/404456 co-relation queries the response was YES. [2024-05-12 13:26:06,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37104 conditions, 4985 events. 2676/4985 cut-off events. For 404456/404456 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 35554 event pairs, 364 based on Foata normal form. 2/4686 useless extension candidates. Maximal degree in co-relation 36845. Up to 3471 conditions per place. [2024-05-12 13:26:06,064 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 514 selfloop transitions, 262 changer transitions 0/785 dead transitions. [2024-05-12 13:26:06,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 785 transitions, 12933 flow [2024-05-12 13:26:06,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:26:06,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:26:06,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 208 transitions. [2024-05-12 13:26:06,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-05-12 13:26:06,065 INFO L175 Difference]: Start difference. First operand has 559 places, 759 transitions, 11187 flow. Second operand 12 states and 208 transitions. [2024-05-12 13:26:06,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 785 transitions, 12933 flow [2024-05-12 13:26:10,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 785 transitions, 12627 flow, removed 47 selfloop flow, removed 10 redundant places. [2024-05-12 13:26:10,832 INFO L231 Difference]: Finished difference. Result has 561 places, 759 transitions, 11410 flow [2024-05-12 13:26:10,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10881, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=759, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=262, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11410, PETRI_PLACES=561, PETRI_TRANSITIONS=759} [2024-05-12 13:26:10,832 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 517 predicate places. [2024-05-12 13:26:10,832 INFO L495 AbstractCegarLoop]: Abstraction has has 561 places, 759 transitions, 11410 flow [2024-05-12 13:26:10,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:26:10,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:26:10,833 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:26:10,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2024-05-12 13:26:10,833 INFO L420 AbstractCegarLoop]: === Iteration 188 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:26:10,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:26:10,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2049486212, now seen corresponding path program 6 times [2024-05-12 13:26:10,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:26:10,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326384892] [2024-05-12 13:26:10,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:26:10,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:26:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:26:12,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:26:12,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:26:12,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326384892] [2024-05-12 13:26:12,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326384892] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:26:12,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:26:12,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:26:12,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123404278] [2024-05-12 13:26:12,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:26:12,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:26:12,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:26:12,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:26:12,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:26:12,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:26:12,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 759 transitions, 11410 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:26:12,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:26:12,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:26:12,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:26:13,858 INFO L124 PetriNetUnfolderBase]: 2674/4980 cut-off events. [2024-05-12 13:26:13,858 INFO L125 PetriNetUnfolderBase]: For 382984/382984 co-relation queries the response was YES. [2024-05-12 13:26:13,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37298 conditions, 4980 events. 2674/4980 cut-off events. For 382984/382984 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 35560 event pairs, 523 based on Foata normal form. 1/4684 useless extension candidates. Maximal degree in co-relation 37038. Up to 4249 conditions per place. [2024-05-12 13:26:13,963 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 679 selfloop transitions, 93 changer transitions 0/781 dead transitions. [2024-05-12 13:26:13,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 781 transitions, 13084 flow [2024-05-12 13:26:13,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:26:13,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:26:13,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 199 transitions. [2024-05-12 13:26:13,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41458333333333336 [2024-05-12 13:26:13,964 INFO L175 Difference]: Start difference. First operand has 561 places, 759 transitions, 11410 flow. Second operand 12 states and 199 transitions. [2024-05-12 13:26:13,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 781 transitions, 13084 flow [2024-05-12 13:26:18,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 781 transitions, 12496 flow, removed 16 selfloop flow, removed 12 redundant places. [2024-05-12 13:26:18,289 INFO L231 Difference]: Finished difference. Result has 561 places, 759 transitions, 11014 flow [2024-05-12 13:26:18,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10822, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=759, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11014, PETRI_PLACES=561, PETRI_TRANSITIONS=759} [2024-05-12 13:26:18,289 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 517 predicate places. [2024-05-12 13:26:18,289 INFO L495 AbstractCegarLoop]: Abstraction has has 561 places, 759 transitions, 11014 flow [2024-05-12 13:26:18,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:26:18,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:26:18,289 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:26:18,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187 [2024-05-12 13:26:18,290 INFO L420 AbstractCegarLoop]: === Iteration 189 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:26:18,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:26:18,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1348542826, now seen corresponding path program 16 times [2024-05-12 13:26:18,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:26:18,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21198272] [2024-05-12 13:26:18,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:26:18,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:26:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:26:19,276 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:26:19,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:26:19,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21198272] [2024-05-12 13:26:19,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21198272] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:26:19,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:26:19,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:26:19,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599636692] [2024-05-12 13:26:19,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:26:19,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:26:19,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:26:19,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:26:19,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:26:19,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:26:19,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 759 transitions, 11014 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:26:19,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:26:19,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:26:19,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:26:21,164 INFO L124 PetriNetUnfolderBase]: 2554/4907 cut-off events. [2024-05-12 13:26:21,164 INFO L125 PetriNetUnfolderBase]: For 400575/400665 co-relation queries the response was YES. [2024-05-12 13:26:21,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36042 conditions, 4907 events. 2554/4907 cut-off events. For 400575/400665 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 36468 event pairs, 373 based on Foata normal form. 33/4586 useless extension candidates. Maximal degree in co-relation 35781. Up to 3913 conditions per place. [2024-05-12 13:26:21,264 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 645 selfloop transitions, 88 changer transitions 0/807 dead transitions. [2024-05-12 13:26:21,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 807 transitions, 13013 flow [2024-05-12 13:26:21,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:26:21,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:26:21,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-05-12 13:26:21,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625 [2024-05-12 13:26:21,265 INFO L175 Difference]: Start difference. First operand has 561 places, 759 transitions, 11014 flow. Second operand 10 states and 185 transitions. [2024-05-12 13:26:21,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 807 transitions, 13013 flow [2024-05-12 13:26:25,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 807 transitions, 12786 flow, removed 9 selfloop flow, removed 11 redundant places. [2024-05-12 13:26:25,837 INFO L231 Difference]: Finished difference. Result has 561 places, 786 transitions, 11479 flow [2024-05-12 13:26:25,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10787, PETRI_DIFFERENCE_MINUEND_PLACES=550, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=759, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11479, PETRI_PLACES=561, PETRI_TRANSITIONS=786} [2024-05-12 13:26:25,838 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 517 predicate places. [2024-05-12 13:26:25,838 INFO L495 AbstractCegarLoop]: Abstraction has has 561 places, 786 transitions, 11479 flow [2024-05-12 13:26:25,838 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:26:25,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:26:25,838 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:26:25,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2024-05-12 13:26:25,838 INFO L420 AbstractCegarLoop]: === Iteration 190 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:26:25,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:26:25,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1875122402, now seen corresponding path program 17 times [2024-05-12 13:26:25,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:26:25,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604029200] [2024-05-12 13:26:25,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:26:25,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:26:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:26:26,975 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:26:26,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:26:26,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604029200] [2024-05-12 13:26:26,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604029200] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:26:26,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:26:26,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:26:26,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341300079] [2024-05-12 13:26:26,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:26:26,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:26:26,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:26:26,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:26:26,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:26:27,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:26:27,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 786 transitions, 11479 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:26:27,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:26:27,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:26:27,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:26:29,163 INFO L124 PetriNetUnfolderBase]: 2619/5063 cut-off events. [2024-05-12 13:26:29,164 INFO L125 PetriNetUnfolderBase]: For 413141/413231 co-relation queries the response was YES. [2024-05-12 13:26:29,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37367 conditions, 5063 events. 2619/5063 cut-off events. For 413141/413231 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 38039 event pairs, 417 based on Foata normal form. 33/4730 useless extension candidates. Maximal degree in co-relation 37104. Up to 4078 conditions per place. [2024-05-12 13:26:29,254 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 663 selfloop transitions, 83 changer transitions 0/820 dead transitions. [2024-05-12 13:26:29,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 820 transitions, 13303 flow [2024-05-12 13:26:29,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:26:29,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:26:29,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 194 transitions. [2024-05-12 13:26:29,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4409090909090909 [2024-05-12 13:26:29,255 INFO L175 Difference]: Start difference. First operand has 561 places, 786 transitions, 11479 flow. Second operand 11 states and 194 transitions. [2024-05-12 13:26:29,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 820 transitions, 13303 flow [2024-05-12 13:26:34,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 820 transitions, 13160 flow, removed 28 selfloop flow, removed 4 redundant places. [2024-05-12 13:26:34,120 INFO L231 Difference]: Finished difference. Result has 569 places, 799 transitions, 11787 flow [2024-05-12 13:26:34,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11336, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=786, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=703, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11787, PETRI_PLACES=569, PETRI_TRANSITIONS=799} [2024-05-12 13:26:34,120 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 525 predicate places. [2024-05-12 13:26:34,120 INFO L495 AbstractCegarLoop]: Abstraction has has 569 places, 799 transitions, 11787 flow [2024-05-12 13:26:34,121 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:26:34,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:26:34,121 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:26:34,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable189 [2024-05-12 13:26:34,121 INFO L420 AbstractCegarLoop]: === Iteration 191 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:26:34,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:26:34,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1758937502, now seen corresponding path program 18 times [2024-05-12 13:26:34,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:26:34,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378819699] [2024-05-12 13:26:34,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:26:34,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:26:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:26:35,166 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:26:35,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:26:35,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378819699] [2024-05-12 13:26:35,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378819699] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:26:35,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:26:35,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:26:35,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783780012] [2024-05-12 13:26:35,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:26:35,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:26:35,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:26:35,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:26:35,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:26:35,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:26:35,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 799 transitions, 11787 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:26:35,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:26:35,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:26:35,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:26:37,142 INFO L124 PetriNetUnfolderBase]: 2636/5109 cut-off events. [2024-05-12 13:26:37,142 INFO L125 PetriNetUnfolderBase]: For 423217/423314 co-relation queries the response was YES. [2024-05-12 13:26:37,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37773 conditions, 5109 events. 2636/5109 cut-off events. For 423217/423314 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 38630 event pairs, 525 based on Foata normal form. 34/4773 useless extension candidates. Maximal degree in co-relation 37506. Up to 4047 conditions per place. [2024-05-12 13:26:37,242 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 664 selfloop transitions, 90 changer transitions 0/828 dead transitions. [2024-05-12 13:26:37,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 828 transitions, 13531 flow [2024-05-12 13:26:37,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:26:37,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:26:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2024-05-12 13:26:37,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4475 [2024-05-12 13:26:37,243 INFO L175 Difference]: Start difference. First operand has 569 places, 799 transitions, 11787 flow. Second operand 10 states and 179 transitions. [2024-05-12 13:26:37,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 828 transitions, 13531 flow [2024-05-12 13:26:41,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 828 transitions, 13315 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-05-12 13:26:41,181 INFO L231 Difference]: Finished difference. Result has 572 places, 802 transitions, 11891 flow [2024-05-12 13:26:41,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11571, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=799, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=710, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11891, PETRI_PLACES=572, PETRI_TRANSITIONS=802} [2024-05-12 13:26:41,182 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 528 predicate places. [2024-05-12 13:26:41,182 INFO L495 AbstractCegarLoop]: Abstraction has has 572 places, 802 transitions, 11891 flow [2024-05-12 13:26:41,183 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:26:41,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:26:41,183 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:26:41,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2024-05-12 13:26:41,185 INFO L420 AbstractCegarLoop]: === Iteration 192 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:26:41,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:26:41,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1875116450, now seen corresponding path program 5 times [2024-05-12 13:26:41,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:26:41,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730143846] [2024-05-12 13:26:41,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:26:41,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:26:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:26:42,283 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:26:42,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:26:42,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730143846] [2024-05-12 13:26:42,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730143846] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:26:42,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:26:42,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:26:42,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536797865] [2024-05-12 13:26:42,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:26:42,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:26:42,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:26:42,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:26:42,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:26:42,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:26:42,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 802 transitions, 11891 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:26:42,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:26:42,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:26:42,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:26:44,370 INFO L124 PetriNetUnfolderBase]: 2843/5351 cut-off events. [2024-05-12 13:26:44,370 INFO L125 PetriNetUnfolderBase]: For 402580/402580 co-relation queries the response was YES. [2024-05-12 13:26:44,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39762 conditions, 5351 events. 2843/5351 cut-off events. For 402580/402580 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 39257 event pairs, 606 based on Foata normal form. 1/5024 useless extension candidates. Maximal degree in co-relation 39494. Up to 4524 conditions per place. [2024-05-12 13:26:44,476 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 670 selfloop transitions, 151 changer transitions 0/830 dead transitions. [2024-05-12 13:26:44,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 830 transitions, 13745 flow [2024-05-12 13:26:44,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:26:44,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:26:44,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 184 transitions. [2024-05-12 13:26:44,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-05-12 13:26:44,477 INFO L175 Difference]: Start difference. First operand has 572 places, 802 transitions, 11891 flow. Second operand 11 states and 184 transitions. [2024-05-12 13:26:44,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 830 transitions, 13745 flow [2024-05-12 13:26:48,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 830 transitions, 13526 flow, removed 35 selfloop flow, removed 7 redundant places. [2024-05-12 13:26:48,938 INFO L231 Difference]: Finished difference. Result has 576 places, 804 transitions, 12083 flow [2024-05-12 13:26:48,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11672, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=802, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12083, PETRI_PLACES=576, PETRI_TRANSITIONS=804} [2024-05-12 13:26:48,939 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 532 predicate places. [2024-05-12 13:26:48,939 INFO L495 AbstractCegarLoop]: Abstraction has has 576 places, 804 transitions, 12083 flow [2024-05-12 13:26:48,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:26:48,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:26:48,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:26:48,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2024-05-12 13:26:48,940 INFO L420 AbstractCegarLoop]: === Iteration 193 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:26:48,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:26:48,940 INFO L85 PathProgramCache]: Analyzing trace with hash 242329095, now seen corresponding path program 22 times [2024-05-12 13:26:48,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:26:48,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584617156] [2024-05-12 13:26:48,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:26:48,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:26:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:26:49,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:26:49,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:26:49,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584617156] [2024-05-12 13:26:49,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584617156] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:26:49,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:26:49,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:26:49,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687638315] [2024-05-12 13:26:49,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:26:49,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:26:49,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:26:49,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:26:49,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:26:49,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:26:49,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 804 transitions, 12083 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:26:49,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:26:49,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:26:49,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:26:52,085 INFO L124 PetriNetUnfolderBase]: 2863/5379 cut-off events. [2024-05-12 13:26:52,086 INFO L125 PetriNetUnfolderBase]: For 395245/395245 co-relation queries the response was YES. [2024-05-12 13:26:52,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38978 conditions, 5379 events. 2863/5379 cut-off events. For 395245/395245 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 39339 event pairs, 493 based on Foata normal form. 2/5049 useless extension candidates. Maximal degree in co-relation 38709. Up to 4616 conditions per place. [2024-05-12 13:26:52,188 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 748 selfloop transitions, 79 changer transitions 0/836 dead transitions. [2024-05-12 13:26:52,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 587 places, 836 transitions, 14049 flow [2024-05-12 13:26:52,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:26:52,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:26:52,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 196 transitions. [2024-05-12 13:26:52,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2024-05-12 13:26:52,189 INFO L175 Difference]: Start difference. First operand has 576 places, 804 transitions, 12083 flow. Second operand 12 states and 196 transitions. [2024-05-12 13:26:52,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 587 places, 836 transitions, 14049 flow [2024-05-12 13:26:56,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 578 places, 836 transitions, 13702 flow, removed 39 selfloop flow, removed 9 redundant places. [2024-05-12 13:26:56,127 INFO L231 Difference]: Finished difference. Result has 579 places, 812 transitions, 12070 flow [2024-05-12 13:26:56,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11744, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=804, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=725, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=12070, PETRI_PLACES=579, PETRI_TRANSITIONS=812} [2024-05-12 13:26:56,127 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 535 predicate places. [2024-05-12 13:26:56,127 INFO L495 AbstractCegarLoop]: Abstraction has has 579 places, 812 transitions, 12070 flow [2024-05-12 13:26:56,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:26:56,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:26:56,128 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:26:56,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192 [2024-05-12 13:26:56,128 INFO L420 AbstractCegarLoop]: === Iteration 194 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:26:56,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:26:56,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1565592738, now seen corresponding path program 19 times [2024-05-12 13:26:56,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:26:56,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096194317] [2024-05-12 13:26:56,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:26:56,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:26:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:26:57,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:26:57,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:26:57,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096194317] [2024-05-12 13:26:57,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096194317] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:26:57,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:26:57,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:26:57,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346957135] [2024-05-12 13:26:57,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:26:57,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:26:57,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:26:57,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:26:57,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:26:57,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:26:57,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 812 transitions, 12070 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:26:57,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:26:57,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:26:57,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:26:59,450 INFO L124 PetriNetUnfolderBase]: 2671/5178 cut-off events. [2024-05-12 13:26:59,450 INFO L125 PetriNetUnfolderBase]: For 385434/385539 co-relation queries the response was YES. [2024-05-12 13:26:59,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37226 conditions, 5178 events. 2671/5178 cut-off events. For 385434/385539 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 39236 event pairs, 515 based on Foata normal form. 33/4835 useless extension candidates. Maximal degree in co-relation 36956. Up to 4102 conditions per place. [2024-05-12 13:26:59,560 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 658 selfloop transitions, 107 changer transitions 0/839 dead transitions. [2024-05-12 13:26:59,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 839 transitions, 13822 flow [2024-05-12 13:26:59,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:26:59,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:26:59,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2024-05-12 13:26:59,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4475 [2024-05-12 13:26:59,561 INFO L175 Difference]: Start difference. First operand has 579 places, 812 transitions, 12070 flow. Second operand 10 states and 179 transitions. [2024-05-12 13:26:59,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 839 transitions, 13822 flow [2024-05-12 13:27:03,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 839 transitions, 13612 flow, removed 19 selfloop flow, removed 9 redundant places. [2024-05-12 13:27:03,613 INFO L231 Difference]: Finished difference. Result has 581 places, 815 transitions, 12188 flow [2024-05-12 13:27:03,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11860, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=812, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=706, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12188, PETRI_PLACES=581, PETRI_TRANSITIONS=815} [2024-05-12 13:27:03,614 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 537 predicate places. [2024-05-12 13:27:03,614 INFO L495 AbstractCegarLoop]: Abstraction has has 581 places, 815 transitions, 12188 flow [2024-05-12 13:27:03,614 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:27:03,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:03,614 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:27:03,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable193 [2024-05-12 13:27:03,614 INFO L420 AbstractCegarLoop]: === Iteration 195 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:27:03,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:03,615 INFO L85 PathProgramCache]: Analyzing trace with hash 436268505, now seen corresponding path program 23 times [2024-05-12 13:27:03,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:03,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026097235] [2024-05-12 13:27:03,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:03,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:04,511 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:27:04,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:04,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026097235] [2024-05-12 13:27:04,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026097235] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:04,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:04,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:27:04,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858169089] [2024-05-12 13:27:04,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:04,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:27:04,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:04,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:27:04,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:27:04,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:27:04,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 815 transitions, 12188 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:27:04,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:04,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:27:04,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:06,665 INFO L124 PetriNetUnfolderBase]: 2906/5469 cut-off events. [2024-05-12 13:27:06,665 INFO L125 PetriNetUnfolderBase]: For 418372/418372 co-relation queries the response was YES. [2024-05-12 13:27:06,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40302 conditions, 5469 events. 2906/5469 cut-off events. For 418372/418372 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 40299 event pairs, 553 based on Foata normal form. 2/5140 useless extension candidates. Maximal degree in co-relation 40030. Up to 4022 conditions per place. [2024-05-12 13:27:06,781 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 631 selfloop transitions, 207 changer transitions 0/847 dead transitions. [2024-05-12 13:27:06,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 847 transitions, 14506 flow [2024-05-12 13:27:06,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:27:06,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:27:06,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2024-05-12 13:27:06,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2024-05-12 13:27:06,782 INFO L175 Difference]: Start difference. First operand has 581 places, 815 transitions, 12188 flow. Second operand 11 states and 192 transitions. [2024-05-12 13:27:06,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 847 transitions, 14506 flow [2024-05-12 13:27:11,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 847 transitions, 14226 flow, removed 42 selfloop flow, removed 7 redundant places. [2024-05-12 13:27:11,524 INFO L231 Difference]: Finished difference. Result has 585 places, 819 transitions, 12498 flow [2024-05-12 13:27:11,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11932, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=815, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12498, PETRI_PLACES=585, PETRI_TRANSITIONS=819} [2024-05-12 13:27:11,525 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 541 predicate places. [2024-05-12 13:27:11,525 INFO L495 AbstractCegarLoop]: Abstraction has has 585 places, 819 transitions, 12498 flow [2024-05-12 13:27:11,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:27:11,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:11,525 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:27:11,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194 [2024-05-12 13:27:11,526 INFO L420 AbstractCegarLoop]: === Iteration 196 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:27:11,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:11,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1028761121, now seen corresponding path program 24 times [2024-05-12 13:27:11,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:11,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759292291] [2024-05-12 13:27:11,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:11,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:12,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:27:12,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:12,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759292291] [2024-05-12 13:27:12,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759292291] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:12,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:12,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:27:12,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703420695] [2024-05-12 13:27:12,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:12,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:27:12,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:12,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:27:12,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:27:12,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:27:12,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 819 transitions, 12498 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:27:12,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:12,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:27:12,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:14,478 INFO L124 PetriNetUnfolderBase]: 2941/5524 cut-off events. [2024-05-12 13:27:14,479 INFO L125 PetriNetUnfolderBase]: For 408330/408330 co-relation queries the response was YES. [2024-05-12 13:27:14,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40252 conditions, 5524 events. 2941/5524 cut-off events. For 408330/408330 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 40580 event pairs, 519 based on Foata normal form. 2/5181 useless extension candidates. Maximal degree in co-relation 39979. Up to 4550 conditions per place. [2024-05-12 13:27:14,590 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 721 selfloop transitions, 135 changer transitions 0/865 dead transitions. [2024-05-12 13:27:14,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 865 transitions, 14980 flow [2024-05-12 13:27:14,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:27:14,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:27:14,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 204 transitions. [2024-05-12 13:27:14,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-05-12 13:27:14,591 INFO L175 Difference]: Start difference. First operand has 585 places, 819 transitions, 12498 flow. Second operand 12 states and 204 transitions. [2024-05-12 13:27:14,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 596 places, 865 transitions, 14980 flow [2024-05-12 13:27:19,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 865 transitions, 14708 flow, removed 35 selfloop flow, removed 9 redundant places. [2024-05-12 13:27:19,389 INFO L231 Difference]: Finished difference. Result has 590 places, 837 transitions, 12892 flow [2024-05-12 13:27:19,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12238, PETRI_DIFFERENCE_MINUEND_PLACES=576, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=819, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=12892, PETRI_PLACES=590, PETRI_TRANSITIONS=837} [2024-05-12 13:27:19,390 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 546 predicate places. [2024-05-12 13:27:19,390 INFO L495 AbstractCegarLoop]: Abstraction has has 590 places, 837 transitions, 12892 flow [2024-05-12 13:27:19,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:27:19,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:19,391 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:27:19,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195 [2024-05-12 13:27:19,391 INFO L420 AbstractCegarLoop]: === Iteration 197 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:27:19,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:19,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1028501651, now seen corresponding path program 25 times [2024-05-12 13:27:19,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:19,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864194251] [2024-05-12 13:27:19,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:19,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:20,310 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:27:20,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:20,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864194251] [2024-05-12 13:27:20,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864194251] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:20,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:20,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:27:20,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829156311] [2024-05-12 13:27:20,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:20,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:27:20,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:20,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:27:20,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:27:20,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:27:20,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 837 transitions, 12892 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:27:20,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:20,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:27:20,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:22,486 INFO L124 PetriNetUnfolderBase]: 2952/5544 cut-off events. [2024-05-12 13:27:22,487 INFO L125 PetriNetUnfolderBase]: For 403739/403739 co-relation queries the response was YES. [2024-05-12 13:27:22,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40719 conditions, 5544 events. 2952/5544 cut-off events. For 403739/403739 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 40780 event pairs, 492 based on Foata normal form. 2/5200 useless extension candidates. Maximal degree in co-relation 40444. Up to 4560 conditions per place. [2024-05-12 13:27:22,602 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 714 selfloop transitions, 144 changer transitions 0/867 dead transitions. [2024-05-12 13:27:22,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 867 transitions, 15184 flow [2024-05-12 13:27:22,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:27:22,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:27:22,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 203 transitions. [2024-05-12 13:27:22,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42291666666666666 [2024-05-12 13:27:22,603 INFO L175 Difference]: Start difference. First operand has 590 places, 837 transitions, 12892 flow. Second operand 12 states and 203 transitions. [2024-05-12 13:27:22,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 867 transitions, 15184 flow [2024-05-12 13:27:27,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 593 places, 867 transitions, 14882 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-05-12 13:27:27,228 INFO L231 Difference]: Finished difference. Result has 594 places, 839 transitions, 12961 flow [2024-05-12 13:27:27,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12594, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=837, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=695, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=12961, PETRI_PLACES=594, PETRI_TRANSITIONS=839} [2024-05-12 13:27:27,228 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 550 predicate places. [2024-05-12 13:27:27,229 INFO L495 AbstractCegarLoop]: Abstraction has has 594 places, 839 transitions, 12961 flow [2024-05-12 13:27:27,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:27:27,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:27,229 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:27:27,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196 [2024-05-12 13:27:27,229 INFO L420 AbstractCegarLoop]: === Iteration 198 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:27:27,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:27,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1704035230, now seen corresponding path program 7 times [2024-05-12 13:27:27,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:27,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162758458] [2024-05-12 13:27:27,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:27,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:28,241 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:27:28,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:28,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162758458] [2024-05-12 13:27:28,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162758458] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:28,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:28,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:27:28,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45583619] [2024-05-12 13:27:28,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:28,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:27:28,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:28,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:27:28,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:27:28,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:27:28,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 839 transitions, 12961 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:27:28,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:28,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:27:28,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:30,729 INFO L124 PetriNetUnfolderBase]: 2958/5557 cut-off events. [2024-05-12 13:27:30,729 INFO L125 PetriNetUnfolderBase]: For 396295/396295 co-relation queries the response was YES. [2024-05-12 13:27:30,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40820 conditions, 5557 events. 2958/5557 cut-off events. For 396295/396295 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 40995 event pairs, 651 based on Foata normal form. 1/5214 useless extension candidates. Maximal degree in co-relation 40544. Up to 4793 conditions per place. [2024-05-12 13:27:30,838 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 773 selfloop transitions, 81 changer transitions 0/863 dead transitions. [2024-05-12 13:27:30,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 863 transitions, 14863 flow [2024-05-12 13:27:30,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:27:30,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:27:30,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 178 transitions. [2024-05-12 13:27:30,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40454545454545454 [2024-05-12 13:27:30,839 INFO L175 Difference]: Start difference. First operand has 594 places, 839 transitions, 12961 flow. Second operand 11 states and 178 transitions. [2024-05-12 13:27:30,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 863 transitions, 14863 flow [2024-05-12 13:27:35,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 863 transitions, 14572 flow, removed 26 selfloop flow, removed 9 redundant places. [2024-05-12 13:27:35,632 INFO L231 Difference]: Finished difference. Result has 596 places, 841 transitions, 12916 flow [2024-05-12 13:27:35,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12670, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=839, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=758, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12916, PETRI_PLACES=596, PETRI_TRANSITIONS=841} [2024-05-12 13:27:35,633 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 552 predicate places. [2024-05-12 13:27:35,633 INFO L495 AbstractCegarLoop]: Abstraction has has 596 places, 841 transitions, 12916 flow [2024-05-12 13:27:35,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:27:35,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:35,633 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:27:35,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable197 [2024-05-12 13:27:35,634 INFO L420 AbstractCegarLoop]: === Iteration 199 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:27:35,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:35,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1557958647, now seen corresponding path program 26 times [2024-05-12 13:27:35,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:35,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727814391] [2024-05-12 13:27:35,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:35,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:36,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:27:36,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:36,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727814391] [2024-05-12 13:27:36,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727814391] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:36,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:36,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:27:36,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985425941] [2024-05-12 13:27:36,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:36,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:27:36,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:36,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:27:36,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:27:36,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:27:36,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 841 transitions, 12916 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:27:36,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:36,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:27:36,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:38,707 INFO L124 PetriNetUnfolderBase]: 2954/5548 cut-off events. [2024-05-12 13:27:38,707 INFO L125 PetriNetUnfolderBase]: For 387599/387599 co-relation queries the response was YES. [2024-05-12 13:27:38,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40288 conditions, 5548 events. 2954/5548 cut-off events. For 387599/387599 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 40858 event pairs, 505 based on Foata normal form. 2/5208 useless extension candidates. Maximal degree in co-relation 40011. Up to 4080 conditions per place. [2024-05-12 13:27:38,818 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 573 selfloop transitions, 285 changer transitions 0/867 dead transitions. [2024-05-12 13:27:38,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 867 transitions, 14802 flow [2024-05-12 13:27:38,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:27:38,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:27:38,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 188 transitions. [2024-05-12 13:27:38,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42727272727272725 [2024-05-12 13:27:38,820 INFO L175 Difference]: Start difference. First operand has 596 places, 841 transitions, 12916 flow. Second operand 11 states and 188 transitions. [2024-05-12 13:27:38,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 867 transitions, 14802 flow [2024-05-12 13:27:43,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 597 places, 867 transitions, 14552 flow, removed 51 selfloop flow, removed 9 redundant places. [2024-05-12 13:27:43,620 INFO L231 Difference]: Finished difference. Result has 598 places, 841 transitions, 13256 flow [2024-05-12 13:27:43,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12666, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=841, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=285, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13256, PETRI_PLACES=598, PETRI_TRANSITIONS=841} [2024-05-12 13:27:43,621 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 554 predicate places. [2024-05-12 13:27:43,621 INFO L495 AbstractCegarLoop]: Abstraction has has 598 places, 841 transitions, 13256 flow [2024-05-12 13:27:43,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:27:43,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:43,621 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:27:43,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable198 [2024-05-12 13:27:43,621 INFO L420 AbstractCegarLoop]: === Iteration 200 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:27:43,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:43,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1277633776, now seen corresponding path program 20 times [2024-05-12 13:27:43,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:43,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599818446] [2024-05-12 13:27:43,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:43,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:44,621 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:27:44,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:44,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599818446] [2024-05-12 13:27:44,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599818446] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:44,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:44,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:27:44,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230564014] [2024-05-12 13:27:44,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:44,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:27:44,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:44,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:27:44,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:27:44,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:27:44,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 841 transitions, 13256 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:27:44,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:44,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:27:44,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:46,823 INFO L124 PetriNetUnfolderBase]: 2762/5343 cut-off events. [2024-05-12 13:27:46,823 INFO L125 PetriNetUnfolderBase]: For 388457/388553 co-relation queries the response was YES. [2024-05-12 13:27:46,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39410 conditions, 5343 events. 2762/5343 cut-off events. For 388457/388553 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 40560 event pairs, 436 based on Foata normal form. 33/4978 useless extension candidates. Maximal degree in co-relation 39132. Up to 4245 conditions per place. [2024-05-12 13:27:46,924 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 682 selfloop transitions, 110 changer transitions 0/866 dead transitions. [2024-05-12 13:27:46,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 866 transitions, 15044 flow [2024-05-12 13:27:46,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:27:46,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:27:46,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-05-12 13:27:46,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445 [2024-05-12 13:27:46,925 INFO L175 Difference]: Start difference. First operand has 598 places, 841 transitions, 13256 flow. Second operand 10 states and 178 transitions. [2024-05-12 13:27:46,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 866 transitions, 15044 flow [2024-05-12 13:27:50,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 866 transitions, 14460 flow, removed 7 selfloop flow, removed 11 redundant places. [2024-05-12 13:27:50,381 INFO L231 Difference]: Finished difference. Result has 598 places, 844 transitions, 12979 flow [2024-05-12 13:27:50,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12672, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=841, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=732, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12979, PETRI_PLACES=598, PETRI_TRANSITIONS=844} [2024-05-12 13:27:50,382 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 554 predicate places. [2024-05-12 13:27:50,382 INFO L495 AbstractCegarLoop]: Abstraction has has 598 places, 844 transitions, 12979 flow [2024-05-12 13:27:50,382 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:27:50,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:50,382 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:27:50,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable199 [2024-05-12 13:27:50,382 INFO L420 AbstractCegarLoop]: === Iteration 201 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:27:50,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:50,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1847524315, now seen corresponding path program 27 times [2024-05-12 13:27:50,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:50,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338315207] [2024-05-12 13:27:50,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:50,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:51,275 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:27:51,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:51,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338315207] [2024-05-12 13:27:51,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338315207] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:51,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:51,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:27:51,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628023839] [2024-05-12 13:27:51,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:51,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:27:51,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:51,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:27:51,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:27:51,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:27:51,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 844 transitions, 12979 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:27:51,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:51,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:27:51,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:53,610 INFO L124 PetriNetUnfolderBase]: 2997/5616 cut-off events. [2024-05-12 13:27:53,610 INFO L125 PetriNetUnfolderBase]: For 410382/410382 co-relation queries the response was YES. [2024-05-12 13:27:53,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41688 conditions, 5616 events. 2997/5616 cut-off events. For 410382/410382 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 41266 event pairs, 498 based on Foata normal form. 2/5266 useless extension candidates. Maximal degree in co-relation 41410. Up to 3580 conditions per place. [2024-05-12 13:27:53,719 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 583 selfloop transitions, 282 changer transitions 0/874 dead transitions. [2024-05-12 13:27:53,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 874 transitions, 15339 flow [2024-05-12 13:27:53,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:27:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:27:53,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 194 transitions. [2024-05-12 13:27:53,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4409090909090909 [2024-05-12 13:27:53,720 INFO L175 Difference]: Start difference. First operand has 598 places, 844 transitions, 12979 flow. Second operand 11 states and 194 transitions. [2024-05-12 13:27:53,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 874 transitions, 15339 flow [2024-05-12 13:27:58,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 874 transitions, 15061 flow, removed 33 selfloop flow, removed 7 redundant places. [2024-05-12 13:27:58,414 INFO L231 Difference]: Finished difference. Result has 602 places, 848 transitions, 13429 flow [2024-05-12 13:27:58,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12713, PETRI_DIFFERENCE_MINUEND_PLACES=591, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=844, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=280, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13429, PETRI_PLACES=602, PETRI_TRANSITIONS=848} [2024-05-12 13:27:58,415 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 558 predicate places. [2024-05-12 13:27:58,415 INFO L495 AbstractCegarLoop]: Abstraction has has 602 places, 848 transitions, 13429 flow [2024-05-12 13:27:58,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:27:58,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:58,416 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:27:58,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable200 [2024-05-12 13:27:58,416 INFO L420 AbstractCegarLoop]: === Iteration 202 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:27:58,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:58,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1854933625, now seen corresponding path program 28 times [2024-05-12 13:27:58,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:58,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108409503] [2024-05-12 13:27:58,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:58,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:59,351 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:27:59,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:59,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108409503] [2024-05-12 13:27:59,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108409503] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:59,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:59,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:27:59,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171696210] [2024-05-12 13:27:59,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:59,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:27:59,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:59,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:27:59,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:27:59,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:27:59,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 848 transitions, 13429 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:27:59,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:59,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:27:59,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:01,413 INFO L124 PetriNetUnfolderBase]: 3038/5694 cut-off events. [2024-05-12 13:28:01,413 INFO L125 PetriNetUnfolderBase]: For 457362/457362 co-relation queries the response was YES. [2024-05-12 13:28:01,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43149 conditions, 5694 events. 3038/5694 cut-off events. For 457362/457362 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 42013 event pairs, 496 based on Foata normal form. 2/5341 useless extension candidates. Maximal degree in co-relation 42870. Up to 3616 conditions per place. [2024-05-12 13:28:01,532 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 602 selfloop transitions, 272 changer transitions 0/883 dead transitions. [2024-05-12 13:28:01,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 883 transitions, 16501 flow [2024-05-12 13:28:01,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:28:01,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:28:01,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 199 transitions. [2024-05-12 13:28:01,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45227272727272727 [2024-05-12 13:28:01,533 INFO L175 Difference]: Start difference. First operand has 602 places, 848 transitions, 13429 flow. Second operand 11 states and 199 transitions. [2024-05-12 13:28:01,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 883 transitions, 16501 flow [2024-05-12 13:28:07,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 883 transitions, 15960 flow, removed 53 selfloop flow, removed 9 redundant places. [2024-05-12 13:28:07,621 INFO L231 Difference]: Finished difference. Result has 604 places, 854 transitions, 13668 flow [2024-05-12 13:28:07,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12918, PETRI_DIFFERENCE_MINUEND_PLACES=593, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=848, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=266, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13668, PETRI_PLACES=604, PETRI_TRANSITIONS=854} [2024-05-12 13:28:07,621 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 560 predicate places. [2024-05-12 13:28:07,621 INFO L495 AbstractCegarLoop]: Abstraction has has 604 places, 854 transitions, 13668 flow [2024-05-12 13:28:07,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:28:07,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:07,622 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:28:07,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable201 [2024-05-12 13:28:07,622 INFO L420 AbstractCegarLoop]: === Iteration 203 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:28:07,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:07,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1275520007, now seen corresponding path program 29 times [2024-05-12 13:28:07,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:07,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216795443] [2024-05-12 13:28:07,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:07,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:08,492 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:28:08,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:08,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216795443] [2024-05-12 13:28:08,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216795443] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:08,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:08,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:28:08,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438030626] [2024-05-12 13:28:08,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:08,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:28:08,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:08,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:28:08,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:28:08,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:28:08,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 854 transitions, 13668 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:28:08,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:08,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:28:08,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:10,612 INFO L124 PetriNetUnfolderBase]: 3034/5688 cut-off events. [2024-05-12 13:28:10,612 INFO L125 PetriNetUnfolderBase]: For 432241/432241 co-relation queries the response was YES. [2024-05-12 13:28:10,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42796 conditions, 5688 events. 3034/5688 cut-off events. For 432241/432241 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 41967 event pairs, 502 based on Foata normal form. 2/5335 useless extension candidates. Maximal degree in co-relation 42517. Up to 3613 conditions per place. [2024-05-12 13:28:10,726 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 603 selfloop transitions, 270 changer transitions 0/882 dead transitions. [2024-05-12 13:28:10,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 882 transitions, 16210 flow [2024-05-12 13:28:10,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:28:10,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:28:10,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 199 transitions. [2024-05-12 13:28:10,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45227272727272727 [2024-05-12 13:28:10,727 INFO L175 Difference]: Start difference. First operand has 604 places, 854 transitions, 13668 flow. Second operand 11 states and 199 transitions. [2024-05-12 13:28:10,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 614 places, 882 transitions, 16210 flow [2024-05-12 13:28:16,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 882 transitions, 15655 flow, removed 53 selfloop flow, removed 7 redundant places. [2024-05-12 13:28:16,306 INFO L231 Difference]: Finished difference. Result has 608 places, 854 transitions, 13665 flow [2024-05-12 13:28:16,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=13117, PETRI_DIFFERENCE_MINUEND_PLACES=597, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=854, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=270, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13665, PETRI_PLACES=608, PETRI_TRANSITIONS=854} [2024-05-12 13:28:16,307 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 564 predicate places. [2024-05-12 13:28:16,307 INFO L495 AbstractCegarLoop]: Abstraction has has 608 places, 854 transitions, 13665 flow [2024-05-12 13:28:16,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:28:16,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:16,308 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:28:16,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable202 [2024-05-12 13:28:16,308 INFO L420 AbstractCegarLoop]: === Iteration 204 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:28:16,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:16,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1269999344, now seen corresponding path program 8 times [2024-05-12 13:28:16,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:16,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018918770] [2024-05-12 13:28:16,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:16,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:17,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:28:17,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:17,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018918770] [2024-05-12 13:28:17,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018918770] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:17,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:17,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:28:17,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947873879] [2024-05-12 13:28:17,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:17,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:28:17,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:17,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:28:17,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:28:17,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:28:17,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 854 transitions, 13665 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:28:17,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:17,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:28:17,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:19,434 INFO L124 PetriNetUnfolderBase]: 3040/5698 cut-off events. [2024-05-12 13:28:19,434 INFO L125 PetriNetUnfolderBase]: For 419672/419672 co-relation queries the response was YES. [2024-05-12 13:28:19,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42765 conditions, 5698 events. 3040/5698 cut-off events. For 419672/419672 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 42022 event pairs, 588 based on Foata normal form. 1/5345 useless extension candidates. Maximal degree in co-relation 42486. Up to 4777 conditions per place. [2024-05-12 13:28:19,553 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 749 selfloop transitions, 118 changer transitions 0/876 dead transitions. [2024-05-12 13:28:19,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 618 places, 876 transitions, 15583 flow [2024-05-12 13:28:19,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:28:19,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:28:19,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 183 transitions. [2024-05-12 13:28:19,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4159090909090909 [2024-05-12 13:28:19,554 INFO L175 Difference]: Start difference. First operand has 608 places, 854 transitions, 13665 flow. Second operand 11 states and 183 transitions. [2024-05-12 13:28:19,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 618 places, 876 transitions, 15583 flow [2024-05-12 13:28:24,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 876 transitions, 15014 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-05-12 13:28:24,385 INFO L231 Difference]: Finished difference. Result has 608 places, 856 transitions, 13405 flow [2024-05-12 13:28:24,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=13096, PETRI_DIFFERENCE_MINUEND_PLACES=597, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=854, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=736, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13405, PETRI_PLACES=608, PETRI_TRANSITIONS=856} [2024-05-12 13:28:24,386 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 564 predicate places. [2024-05-12 13:28:24,386 INFO L495 AbstractCegarLoop]: Abstraction has has 608 places, 856 transitions, 13405 flow [2024-05-12 13:28:24,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:28:24,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:24,386 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:28:24,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable203 [2024-05-12 13:28:24,387 INFO L420 AbstractCegarLoop]: === Iteration 205 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:28:24,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:24,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1854942925, now seen corresponding path program 30 times [2024-05-12 13:28:24,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:24,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670872769] [2024-05-12 13:28:24,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:24,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:25,279 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:28:25,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:25,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670872769] [2024-05-12 13:28:25,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670872769] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:25,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:25,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:28:25,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840452200] [2024-05-12 13:28:25,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:25,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:28:25,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:25,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:28:25,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:28:25,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:28:25,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 856 transitions, 13405 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:28:25,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:25,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:28:25,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:27,605 INFO L124 PetriNetUnfolderBase]: 3036/5691 cut-off events. [2024-05-12 13:28:27,605 INFO L125 PetriNetUnfolderBase]: For 405984/405984 co-relation queries the response was YES. [2024-05-12 13:28:27,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41819 conditions, 5691 events. 3036/5691 cut-off events. For 405984/405984 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 41965 event pairs, 495 based on Foata normal form. 2/5337 useless extension candidates. Maximal degree in co-relation 41540. Up to 3619 conditions per place. [2024-05-12 13:28:27,737 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 599 selfloop transitions, 275 changer transitions 0/883 dead transitions. [2024-05-12 13:28:27,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 618 places, 883 transitions, 15643 flow [2024-05-12 13:28:27,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:28:27,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:28:27,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions. [2024-05-12 13:28:27,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44545454545454544 [2024-05-12 13:28:27,739 INFO L175 Difference]: Start difference. First operand has 608 places, 856 transitions, 13405 flow. Second operand 11 states and 196 transitions. [2024-05-12 13:28:27,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 618 places, 883 transitions, 15643 flow [2024-05-12 13:28:32,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 883 transitions, 15312 flow, removed 49 selfloop flow, removed 10 redundant places. [2024-05-12 13:28:32,143 INFO L231 Difference]: Finished difference. Result has 609 places, 856 transitions, 13635 flow [2024-05-12 13:28:32,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=13076, PETRI_DIFFERENCE_MINUEND_PLACES=598, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=856, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=275, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13635, PETRI_PLACES=609, PETRI_TRANSITIONS=856} [2024-05-12 13:28:32,143 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 565 predicate places. [2024-05-12 13:28:32,144 INFO L495 AbstractCegarLoop]: Abstraction has has 609 places, 856 transitions, 13635 flow [2024-05-12 13:28:32,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:28:32,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:32,144 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:28:32,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable204 [2024-05-12 13:28:32,144 INFO L420 AbstractCegarLoop]: === Iteration 206 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:28:32,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:32,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2113548366, now seen corresponding path program 9 times [2024-05-12 13:28:32,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:32,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956302780] [2024-05-12 13:28:32,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:32,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:33,265 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:28:33,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:33,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956302780] [2024-05-12 13:28:33,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956302780] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:33,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:33,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:28:33,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375705249] [2024-05-12 13:28:33,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:33,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:28:33,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:33,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:28:33,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:28:33,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:28:33,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 856 transitions, 13635 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:28:33,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:33,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:28:33,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:35,473 INFO L124 PetriNetUnfolderBase]: 3048/5710 cut-off events. [2024-05-12 13:28:35,474 INFO L125 PetriNetUnfolderBase]: For 395381/395381 co-relation queries the response was YES. [2024-05-12 13:28:35,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42453 conditions, 5710 events. 3048/5710 cut-off events. For 395381/395381 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 42177 event pairs, 587 based on Foata normal form. 1/5355 useless extension candidates. Maximal degree in co-relation 42174. Up to 4789 conditions per place. [2024-05-12 13:28:35,585 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 726 selfloop transitions, 145 changer transitions 0/880 dead transitions. [2024-05-12 13:28:35,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 880 transitions, 15579 flow [2024-05-12 13:28:35,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:28:35,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:28:35,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 180 transitions. [2024-05-12 13:28:35,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-05-12 13:28:35,586 INFO L175 Difference]: Start difference. First operand has 609 places, 856 transitions, 13635 flow. Second operand 11 states and 180 transitions. [2024-05-12 13:28:35,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 619 places, 880 transitions, 15579 flow [2024-05-12 13:28:40,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 880 transitions, 15014 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-05-12 13:28:40,638 INFO L231 Difference]: Finished difference. Result has 609 places, 860 transitions, 13455 flow [2024-05-12 13:28:40,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=13070, PETRI_DIFFERENCE_MINUEND_PLACES=598, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=856, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=711, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13455, PETRI_PLACES=609, PETRI_TRANSITIONS=860} [2024-05-12 13:28:40,639 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 565 predicate places. [2024-05-12 13:28:40,639 INFO L495 AbstractCegarLoop]: Abstraction has has 609 places, 860 transitions, 13455 flow [2024-05-12 13:28:40,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:28:40,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:40,639 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:28:40,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable205 [2024-05-12 13:28:40,639 INFO L420 AbstractCegarLoop]: === Iteration 207 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:28:40,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:40,640 INFO L85 PathProgramCache]: Analyzing trace with hash 2104293936, now seen corresponding path program 10 times [2024-05-12 13:28:40,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:40,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403979626] [2024-05-12 13:28:40,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:40,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:41,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:28:41,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:41,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403979626] [2024-05-12 13:28:41,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403979626] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:41,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:41,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:28:41,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822610694] [2024-05-12 13:28:41,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:41,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:28:41,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:41,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:28:41,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:28:41,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:28:41,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 860 transitions, 13455 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:28:41,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:41,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:28:41,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:44,078 INFO L124 PetriNetUnfolderBase]: 3054/5716 cut-off events. [2024-05-12 13:28:44,078 INFO L125 PetriNetUnfolderBase]: For 393212/393212 co-relation queries the response was YES. [2024-05-12 13:28:44,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42045 conditions, 5716 events. 3054/5716 cut-off events. For 393212/393212 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 42139 event pairs, 590 based on Foata normal form. 1/5360 useless extension candidates. Maximal degree in co-relation 41766. Up to 4798 conditions per place. [2024-05-12 13:28:44,193 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 748 selfloop transitions, 125 changer transitions 0/882 dead transitions. [2024-05-12 13:28:44,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 882 transitions, 15393 flow [2024-05-12 13:28:44,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:28:44,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:28:44,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2024-05-12 13:28:44,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41363636363636364 [2024-05-12 13:28:44,194 INFO L175 Difference]: Start difference. First operand has 609 places, 860 transitions, 13455 flow. Second operand 11 states and 182 transitions. [2024-05-12 13:28:44,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 619 places, 882 transitions, 15393 flow [2024-05-12 13:28:49,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 610 places, 882 transitions, 15058 flow, removed 26 selfloop flow, removed 9 redundant places. [2024-05-12 13:28:49,206 INFO L231 Difference]: Finished difference. Result has 611 places, 862 transitions, 13451 flow [2024-05-12 13:28:49,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=13120, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=860, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=735, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13451, PETRI_PLACES=611, PETRI_TRANSITIONS=862} [2024-05-12 13:28:49,207 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 567 predicate places. [2024-05-12 13:28:49,207 INFO L495 AbstractCegarLoop]: Abstraction has has 611 places, 862 transitions, 13451 flow [2024-05-12 13:28:49,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:28:49,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:49,207 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:28:49,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable206 [2024-05-12 13:28:49,207 INFO L420 AbstractCegarLoop]: === Iteration 208 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:28:49,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:49,207 INFO L85 PathProgramCache]: Analyzing trace with hash 2104024825, now seen corresponding path program 31 times [2024-05-12 13:28:49,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:49,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196864983] [2024-05-12 13:28:49,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:49,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:50,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:28:50,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:50,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196864983] [2024-05-12 13:28:50,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196864983] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:50,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:50,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:28:50,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152409930] [2024-05-12 13:28:50,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:50,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:28:50,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:50,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:28:50,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:28:50,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:28:50,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 862 transitions, 13451 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:28:50,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:50,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:28:50,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:52,508 INFO L124 PetriNetUnfolderBase]: 3065/5729 cut-off events. [2024-05-12 13:28:52,508 INFO L125 PetriNetUnfolderBase]: For 410882/410882 co-relation queries the response was YES. [2024-05-12 13:28:52,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42193 conditions, 5729 events. 3065/5729 cut-off events. For 410882/410882 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 42167 event pairs, 507 based on Foata normal form. 2/5371 useless extension candidates. Maximal degree in co-relation 41913. Up to 3656 conditions per place. [2024-05-12 13:28:52,626 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 560 selfloop transitions, 320 changer transitions 0/889 dead transitions. [2024-05-12 13:28:52,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 889 transitions, 15751 flow [2024-05-12 13:28:52,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:28:52,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:28:52,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2024-05-12 13:28:52,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43863636363636366 [2024-05-12 13:28:52,627 INFO L175 Difference]: Start difference. First operand has 611 places, 862 transitions, 13451 flow. Second operand 11 states and 193 transitions. [2024-05-12 13:28:52,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 621 places, 889 transitions, 15751 flow [2024-05-12 13:28:56,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 889 transitions, 15448 flow, removed 30 selfloop flow, removed 9 redundant places. [2024-05-12 13:28:56,824 INFO L231 Difference]: Finished difference. Result has 613 places, 864 transitions, 13866 flow [2024-05-12 13:28:56,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=13150, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=862, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=318, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13866, PETRI_PLACES=613, PETRI_TRANSITIONS=864} [2024-05-12 13:28:56,825 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 569 predicate places. [2024-05-12 13:28:56,825 INFO L495 AbstractCegarLoop]: Abstraction has has 613 places, 864 transitions, 13866 flow [2024-05-12 13:28:56,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:28:56,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:56,825 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:28:56,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207 [2024-05-12 13:28:56,825 INFO L420 AbstractCegarLoop]: === Iteration 209 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:28:56,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:56,825 INFO L85 PathProgramCache]: Analyzing trace with hash 2104284295, now seen corresponding path program 32 times [2024-05-12 13:28:56,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:56,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985319405] [2024-05-12 13:28:56,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:56,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:57,752 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:28:57,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:57,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985319405] [2024-05-12 13:28:57,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985319405] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:57,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:57,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:28:57,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639858337] [2024-05-12 13:28:57,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:57,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:28:57,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:57,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:28:57,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:28:57,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:28:57,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 864 transitions, 13866 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:28:57,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:57,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:28:57,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:29:00,083 INFO L124 PetriNetUnfolderBase]: 3151/5891 cut-off events. [2024-05-12 13:29:00,083 INFO L125 PetriNetUnfolderBase]: For 440191/440191 co-relation queries the response was YES. [2024-05-12 13:29:00,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44366 conditions, 5891 events. 3151/5891 cut-off events. For 440191/440191 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 43672 event pairs, 524 based on Foata normal form. 2/5511 useless extension candidates. Maximal degree in co-relation 44085. Up to 4525 conditions per place. [2024-05-12 13:29:00,194 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 726 selfloop transitions, 210 changer transitions 0/945 dead transitions. [2024-05-12 13:29:00,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 945 transitions, 17334 flow [2024-05-12 13:29:00,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:29:00,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:29:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 212 transitions. [2024-05-12 13:29:00,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2024-05-12 13:29:00,196 INFO L175 Difference]: Start difference. First operand has 613 places, 864 transitions, 13866 flow. Second operand 12 states and 212 transitions. [2024-05-12 13:29:00,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 945 transitions, 17334 flow [2024-05-12 13:29:05,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 945 transitions, 16424 flow, removed 30 selfloop flow, removed 12 redundant places. [2024-05-12 13:29:05,643 INFO L231 Difference]: Finished difference. Result has 618 places, 903 transitions, 14306 flow [2024-05-12 13:29:05,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=13077, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=864, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=658, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=14306, PETRI_PLACES=618, PETRI_TRANSITIONS=903} [2024-05-12 13:29:05,643 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 574 predicate places. [2024-05-12 13:29:05,643 INFO L495 AbstractCegarLoop]: Abstraction has has 618 places, 903 transitions, 14306 flow [2024-05-12 13:29:05,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:29:05,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:29:05,643 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:29:05,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable208 [2024-05-12 13:29:05,643 INFO L420 AbstractCegarLoop]: === Iteration 210 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:29:05,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:29:05,644 INFO L85 PathProgramCache]: Analyzing trace with hash 2104293595, now seen corresponding path program 33 times [2024-05-12 13:29:05,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:29:05,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860945693] [2024-05-12 13:29:05,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:29:05,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:29:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:29:06,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:29:06,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:29:06,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860945693] [2024-05-12 13:29:06,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860945693] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:29:06,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:29:06,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:29:06,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163999977] [2024-05-12 13:29:06,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:29:06,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:29:06,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:29:06,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:29:06,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:29:06,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:29:06,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 618 places, 903 transitions, 14306 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:29:06,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:29:06,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:29:06,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:29:08,900 INFO L124 PetriNetUnfolderBase]: 3147/5876 cut-off events. [2024-05-12 13:29:08,900 INFO L125 PetriNetUnfolderBase]: For 413335/413335 co-relation queries the response was YES. [2024-05-12 13:29:08,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43910 conditions, 5876 events. 3147/5876 cut-off events. For 413335/413335 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 43426 event pairs, 499 based on Foata normal form. 2/5496 useless extension candidates. Maximal degree in co-relation 43625. Up to 3736 conditions per place. [2024-05-12 13:29:09,018 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 569 selfloop transitions, 351 changer transitions 0/929 dead transitions. [2024-05-12 13:29:09,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 929 transitions, 16628 flow [2024-05-12 13:29:09,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:29:09,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:29:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 195 transitions. [2024-05-12 13:29:09,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2024-05-12 13:29:09,019 INFO L175 Difference]: Start difference. First operand has 618 places, 903 transitions, 14306 flow. Second operand 11 states and 195 transitions. [2024-05-12 13:29:09,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 929 transitions, 16628 flow [2024-05-12 13:29:13,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 929 transitions, 16310 flow, removed 49 selfloop flow, removed 6 redundant places. [2024-05-12 13:29:13,368 INFO L231 Difference]: Finished difference. Result has 623 places, 903 transitions, 14701 flow [2024-05-12 13:29:13,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=13988, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=903, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=351, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14701, PETRI_PLACES=623, PETRI_TRANSITIONS=903} [2024-05-12 13:29:13,368 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 579 predicate places. [2024-05-12 13:29:13,369 INFO L495 AbstractCegarLoop]: Abstraction has has 623 places, 903 transitions, 14701 flow [2024-05-12 13:29:13,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:29:13,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:29:13,369 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:29:13,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable209 [2024-05-12 13:29:13,369 INFO L420 AbstractCegarLoop]: === Iteration 211 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:29:13,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:29:13,369 INFO L85 PathProgramCache]: Analyzing trace with hash 2113559526, now seen corresponding path program 11 times [2024-05-12 13:29:13,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:29:13,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690173311] [2024-05-12 13:29:13,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:29:13,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:29:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:29:14,551 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:29:14,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:29:14,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690173311] [2024-05-12 13:29:14,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690173311] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:29:14,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:29:14,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:29:14,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129382126] [2024-05-12 13:29:14,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:29:14,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:29:14,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:29:14,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:29:14,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:29:14,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:29:14,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 903 transitions, 14701 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:29:14,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:29:14,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:29:14,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:29:16,995 INFO L124 PetriNetUnfolderBase]: 3161/5901 cut-off events. [2024-05-12 13:29:16,995 INFO L125 PetriNetUnfolderBase]: For 420431/420431 co-relation queries the response was YES. [2024-05-12 13:29:17,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44803 conditions, 5901 events. 3161/5901 cut-off events. For 420431/420431 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 43702 event pairs, 594 based on Foata normal form. 1/5520 useless extension candidates. Maximal degree in co-relation 44517. Up to 4897 conditions per place. [2024-05-12 13:29:17,115 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 748 selfloop transitions, 173 changer transitions 0/930 dead transitions. [2024-05-12 13:29:17,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 930 transitions, 17127 flow [2024-05-12 13:29:17,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:29:17,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:29:17,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 196 transitions. [2024-05-12 13:29:17,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2024-05-12 13:29:17,116 INFO L175 Difference]: Start difference. First operand has 623 places, 903 transitions, 14701 flow. Second operand 12 states and 196 transitions. [2024-05-12 13:29:17,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 930 transitions, 17127 flow [2024-05-12 13:29:22,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 930 transitions, 16422 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-05-12 13:29:22,192 INFO L231 Difference]: Finished difference. Result has 625 places, 907 transitions, 14499 flow [2024-05-12 13:29:22,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=13998, PETRI_DIFFERENCE_MINUEND_PLACES=613, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=903, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=732, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=14499, PETRI_PLACES=625, PETRI_TRANSITIONS=907} [2024-05-12 13:29:22,193 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 581 predicate places. [2024-05-12 13:29:22,193 INFO L495 AbstractCegarLoop]: Abstraction has has 625 places, 907 transitions, 14499 flow [2024-05-12 13:29:22,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:29:22,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:29:22,193 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:29:22,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable210 [2024-05-12 13:29:22,193 INFO L420 AbstractCegarLoop]: === Iteration 212 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:29:22,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:29:22,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2113548025, now seen corresponding path program 34 times [2024-05-12 13:29:22,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:29:22,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60096129] [2024-05-12 13:29:22,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:29:22,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:29:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:29:23,057 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:29:23,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:29:23,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60096129] [2024-05-12 13:29:23,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60096129] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:29:23,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:29:23,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:29:23,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502326421] [2024-05-12 13:29:23,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:29:23,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:29:23,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:29:23,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:29:23,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:29:23,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:29:23,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 625 places, 907 transitions, 14499 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:29:23,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:29:23,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:29:23,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:29:25,381 INFO L124 PetriNetUnfolderBase]: 3172/5917 cut-off events. [2024-05-12 13:29:25,381 INFO L125 PetriNetUnfolderBase]: For 430668/430668 co-relation queries the response was YES. [2024-05-12 13:29:25,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44440 conditions, 5917 events. 3172/5917 cut-off events. For 430668/430668 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 43718 event pairs, 406 based on Foata normal form. 2/5534 useless extension candidates. Maximal degree in co-relation 44154. Up to 3767 conditions per place. [2024-05-12 13:29:25,502 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 491 selfloop transitions, 434 changer transitions 0/934 dead transitions. [2024-05-12 13:29:25,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 934 transitions, 16893 flow [2024-05-12 13:29:25,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:29:25,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:29:25,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 191 transitions. [2024-05-12 13:29:25,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4340909090909091 [2024-05-12 13:29:25,504 INFO L175 Difference]: Start difference. First operand has 625 places, 907 transitions, 14499 flow. Second operand 11 states and 191 transitions. [2024-05-12 13:29:25,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 934 transitions, 16893 flow [2024-05-12 13:29:31,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 626 places, 934 transitions, 16622 flow, removed 33 selfloop flow, removed 9 redundant places. [2024-05-12 13:29:31,679 INFO L231 Difference]: Finished difference. Result has 627 places, 909 transitions, 15179 flow [2024-05-12 13:29:31,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14230, PETRI_DIFFERENCE_MINUEND_PLACES=616, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=907, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=432, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15179, PETRI_PLACES=627, PETRI_TRANSITIONS=909} [2024-05-12 13:29:31,680 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 583 predicate places. [2024-05-12 13:29:31,680 INFO L495 AbstractCegarLoop]: Abstraction has has 627 places, 909 transitions, 15179 flow [2024-05-12 13:29:31,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:29:31,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:29:31,680 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:29:31,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable211 [2024-05-12 13:29:31,680 INFO L420 AbstractCegarLoop]: === Iteration 213 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:29:31,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:29:31,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2113231236, now seen corresponding path program 12 times [2024-05-12 13:29:31,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:29:31,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738781041] [2024-05-12 13:29:31,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:29:31,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:29:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:29:32,713 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:29:32,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:29:32,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738781041] [2024-05-12 13:29:32,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738781041] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:29:32,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:29:32,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:29:32,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511466415] [2024-05-12 13:29:32,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:29:32,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:29:32,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:29:32,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:29:32,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:29:32,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:29:32,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 909 transitions, 15179 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:29:32,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:29:32,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:29:32,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:29:35,093 INFO L124 PetriNetUnfolderBase]: 3170/5918 cut-off events. [2024-05-12 13:29:35,093 INFO L125 PetriNetUnfolderBase]: For 407680/407680 co-relation queries the response was YES. [2024-05-12 13:29:35,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45382 conditions, 5918 events. 3170/5918 cut-off events. For 407680/407680 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 43779 event pairs, 603 based on Foata normal form. 1/5536 useless extension candidates. Maximal degree in co-relation 45095. Up to 4984 conditions per place. [2024-05-12 13:29:35,223 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 784 selfloop transitions, 136 changer transitions 0/929 dead transitions. [2024-05-12 13:29:35,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 637 places, 929 transitions, 17143 flow [2024-05-12 13:29:35,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:29:35,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:29:35,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 181 transitions. [2024-05-12 13:29:35,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4113636363636364 [2024-05-12 13:29:35,225 INFO L175 Difference]: Start difference. First operand has 627 places, 909 transitions, 15179 flow. Second operand 11 states and 181 transitions. [2024-05-12 13:29:35,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 637 places, 929 transitions, 17143 flow [2024-05-12 13:29:40,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 628 places, 929 transitions, 16383 flow, removed 46 selfloop flow, removed 9 redundant places. [2024-05-12 13:29:40,827 INFO L231 Difference]: Finished difference. Result has 629 places, 909 transitions, 14700 flow [2024-05-12 13:29:40,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14419, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=909, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=773, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14700, PETRI_PLACES=629, PETRI_TRANSITIONS=909} [2024-05-12 13:29:40,828 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 585 predicate places. [2024-05-12 13:29:40,828 INFO L495 AbstractCegarLoop]: Abstraction has has 629 places, 909 transitions, 14700 flow [2024-05-12 13:29:40,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:29:40,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:29:40,828 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:29:40,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable212 [2024-05-12 13:29:40,828 INFO L420 AbstractCegarLoop]: === Iteration 214 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:29:40,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:29:40,829 INFO L85 PathProgramCache]: Analyzing trace with hash 2113559929, now seen corresponding path program 2 times [2024-05-12 13:29:40,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:29:40,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484538179] [2024-05-12 13:29:40,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:29:40,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:29:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:29:41,921 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:29:41,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:29:41,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484538179] [2024-05-12 13:29:41,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484538179] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:29:41,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:29:41,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:29:41,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627844993] [2024-05-12 13:29:41,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:29:41,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:29:41,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:29:41,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:29:41,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:29:42,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:29:42,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 629 places, 909 transitions, 14700 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:29:42,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:29:42,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:29:42,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:29:44,190 INFO L124 PetriNetUnfolderBase]: 3088/5853 cut-off events. [2024-05-12 13:29:44,190 INFO L125 PetriNetUnfolderBase]: For 423227/423232 co-relation queries the response was YES. [2024-05-12 13:29:44,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43763 conditions, 5853 events. 3088/5853 cut-off events. For 423227/423232 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 44123 event pairs, 688 based on Foata normal form. 7/5473 useless extension candidates. Maximal degree in co-relation 43476. Up to 4833 conditions per place. [2024-05-12 13:29:44,310 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 789 selfloop transitions, 40 changer transitions 0/934 dead transitions. [2024-05-12 13:29:44,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 934 transitions, 16538 flow [2024-05-12 13:29:44,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:29:44,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:29:44,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 188 transitions. [2024-05-12 13:29:44,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42727272727272725 [2024-05-12 13:29:44,312 INFO L175 Difference]: Start difference. First operand has 629 places, 909 transitions, 14700 flow. Second operand 11 states and 188 transitions. [2024-05-12 13:29:44,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 934 transitions, 16538 flow [2024-05-12 13:29:50,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 628 places, 934 transitions, 16211 flow, removed 8 selfloop flow, removed 11 redundant places. [2024-05-12 13:29:50,055 INFO L231 Difference]: Finished difference. Result has 629 places, 910 transitions, 14493 flow [2024-05-12 13:29:50,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14373, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=909, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=869, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14493, PETRI_PLACES=629, PETRI_TRANSITIONS=910} [2024-05-12 13:29:50,056 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 585 predicate places. [2024-05-12 13:29:50,056 INFO L495 AbstractCegarLoop]: Abstraction has has 629 places, 910 transitions, 14493 flow [2024-05-12 13:29:50,056 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:29:50,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:29:50,056 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:29:50,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable213 [2024-05-12 13:29:50,056 INFO L420 AbstractCegarLoop]: === Iteration 215 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:29:50,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:29:50,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2113221595, now seen corresponding path program 35 times [2024-05-12 13:29:50,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:29:50,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482704843] [2024-05-12 13:29:50,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:29:50,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:29:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:29:50,923 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:29:50,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:29:50,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482704843] [2024-05-12 13:29:50,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482704843] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:29:50,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:29:50,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:29:50,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540195533] [2024-05-12 13:29:50,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:29:50,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:29:50,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:29:50,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:29:50,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:29:51,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:29:51,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 629 places, 910 transitions, 14493 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:29:51,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:29:51,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:29:51,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:29:53,205 INFO L124 PetriNetUnfolderBase]: 3198/5971 cut-off events. [2024-05-12 13:29:53,205 INFO L125 PetriNetUnfolderBase]: For 418980/418980 co-relation queries the response was YES. [2024-05-12 13:29:53,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44662 conditions, 5971 events. 3198/5971 cut-off events. For 418980/418980 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 44243 event pairs, 435 based on Foata normal form. 2/5584 useless extension candidates. Maximal degree in co-relation 44375. Up to 3805 conditions per place. [2024-05-12 13:29:53,324 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 537 selfloop transitions, 391 changer transitions 0/937 dead transitions. [2024-05-12 13:29:53,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 937 transitions, 16891 flow [2024-05-12 13:29:53,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:29:53,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:29:53,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2024-05-12 13:29:53,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2024-05-12 13:29:53,325 INFO L175 Difference]: Start difference. First operand has 629 places, 910 transitions, 14493 flow. Second operand 11 states and 192 transitions. [2024-05-12 13:29:53,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 937 transitions, 16891 flow [2024-05-12 13:29:58,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 630 places, 937 transitions, 16781 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-05-12 13:29:58,989 INFO L231 Difference]: Finished difference. Result has 631 places, 912 transitions, 15245 flow [2024-05-12 13:29:58,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14385, PETRI_DIFFERENCE_MINUEND_PLACES=620, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=910, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=389, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15245, PETRI_PLACES=631, PETRI_TRANSITIONS=912} [2024-05-12 13:29:58,989 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 587 predicate places. [2024-05-12 13:29:58,989 INFO L495 AbstractCegarLoop]: Abstraction has has 631 places, 912 transitions, 15245 flow [2024-05-12 13:29:58,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:29:58,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:29:58,990 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:29:58,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable214 [2024-05-12 13:29:58,990 INFO L420 AbstractCegarLoop]: === Iteration 216 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:29:58,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:29:58,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2113230895, now seen corresponding path program 36 times [2024-05-12 13:29:58,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:29:58,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140585692] [2024-05-12 13:29:58,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:29:58,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:29:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:29:59,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:29:59,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:29:59,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140585692] [2024-05-12 13:29:59,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140585692] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:29:59,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:29:59,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:29:59,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588363564] [2024-05-12 13:29:59,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:29:59,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:29:59,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:29:59,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:29:59,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:29:59,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:29:59,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 912 transitions, 15245 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:29:59,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:29:59,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:29:59,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:02,211 INFO L124 PetriNetUnfolderBase]: 3194/5965 cut-off events. [2024-05-12 13:30:02,211 INFO L125 PetriNetUnfolderBase]: For 397879/397879 co-relation queries the response was YES. [2024-05-12 13:30:02,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45180 conditions, 5965 events. 3194/5965 cut-off events. For 397879/397879 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 44247 event pairs, 434 based on Foata normal form. 2/5578 useless extension candidates. Maximal degree in co-relation 44892. Up to 3802 conditions per place. [2024-05-12 13:30:02,331 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 540 selfloop transitions, 388 changer transitions 0/937 dead transitions. [2024-05-12 13:30:02,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 641 places, 937 transitions, 17275 flow [2024-05-12 13:30:02,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:30:02,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:30:02,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2024-05-12 13:30:02,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43863636363636366 [2024-05-12 13:30:02,332 INFO L175 Difference]: Start difference. First operand has 631 places, 912 transitions, 15245 flow. Second operand 11 states and 193 transitions. [2024-05-12 13:30:02,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 641 places, 937 transitions, 17275 flow [2024-05-12 13:30:06,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 937 transitions, 16368 flow, removed 47 selfloop flow, removed 10 redundant places. [2024-05-12 13:30:06,883 INFO L231 Difference]: Finished difference. Result has 632 places, 912 transitions, 15125 flow [2024-05-12 13:30:06,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14338, PETRI_DIFFERENCE_MINUEND_PLACES=621, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=912, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=388, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15125, PETRI_PLACES=632, PETRI_TRANSITIONS=912} [2024-05-12 13:30:06,883 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 588 predicate places. [2024-05-12 13:30:06,883 INFO L495 AbstractCegarLoop]: Abstraction has has 632 places, 912 transitions, 15125 flow [2024-05-12 13:30:06,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:06,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:06,884 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:06,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable215 [2024-05-12 13:30:06,884 INFO L420 AbstractCegarLoop]: === Iteration 217 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:06,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:06,884 INFO L85 PathProgramCache]: Analyzing trace with hash 976997650, now seen corresponding path program 21 times [2024-05-12 13:30:06,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:06,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631126115] [2024-05-12 13:30:06,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:06,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:07,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:07,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:07,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631126115] [2024-05-12 13:30:07,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631126115] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:07,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:07,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:30:07,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152478650] [2024-05-12 13:30:07,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:07,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:30:07,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:07,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:30:07,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:30:08,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-05-12 13:30:08,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 912 transitions, 15125 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:08,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:08,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-05-12 13:30:08,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:10,085 INFO L124 PetriNetUnfolderBase]: 2983/5742 cut-off events. [2024-05-12 13:30:10,085 INFO L125 PetriNetUnfolderBase]: For 373530/373624 co-relation queries the response was YES. [2024-05-12 13:30:10,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42943 conditions, 5742 events. 2983/5742 cut-off events. For 373530/373624 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 43978 event pairs, 463 based on Foata normal form. 28/5328 useless extension candidates. Maximal degree in co-relation 42655. Up to 4589 conditions per place. [2024-05-12 13:30:10,205 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 747 selfloop transitions, 113 changer transitions 0/935 dead transitions. [2024-05-12 13:30:10,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 641 places, 935 transitions, 17041 flow [2024-05-12 13:30:10,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:30:10,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:30:10,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2024-05-12 13:30:10,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4425 [2024-05-12 13:30:10,206 INFO L175 Difference]: Start difference. First operand has 632 places, 912 transitions, 15125 flow. Second operand 10 states and 177 transitions. [2024-05-12 13:30:10,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 641 places, 935 transitions, 17041 flow [2024-05-12 13:30:15,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 935 transitions, 16041 flow, removed 1 selfloop flow, removed 12 redundant places. [2024-05-12 13:30:15,305 INFO L231 Difference]: Finished difference. Result has 631 places, 915 transitions, 14430 flow [2024-05-12 13:30:15,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14125, PETRI_DIFFERENCE_MINUEND_PLACES=620, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=912, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=800, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14430, PETRI_PLACES=631, PETRI_TRANSITIONS=915} [2024-05-12 13:30:15,306 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 587 predicate places. [2024-05-12 13:30:15,306 INFO L495 AbstractCegarLoop]: Abstraction has has 631 places, 915 transitions, 14430 flow [2024-05-12 13:30:15,306 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:15,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:15,306 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:15,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable216 [2024-05-12 13:30:15,306 INFO L420 AbstractCegarLoop]: === Iteration 218 === 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,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:15,306 INFO L85 PathProgramCache]: Analyzing trace with hash 977213131, now seen corresponding path program 37 times [2024-05-12 13:30:15,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:15,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927044581] [2024-05-12 13:30:15,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:15,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:16,190 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,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:16,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927044581] [2024-05-12 13:30:16,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927044581] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:16,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:16,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:30:16,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206147069] [2024-05-12 13:30:16,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:16,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:30:16,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:16,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:30:16,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:30:16,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:30:16,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 915 transitions, 14430 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:16,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:16,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:30:16,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:18,476 INFO L124 PetriNetUnfolderBase]: 3214/6007 cut-off events. [2024-05-12 13:30:18,476 INFO L125 PetriNetUnfolderBase]: For 384565/384565 co-relation queries the response was YES. [2024-05-12 13:30:18,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44458 conditions, 6007 events. 3214/6007 cut-off events. For 384565/384565 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 44612 event pairs, 533 based on Foata normal form. 2/5616 useless extension candidates. Maximal degree in co-relation 44169. Up to 3392 conditions per place. [2024-05-12 13:30:18,594 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 584 selfloop transitions, 350 changer transitions 0/943 dead transitions. [2024-05-12 13:30:18,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 641 places, 943 transitions, 16918 flow [2024-05-12 13:30:18,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:30:18,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:30:18,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions. [2024-05-12 13:30:18,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44545454545454544 [2024-05-12 13:30:18,595 INFO L175 Difference]: Start difference. First operand has 631 places, 915 transitions, 14430 flow. Second operand 11 states and 196 transitions. [2024-05-12 13:30:18,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 641 places, 943 transitions, 16918 flow [2024-05-12 13:30:24,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 634 places, 943 transitions, 16644 flow, removed 26 selfloop flow, removed 7 redundant places. [2024-05-12 13:30:24,707 INFO L231 Difference]: Finished difference. Result has 635 places, 919 transitions, 14997 flow [2024-05-12 13:30:24,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14156, PETRI_DIFFERENCE_MINUEND_PLACES=624, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=915, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=348, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14997, PETRI_PLACES=635, PETRI_TRANSITIONS=919} [2024-05-12 13:30:24,707 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 591 predicate places. [2024-05-12 13:30:24,708 INFO L495 AbstractCegarLoop]: Abstraction has has 635 places, 919 transitions, 14997 flow [2024-05-12 13:30:24,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:24,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:24,708 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:24,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable217 [2024-05-12 13:30:24,708 INFO L420 AbstractCegarLoop]: === Iteration 219 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:24,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:24,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1315053955, now seen corresponding path program 38 times [2024-05-12 13:30:24,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:24,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455881951] [2024-05-12 13:30:24,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:24,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:25,668 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,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:25,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455881951] [2024-05-12 13:30:25,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455881951] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:25,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:25,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:30:25,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732123484] [2024-05-12 13:30:25,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:25,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:30:25,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:25,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:30:25,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:30:25,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:30:25,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 919 transitions, 14997 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:25,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:25,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:30:25,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:28,087 INFO L124 PetriNetUnfolderBase]: 3240/6050 cut-off events. [2024-05-12 13:30:28,087 INFO L125 PetriNetUnfolderBase]: For 414169/414169 co-relation queries the response was YES. [2024-05-12 13:30:28,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45880 conditions, 6050 events. 3240/6050 cut-off events. For 414169/414169 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 44951 event pairs, 438 based on Foata normal form. 2/5657 useless extension candidates. Maximal degree in co-relation 45590. Up to 3415 conditions per place. [2024-05-12 13:30:28,217 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 503 selfloop transitions, 435 changer transitions 0/947 dead transitions. [2024-05-12 13:30:28,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 645 places, 947 transitions, 17803 flow [2024-05-12 13:30:28,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:30:28,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:30:28,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 195 transitions. [2024-05-12 13:30:28,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2024-05-12 13:30:28,218 INFO L175 Difference]: Start difference. First operand has 635 places, 919 transitions, 14997 flow. Second operand 11 states and 195 transitions. [2024-05-12 13:30:28,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 645 places, 947 transitions, 17803 flow [2024-05-12 13:30:34,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 947 transitions, 17090 flow, removed 43 selfloop flow, removed 8 redundant places. [2024-05-12 13:30:34,690 INFO L231 Difference]: Finished difference. Result has 638 places, 923 transitions, 15299 flow [2024-05-12 13:30:34,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14300, PETRI_DIFFERENCE_MINUEND_PLACES=627, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=919, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=431, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15299, PETRI_PLACES=638, PETRI_TRANSITIONS=923} [2024-05-12 13:30:34,690 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 594 predicate places. [2024-05-12 13:30:34,690 INFO L495 AbstractCegarLoop]: Abstraction has has 638 places, 923 transitions, 15299 flow [2024-05-12 13:30:34,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:34,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:34,690 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:34,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable218 [2024-05-12 13:30:34,691 INFO L420 AbstractCegarLoop]: === Iteration 220 === 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,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:34,691 INFO L85 PathProgramCache]: Analyzing trace with hash -213476577, now seen corresponding path program 39 times [2024-05-12 13:30:34,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:34,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783372388] [2024-05-12 13:30:34,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:34,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:35,617 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,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:35,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783372388] [2024-05-12 13:30:35,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783372388] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:35,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:35,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 13:30:35,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907786772] [2024-05-12 13:30:35,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:35,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 13:30:35,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:35,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 13:30:35,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-05-12 13:30:35,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-05-12 13:30:35,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 923 transitions, 15299 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 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:35,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:35,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-05-12 13:30:35,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:38,056 INFO L124 PetriNetUnfolderBase]: 3251/6067 cut-off events. [2024-05-12 13:30:38,056 INFO L125 PetriNetUnfolderBase]: For 418465/418465 co-relation queries the response was YES. [2024-05-12 13:30:38,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46317 conditions, 6067 events. 3251/6067 cut-off events. For 418465/418465 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 45100 event pairs, 437 based on Foata normal form. 2/5673 useless extension candidates. Maximal degree in co-relation 46026. Up to 3425 conditions per place. [2024-05-12 13:30:38,181 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 506 selfloop transitions, 435 changer transitions 0/950 dead transitions. [2024-05-12 13:30:38,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 648 places, 950 transitions, 18053 flow [2024-05-12 13:30:38,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:30:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:30:38,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions. [2024-05-12 13:30:38,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44772727272727275 [2024-05-12 13:30:38,182 INFO L175 Difference]: Start difference. First operand has 638 places, 923 transitions, 15299 flow. Second operand 11 states and 197 transitions. [2024-05-12 13:30:38,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 648 places, 950 transitions, 18053 flow Killed by 15