./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-atomic/szymanski.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/protection/szymanski.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 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-atomic/szymanski.i ./goblint.2024-05-21_14-57-05.files/protection/szymanski.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m [2024-06-14 11:18:17,527 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 11:18:17,592 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 11:18:17,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 11:18:17,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 11:18:17,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 11:18:17,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 11:18:17,620 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 11:18:17,621 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 11:18:17,624 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 11:18:17,624 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 11:18:17,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 11:18:17,625 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 11:18:17,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 11:18:17,626 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 11:18:17,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 11:18:17,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 11:18:17,627 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 11:18:17,627 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 11:18:17,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 11:18:17,628 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 11:18:17,628 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 11:18:17,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 11:18:17,628 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 11:18:17,629 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 11:18:17,629 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 11:18:17,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 11:18:17,629 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 11:18:17,630 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 11:18:17,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 11:18:17,631 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 11:18:17,631 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 11:18:17,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 11:18:17,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 11:18:17,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 11:18:17,632 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 11:18:17,632 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 11:18:17,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 11:18:17,632 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 11:18:17,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 11:18:17,633 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 11:18:17,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 11:18:17,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 11:18:17,633 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-14 11:18:17,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 11:18:17,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 11:18:17,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 11:18:17,880 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 11:18:17,880 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 11:18:17,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/szymanski.i [2024-06-14 11:18:18,848 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 11:18:19,054 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 11:18:19,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i [2024-06-14 11:18:19,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d907416b2/8a40dcc0b6de4ab697373d22c41cca85/FLAG007192d82 [2024-06-14 11:18:19,079 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d907416b2/8a40dcc0b6de4ab697373d22c41cca85 [2024-06-14 11:18:19,080 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 11:18:19,081 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 11:18:19,081 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/protection/szymanski.yml/witness.yml [2024-06-14 11:18:19,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 11:18:19,154 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 11:18:19,156 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 11:18:19,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 11:18:19,160 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 11:18:19,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 11:18:19" (1/2) ... [2024-06-14 11:18:19,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551657a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:18:19, skipping insertion in model container [2024-06-14 11:18:19,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 11:18:19" (1/2) ... [2024-06-14 11:18:19,164 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@808e158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:18:19, skipping insertion in model container [2024-06-14 11:18:19,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 11:18:19" (2/2) ... [2024-06-14 11:18:19,164 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551657a4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:18:19, skipping insertion in model container [2024-06-14 11:18:19,164 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 11:18:19" (2/2) ... [2024-06-14 11:18:19,165 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 11:18:19,184 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 11:18:19,185 INFO L97 edCorrectnessWitness]: Location invariant before [L819-L819] ((! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1))) && (! multithreaded || (((0 <= flag2 && flag2 <= 4) && flag2 <= 127) && ((((flag2 == 0 || flag2 == 1) || flag2 == 2) || flag2 == 3) || flag2 == 4)))) && (! multithreaded || (((0 <= flag1 && flag1 <= 4) && flag1 <= 127) && ((((flag1 == 0 || flag1 == 1) || flag1 == 2) || flag1 == 3) || flag1 == 4))) [2024-06-14 11:18:19,185 INFO L97 edCorrectnessWitness]: Location invariant before [L820-L820] ((! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1))) && (! multithreaded || (((0 <= flag2 && flag2 <= 4) && flag2 <= 127) && ((((flag2 == 0 || flag2 == 1) || flag2 == 2) || flag2 == 3) || flag2 == 4)))) && (! multithreaded || (((0 <= flag1 && flag1 <= 4) && flag1 <= 127) && ((((flag1 == 0 || flag1 == 1) || flag1 == 2) || flag1 == 3) || flag1 == 4))) [2024-06-14 11:18:19,185 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 11:18:19,186 INFO L106 edCorrectnessWitness]: ghost_update [L818-L818] multithreaded = 1; [2024-06-14 11:18:19,222 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 11:18:19,497 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 11:18:19,505 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 11:18:19,596 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 11:18:19,628 INFO L206 MainTranslator]: Completed translation [2024-06-14 11:18:19,631 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:18:19 WrapperNode [2024-06-14 11:18:19,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 11:18:19,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 11:18:19,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 11:18:19,635 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 11:18:19,640 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 14.06 11:18:19" (1/1) ... [2024-06-14 11:18:19,652 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 14.06 11:18:19" (1/1) ... [2024-06-14 11:18:19,681 INFO L138 Inliner]: procedures = 169, calls = 66, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 170 [2024-06-14 11:18:19,690 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 11:18:19,691 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 11:18:19,691 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 11:18:19,691 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 11:18:19,699 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:18:19" (1/1) ... [2024-06-14 11:18:19,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:18:19" (1/1) ... [2024-06-14 11:18:19,703 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:18:19" (1/1) ... [2024-06-14 11:18:19,712 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-14 11:18:19,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:18:19" (1/1) ... [2024-06-14 11:18:19,713 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:18:19" (1/1) ... [2024-06-14 11:18:19,716 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:18:19" (1/1) ... [2024-06-14 11:18:19,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:18:19" (1/1) ... [2024-06-14 11:18:19,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:18:19" (1/1) ... [2024-06-14 11:18:19,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:18:19" (1/1) ... [2024-06-14 11:18:19,724 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 11:18:19,725 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 11:18:19,725 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 11:18:19,725 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 11:18:19,726 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:18:19" (1/1) ... [2024-06-14 11:18:19,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 11:18:19,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 11:18:19,746 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-14 11:18:19,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-14 11:18:19,777 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-06-14 11:18:19,777 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-06-14 11:18:19,778 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-06-14 11:18:19,778 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-06-14 11:18:19,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 11:18:19,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 11:18:19,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 11:18:19,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 11:18:19,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 11:18:19,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 11:18:19,780 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 11:18:19,860 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 11:18:19,861 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 11:18:20,006 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 11:18:20,006 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 11:18:20,067 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 11:18:20,067 INFO L320 CfgBuilder]: Removed 8 assume(true) statements. [2024-06-14 11:18:20,068 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 11:18:20 BoogieIcfgContainer [2024-06-14 11:18:20,068 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 11:18:20,069 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 11:18:20,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 11:18:20,072 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 11:18:20,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 11:18:19" (1/4) ... [2024-06-14 11:18:20,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1eda9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 11:18:20, skipping insertion in model container [2024-06-14 11:18:20,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 11:18:19" (2/4) ... [2024-06-14 11:18:20,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1eda9e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 11:18:20, skipping insertion in model container [2024-06-14 11:18:20,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:18:19" (3/4) ... [2024-06-14 11:18:20,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1eda9e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 11:18:20, skipping insertion in model container [2024-06-14 11:18:20,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 11:18:20" (4/4) ... [2024-06-14 11:18:20,085 INFO L112 eAbstractionObserver]: Analyzing ICFG szymanski.i [2024-06-14 11:18:20,097 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 11:18:20,097 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 11:18:20,097 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 11:18:20,140 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-14 11:18:20,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 68 transitions, 150 flow [2024-06-14 11:18:20,207 INFO L124 PetriNetUnfolderBase]: 10/66 cut-off events. [2024-06-14 11:18:20,213 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-14 11:18:20,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 66 events. 10/66 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 116 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2024-06-14 11:18:20,216 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 68 transitions, 150 flow [2024-06-14 11:18:20,219 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 64 transitions, 137 flow [2024-06-14 11:18:20,226 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 11:18:20,231 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;@124fd4ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 11:18:20,231 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 11:18:20,233 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 11:18:20,234 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 11:18:20,234 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 11:18:20,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:20,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 11:18:20,235 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:20,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:20,238 INFO L85 PathProgramCache]: Analyzing trace with hash 833335324, now seen corresponding path program 1 times [2024-06-14 11:18:20,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:20,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670520388] [2024-06-14 11:18:20,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:20,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:20,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:20,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670520388] [2024-06-14 11:18:20,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670520388] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:20,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:20,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 11:18:20,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757792105] [2024-06-14 11:18:20,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:20,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 11:18:20,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:20,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 11:18:20,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 11:18:20,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 68 [2024-06-14 11:18:20,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 64 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:20,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:20,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 68 [2024-06-14 11:18:20,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:20,848 INFO L124 PetriNetUnfolderBase]: 616/1313 cut-off events. [2024-06-14 11:18:20,848 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-06-14 11:18:20,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2158 conditions, 1313 events. 616/1313 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 7687 event pairs, 292 based on Foata normal form. 1/1260 useless extension candidates. Maximal degree in co-relation 2097. Up to 805 conditions per place. [2024-06-14 11:18:20,862 INFO L140 encePairwiseOnDemand]: 63/68 looper letters, 32 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2024-06-14 11:18:20,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 70 transitions, 222 flow [2024-06-14 11:18:20,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 11:18:20,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 11:18:20,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2024-06-14 11:18:20,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7254901960784313 [2024-06-14 11:18:20,876 INFO L175 Difference]: Start difference. First operand has 61 places, 64 transitions, 137 flow. Second operand 3 states and 148 transitions. [2024-06-14 11:18:20,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 70 transitions, 222 flow [2024-06-14 11:18:20,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 70 transitions, 216 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-14 11:18:20,885 INFO L231 Difference]: Finished difference. Result has 61 places, 66 transitions, 153 flow [2024-06-14 11:18:20,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=61, PETRI_TRANSITIONS=66} [2024-06-14 11:18:20,890 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 0 predicate places. [2024-06-14 11:18:20,890 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 66 transitions, 153 flow [2024-06-14 11:18:20,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:20,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:20,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:20,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 11:18:20,892 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:20,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:20,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1973982471, now seen corresponding path program 1 times [2024-06-14 11:18:20,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:20,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997489798] [2024-06-14 11:18:20,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:20,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:21,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:21,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:21,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997489798] [2024-06-14 11:18:21,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997489798] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:21,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:21,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 11:18:21,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705717018] [2024-06-14 11:18:21,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:21,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:18:21,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:21,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:18:21,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:18:21,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 68 [2024-06-14 11:18:21,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 66 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:21,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:21,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 68 [2024-06-14 11:18:21,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:21,216 INFO L124 PetriNetUnfolderBase]: 672/1436 cut-off events. [2024-06-14 11:18:21,216 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2024-06-14 11:18:21,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2520 conditions, 1436 events. 672/1436 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 8600 event pairs, 122 based on Foata normal form. 4/1395 useless extension candidates. Maximal degree in co-relation 1842. Up to 752 conditions per place. [2024-06-14 11:18:21,225 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 42 selfloop transitions, 6 changer transitions 1/83 dead transitions. [2024-06-14 11:18:21,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 83 transitions, 292 flow [2024-06-14 11:18:21,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 11:18:21,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 11:18:21,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2024-06-14 11:18:21,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7132352941176471 [2024-06-14 11:18:21,233 INFO L175 Difference]: Start difference. First operand has 61 places, 66 transitions, 153 flow. Second operand 4 states and 194 transitions. [2024-06-14 11:18:21,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 83 transitions, 292 flow [2024-06-14 11:18:21,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 83 transitions, 289 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 11:18:21,237 INFO L231 Difference]: Finished difference. Result has 64 places, 68 transitions, 177 flow [2024-06-14 11:18:21,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=64, PETRI_TRANSITIONS=68} [2024-06-14 11:18:21,238 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 3 predicate places. [2024-06-14 11:18:21,238 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 68 transitions, 177 flow [2024-06-14 11:18:21,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:21,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:21,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:21,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 11:18:21,240 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:21,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:21,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1467278947, now seen corresponding path program 1 times [2024-06-14 11:18:21,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:21,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380298407] [2024-06-14 11:18:21,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:21,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:21,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:21,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:21,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380298407] [2024-06-14 11:18:21,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380298407] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:21,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:21,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 11:18:21,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26817181] [2024-06-14 11:18:21,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:21,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:18:21,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:21,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:18:21,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:18:21,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 68 [2024-06-14 11:18:21,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 68 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:21,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:21,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 68 [2024-06-14 11:18:21,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:21,542 INFO L124 PetriNetUnfolderBase]: 676/1461 cut-off events. [2024-06-14 11:18:21,543 INFO L125 PetriNetUnfolderBase]: For 442/442 co-relation queries the response was YES. [2024-06-14 11:18:21,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2707 conditions, 1461 events. 676/1461 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 8766 event pairs, 123 based on Foata normal form. 2/1421 useless extension candidates. Maximal degree in co-relation 2005. Up to 751 conditions per place. [2024-06-14 11:18:21,551 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 42 selfloop transitions, 8 changer transitions 1/85 dead transitions. [2024-06-14 11:18:21,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 85 transitions, 324 flow [2024-06-14 11:18:21,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 11:18:21,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 11:18:21,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2024-06-14 11:18:21,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7169117647058824 [2024-06-14 11:18:21,553 INFO L175 Difference]: Start difference. First operand has 64 places, 68 transitions, 177 flow. Second operand 4 states and 195 transitions. [2024-06-14 11:18:21,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 85 transitions, 324 flow [2024-06-14 11:18:21,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 85 transitions, 317 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-14 11:18:21,557 INFO L231 Difference]: Finished difference. Result has 67 places, 71 transitions, 208 flow [2024-06-14 11:18:21,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=67, PETRI_TRANSITIONS=71} [2024-06-14 11:18:21,558 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 6 predicate places. [2024-06-14 11:18:21,558 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 71 transitions, 208 flow [2024-06-14 11:18:21,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:21,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:21,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:21,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 11:18:21,559 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:21,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:21,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1117092599, now seen corresponding path program 1 times [2024-06-14 11:18:21,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:21,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018072567] [2024-06-14 11:18:21,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:21,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:21,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:21,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:21,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018072567] [2024-06-14 11:18:21,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018072567] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:21,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:21,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 11:18:21,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946054675] [2024-06-14 11:18:21,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:21,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:18:21,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:21,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:18:21,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:18:21,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 68 [2024-06-14 11:18:21,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 71 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:21,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:21,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 68 [2024-06-14 11:18:21,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:21,816 INFO L124 PetriNetUnfolderBase]: 667/1385 cut-off events. [2024-06-14 11:18:21,817 INFO L125 PetriNetUnfolderBase]: For 855/863 co-relation queries the response was YES. [2024-06-14 11:18:21,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2843 conditions, 1385 events. 667/1385 cut-off events. For 855/863 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 8158 event pairs, 239 based on Foata normal form. 2/1338 useless extension candidates. Maximal degree in co-relation 2566. Up to 849 conditions per place. [2024-06-14 11:18:21,823 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 44 selfloop transitions, 7 changer transitions 0/85 dead transitions. [2024-06-14 11:18:21,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 85 transitions, 350 flow [2024-06-14 11:18:21,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 11:18:21,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 11:18:21,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2024-06-14 11:18:21,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6985294117647058 [2024-06-14 11:18:21,824 INFO L175 Difference]: Start difference. First operand has 67 places, 71 transitions, 208 flow. Second operand 4 states and 190 transitions. [2024-06-14 11:18:21,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 85 transitions, 350 flow [2024-06-14 11:18:21,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 85 transitions, 343 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-14 11:18:21,826 INFO L231 Difference]: Finished difference. Result has 71 places, 75 transitions, 244 flow [2024-06-14 11:18:21,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=244, PETRI_PLACES=71, PETRI_TRANSITIONS=75} [2024-06-14 11:18:21,827 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 10 predicate places. [2024-06-14 11:18:21,827 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 75 transitions, 244 flow [2024-06-14 11:18:21,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:21,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:21,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:21,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 11:18:21,828 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:21,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:21,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1767742354, now seen corresponding path program 1 times [2024-06-14 11:18:21,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:21,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754930537] [2024-06-14 11:18:21,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:21,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:21,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:21,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:21,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754930537] [2024-06-14 11:18:21,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754930537] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:21,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:21,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:21,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190874019] [2024-06-14 11:18:21,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:21,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:21,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:21,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:21,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:21,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:21,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 75 transitions, 244 flow. Second operand has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:21,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:21,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:21,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:22,074 INFO L124 PetriNetUnfolderBase]: 786/1571 cut-off events. [2024-06-14 11:18:22,074 INFO L125 PetriNetUnfolderBase]: For 1611/1611 co-relation queries the response was YES. [2024-06-14 11:18:22,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3582 conditions, 1571 events. 786/1571 cut-off events. For 1611/1611 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9187 event pairs, 264 based on Foata normal form. 4/1517 useless extension candidates. Maximal degree in co-relation 2634. Up to 648 conditions per place. [2024-06-14 11:18:22,085 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 60 selfloop transitions, 13 changer transitions 0/106 dead transitions. [2024-06-14 11:18:22,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 106 transitions, 485 flow [2024-06-14 11:18:22,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:22,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:22,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2024-06-14 11:18:22,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-06-14 11:18:22,087 INFO L175 Difference]: Start difference. First operand has 71 places, 75 transitions, 244 flow. Second operand 5 states and 240 transitions. [2024-06-14 11:18:22,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 106 transitions, 485 flow [2024-06-14 11:18:22,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 106 transitions, 483 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-14 11:18:22,090 INFO L231 Difference]: Finished difference. Result has 77 places, 80 transitions, 302 flow [2024-06-14 11:18:22,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=77, PETRI_TRANSITIONS=80} [2024-06-14 11:18:22,091 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 16 predicate places. [2024-06-14 11:18:22,091 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 80 transitions, 302 flow [2024-06-14 11:18:22,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:22,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:22,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:22,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 11:18:22,092 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:22,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:22,092 INFO L85 PathProgramCache]: Analyzing trace with hash 258813064, now seen corresponding path program 2 times [2024-06-14 11:18:22,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:22,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828857871] [2024-06-14 11:18:22,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:22,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:22,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-06-14 11:18:22,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:22,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828857871] [2024-06-14 11:18:22,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828857871] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:22,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:22,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:22,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894780644] [2024-06-14 11:18:22,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:22,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:22,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:22,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:22,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:22,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:22,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 80 transitions, 302 flow. Second operand has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:22,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:22,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:22,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:22,365 INFO L124 PetriNetUnfolderBase]: 805/1615 cut-off events. [2024-06-14 11:18:22,365 INFO L125 PetriNetUnfolderBase]: For 2567/2575 co-relation queries the response was YES. [2024-06-14 11:18:22,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3926 conditions, 1615 events. 805/1615 cut-off events. For 2567/2575 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9349 event pairs, 215 based on Foata normal form. 12/1570 useless extension candidates. Maximal degree in co-relation 3473. Up to 591 conditions per place. [2024-06-14 11:18:22,374 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 61 selfloop transitions, 15 changer transitions 0/109 dead transitions. [2024-06-14 11:18:22,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 109 transitions, 552 flow [2024-06-14 11:18:22,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:22,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:22,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 241 transitions. [2024-06-14 11:18:22,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7088235294117647 [2024-06-14 11:18:22,375 INFO L175 Difference]: Start difference. First operand has 77 places, 80 transitions, 302 flow. Second operand 5 states and 241 transitions. [2024-06-14 11:18:22,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 109 transitions, 552 flow [2024-06-14 11:18:22,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 109 transitions, 546 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-06-14 11:18:22,381 INFO L231 Difference]: Finished difference. Result has 82 places, 82 transitions, 345 flow [2024-06-14 11:18:22,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=345, PETRI_PLACES=82, PETRI_TRANSITIONS=82} [2024-06-14 11:18:22,384 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 21 predicate places. [2024-06-14 11:18:22,384 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 82 transitions, 345 flow [2024-06-14 11:18:22,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:22,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:22,384 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:22,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 11:18:22,385 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:22,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:22,385 INFO L85 PathProgramCache]: Analyzing trace with hash -187682116, now seen corresponding path program 1 times [2024-06-14 11:18:22,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:22,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912620889] [2024-06-14 11:18:22,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:22,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:22,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-06-14 11:18:22,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:22,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912620889] [2024-06-14 11:18:22,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912620889] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:22,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:22,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:22,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564559551] [2024-06-14 11:18:22,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:22,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:18:22,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:22,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:18:22,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:18:22,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 68 [2024-06-14 11:18:22,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 82 transitions, 345 flow. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 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-06-14 11:18:22,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:22,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 68 [2024-06-14 11:18:22,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:22,664 INFO L124 PetriNetUnfolderBase]: 1309/2778 cut-off events. [2024-06-14 11:18:22,664 INFO L125 PetriNetUnfolderBase]: For 2498/2534 co-relation queries the response was YES. [2024-06-14 11:18:22,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5893 conditions, 2778 events. 1309/2778 cut-off events. For 2498/2534 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 18887 event pairs, 286 based on Foata normal form. 59/2653 useless extension candidates. Maximal degree in co-relation 5708. Up to 1007 conditions per place. [2024-06-14 11:18:22,679 INFO L140 encePairwiseOnDemand]: 51/68 looper letters, 80 selfloop transitions, 20 changer transitions 2/137 dead transitions. [2024-06-14 11:18:22,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 137 transitions, 711 flow [2024-06-14 11:18:22,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:22,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:22,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 243 transitions. [2024-06-14 11:18:22,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7147058823529412 [2024-06-14 11:18:22,680 INFO L175 Difference]: Start difference. First operand has 82 places, 82 transitions, 345 flow. Second operand 5 states and 243 transitions. [2024-06-14 11:18:22,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 137 transitions, 711 flow [2024-06-14 11:18:22,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 137 transitions, 674 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-14 11:18:22,685 INFO L231 Difference]: Finished difference. Result has 87 places, 95 transitions, 466 flow [2024-06-14 11:18:22,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=466, PETRI_PLACES=87, PETRI_TRANSITIONS=95} [2024-06-14 11:18:22,687 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 26 predicate places. [2024-06-14 11:18:22,687 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 95 transitions, 466 flow [2024-06-14 11:18:22,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 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-06-14 11:18:22,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:22,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:22,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 11:18:22,688 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:22,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:22,688 INFO L85 PathProgramCache]: Analyzing trace with hash -696309160, now seen corresponding path program 1 times [2024-06-14 11:18:22,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:22,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104285083] [2024-06-14 11:18:22,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:22,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:22,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:22,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:22,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104285083] [2024-06-14 11:18:22,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104285083] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:22,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:22,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 11:18:22,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568614813] [2024-06-14 11:18:22,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:22,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:18:22,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:22,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:18:22,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:18:22,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 68 [2024-06-14 11:18:22,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 95 transitions, 466 flow. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:22,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:22,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 68 [2024-06-14 11:18:22,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:22,999 INFO L124 PetriNetUnfolderBase]: 1253/2538 cut-off events. [2024-06-14 11:18:22,999 INFO L125 PetriNetUnfolderBase]: For 5722/5754 co-relation queries the response was YES. [2024-06-14 11:18:23,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6761 conditions, 2538 events. 1253/2538 cut-off events. For 5722/5754 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 16671 event pairs, 485 based on Foata normal form. 6/2433 useless extension candidates. Maximal degree in co-relation 6305. Up to 1634 conditions per place. [2024-06-14 11:18:23,013 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 52 selfloop transitions, 9 changer transitions 0/108 dead transitions. [2024-06-14 11:18:23,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 108 transitions, 640 flow [2024-06-14 11:18:23,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 11:18:23,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 11:18:23,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2024-06-14 11:18:23,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-06-14 11:18:23,015 INFO L175 Difference]: Start difference. First operand has 87 places, 95 transitions, 466 flow. Second operand 4 states and 192 transitions. [2024-06-14 11:18:23,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 108 transitions, 640 flow [2024-06-14 11:18:23,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 108 transitions, 640 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-14 11:18:23,020 INFO L231 Difference]: Finished difference. Result has 91 places, 97 transitions, 506 flow [2024-06-14 11:18:23,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=506, PETRI_PLACES=91, PETRI_TRANSITIONS=97} [2024-06-14 11:18:23,021 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 30 predicate places. [2024-06-14 11:18:23,021 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 97 transitions, 506 flow [2024-06-14 11:18:23,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:23,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:23,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:23,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 11:18:23,021 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:23,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:23,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1897335129, now seen corresponding path program 1 times [2024-06-14 11:18:23,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:23,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003984251] [2024-06-14 11:18:23,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:23,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:23,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:23,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:23,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003984251] [2024-06-14 11:18:23,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003984251] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:23,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:23,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 11:18:23,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796245087] [2024-06-14 11:18:23,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:23,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:18:23,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:23,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:18:23,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:18:23,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 68 [2024-06-14 11:18:23,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 97 transitions, 506 flow. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:23,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:23,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 68 [2024-06-14 11:18:23,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:23,301 INFO L124 PetriNetUnfolderBase]: 1299/2656 cut-off events. [2024-06-14 11:18:23,301 INFO L125 PetriNetUnfolderBase]: For 7782/7820 co-relation queries the response was YES. [2024-06-14 11:18:23,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7430 conditions, 2656 events. 1299/2656 cut-off events. For 7782/7820 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 17401 event pairs, 542 based on Foata normal form. 1/2526 useless extension candidates. Maximal degree in co-relation 7189. Up to 1743 conditions per place. [2024-06-14 11:18:23,315 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 53 selfloop transitions, 9 changer transitions 0/109 dead transitions. [2024-06-14 11:18:23,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 109 transitions, 677 flow [2024-06-14 11:18:23,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 11:18:23,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 11:18:23,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 191 transitions. [2024-06-14 11:18:23,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7022058823529411 [2024-06-14 11:18:23,317 INFO L175 Difference]: Start difference. First operand has 91 places, 97 transitions, 506 flow. Second operand 4 states and 191 transitions. [2024-06-14 11:18:23,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 109 transitions, 677 flow [2024-06-14 11:18:23,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 109 transitions, 668 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-14 11:18:23,323 INFO L231 Difference]: Finished difference. Result has 94 places, 100 transitions, 538 flow [2024-06-14 11:18:23,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=538, PETRI_PLACES=94, PETRI_TRANSITIONS=100} [2024-06-14 11:18:23,324 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 33 predicate places. [2024-06-14 11:18:23,324 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 100 transitions, 538 flow [2024-06-14 11:18:23,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:23,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:23,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:23,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 11:18:23,325 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:23,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:23,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1387491418, now seen corresponding path program 1 times [2024-06-14 11:18:23,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:23,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999373146] [2024-06-14 11:18:23,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:23,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:23,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:23,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:23,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999373146] [2024-06-14 11:18:23,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999373146] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:23,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:23,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:23,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160787950] [2024-06-14 11:18:23,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:23,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:23,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:23,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:23,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:23,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:23,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 100 transitions, 538 flow. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:23,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:23,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:23,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:23,645 INFO L124 PetriNetUnfolderBase]: 1373/2782 cut-off events. [2024-06-14 11:18:23,645 INFO L125 PetriNetUnfolderBase]: For 9946/9999 co-relation queries the response was YES. [2024-06-14 11:18:23,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8177 conditions, 2782 events. 1373/2782 cut-off events. For 9946/9999 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 18204 event pairs, 462 based on Foata normal form. 4/2674 useless extension candidates. Maximal degree in co-relation 7627. Up to 1093 conditions per place. [2024-06-14 11:18:23,664 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 69 selfloop transitions, 17 changer transitions 0/131 dead transitions. [2024-06-14 11:18:23,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 131 transitions, 847 flow [2024-06-14 11:18:23,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:23,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 241 transitions. [2024-06-14 11:18:23,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7088235294117647 [2024-06-14 11:18:23,666 INFO L175 Difference]: Start difference. First operand has 94 places, 100 transitions, 538 flow. Second operand 5 states and 241 transitions. [2024-06-14 11:18:23,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 131 transitions, 847 flow [2024-06-14 11:18:23,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 131 transitions, 839 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-14 11:18:23,672 INFO L231 Difference]: Finished difference. Result has 99 places, 106 transitions, 618 flow [2024-06-14 11:18:23,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=618, PETRI_PLACES=99, PETRI_TRANSITIONS=106} [2024-06-14 11:18:23,673 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 38 predicate places. [2024-06-14 11:18:23,675 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 106 transitions, 618 flow [2024-06-14 11:18:23,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:23,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:23,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:23,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 11:18:23,676 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:23,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:23,676 INFO L85 PathProgramCache]: Analyzing trace with hash -57058194, now seen corresponding path program 2 times [2024-06-14 11:18:23,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:23,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126001514] [2024-06-14 11:18:23,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:23,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:23,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:23,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:23,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126001514] [2024-06-14 11:18:23,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126001514] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:23,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:23,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:23,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565524590] [2024-06-14 11:18:23,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:23,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:23,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:23,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:23,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:23,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:23,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 106 transitions, 618 flow. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:23,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:23,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:23,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:23,994 INFO L124 PetriNetUnfolderBase]: 1404/2719 cut-off events. [2024-06-14 11:18:23,994 INFO L125 PetriNetUnfolderBase]: For 13416/13492 co-relation queries the response was YES. [2024-06-14 11:18:24,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9109 conditions, 2719 events. 1404/2719 cut-off events. For 13416/13492 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 17166 event pairs, 424 based on Foata normal form. 4/2617 useless extension candidates. Maximal degree in co-relation 8571. Up to 1004 conditions per place. [2024-06-14 11:18:24,012 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 67 selfloop transitions, 22 changer transitions 0/134 dead transitions. [2024-06-14 11:18:24,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 134 transitions, 936 flow [2024-06-14 11:18:24,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:24,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:24,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 241 transitions. [2024-06-14 11:18:24,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7088235294117647 [2024-06-14 11:18:24,014 INFO L175 Difference]: Start difference. First operand has 99 places, 106 transitions, 618 flow. Second operand 5 states and 241 transitions. [2024-06-14 11:18:24,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 134 transitions, 936 flow [2024-06-14 11:18:24,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 134 transitions, 926 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-06-14 11:18:24,023 INFO L231 Difference]: Finished difference. Result has 104 places, 109 transitions, 686 flow [2024-06-14 11:18:24,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=686, PETRI_PLACES=104, PETRI_TRANSITIONS=109} [2024-06-14 11:18:24,023 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 43 predicate places. [2024-06-14 11:18:24,024 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 109 transitions, 686 flow [2024-06-14 11:18:24,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:24,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:24,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:24,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 11:18:24,024 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:24,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:24,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1917078450, now seen corresponding path program 1 times [2024-06-14 11:18:24,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:24,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865111343] [2024-06-14 11:18:24,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:24,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:24,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:24,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865111343] [2024-06-14 11:18:24,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865111343] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:24,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:24,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:24,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420989301] [2024-06-14 11:18:24,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:24,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:24,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:24,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:24,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:24,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:24,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 109 transitions, 686 flow. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:24,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:24,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:24,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:24,366 INFO L124 PetriNetUnfolderBase]: 1368/2742 cut-off events. [2024-06-14 11:18:24,366 INFO L125 PetriNetUnfolderBase]: For 15708/15749 co-relation queries the response was YES. [2024-06-14 11:18:24,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9172 conditions, 2742 events. 1368/2742 cut-off events. For 15708/15749 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 17905 event pairs, 456 based on Foata normal form. 12/2646 useless extension candidates. Maximal degree in co-relation 6798. Up to 1056 conditions per place. [2024-06-14 11:18:24,383 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 72 selfloop transitions, 19 changer transitions 0/136 dead transitions. [2024-06-14 11:18:24,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 136 transitions, 999 flow [2024-06-14 11:18:24,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:24,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:24,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2024-06-14 11:18:24,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-06-14 11:18:24,385 INFO L175 Difference]: Start difference. First operand has 104 places, 109 transitions, 686 flow. Second operand 5 states and 240 transitions. [2024-06-14 11:18:24,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 136 transitions, 999 flow [2024-06-14 11:18:24,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 136 transitions, 965 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-06-14 11:18:24,397 INFO L231 Difference]: Finished difference. Result has 107 places, 112 transitions, 720 flow [2024-06-14 11:18:24,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=720, PETRI_PLACES=107, PETRI_TRANSITIONS=112} [2024-06-14 11:18:24,397 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 46 predicate places. [2024-06-14 11:18:24,397 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 112 transitions, 720 flow [2024-06-14 11:18:24,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:24,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:24,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:24,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 11:18:24,398 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:24,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:24,399 INFO L85 PathProgramCache]: Analyzing trace with hash 675332066, now seen corresponding path program 2 times [2024-06-14 11:18:24,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:24,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923822647] [2024-06-14 11:18:24,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:24,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:24,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:24,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:24,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923822647] [2024-06-14 11:18:24,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923822647] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:24,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:24,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:24,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916378196] [2024-06-14 11:18:24,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:24,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:24,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:24,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:24,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:24,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:24,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 112 transitions, 720 flow. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:24,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:24,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:24,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:24,740 INFO L124 PetriNetUnfolderBase]: 1432/2891 cut-off events. [2024-06-14 11:18:24,740 INFO L125 PetriNetUnfolderBase]: For 19279/19332 co-relation queries the response was YES. [2024-06-14 11:18:24,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10127 conditions, 2891 events. 1432/2891 cut-off events. For 19279/19332 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 18989 event pairs, 458 based on Foata normal form. 10/2818 useless extension candidates. Maximal degree in co-relation 9459. Up to 1158 conditions per place. [2024-06-14 11:18:24,756 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 76 selfloop transitions, 22 changer transitions 0/143 dead transitions. [2024-06-14 11:18:24,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 143 transitions, 1090 flow [2024-06-14 11:18:24,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:24,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2024-06-14 11:18:24,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.711764705882353 [2024-06-14 11:18:24,758 INFO L175 Difference]: Start difference. First operand has 107 places, 112 transitions, 720 flow. Second operand 5 states and 242 transitions. [2024-06-14 11:18:24,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 143 transitions, 1090 flow [2024-06-14 11:18:24,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 143 transitions, 1061 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-14 11:18:24,770 INFO L231 Difference]: Finished difference. Result has 110 places, 116 transitions, 776 flow [2024-06-14 11:18:24,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=776, PETRI_PLACES=110, PETRI_TRANSITIONS=116} [2024-06-14 11:18:24,770 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 49 predicate places. [2024-06-14 11:18:24,770 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 116 transitions, 776 flow [2024-06-14 11:18:24,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:24,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:24,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:24,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 11:18:24,771 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:24,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:24,772 INFO L85 PathProgramCache]: Analyzing trace with hash -540124792, now seen corresponding path program 1 times [2024-06-14 11:18:24,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:24,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804529458] [2024-06-14 11:18:24,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:24,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:24,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:24,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:24,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804529458] [2024-06-14 11:18:24,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804529458] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:24,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:24,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:24,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789696947] [2024-06-14 11:18:24,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:24,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:18:24,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:24,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:18:24,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:18:24,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 68 [2024-06-14 11:18:24,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 116 transitions, 776 flow. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:24,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:24,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 68 [2024-06-14 11:18:24,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:25,166 INFO L124 PetriNetUnfolderBase]: 2235/4439 cut-off events. [2024-06-14 11:18:25,166 INFO L125 PetriNetUnfolderBase]: For 16062/16390 co-relation queries the response was YES. [2024-06-14 11:18:25,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13837 conditions, 4439 events. 2235/4439 cut-off events. For 16062/16390 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 32320 event pairs, 544 based on Foata normal form. 80/4129 useless extension candidates. Maximal degree in co-relation 13535. Up to 1850 conditions per place. [2024-06-14 11:18:25,191 INFO L140 encePairwiseOnDemand]: 51/68 looper letters, 97 selfloop transitions, 22 changer transitions 1/176 dead transitions. [2024-06-14 11:18:25,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 176 transitions, 1284 flow [2024-06-14 11:18:25,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:25,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:25,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 241 transitions. [2024-06-14 11:18:25,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7088235294117647 [2024-06-14 11:18:25,192 INFO L175 Difference]: Start difference. First operand has 110 places, 116 transitions, 776 flow. Second operand 5 states and 241 transitions. [2024-06-14 11:18:25,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 176 transitions, 1284 flow [2024-06-14 11:18:25,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 176 transitions, 1256 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-06-14 11:18:25,211 INFO L231 Difference]: Finished difference. Result has 116 places, 129 transitions, 913 flow [2024-06-14 11:18:25,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=913, PETRI_PLACES=116, PETRI_TRANSITIONS=129} [2024-06-14 11:18:25,212 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 55 predicate places. [2024-06-14 11:18:25,212 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 129 transitions, 913 flow [2024-06-14 11:18:25,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:25,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:25,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:25,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 11:18:25,213 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:25,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:25,213 INFO L85 PathProgramCache]: Analyzing trace with hash -353404956, now seen corresponding path program 1 times [2024-06-14 11:18:25,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:25,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911651495] [2024-06-14 11:18:25,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:25,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:25,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-06-14 11:18:25,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:25,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911651495] [2024-06-14 11:18:25,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911651495] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:25,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:25,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 11:18:25,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231870446] [2024-06-14 11:18:25,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:25,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:18:25,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:25,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:18:25,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:18:25,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 68 [2024-06-14 11:18:25,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 129 transitions, 913 flow. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:25,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:25,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 68 [2024-06-14 11:18:25,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:25,643 INFO L124 PetriNetUnfolderBase]: 2095/4271 cut-off events. [2024-06-14 11:18:25,644 INFO L125 PetriNetUnfolderBase]: For 36454/36559 co-relation queries the response was YES. [2024-06-14 11:18:25,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17253 conditions, 4271 events. 2095/4271 cut-off events. For 36454/36559 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 31055 event pairs, 852 based on Foata normal form. 3/4190 useless extension candidates. Maximal degree in co-relation 16977. Up to 2873 conditions per place. [2024-06-14 11:18:25,673 INFO L140 encePairwiseOnDemand]: 63/68 looper letters, 67 selfloop transitions, 8 changer transitions 0/135 dead transitions. [2024-06-14 11:18:25,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 135 transitions, 1077 flow [2024-06-14 11:18:25,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 11:18:25,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 11:18:25,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2024-06-14 11:18:25,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6875 [2024-06-14 11:18:25,675 INFO L175 Difference]: Start difference. First operand has 116 places, 129 transitions, 913 flow. Second operand 4 states and 187 transitions. [2024-06-14 11:18:25,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 135 transitions, 1077 flow [2024-06-14 11:18:25,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 135 transitions, 1077 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-14 11:18:25,765 INFO L231 Difference]: Finished difference. Result has 120 places, 129 transitions, 934 flow [2024-06-14 11:18:25,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=934, PETRI_PLACES=120, PETRI_TRANSITIONS=129} [2024-06-14 11:18:25,765 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 59 predicate places. [2024-06-14 11:18:25,766 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 129 transitions, 934 flow [2024-06-14 11:18:25,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:25,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:25,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:25,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 11:18:25,766 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:25,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:25,766 INFO L85 PathProgramCache]: Analyzing trace with hash -739200223, now seen corresponding path program 1 times [2024-06-14 11:18:25,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:25,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637277895] [2024-06-14 11:18:25,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:25,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:25,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:25,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:25,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637277895] [2024-06-14 11:18:25,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637277895] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:25,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:25,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:25,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934669963] [2024-06-14 11:18:25,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:25,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:25,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:25,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:25,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:25,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:25,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 129 transitions, 934 flow. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:25,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:25,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:25,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:26,445 INFO L124 PetriNetUnfolderBase]: 2203/4397 cut-off events. [2024-06-14 11:18:26,445 INFO L125 PetriNetUnfolderBase]: For 42346/42466 co-relation queries the response was YES. [2024-06-14 11:18:26,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18137 conditions, 4397 events. 2203/4397 cut-off events. For 42346/42466 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 31106 event pairs, 710 based on Foata normal form. 16/4339 useless extension candidates. Maximal degree in co-relation 12813. Up to 1454 conditions per place. [2024-06-14 11:18:26,477 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 89 selfloop transitions, 18 changer transitions 0/164 dead transitions. [2024-06-14 11:18:26,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 164 transitions, 1365 flow [2024-06-14 11:18:26,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:26,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:26,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 243 transitions. [2024-06-14 11:18:26,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7147058823529412 [2024-06-14 11:18:26,479 INFO L175 Difference]: Start difference. First operand has 120 places, 129 transitions, 934 flow. Second operand 5 states and 243 transitions. [2024-06-14 11:18:26,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 164 transitions, 1365 flow [2024-06-14 11:18:26,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 164 transitions, 1335 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-14 11:18:26,509 INFO L231 Difference]: Finished difference. Result has 123 places, 135 transitions, 1033 flow [2024-06-14 11:18:26,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1033, PETRI_PLACES=123, PETRI_TRANSITIONS=135} [2024-06-14 11:18:26,509 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 62 predicate places. [2024-06-14 11:18:26,510 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 135 transitions, 1033 flow [2024-06-14 11:18:26,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:26,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:26,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:26,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 11:18:26,510 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:26,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:26,511 INFO L85 PathProgramCache]: Analyzing trace with hash -525305469, now seen corresponding path program 2 times [2024-06-14 11:18:26,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:26,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321429675] [2024-06-14 11:18:26,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:26,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:26,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:26,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:26,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321429675] [2024-06-14 11:18:26,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321429675] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:26,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:26,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:26,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664985125] [2024-06-14 11:18:26,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:26,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:26,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:26,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:26,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:26,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:26,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 135 transitions, 1033 flow. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:26,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:26,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:26,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:27,128 INFO L124 PetriNetUnfolderBase]: 2228/4368 cut-off events. [2024-06-14 11:18:27,128 INFO L125 PetriNetUnfolderBase]: For 50582/50731 co-relation queries the response was YES. [2024-06-14 11:18:27,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19469 conditions, 4368 events. 2228/4368 cut-off events. For 50582/50731 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 30598 event pairs, 772 based on Foata normal form. 16/4266 useless extension candidates. Maximal degree in co-relation 13695. Up to 1596 conditions per place. [2024-06-14 11:18:27,165 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 81 selfloop transitions, 26 changer transitions 0/164 dead transitions. [2024-06-14 11:18:27,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 164 transitions, 1436 flow [2024-06-14 11:18:27,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:27,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:27,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2024-06-14 11:18:27,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.711764705882353 [2024-06-14 11:18:27,167 INFO L175 Difference]: Start difference. First operand has 123 places, 135 transitions, 1033 flow. Second operand 5 states and 242 transitions. [2024-06-14 11:18:27,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 164 transitions, 1436 flow [2024-06-14 11:18:27,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 164 transitions, 1417 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-14 11:18:27,207 INFO L231 Difference]: Finished difference. Result has 128 places, 139 transitions, 1147 flow [2024-06-14 11:18:27,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1147, PETRI_PLACES=128, PETRI_TRANSITIONS=139} [2024-06-14 11:18:27,207 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 67 predicate places. [2024-06-14 11:18:27,207 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 139 transitions, 1147 flow [2024-06-14 11:18:27,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:27,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:27,208 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:27,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 11:18:27,208 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:27,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:27,209 INFO L85 PathProgramCache]: Analyzing trace with hash -554859102, now seen corresponding path program 1 times [2024-06-14 11:18:27,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:27,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755291727] [2024-06-14 11:18:27,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:27,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:27,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:27,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:27,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755291727] [2024-06-14 11:18:27,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755291727] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:27,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:27,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:27,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116283723] [2024-06-14 11:18:27,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:27,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:18:27,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:27,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:18:27,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:18:27,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 68 [2024-06-14 11:18:27,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 139 transitions, 1147 flow. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:27,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:27,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 68 [2024-06-14 11:18:27,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:27,768 INFO L124 PetriNetUnfolderBase]: 2082/4285 cut-off events. [2024-06-14 11:18:27,768 INFO L125 PetriNetUnfolderBase]: For 26698/27055 co-relation queries the response was YES. [2024-06-14 11:18:27,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16285 conditions, 4285 events. 2082/4285 cut-off events. For 26698/27055 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 31340 event pairs, 569 based on Foata normal form. 107/4168 useless extension candidates. Maximal degree in co-relation 11945. Up to 1277 conditions per place. [2024-06-14 11:18:27,790 INFO L140 encePairwiseOnDemand]: 50/68 looper letters, 88 selfloop transitions, 61 changer transitions 0/207 dead transitions. [2024-06-14 11:18:27,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 207 transitions, 1841 flow [2024-06-14 11:18:27,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:27,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:27,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 246 transitions. [2024-06-14 11:18:27,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7235294117647059 [2024-06-14 11:18:27,792 INFO L175 Difference]: Start difference. First operand has 128 places, 139 transitions, 1147 flow. Second operand 5 states and 246 transitions. [2024-06-14 11:18:27,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 207 transitions, 1841 flow [2024-06-14 11:18:27,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 207 transitions, 1799 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-14 11:18:27,832 INFO L231 Difference]: Finished difference. Result has 134 places, 176 transitions, 1672 flow [2024-06-14 11:18:27,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=1083, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1672, PETRI_PLACES=134, PETRI_TRANSITIONS=176} [2024-06-14 11:18:27,833 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 73 predicate places. [2024-06-14 11:18:27,833 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 176 transitions, 1672 flow [2024-06-14 11:18:27,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:27,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:27,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:27,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 11:18:27,833 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:27,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:27,834 INFO L85 PathProgramCache]: Analyzing trace with hash -553905821, now seen corresponding path program 1 times [2024-06-14 11:18:27,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:27,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638470329] [2024-06-14 11:18:27,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:27,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:27,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:27,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:27,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638470329] [2024-06-14 11:18:27,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638470329] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:27,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:27,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:27,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039369428] [2024-06-14 11:18:27,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:27,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:27,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:27,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:27,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:27,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:27,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 176 transitions, 1672 flow. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:27,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:27,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:27,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:28,455 INFO L124 PetriNetUnfolderBase]: 2411/4810 cut-off events. [2024-06-14 11:18:28,455 INFO L125 PetriNetUnfolderBase]: For 67465/67693 co-relation queries the response was YES. [2024-06-14 11:18:28,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23693 conditions, 4810 events. 2411/4810 cut-off events. For 67465/67693 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 34789 event pairs, 853 based on Foata normal form. 29/4692 useless extension candidates. Maximal degree in co-relation 17469. Up to 1802 conditions per place. [2024-06-14 11:18:28,584 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 95 selfloop transitions, 26 changer transitions 0/200 dead transitions. [2024-06-14 11:18:28,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 200 transitions, 2089 flow [2024-06-14 11:18:28,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:28,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:28,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2024-06-14 11:18:28,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-06-14 11:18:28,586 INFO L175 Difference]: Start difference. First operand has 134 places, 176 transitions, 1672 flow. Second operand 5 states and 240 transitions. [2024-06-14 11:18:28,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 200 transitions, 2089 flow [2024-06-14 11:18:28,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 200 transitions, 2047 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-06-14 11:18:28,664 INFO L231 Difference]: Finished difference. Result has 138 places, 177 transitions, 1707 flow [2024-06-14 11:18:28,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=1630, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1707, PETRI_PLACES=138, PETRI_TRANSITIONS=177} [2024-06-14 11:18:28,665 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 77 predicate places. [2024-06-14 11:18:28,665 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 177 transitions, 1707 flow [2024-06-14 11:18:28,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:28,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:28,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:28,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 11:18:28,666 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:28,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:28,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1929039442, now seen corresponding path program 2 times [2024-06-14 11:18:28,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:28,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026912395] [2024-06-14 11:18:28,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:28,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:28,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:28,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:28,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026912395] [2024-06-14 11:18:28,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026912395] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:28,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:28,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:28,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692688984] [2024-06-14 11:18:28,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:28,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:28,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:28,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:28,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:28,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:28,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 177 transitions, 1707 flow. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:28,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:28,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:28,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:29,322 INFO L124 PetriNetUnfolderBase]: 2445/4920 cut-off events. [2024-06-14 11:18:29,322 INFO L125 PetriNetUnfolderBase]: For 73197/73415 co-relation queries the response was YES. [2024-06-14 11:18:29,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24377 conditions, 4920 events. 2445/4920 cut-off events. For 73197/73415 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 35697 event pairs, 777 based on Foata normal form. 56/4880 useless extension candidates. Maximal degree in co-relation 17994. Up to 1985 conditions per place. [2024-06-14 11:18:29,366 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 96 selfloop transitions, 31 changer transitions 0/206 dead transitions. [2024-06-14 11:18:29,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 206 transitions, 2199 flow [2024-06-14 11:18:29,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:29,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:29,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2024-06-14 11:18:29,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-06-14 11:18:29,367 INFO L175 Difference]: Start difference. First operand has 138 places, 177 transitions, 1707 flow. Second operand 5 states and 240 transitions. [2024-06-14 11:18:29,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 206 transitions, 2199 flow [2024-06-14 11:18:29,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 206 transitions, 2156 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-14 11:18:29,501 INFO L231 Difference]: Finished difference. Result has 141 places, 181 transitions, 1779 flow [2024-06-14 11:18:29,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=1664, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1779, PETRI_PLACES=141, PETRI_TRANSITIONS=181} [2024-06-14 11:18:29,501 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 80 predicate places. [2024-06-14 11:18:29,501 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 181 transitions, 1779 flow [2024-06-14 11:18:29,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:29,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:29,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:29,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 11:18:29,502 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:29,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:29,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1931390482, now seen corresponding path program 3 times [2024-06-14 11:18:29,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:29,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056609504] [2024-06-14 11:18:29,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:29,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:29,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-06-14 11:18:29,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:29,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056609504] [2024-06-14 11:18:29,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056609504] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:29,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:29,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:29,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960539801] [2024-06-14 11:18:29,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:29,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:29,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:29,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:29,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:29,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:29,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 181 transitions, 1779 flow. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:29,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:29,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:29,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:30,102 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L749-1-->L756: Formula: (= v_~flag1~0_13 0) InVars {} OutVars{~flag1~0=v_~flag1~0_13} AuxVars[] AssignedVars[~flag1~0][182], [thr2Thread1of1ForFork1InUse, Black: 131#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3)), Black: 195#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), 161#(= ~x~0 0), Black: 70#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), Black: 137#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), Black: 75#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 143#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), Black: 80#(and (= ~x~0 0) (= ~flag1~0 3) (= ~flag2~0 0)), 177#(<= 3 |thr2Thread1of1ForFork1_~f12~0#1|), 101#true, 147#(<= ~flag1~0 0), Black: 85#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1)), Black: 84#(and (= ~flag1~0 0) (= ~x~0 0)), Black: 148#(<= |thr2Thread1of1ForFork1_~f12~0#1| 0), Black: 150#(and (<= ~flag1~0 0) (<= |thr2Thread1of1ForFork1_~f12~0#1| 0)), 82#true, Black: 88#true, Black: 92#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 157#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 4)), Black: 99#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), 193#(= ~x~0 0), Black: 162#(and (= ~x~0 0) (= ~flag1~0 4)), 29#L799true, Black: 163#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), 122#(= ~x~0 0), Black: 106#(and (= |thr1Thread1of1ForFork0_~f21~0#1| 0) (= ~flag2~0 0)), Black: 104#(= |thr1Thread1of1ForFork0_~f21~0#1| 0), Black: 171#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), Black: 170#(and (= ~x~0 0) (= ~flag2~0 1)), Black: 103#(= ~flag2~0 0), 27#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 113#(and (= ~x~0 0) (= ~flag1~0 4) (= ~flag2~0 0)), 141#(= ~x~0 0), Black: 179#(and (<= 3 |thr2Thread1of1ForFork1_~f12~0#1|) (<= 3 ~flag1~0)), Black: 176#(<= 3 ~flag1~0), Black: 118#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 3)), 199#(= ~x~0 0), Black: 174#true, 135#(= ~x~0 0), 13#L756true, Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3)), Black: 189#(and (= ~x~0 0) (= ~flag2~0 1) (= 2 ~flag1~0))]) [2024-06-14 11:18:30,103 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-06-14 11:18:30,103 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-14 11:18:30,103 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-14 11:18:30,103 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-14 11:18:30,144 INFO L124 PetriNetUnfolderBase]: 2389/4801 cut-off events. [2024-06-14 11:18:30,144 INFO L125 PetriNetUnfolderBase]: For 80083/80292 co-relation queries the response was YES. [2024-06-14 11:18:30,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24500 conditions, 4801 events. 2389/4801 cut-off events. For 80083/80292 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 34664 event pairs, 837 based on Foata normal form. 77/4781 useless extension candidates. Maximal degree in co-relation 18019. Up to 1870 conditions per place. [2024-06-14 11:18:30,177 INFO L140 encePairwiseOnDemand]: 58/68 looper letters, 105 selfloop transitions, 29 changer transitions 0/213 dead transitions. [2024-06-14 11:18:30,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 213 transitions, 2352 flow [2024-06-14 11:18:30,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:30,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:30,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2024-06-14 11:18:30,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.711764705882353 [2024-06-14 11:18:30,179 INFO L175 Difference]: Start difference. First operand has 141 places, 181 transitions, 1779 flow. Second operand 5 states and 242 transitions. [2024-06-14 11:18:30,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 213 transitions, 2352 flow [2024-06-14 11:18:30,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 213 transitions, 2298 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-14 11:18:30,248 INFO L231 Difference]: Finished difference. Result has 144 places, 186 transitions, 1858 flow [2024-06-14 11:18:30,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=1728, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1858, PETRI_PLACES=144, PETRI_TRANSITIONS=186} [2024-06-14 11:18:30,249 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 83 predicate places. [2024-06-14 11:18:30,249 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 186 transitions, 1858 flow [2024-06-14 11:18:30,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:30,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:30,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:30,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 11:18:30,249 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:30,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:30,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1324426055, now seen corresponding path program 1 times [2024-06-14 11:18:30,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:30,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961359449] [2024-06-14 11:18:30,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:30,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:30,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:30,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:30,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961359449] [2024-06-14 11:18:30,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961359449] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:30,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:30,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:30,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552135437] [2024-06-14 11:18:30,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:30,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:18:30,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:30,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:18:30,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:18:30,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 68 [2024-06-14 11:18:30,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 186 transitions, 1858 flow. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 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-06-14 11:18:30,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:30,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 68 [2024-06-14 11:18:30,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:30,900 INFO L124 PetriNetUnfolderBase]: 2454/4993 cut-off events. [2024-06-14 11:18:30,900 INFO L125 PetriNetUnfolderBase]: For 48071/48480 co-relation queries the response was YES. [2024-06-14 11:18:30,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22069 conditions, 4993 events. 2454/4993 cut-off events. For 48071/48480 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 37568 event pairs, 1040 based on Foata normal form. 146/4831 useless extension candidates. Maximal degree in co-relation 15524. Up to 2653 conditions per place. [2024-06-14 11:18:30,936 INFO L140 encePairwiseOnDemand]: 54/68 looper letters, 156 selfloop transitions, 36 changer transitions 0/250 dead transitions. [2024-06-14 11:18:30,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 250 transitions, 2782 flow [2024-06-14 11:18:30,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:30,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:30,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 230 transitions. [2024-06-14 11:18:30,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2024-06-14 11:18:30,938 INFO L175 Difference]: Start difference. First operand has 144 places, 186 transitions, 1858 flow. Second operand 5 states and 230 transitions. [2024-06-14 11:18:30,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 250 transitions, 2782 flow [2024-06-14 11:18:31,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 250 transitions, 2712 flow, removed 15 selfloop flow, removed 2 redundant places. [2024-06-14 11:18:31,005 INFO L231 Difference]: Finished difference. Result has 150 places, 203 transitions, 2148 flow [2024-06-14 11:18:31,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=1745, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2148, PETRI_PLACES=150, PETRI_TRANSITIONS=203} [2024-06-14 11:18:31,005 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 89 predicate places. [2024-06-14 11:18:31,005 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 203 transitions, 2148 flow [2024-06-14 11:18:31,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 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-06-14 11:18:31,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:31,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:31,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 11:18:31,006 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:31,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:31,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1909772417, now seen corresponding path program 1 times [2024-06-14 11:18:31,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:31,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511371977] [2024-06-14 11:18:31,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:31,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:31,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-06-14 11:18:31,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:31,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511371977] [2024-06-14 11:18:31,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511371977] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:31,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:31,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:31,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442568685] [2024-06-14 11:18:31,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:31,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:31,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:31,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:31,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:31,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:31,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 203 transitions, 2148 flow. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:31,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:31,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:31,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:31,723 INFO L124 PetriNetUnfolderBase]: 2569/5237 cut-off events. [2024-06-14 11:18:31,723 INFO L125 PetriNetUnfolderBase]: For 98508/98709 co-relation queries the response was YES. [2024-06-14 11:18:31,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27462 conditions, 5237 events. 2569/5237 cut-off events. For 98508/98709 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 39004 event pairs, 942 based on Foata normal form. 41/5159 useless extension candidates. Maximal degree in co-relation 19432. Up to 2292 conditions per place. [2024-06-14 11:18:31,776 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 105 selfloop transitions, 26 changer transitions 0/225 dead transitions. [2024-06-14 11:18:31,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 225 transitions, 2596 flow [2024-06-14 11:18:31,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:31,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:31,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 237 transitions. [2024-06-14 11:18:31,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6970588235294117 [2024-06-14 11:18:31,778 INFO L175 Difference]: Start difference. First operand has 150 places, 203 transitions, 2148 flow. Second operand 5 states and 237 transitions. [2024-06-14 11:18:31,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 225 transitions, 2596 flow [2024-06-14 11:18:31,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 225 transitions, 2584 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-14 11:18:31,868 INFO L231 Difference]: Finished difference. Result has 155 places, 204 transitions, 2215 flow [2024-06-14 11:18:31,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2136, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2215, PETRI_PLACES=155, PETRI_TRANSITIONS=204} [2024-06-14 11:18:31,869 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 94 predicate places. [2024-06-14 11:18:31,869 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 204 transitions, 2215 flow [2024-06-14 11:18:31,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:31,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:31,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:31,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 11:18:31,870 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:31,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:31,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1174715329, now seen corresponding path program 2 times [2024-06-14 11:18:31,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:31,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080794631] [2024-06-14 11:18:31,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:31,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:31,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:31,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:31,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080794631] [2024-06-14 11:18:31,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080794631] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:31,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:31,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:31,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495378785] [2024-06-14 11:18:31,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:31,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:31,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:31,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:31,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:31,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:31,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 204 transitions, 2215 flow. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:31,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:31,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:31,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:32,601 INFO L124 PetriNetUnfolderBase]: 2562/5209 cut-off events. [2024-06-14 11:18:32,602 INFO L125 PetriNetUnfolderBase]: For 107982/108199 co-relation queries the response was YES. [2024-06-14 11:18:32,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28081 conditions, 5209 events. 2562/5209 cut-off events. For 107982/108199 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 38680 event pairs, 1039 based on Foata normal form. 35/5116 useless extension candidates. Maximal degree in co-relation 19859. Up to 2293 conditions per place. [2024-06-14 11:18:32,653 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 106 selfloop transitions, 28 changer transitions 0/228 dead transitions. [2024-06-14 11:18:32,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 228 transitions, 2712 flow [2024-06-14 11:18:32,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:32,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:32,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 238 transitions. [2024-06-14 11:18:32,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-06-14 11:18:32,657 INFO L175 Difference]: Start difference. First operand has 155 places, 204 transitions, 2215 flow. Second operand 5 states and 238 transitions. [2024-06-14 11:18:32,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 228 transitions, 2712 flow [2024-06-14 11:18:32,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 228 transitions, 2673 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-14 11:18:32,783 INFO L231 Difference]: Finished difference. Result has 158 places, 207 transitions, 2299 flow [2024-06-14 11:18:32,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2179, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2299, PETRI_PLACES=158, PETRI_TRANSITIONS=207} [2024-06-14 11:18:32,784 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 97 predicate places. [2024-06-14 11:18:32,784 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 207 transitions, 2299 flow [2024-06-14 11:18:32,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:32,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:32,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:32,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 11:18:32,785 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:32,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:32,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1562890865, now seen corresponding path program 3 times [2024-06-14 11:18:32,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:32,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585385878] [2024-06-14 11:18:32,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:32,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:32,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-06-14 11:18:32,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:32,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585385878] [2024-06-14 11:18:32,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585385878] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:32,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:32,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:32,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408988040] [2024-06-14 11:18:32,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:32,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:32,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:32,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:32,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:32,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:32,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 207 transitions, 2299 flow. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:32,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:32,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:32,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:33,556 INFO L124 PetriNetUnfolderBase]: 2598/5270 cut-off events. [2024-06-14 11:18:33,557 INFO L125 PetriNetUnfolderBase]: For 116393/116613 co-relation queries the response was YES. [2024-06-14 11:18:33,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28691 conditions, 5270 events. 2598/5270 cut-off events. For 116393/116613 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 38656 event pairs, 974 based on Foata normal form. 40/5222 useless extension candidates. Maximal degree in co-relation 15203. Up to 2045 conditions per place. [2024-06-14 11:18:33,606 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 127 selfloop transitions, 17 changer transitions 0/238 dead transitions. [2024-06-14 11:18:33,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 238 transitions, 2891 flow [2024-06-14 11:18:33,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:33,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:33,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2024-06-14 11:18:33,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-06-14 11:18:33,608 INFO L175 Difference]: Start difference. First operand has 158 places, 207 transitions, 2299 flow. Second operand 5 states and 240 transitions. [2024-06-14 11:18:33,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 238 transitions, 2891 flow [2024-06-14 11:18:33,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 238 transitions, 2846 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-14 11:18:33,733 INFO L231 Difference]: Finished difference. Result has 161 places, 207 transitions, 2294 flow [2024-06-14 11:18:33,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2254, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2294, PETRI_PLACES=161, PETRI_TRANSITIONS=207} [2024-06-14 11:18:33,734 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 100 predicate places. [2024-06-14 11:18:33,734 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 207 transitions, 2294 flow [2024-06-14 11:18:33,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:33,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:33,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:33,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 11:18:33,735 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:33,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:33,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1008395796, now seen corresponding path program 1 times [2024-06-14 11:18:33,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:33,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018318366] [2024-06-14 11:18:33,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:33,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:33,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:33,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:33,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018318366] [2024-06-14 11:18:33,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018318366] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:33,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:33,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:33,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788773182] [2024-06-14 11:18:33,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:33,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:33,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:33,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:33,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:33,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:33,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 207 transitions, 2294 flow. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:33,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:33,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:33,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:34,512 INFO L124 PetriNetUnfolderBase]: 2661/5465 cut-off events. [2024-06-14 11:18:34,512 INFO L125 PetriNetUnfolderBase]: For 133767/133991 co-relation queries the response was YES. [2024-06-14 11:18:34,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30017 conditions, 5465 events. 2661/5465 cut-off events. For 133767/133991 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 40816 event pairs, 608 based on Foata normal form. 58/5425 useless extension candidates. Maximal degree in co-relation 29625. Up to 2372 conditions per place. [2024-06-14 11:18:34,567 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 130 selfloop transitions, 15 changer transitions 2/241 dead transitions. [2024-06-14 11:18:34,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 241 transitions, 2908 flow [2024-06-14 11:18:34,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:34,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:34,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 238 transitions. [2024-06-14 11:18:34,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-06-14 11:18:34,568 INFO L175 Difference]: Start difference. First operand has 161 places, 207 transitions, 2294 flow. Second operand 5 states and 238 transitions. [2024-06-14 11:18:34,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 241 transitions, 2908 flow [2024-06-14 11:18:34,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 241 transitions, 2793 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-14 11:18:34,690 INFO L231 Difference]: Finished difference. Result has 161 places, 210 transitions, 2286 flow [2024-06-14 11:18:34,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2171, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2286, PETRI_PLACES=161, PETRI_TRANSITIONS=210} [2024-06-14 11:18:34,691 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 100 predicate places. [2024-06-14 11:18:34,691 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 210 transitions, 2286 flow [2024-06-14 11:18:34,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:34,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:34,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:34,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 11:18:34,692 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:34,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:34,692 INFO L85 PathProgramCache]: Analyzing trace with hash -808075808, now seen corresponding path program 1 times [2024-06-14 11:18:34,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:34,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003398241] [2024-06-14 11:18:34,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:34,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:34,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:34,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:34,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003398241] [2024-06-14 11:18:34,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003398241] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:34,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:34,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:34,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803995321] [2024-06-14 11:18:34,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:34,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:34,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:34,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:34,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:34,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:34,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 210 transitions, 2286 flow. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:34,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:34,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:34,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:35,498 INFO L124 PetriNetUnfolderBase]: 2678/5520 cut-off events. [2024-06-14 11:18:35,499 INFO L125 PetriNetUnfolderBase]: For 142899/143135 co-relation queries the response was YES. [2024-06-14 11:18:35,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30997 conditions, 5520 events. 2678/5520 cut-off events. For 142899/143135 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 41663 event pairs, 965 based on Foata normal form. 49/5467 useless extension candidates. Maximal degree in co-relation 30592. Up to 2606 conditions per place. [2024-06-14 11:18:35,552 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 111 selfloop transitions, 30 changer transitions 1/236 dead transitions. [2024-06-14 11:18:35,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 236 transitions, 2808 flow [2024-06-14 11:18:35,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:35,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:35,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 233 transitions. [2024-06-14 11:18:35,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6852941176470588 [2024-06-14 11:18:35,554 INFO L175 Difference]: Start difference. First operand has 161 places, 210 transitions, 2286 flow. Second operand 5 states and 233 transitions. [2024-06-14 11:18:35,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 236 transitions, 2808 flow [2024-06-14 11:18:35,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 236 transitions, 2797 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 11:18:35,699 INFO L231 Difference]: Finished difference. Result has 167 places, 215 transitions, 2441 flow [2024-06-14 11:18:35,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2277, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2441, PETRI_PLACES=167, PETRI_TRANSITIONS=215} [2024-06-14 11:18:35,699 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 106 predicate places. [2024-06-14 11:18:35,699 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 215 transitions, 2441 flow [2024-06-14 11:18:35,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:35,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:35,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:35,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 11:18:35,700 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:35,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:35,701 INFO L85 PathProgramCache]: Analyzing trace with hash 254139939, now seen corresponding path program 1 times [2024-06-14 11:18:35,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:35,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530781449] [2024-06-14 11:18:35,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:35,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:35,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:35,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:35,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530781449] [2024-06-14 11:18:35,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530781449] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:35,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:35,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:35,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454592713] [2024-06-14 11:18:35,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:35,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:35,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:35,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:35,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:35,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:35,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 215 transitions, 2441 flow. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:35,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:35,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:35,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:36,315 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([352] L809-->L806-1: Formula: (or (< 3 |v_thr2Thread1of1ForFork1_~f12~0#1_35|) (< |v_thr2Thread1of1ForFork1_~f12~0#1_35| 2)) InVars {thr2Thread1of1ForFork1_~f12~0#1=|v_thr2Thread1of1ForFork1_~f12~0#1_35|} OutVars{thr2Thread1of1ForFork1_~f12~0#1=|v_thr2Thread1of1ForFork1_~f12~0#1_35|} AuxVars[] AssignedVars[][101], [18#L735true, Black: 131#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3)), Black: 137#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 239#true, Black: 143#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 101#true, Black: 147#(<= ~flag1~0 0), Black: 148#(<= |thr2Thread1of1ForFork1_~f12~0#1| 0), Black: 150#(and (<= ~flag1~0 0) (<= |thr2Thread1of1ForFork1_~f12~0#1| 0)), Black: 157#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 4)), 26#L806-1true, Black: 161#(= ~x~0 0), Black: 162#(and (= ~x~0 0) (= ~flag1~0 4)), Black: 163#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), Black: 171#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), Black: 170#(and (= ~x~0 0) (= ~flag2~0 1)), 27#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 179#(and (<= 3 |thr2Thread1of1ForFork1_~f12~0#1|) (<= 3 ~flag1~0)), Black: 177#(<= 3 |thr2Thread1of1ForFork1_~f12~0#1|), Black: 176#(<= 3 ~flag1~0), Black: 174#true, Black: 189#(and (= ~x~0 0) (= ~flag2~0 1) (= 2 ~flag1~0)), thr2Thread1of1ForFork1InUse, Black: 195#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), 247#true, Black: 70#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), 88#true, 145#true, Black: 201#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), Black: 75#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 80#(and (= ~x~0 0) (= ~flag1~0 3) (= ~flag2~0 0)), Black: 208#(and (= |thr2Thread1of1ForFork1_~f12~0#1| 1) (= ~flag1~0 1)), Black: 205#(= ~flag1~0 1), Black: 206#(= |thr2Thread1of1ForFork1_~f12~0#1| 1), Black: 85#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1)), Black: 84#(and (= ~flag1~0 0) (= ~x~0 0)), Black: 217#(and (= ~x~0 0) (= ~flag1~0 1) (= 2 ~flag2~0)), 82#true, Black: 92#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 223#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), 120#true, Black: 99#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 229#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), Black: 106#(and (= |thr1Thread1of1ForFork0_~f21~0#1| 0) (= ~flag2~0 0)), Black: 235#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), Black: 104#(= |thr1Thread1of1ForFork0_~f21~0#1| 0), Black: 233#(= ~flag2~0 0), Black: 103#(= ~flag2~0 0), 203#true, Black: 234#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 113#(and (= ~x~0 0) (= ~flag1~0 4) (= ~flag2~0 0)), Black: 241#(= ~flag1~0 0), Black: 243#(and (= ~flag1~0 0) (= ~flag2~0 4) (= ~x~0 1)), Black: 242#(and (= ~flag1~0 0) (= ~flag2~0 4)), Black: 118#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 3)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3))]) [2024-06-14 11:18:36,316 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-14 11:18:36,316 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-14 11:18:36,316 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-14 11:18:36,316 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-14 11:18:36,316 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([352] L809-->L806-1: Formula: (or (< 3 |v_thr2Thread1of1ForFork1_~f12~0#1_35|) (< |v_thr2Thread1of1ForFork1_~f12~0#1_35| 2)) InVars {thr2Thread1of1ForFork1_~f12~0#1=|v_thr2Thread1of1ForFork1_~f12~0#1_35|} OutVars{thr2Thread1of1ForFork1_~f12~0#1=|v_thr2Thread1of1ForFork1_~f12~0#1_35|} AuxVars[] AssignedVars[][101], [Black: 131#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3)), 161#(= ~x~0 0), Black: 137#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 239#true, Black: 143#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 101#true, 15#L745-3true, Black: 147#(<= ~flag1~0 0), Black: 148#(<= |thr2Thread1of1ForFork1_~f12~0#1| 0), Black: 150#(and (<= ~flag1~0 0) (<= |thr2Thread1of1ForFork1_~f12~0#1| 0)), Black: 157#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 4)), 26#L806-1true, Black: 162#(and (= ~x~0 0) (= ~flag1~0 4)), Black: 163#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), Black: 171#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), 215#(= ~x~0 0), Black: 170#(and (= ~x~0 0) (= ~flag2~0 1)), 27#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 179#(and (<= 3 |thr2Thread1of1ForFork1_~f12~0#1|) (<= 3 ~flag1~0)), Black: 177#(<= 3 |thr2Thread1of1ForFork1_~f12~0#1|), 141#(= ~x~0 0), Black: 176#(<= 3 ~flag1~0), Black: 174#true, Black: 189#(and (= ~x~0 0) (= ~flag2~0 1) (= 2 ~flag1~0)), thr2Thread1of1ForFork1InUse, Black: 195#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), 247#true, Black: 70#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), 145#true, Black: 201#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), Black: 75#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 80#(and (= ~x~0 0) (= ~flag1~0 3) (= ~flag2~0 0)), Black: 208#(and (= |thr2Thread1of1ForFork1_~f12~0#1| 1) (= ~flag1~0 1)), Black: 205#(= ~flag1~0 1), Black: 206#(= |thr2Thread1of1ForFork1_~f12~0#1| 1), Black: 85#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1)), Black: 84#(and (= ~flag1~0 0) (= ~x~0 0)), Black: 217#(and (= ~x~0 0) (= ~flag1~0 1) (= 2 ~flag2~0)), 82#true, Black: 88#true, Black: 92#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 223#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), Black: 99#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 229#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), 122#(= ~x~0 0), Black: 106#(and (= |thr1Thread1of1ForFork0_~f21~0#1| 0) (= ~flag2~0 0)), Black: 104#(= |thr1Thread1of1ForFork0_~f21~0#1| 0), Black: 235#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), Black: 103#(= ~flag2~0 0), Black: 233#(= ~flag2~0 0), 203#true, Black: 234#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 113#(and (= ~x~0 0) (= ~flag1~0 4) (= ~flag2~0 0)), Black: 241#(= ~flag1~0 0), Black: 243#(and (= ~flag1~0 0) (= ~flag2~0 4) (= ~x~0 1)), Black: 242#(and (= ~flag1~0 0) (= ~flag2~0 4)), Black: 118#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 3)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3))]) [2024-06-14 11:18:36,316 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-14 11:18:36,316 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-14 11:18:36,317 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-14 11:18:36,317 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-14 11:18:36,405 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([352] L809-->L806-1: Formula: (or (< 3 |v_thr2Thread1of1ForFork1_~f12~0#1_35|) (< |v_thr2Thread1of1ForFork1_~f12~0#1_35| 2)) InVars {thr2Thread1of1ForFork1_~f12~0#1=|v_thr2Thread1of1ForFork1_~f12~0#1_35|} OutVars{thr2Thread1of1ForFork1_~f12~0#1=|v_thr2Thread1of1ForFork1_~f12~0#1_35|} AuxVars[] AssignedVars[][101], [161#(= ~x~0 0), Black: 131#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3)), Black: 137#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 239#true, Black: 143#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 101#true, Black: 147#(<= ~flag1~0 0), Black: 148#(<= |thr2Thread1of1ForFork1_~f12~0#1| 0), Black: 150#(and (<= ~flag1~0 0) (<= |thr2Thread1of1ForFork1_~f12~0#1| 0)), Black: 157#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 4)), 26#L806-1true, Black: 162#(and (= ~x~0 0) (= ~flag1~0 4)), Black: 163#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), 215#(= ~x~0 0), Black: 171#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), Black: 170#(and (= ~x~0 0) (= ~flag2~0 1)), 27#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 179#(and (<= 3 |thr2Thread1of1ForFork1_~f12~0#1|) (<= 3 ~flag1~0)), 141#(= ~x~0 0), Black: 177#(<= 3 |thr2Thread1of1ForFork1_~f12~0#1|), Black: 176#(<= 3 ~flag1~0), Black: 174#true, Black: 189#(and (= ~x~0 0) (= ~flag2~0 1) (= 2 ~flag1~0)), thr2Thread1of1ForFork1InUse, 247#true, Black: 195#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), Black: 70#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), 145#true, Black: 201#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), Black: 75#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 80#(and (= ~x~0 0) (= ~flag1~0 3) (= ~flag2~0 0)), Black: 208#(and (= |thr2Thread1of1ForFork1_~f12~0#1| 1) (= ~flag1~0 1)), Black: 205#(= ~flag1~0 1), Black: 206#(= |thr2Thread1of1ForFork1_~f12~0#1| 1), Black: 85#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1)), 49#L749-1true, Black: 84#(and (= ~flag1~0 0) (= ~x~0 0)), Black: 217#(and (= ~x~0 0) (= ~flag1~0 1) (= 2 ~flag2~0)), 82#true, Black: 88#true, Black: 92#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 223#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), Black: 99#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 229#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), 122#(= ~x~0 0), Black: 106#(and (= |thr1Thread1of1ForFork0_~f21~0#1| 0) (= ~flag2~0 0)), Black: 235#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), Black: 104#(= |thr1Thread1of1ForFork0_~f21~0#1| 0), Black: 233#(= ~flag2~0 0), Black: 103#(= ~flag2~0 0), Black: 234#(and (= ~x~0 0) (= ~flag2~0 0)), 203#true, Black: 113#(and (= ~x~0 0) (= ~flag1~0 4) (= ~flag2~0 0)), Black: 241#(= ~flag1~0 0), Black: 243#(and (= ~flag1~0 0) (= ~flag2~0 4) (= ~x~0 1)), Black: 242#(and (= ~flag1~0 0) (= ~flag2~0 4)), Black: 118#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 3)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3))]) [2024-06-14 11:18:36,406 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-14 11:18:36,406 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-06-14 11:18:36,406 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-14 11:18:36,406 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-06-14 11:18:36,455 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L749-1-->L756: Formula: (= v_~flag1~0_13 0) InVars {} OutVars{~flag1~0=v_~flag1~0_13} AuxVars[] AssignedVars[~flag1~0][214], [161#(= ~x~0 0), Black: 131#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3)), Black: 137#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 56#L809true, Black: 143#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 177#(<= 3 |thr2Thread1of1ForFork1_~f12~0#1|), 147#(<= ~flag1~0 0), 101#true, Black: 148#(<= |thr2Thread1of1ForFork1_~f12~0#1| 0), Black: 150#(and (<= ~flag1~0 0) (<= |thr2Thread1of1ForFork1_~f12~0#1| 0)), Black: 157#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 4)), Black: 162#(and (= ~x~0 0) (= ~flag1~0 4)), Black: 163#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), 215#(= ~x~0 0), Black: 171#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), Black: 170#(and (= ~x~0 0) (= ~flag2~0 1)), 27#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 141#(= ~x~0 0), 241#(= ~flag1~0 0), Black: 179#(and (<= 3 |thr2Thread1of1ForFork1_~f12~0#1|) (<= 3 ~flag1~0)), Black: 176#(<= 3 ~flag1~0), Black: 174#true, Black: 189#(and (= ~x~0 0) (= ~flag2~0 1) (= 2 ~flag1~0)), thr2Thread1of1ForFork1InUse, 247#true, Black: 195#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), Black: 70#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), Black: 201#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), Black: 75#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 80#(and (= ~x~0 0) (= ~flag1~0 3) (= ~flag2~0 0)), Black: 208#(and (= |thr2Thread1of1ForFork1_~f12~0#1| 1) (= ~flag1~0 1)), Black: 205#(= ~flag1~0 1), Black: 206#(= |thr2Thread1of1ForFork1_~f12~0#1| 1), Black: 85#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1)), Black: 84#(and (= ~flag1~0 0) (= ~x~0 0)), Black: 217#(and (= ~x~0 0) (= ~flag1~0 1) (= 2 ~flag2~0)), 82#true, Black: 88#true, Black: 92#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 223#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), Black: 99#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 229#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), 122#(= ~x~0 0), Black: 106#(and (= |thr1Thread1of1ForFork0_~f21~0#1| 0) (= ~flag2~0 0)), Black: 235#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), Black: 104#(= |thr1Thread1of1ForFork0_~f21~0#1| 0), Black: 233#(= ~flag2~0 0), Black: 103#(= ~flag2~0 0), Black: 234#(and (= ~x~0 0) (= ~flag2~0 0)), 203#true, Black: 113#(and (= ~x~0 0) (= ~flag1~0 4) (= ~flag2~0 0)), Black: 243#(and (= ~flag1~0 0) (= ~flag2~0 4) (= ~x~0 1)), Black: 242#(and (= ~flag1~0 0) (= ~flag2~0 4)), Black: 118#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 3)), 13#L756true, Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3))]) [2024-06-14 11:18:36,456 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2024-06-14 11:18:36,456 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2024-06-14 11:18:36,456 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-06-14 11:18:36,456 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2024-06-14 11:18:36,580 INFO L124 PetriNetUnfolderBase]: 2635/5346 cut-off events. [2024-06-14 11:18:36,580 INFO L125 PetriNetUnfolderBase]: For 154646/154884 co-relation queries the response was YES. [2024-06-14 11:18:36,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31622 conditions, 5346 events. 2635/5346 cut-off events. For 154646/154884 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 40098 event pairs, 1515 based on Foata normal form. 38/5189 useless extension candidates. Maximal degree in co-relation 22436. Up to 3616 conditions per place. [2024-06-14 11:18:36,636 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 110 selfloop transitions, 27 changer transitions 0/231 dead transitions. [2024-06-14 11:18:36,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 231 transitions, 2825 flow [2024-06-14 11:18:36,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:36,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:36,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 229 transitions. [2024-06-14 11:18:36,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6735294117647059 [2024-06-14 11:18:36,637 INFO L175 Difference]: Start difference. First operand has 167 places, 215 transitions, 2441 flow. Second operand 5 states and 229 transitions. [2024-06-14 11:18:36,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 231 transitions, 2825 flow [2024-06-14 11:18:36,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 231 transitions, 2798 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-14 11:18:36,805 INFO L231 Difference]: Finished difference. Result has 171 places, 217 transitions, 2498 flow [2024-06-14 11:18:36,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2414, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2498, PETRI_PLACES=171, PETRI_TRANSITIONS=217} [2024-06-14 11:18:36,806 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 110 predicate places. [2024-06-14 11:18:36,806 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 217 transitions, 2498 flow [2024-06-14 11:18:36,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:36,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:36,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:36,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 11:18:36,807 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:36,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:36,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1892534533, now seen corresponding path program 2 times [2024-06-14 11:18:36,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:36,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230041298] [2024-06-14 11:18:36,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:36,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:36,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:36,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230041298] [2024-06-14 11:18:36,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230041298] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:36,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:36,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:36,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101764074] [2024-06-14 11:18:36,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:36,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:36,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:36,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:36,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:36,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:36,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 217 transitions, 2498 flow. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:36,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:36,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:36,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:37,726 INFO L124 PetriNetUnfolderBase]: 2676/5459 cut-off events. [2024-06-14 11:18:37,727 INFO L125 PetriNetUnfolderBase]: For 163578/163814 co-relation queries the response was YES. [2024-06-14 11:18:37,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32789 conditions, 5459 events. 2676/5459 cut-off events. For 163578/163814 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 40668 event pairs, 1188 based on Foata normal form. 45/5367 useless extension candidates. Maximal degree in co-relation 22503. Up to 2671 conditions per place. [2024-06-14 11:18:37,777 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 137 selfloop transitions, 23 changer transitions 0/254 dead transitions. [2024-06-14 11:18:37,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 254 transitions, 3282 flow [2024-06-14 11:18:37,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:37,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:37,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 231 transitions. [2024-06-14 11:18:37,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6794117647058824 [2024-06-14 11:18:37,779 INFO L175 Difference]: Start difference. First operand has 171 places, 217 transitions, 2498 flow. Second operand 5 states and 231 transitions. [2024-06-14 11:18:37,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 254 transitions, 3282 flow [2024-06-14 11:18:37,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 254 transitions, 3244 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-14 11:18:37,931 INFO L231 Difference]: Finished difference. Result has 174 places, 223 transitions, 2602 flow [2024-06-14 11:18:37,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2464, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2602, PETRI_PLACES=174, PETRI_TRANSITIONS=223} [2024-06-14 11:18:37,932 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 113 predicate places. [2024-06-14 11:18:37,932 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 223 transitions, 2602 flow [2024-06-14 11:18:37,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:37,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:37,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:37,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 11:18:37,933 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:37,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:37,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1892265763, now seen corresponding path program 3 times [2024-06-14 11:18:37,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:37,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335982467] [2024-06-14 11:18:37,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:37,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:37,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-06-14 11:18:37,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:37,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335982467] [2024-06-14 11:18:37,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335982467] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:37,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:37,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:37,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468549466] [2024-06-14 11:18:37,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:37,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:37,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:37,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:37,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:38,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:38,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 223 transitions, 2602 flow. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:38,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:38,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:38,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:38,765 INFO L124 PetriNetUnfolderBase]: 2660/5434 cut-off events. [2024-06-14 11:18:38,765 INFO L125 PetriNetUnfolderBase]: For 174596/174839 co-relation queries the response was YES. [2024-06-14 11:18:38,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33245 conditions, 5434 events. 2660/5434 cut-off events. For 174596/174839 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 40504 event pairs, 1135 based on Foata normal form. 48/5354 useless extension candidates. Maximal degree in co-relation 22926. Up to 2665 conditions per place. [2024-06-14 11:18:38,815 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 142 selfloop transitions, 26 changer transitions 0/262 dead transitions. [2024-06-14 11:18:38,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 262 transitions, 3400 flow [2024-06-14 11:18:38,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:38,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:38,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 239 transitions. [2024-06-14 11:18:38,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7029411764705882 [2024-06-14 11:18:38,816 INFO L175 Difference]: Start difference. First operand has 174 places, 223 transitions, 2602 flow. Second operand 5 states and 239 transitions. [2024-06-14 11:18:38,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 262 transitions, 3400 flow [2024-06-14 11:18:39,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 262 transitions, 3380 flow, removed 10 selfloop flow, removed 0 redundant places. [2024-06-14 11:18:39,015 INFO L231 Difference]: Finished difference. Result has 179 places, 224 transitions, 2653 flow [2024-06-14 11:18:39,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2582, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2653, PETRI_PLACES=179, PETRI_TRANSITIONS=224} [2024-06-14 11:18:39,016 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 118 predicate places. [2024-06-14 11:18:39,016 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 224 transitions, 2653 flow [2024-06-14 11:18:39,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:39,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:39,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:39,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 11:18:39,017 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:39,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:39,017 INFO L85 PathProgramCache]: Analyzing trace with hash -142289907, now seen corresponding path program 1 times [2024-06-14 11:18:39,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:39,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293027828] [2024-06-14 11:18:39,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:39,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:39,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:39,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:39,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293027828] [2024-06-14 11:18:39,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293027828] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:39,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:39,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:39,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087422608] [2024-06-14 11:18:39,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:39,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:39,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:39,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:39,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:39,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:39,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 224 transitions, 2653 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:39,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:39,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:39,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:39,847 INFO L124 PetriNetUnfolderBase]: 2687/5489 cut-off events. [2024-06-14 11:18:39,847 INFO L125 PetriNetUnfolderBase]: For 188372/188629 co-relation queries the response was YES. [2024-06-14 11:18:39,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34357 conditions, 5489 events. 2687/5489 cut-off events. For 188372/188629 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 40993 event pairs, 1114 based on Foata normal form. 42/5397 useless extension candidates. Maximal degree in co-relation 23865. Up to 2390 conditions per place. [2024-06-14 11:18:39,899 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 127 selfloop transitions, 29 changer transitions 0/250 dead transitions. [2024-06-14 11:18:39,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 250 transitions, 3286 flow [2024-06-14 11:18:39,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:39,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:39,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 236 transitions. [2024-06-14 11:18:39,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6941176470588235 [2024-06-14 11:18:39,900 INFO L175 Difference]: Start difference. First operand has 179 places, 224 transitions, 2653 flow. Second operand 5 states and 236 transitions. [2024-06-14 11:18:39,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 250 transitions, 3286 flow [2024-06-14 11:18:40,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 250 transitions, 3246 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-14 11:18:40,148 INFO L231 Difference]: Finished difference. Result has 181 places, 228 transitions, 2745 flow [2024-06-14 11:18:40,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2616, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2745, PETRI_PLACES=181, PETRI_TRANSITIONS=228} [2024-06-14 11:18:40,148 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 120 predicate places. [2024-06-14 11:18:40,149 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 228 transitions, 2745 flow [2024-06-14 11:18:40,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:40,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:40,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:40,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 11:18:40,149 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:40,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:40,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1924012341, now seen corresponding path program 1 times [2024-06-14 11:18:40,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:40,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958550464] [2024-06-14 11:18:40,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:40,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:40,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-06-14 11:18:40,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:40,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958550464] [2024-06-14 11:18:40,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958550464] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:40,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:40,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:40,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861625532] [2024-06-14 11:18:40,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:40,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:18:40,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:40,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:18:40,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:18:40,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 68 [2024-06-14 11:18:40,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 228 transitions, 2745 flow. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:40,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:40,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 68 [2024-06-14 11:18:40,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:40,809 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L749-1-->L756: Formula: (= v_~flag1~0_13 0) InVars {} OutVars{~flag1~0=v_~flag1~0_13} AuxVars[] AssignedVars[~flag1~0][256], [Black: 257#(and (= ~flag2~0 4) (= ~flag1~0 1) (= ~x~0 1)), Black: 131#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3)), 161#(= ~x~0 0), Black: 263#(and (= ~flag2~0 4) (= ~flag1~0 1) (= ~x~0 1)), Black: 137#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 56#L809true, Black: 269#(and (= ~x~0 0) (= 2 ~flag1~0) (= ~flag2~0 3)), Black: 143#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 177#(<= 3 |thr2Thread1of1ForFork1_~f12~0#1|), 101#true, 147#(<= ~flag1~0 0), Black: 148#(<= |thr2Thread1of1ForFork1_~f12~0#1| 0), Black: 150#(and (<= ~flag1~0 0) (<= |thr2Thread1of1ForFork1_~f12~0#1| 0)), Black: 157#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 4)), 261#(= ~flag2~0 4), Black: 162#(and (= ~x~0 0) (= ~flag1~0 4)), Black: 163#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), Black: 171#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), 215#(= ~x~0 0), Black: 170#(and (= ~x~0 0) (= ~flag2~0 1)), 27#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 141#(= ~x~0 0), 241#(= ~flag1~0 0), Black: 179#(and (<= 3 |thr2Thread1of1ForFork1_~f12~0#1|) (<= 3 ~flag1~0)), Black: 176#(<= 3 ~flag1~0), Black: 174#true, Black: 189#(and (= ~x~0 0) (= ~flag2~0 1) (= 2 ~flag1~0)), thr2Thread1of1ForFork1InUse, Black: 195#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), Black: 70#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), Black: 201#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), Black: 75#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 80#(and (= ~x~0 0) (= ~flag1~0 3) (= ~flag2~0 0)), Black: 208#(and (= |thr2Thread1of1ForFork1_~f12~0#1| 1) (= ~flag1~0 1)), 271#true, Black: 205#(= ~flag1~0 1), Black: 206#(= |thr2Thread1of1ForFork1_~f12~0#1| 1), Black: 85#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1)), Black: 84#(and (= ~flag1~0 0) (= ~x~0 0)), Black: 217#(and (= ~x~0 0) (= ~flag1~0 1) (= 2 ~flag2~0)), 82#true, Black: 88#true, Black: 92#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 223#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), Black: 99#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 229#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), 122#(= ~x~0 0), Black: 106#(and (= |thr1Thread1of1ForFork0_~f21~0#1| 0) (= ~flag2~0 0)), Black: 235#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), Black: 104#(= |thr1Thread1of1ForFork0_~f21~0#1| 0), 267#(= ~x~0 0), Black: 103#(= ~flag2~0 0), Black: 234#(and (= ~x~0 0) (= ~flag2~0 0)), 203#true, Black: 113#(and (= ~x~0 0) (= ~flag1~0 4) (= ~flag2~0 0)), Black: 243#(and (= ~flag1~0 0) (= ~flag2~0 4) (= ~x~0 1)), Black: 242#(and (= ~flag1~0 0) (= ~flag2~0 4)), Black: 118#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 3)), 255#(= ~flag2~0 4), 13#L756true, Black: 251#(and (= ~flag2~0 4) (= ~flag1~0 1) (= ~x~0 1)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3))]) [2024-06-14 11:18:40,810 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-06-14 11:18:40,810 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-06-14 11:18:40,810 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-14 11:18:40,810 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-06-14 11:18:40,878 INFO L124 PetriNetUnfolderBase]: 2952/5814 cut-off events. [2024-06-14 11:18:40,879 INFO L125 PetriNetUnfolderBase]: For 116499/117327 co-relation queries the response was YES. [2024-06-14 11:18:40,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30932 conditions, 5814 events. 2952/5814 cut-off events. For 116499/117327 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 43111 event pairs, 1438 based on Foata normal form. 132/5556 useless extension candidates. Maximal degree in co-relation 21722. Up to 3663 conditions per place. [2024-06-14 11:18:40,936 INFO L140 encePairwiseOnDemand]: 54/68 looper letters, 114 selfloop transitions, 26 changer transitions 1/274 dead transitions. [2024-06-14 11:18:40,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 274 transitions, 3338 flow [2024-06-14 11:18:40,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:40,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:40,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2024-06-14 11:18:40,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6588235294117647 [2024-06-14 11:18:40,938 INFO L175 Difference]: Start difference. First operand has 181 places, 228 transitions, 2745 flow. Second operand 5 states and 224 transitions. [2024-06-14 11:18:40,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 274 transitions, 3338 flow [2024-06-14 11:18:41,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 274 transitions, 3267 flow, removed 19 selfloop flow, removed 2 redundant places. [2024-06-14 11:18:41,152 INFO L231 Difference]: Finished difference. Result has 187 places, 233 transitions, 2825 flow [2024-06-14 11:18:41,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2601, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2825, PETRI_PLACES=187, PETRI_TRANSITIONS=233} [2024-06-14 11:18:41,153 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 126 predicate places. [2024-06-14 11:18:41,153 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 233 transitions, 2825 flow [2024-06-14 11:18:41,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:41,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:41,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:41,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 11:18:41,154 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:41,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:41,154 INFO L85 PathProgramCache]: Analyzing trace with hash 828603239, now seen corresponding path program 2 times [2024-06-14 11:18:41,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:41,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338692246] [2024-06-14 11:18:41,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:41,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:41,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:41,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:41,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338692246] [2024-06-14 11:18:41,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338692246] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:41,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:41,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:41,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204407777] [2024-06-14 11:18:41,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:41,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:41,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:41,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:41,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:41,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:41,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 233 transitions, 2825 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:41,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:41,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:41,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:41,992 INFO L124 PetriNetUnfolderBase]: 2610/5446 cut-off events. [2024-06-14 11:18:41,992 INFO L125 PetriNetUnfolderBase]: For 204745/204999 co-relation queries the response was YES. [2024-06-14 11:18:42,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35522 conditions, 5446 events. 2610/5446 cut-off events. For 204745/204999 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 41447 event pairs, 987 based on Foata normal form. 49/5354 useless extension candidates. Maximal degree in co-relation 27426. Up to 2171 conditions per place. [2024-06-14 11:18:42,049 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 118 selfloop transitions, 43 changer transitions 0/261 dead transitions. [2024-06-14 11:18:42,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 261 transitions, 3487 flow [2024-06-14 11:18:42,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:42,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:42,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 239 transitions. [2024-06-14 11:18:42,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7029411764705882 [2024-06-14 11:18:42,050 INFO L175 Difference]: Start difference. First operand has 187 places, 233 transitions, 2825 flow. Second operand 5 states and 239 transitions. [2024-06-14 11:18:42,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 261 transitions, 3487 flow [2024-06-14 11:18:42,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 261 transitions, 3483 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-14 11:18:42,339 INFO L231 Difference]: Finished difference. Result has 193 places, 240 transitions, 3083 flow [2024-06-14 11:18:42,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2821, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3083, PETRI_PLACES=193, PETRI_TRANSITIONS=240} [2024-06-14 11:18:42,340 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 132 predicate places. [2024-06-14 11:18:42,340 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 240 transitions, 3083 flow [2024-06-14 11:18:42,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:42,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:42,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:42,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 11:18:42,341 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:42,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:42,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1602497195, now seen corresponding path program 1 times [2024-06-14 11:18:42,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:42,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014917658] [2024-06-14 11:18:42,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:42,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:42,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:42,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:42,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014917658] [2024-06-14 11:18:42,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014917658] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:42,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:42,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:42,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822163196] [2024-06-14 11:18:42,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:42,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:42,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:42,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:42,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:42,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:42,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 240 transitions, 3083 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:42,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:42,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:42,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:43,166 INFO L124 PetriNetUnfolderBase]: 2673/5587 cut-off events. [2024-06-14 11:18:43,166 INFO L125 PetriNetUnfolderBase]: For 217221/217472 co-relation queries the response was YES. [2024-06-14 11:18:43,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37330 conditions, 5587 events. 2673/5587 cut-off events. For 217221/217472 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 42647 event pairs, 1024 based on Foata normal form. 39/5485 useless extension candidates. Maximal degree in co-relation 28828. Up to 2361 conditions per place. [2024-06-14 11:18:43,224 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 121 selfloop transitions, 45 changer transitions 0/266 dead transitions. [2024-06-14 11:18:43,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 266 transitions, 3721 flow [2024-06-14 11:18:43,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:43,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:43,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2024-06-14 11:18:43,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-06-14 11:18:43,226 INFO L175 Difference]: Start difference. First operand has 193 places, 240 transitions, 3083 flow. Second operand 5 states and 240 transitions. [2024-06-14 11:18:43,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 266 transitions, 3721 flow [2024-06-14 11:18:43,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 266 transitions, 3643 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-06-14 11:18:43,495 INFO L231 Difference]: Finished difference. Result has 196 places, 244 transitions, 3167 flow [2024-06-14 11:18:43,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3005, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3167, PETRI_PLACES=196, PETRI_TRANSITIONS=244} [2024-06-14 11:18:43,495 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 135 predicate places. [2024-06-14 11:18:43,496 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 244 transitions, 3167 flow [2024-06-14 11:18:43,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:43,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:43,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:43,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 11:18:43,496 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:43,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:43,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1601784815, now seen corresponding path program 2 times [2024-06-14 11:18:43,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:43,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436575072] [2024-06-14 11:18:43,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:43,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:43,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:43,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:43,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436575072] [2024-06-14 11:18:43,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436575072] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:43,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:43,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:43,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829956173] [2024-06-14 11:18:43,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:43,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:43,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:43,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:43,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:43,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:43,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 244 transitions, 3167 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:43,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:43,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:43,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:44,327 INFO L124 PetriNetUnfolderBase]: 2626/5498 cut-off events. [2024-06-14 11:18:44,327 INFO L125 PetriNetUnfolderBase]: For 225747/225957 co-relation queries the response was YES. [2024-06-14 11:18:44,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36856 conditions, 5498 events. 2626/5498 cut-off events. For 225747/225957 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 41898 event pairs, 1040 based on Foata normal form. 36/5404 useless extension candidates. Maximal degree in co-relation 28304. Up to 2175 conditions per place. [2024-06-14 11:18:44,382 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 149 selfloop transitions, 25 changer transitions 0/274 dead transitions. [2024-06-14 11:18:44,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 274 transitions, 3900 flow [2024-06-14 11:18:44,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:44,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:44,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2024-06-14 11:18:44,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-06-14 11:18:44,393 INFO L175 Difference]: Start difference. First operand has 196 places, 244 transitions, 3167 flow. Second operand 5 states and 240 transitions. [2024-06-14 11:18:44,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 274 transitions, 3900 flow [2024-06-14 11:18:44,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 274 transitions, 3818 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-06-14 11:18:44,666 INFO L231 Difference]: Finished difference. Result has 199 places, 248 transitions, 3219 flow [2024-06-14 11:18:44,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3088, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3219, PETRI_PLACES=199, PETRI_TRANSITIONS=248} [2024-06-14 11:18:44,667 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 138 predicate places. [2024-06-14 11:18:44,667 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 248 transitions, 3219 flow [2024-06-14 11:18:44,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:44,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:44,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:44,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 11:18:44,668 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:44,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:44,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1949779479, now seen corresponding path program 1 times [2024-06-14 11:18:44,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:44,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128176792] [2024-06-14 11:18:44,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:44,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:44,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:44,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:44,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128176792] [2024-06-14 11:18:44,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128176792] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:44,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:44,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:44,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688032541] [2024-06-14 11:18:44,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:44,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:44,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:44,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:44,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:44,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:44,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 248 transitions, 3219 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:44,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:44,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:44,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:45,610 INFO L124 PetriNetUnfolderBase]: 2642/5517 cut-off events. [2024-06-14 11:18:45,610 INFO L125 PetriNetUnfolderBase]: For 236961/237216 co-relation queries the response was YES. [2024-06-14 11:18:45,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37359 conditions, 5517 events. 2642/5517 cut-off events. For 236961/237216 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 41917 event pairs, 1041 based on Foata normal form. 46/5429 useless extension candidates. Maximal degree in co-relation 28697. Up to 2355 conditions per place. [2024-06-14 11:18:45,659 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 118 selfloop transitions, 53 changer transitions 0/271 dead transitions. [2024-06-14 11:18:45,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 271 transitions, 3848 flow [2024-06-14 11:18:45,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:45,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:45,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 238 transitions. [2024-06-14 11:18:45,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-06-14 11:18:45,661 INFO L175 Difference]: Start difference. First operand has 199 places, 248 transitions, 3219 flow. Second operand 5 states and 238 transitions. [2024-06-14 11:18:45,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 271 transitions, 3848 flow [2024-06-14 11:18:45,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 271 transitions, 3749 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-14 11:18:45,898 INFO L231 Difference]: Finished difference. Result has 201 places, 251 transitions, 3293 flow [2024-06-14 11:18:45,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3120, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3293, PETRI_PLACES=201, PETRI_TRANSITIONS=251} [2024-06-14 11:18:45,898 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 140 predicate places. [2024-06-14 11:18:45,899 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 251 transitions, 3293 flow [2024-06-14 11:18:45,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:45,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:45,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:45,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 11:18:45,899 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:45,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:45,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1924849403, now seen corresponding path program 2 times [2024-06-14 11:18:45,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:45,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047313742] [2024-06-14 11:18:45,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:45,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:45,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:45,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:45,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047313742] [2024-06-14 11:18:45,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047313742] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:45,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:45,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:45,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567144331] [2024-06-14 11:18:45,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:45,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:45,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:45,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:45,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:45,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:45,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 251 transitions, 3293 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:45,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:45,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:45,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:46,712 INFO L124 PetriNetUnfolderBase]: 2565/5369 cut-off events. [2024-06-14 11:18:46,712 INFO L125 PetriNetUnfolderBase]: For 245604/245848 co-relation queries the response was YES. [2024-06-14 11:18:46,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36587 conditions, 5369 events. 2565/5369 cut-off events. For 245604/245848 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 40700 event pairs, 979 based on Foata normal form. 55/5293 useless extension candidates. Maximal degree in co-relation 28006. Up to 2137 conditions per place. [2024-06-14 11:18:46,767 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 132 selfloop transitions, 42 changer transitions 0/274 dead transitions. [2024-06-14 11:18:46,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 274 transitions, 3894 flow [2024-06-14 11:18:46,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:46,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:46,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 241 transitions. [2024-06-14 11:18:46,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7088235294117647 [2024-06-14 11:18:46,769 INFO L175 Difference]: Start difference. First operand has 201 places, 251 transitions, 3293 flow. Second operand 5 states and 241 transitions. [2024-06-14 11:18:46,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 274 transitions, 3894 flow [2024-06-14 11:18:47,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 274 transitions, 3811 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-14 11:18:47,064 INFO L231 Difference]: Finished difference. Result has 204 places, 252 transitions, 3317 flow [2024-06-14 11:18:47,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3210, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3317, PETRI_PLACES=204, PETRI_TRANSITIONS=252} [2024-06-14 11:18:47,064 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 143 predicate places. [2024-06-14 11:18:47,065 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 252 transitions, 3317 flow [2024-06-14 11:18:47,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:47,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:47,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:47,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 11:18:47,065 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:47,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:47,066 INFO L85 PathProgramCache]: Analyzing trace with hash -646318099, now seen corresponding path program 2 times [2024-06-14 11:18:47,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:47,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258962194] [2024-06-14 11:18:47,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:47,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:47,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:47,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:47,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258962194] [2024-06-14 11:18:47,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258962194] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:47,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:47,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:47,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919268579] [2024-06-14 11:18:47,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:47,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:18:47,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:47,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:18:47,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:18:47,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 68 [2024-06-14 11:18:47,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 252 transitions, 3317 flow. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:47,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:47,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 68 [2024-06-14 11:18:47,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:47,657 INFO L124 PetriNetUnfolderBase]: 1792/3888 cut-off events. [2024-06-14 11:18:47,658 INFO L125 PetriNetUnfolderBase]: For 94468/94859 co-relation queries the response was YES. [2024-06-14 11:18:47,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22308 conditions, 3888 events. 1792/3888 cut-off events. For 94468/94859 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 28568 event pairs, 600 based on Foata normal form. 153/3883 useless extension candidates. Maximal degree in co-relation 18765. Up to 1566 conditions per place. [2024-06-14 11:18:47,693 INFO L140 encePairwiseOnDemand]: 52/68 looper letters, 111 selfloop transitions, 45 changer transitions 1/284 dead transitions. [2024-06-14 11:18:47,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 284 transitions, 3749 flow [2024-06-14 11:18:47,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:47,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:47,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 239 transitions. [2024-06-14 11:18:47,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7029411764705882 [2024-06-14 11:18:47,694 INFO L175 Difference]: Start difference. First operand has 204 places, 252 transitions, 3317 flow. Second operand 5 states and 239 transitions. [2024-06-14 11:18:47,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 284 transitions, 3749 flow [2024-06-14 11:18:47,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 284 transitions, 3582 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-14 11:18:47,895 INFO L231 Difference]: Finished difference. Result has 207 places, 250 transitions, 3278 flow [2024-06-14 11:18:47,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2849, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3278, PETRI_PLACES=207, PETRI_TRANSITIONS=250} [2024-06-14 11:18:47,895 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 146 predicate places. [2024-06-14 11:18:47,895 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 250 transitions, 3278 flow [2024-06-14 11:18:47,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:47,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:47,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:47,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 11:18:47,896 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:47,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:47,897 INFO L85 PathProgramCache]: Analyzing trace with hash -150218033, now seen corresponding path program 3 times [2024-06-14 11:18:47,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:47,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318295087] [2024-06-14 11:18:47,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:47,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:47,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:47,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:47,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318295087] [2024-06-14 11:18:47,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318295087] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:47,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:47,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:47,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666071760] [2024-06-14 11:18:47,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:47,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:18:47,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:47,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:18:47,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:18:47,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 68 [2024-06-14 11:18:47,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 250 transitions, 3278 flow. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:47,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:47,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 68 [2024-06-14 11:18:47,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:48,403 INFO L124 PetriNetUnfolderBase]: 1490/3287 cut-off events. [2024-06-14 11:18:48,403 INFO L125 PetriNetUnfolderBase]: For 74186/74488 co-relation queries the response was YES. [2024-06-14 11:18:48,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18959 conditions, 3287 events. 1490/3287 cut-off events. For 74186/74488 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 23011 event pairs, 450 based on Foata normal form. 98/3274 useless extension candidates. Maximal degree in co-relation 15635. Up to 1046 conditions per place. [2024-06-14 11:18:48,433 INFO L140 encePairwiseOnDemand]: 50/68 looper letters, 110 selfloop transitions, 70 changer transitions 1/289 dead transitions. [2024-06-14 11:18:48,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 289 transitions, 3880 flow [2024-06-14 11:18:48,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:48,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:48,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 239 transitions. [2024-06-14 11:18:48,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7029411764705882 [2024-06-14 11:18:48,441 INFO L175 Difference]: Start difference. First operand has 207 places, 250 transitions, 3278 flow. Second operand 5 states and 239 transitions. [2024-06-14 11:18:48,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 289 transitions, 3880 flow [2024-06-14 11:18:48,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 289 transitions, 3658 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-14 11:18:48,607 INFO L231 Difference]: Finished difference. Result has 209 places, 254 transitions, 3339 flow [2024-06-14 11:18:48,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2746, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3339, PETRI_PLACES=209, PETRI_TRANSITIONS=254} [2024-06-14 11:18:48,608 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 148 predicate places. [2024-06-14 11:18:48,608 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 254 transitions, 3339 flow [2024-06-14 11:18:48,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:48,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:48,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:48,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 11:18:48,608 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:48,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:48,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1469484678, now seen corresponding path program 1 times [2024-06-14 11:18:48,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:48,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114776033] [2024-06-14 11:18:48,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:48,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:48,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:48,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:48,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114776033] [2024-06-14 11:18:48,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114776033] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:48,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:48,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:48,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743612850] [2024-06-14 11:18:48,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:48,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:48,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:48,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:48,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:48,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:48,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 254 transitions, 3339 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:48,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:48,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:48,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:49,120 INFO L124 PetriNetUnfolderBase]: 1410/3265 cut-off events. [2024-06-14 11:18:49,120 INFO L125 PetriNetUnfolderBase]: For 127844/128013 co-relation queries the response was YES. [2024-06-14 11:18:49,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21754 conditions, 3265 events. 1410/3265 cut-off events. For 127844/128013 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 23461 event pairs, 321 based on Foata normal form. 83/3294 useless extension candidates. Maximal degree in co-relation 21291. Up to 1376 conditions per place. [2024-06-14 11:18:49,151 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 135 selfloop transitions, 25 changer transitions 2/274 dead transitions. [2024-06-14 11:18:49,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 274 transitions, 3891 flow [2024-06-14 11:18:49,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:49,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:49,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 230 transitions. [2024-06-14 11:18:49,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2024-06-14 11:18:49,152 INFO L175 Difference]: Start difference. First operand has 209 places, 254 transitions, 3339 flow. Second operand 5 states and 230 transitions. [2024-06-14 11:18:49,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 274 transitions, 3891 flow [2024-06-14 11:18:49,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 274 transitions, 3881 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-06-14 11:18:49,345 INFO L231 Difference]: Finished difference. Result has 215 places, 256 transitions, 3438 flow [2024-06-14 11:18:49,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3329, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3438, PETRI_PLACES=215, PETRI_TRANSITIONS=256} [2024-06-14 11:18:49,346 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 154 predicate places. [2024-06-14 11:18:49,346 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 256 transitions, 3438 flow [2024-06-14 11:18:49,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:49,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:49,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:49,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 11:18:49,347 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:49,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:49,347 INFO L85 PathProgramCache]: Analyzing trace with hash 144859089, now seen corresponding path program 1 times [2024-06-14 11:18:49,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:49,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753653663] [2024-06-14 11:18:49,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:49,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:49,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:49,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:49,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753653663] [2024-06-14 11:18:49,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753653663] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:49,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:49,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:49,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643567124] [2024-06-14 11:18:49,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:49,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:49,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:49,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:49,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:49,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:49,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 256 transitions, 3438 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:49,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:49,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:49,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:49,898 INFO L124 PetriNetUnfolderBase]: 1384/3191 cut-off events. [2024-06-14 11:18:49,898 INFO L125 PetriNetUnfolderBase]: For 128647/128843 co-relation queries the response was YES. [2024-06-14 11:18:49,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21508 conditions, 3191 events. 1384/3191 cut-off events. For 128647/128843 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 22996 event pairs, 431 based on Foata normal form. 74/3166 useless extension candidates. Maximal degree in co-relation 17855. Up to 1151 conditions per place. [2024-06-14 11:18:49,929 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 135 selfloop transitions, 30 changer transitions 2/279 dead transitions. [2024-06-14 11:18:49,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 279 transitions, 4068 flow [2024-06-14 11:18:49,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:49,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:49,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 234 transitions. [2024-06-14 11:18:49,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6882352941176471 [2024-06-14 11:18:49,931 INFO L175 Difference]: Start difference. First operand has 215 places, 256 transitions, 3438 flow. Second operand 5 states and 234 transitions. [2024-06-14 11:18:49,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 279 transitions, 4068 flow [2024-06-14 11:18:50,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 279 transitions, 3931 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-14 11:18:50,152 INFO L231 Difference]: Finished difference. Result has 214 places, 257 transitions, 3396 flow [2024-06-14 11:18:50,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3301, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3396, PETRI_PLACES=214, PETRI_TRANSITIONS=257} [2024-06-14 11:18:50,152 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 153 predicate places. [2024-06-14 11:18:50,152 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 257 transitions, 3396 flow [2024-06-14 11:18:50,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:50,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:50,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:50,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 11:18:50,153 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:50,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:50,153 INFO L85 PathProgramCache]: Analyzing trace with hash -449486491, now seen corresponding path program 2 times [2024-06-14 11:18:50,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:50,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477456131] [2024-06-14 11:18:50,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:50,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:50,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:50,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:50,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477456131] [2024-06-14 11:18:50,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477456131] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:50,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:50,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:50,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161870859] [2024-06-14 11:18:50,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:50,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:50,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:50,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:50,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:50,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:50,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 257 transitions, 3396 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:50,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:50,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:50,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:50,659 INFO L124 PetriNetUnfolderBase]: 1408/3242 cut-off events. [2024-06-14 11:18:50,659 INFO L125 PetriNetUnfolderBase]: For 126222/126427 co-relation queries the response was YES. [2024-06-14 11:18:50,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21638 conditions, 3242 events. 1408/3242 cut-off events. For 126222/126427 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 23176 event pairs, 254 based on Foata normal form. 69/3246 useless extension candidates. Maximal degree in co-relation 20512. Up to 986 conditions per place. [2024-06-14 11:18:50,690 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 139 selfloop transitions, 28 changer transitions 2/281 dead transitions. [2024-06-14 11:18:50,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 281 transitions, 4016 flow [2024-06-14 11:18:50,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:50,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 235 transitions. [2024-06-14 11:18:50,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6911764705882353 [2024-06-14 11:18:50,692 INFO L175 Difference]: Start difference. First operand has 214 places, 257 transitions, 3396 flow. Second operand 5 states and 235 transitions. [2024-06-14 11:18:50,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 281 transitions, 4016 flow [2024-06-14 11:18:50,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 281 transitions, 3937 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-14 11:18:50,867 INFO L231 Difference]: Finished difference. Result has 216 places, 257 transitions, 3385 flow [2024-06-14 11:18:50,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3321, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3385, PETRI_PLACES=216, PETRI_TRANSITIONS=257} [2024-06-14 11:18:50,868 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 155 predicate places. [2024-06-14 11:18:50,868 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 257 transitions, 3385 flow [2024-06-14 11:18:50,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:50,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:50,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:50,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 11:18:50,868 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:50,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:50,869 INFO L85 PathProgramCache]: Analyzing trace with hash 434587141, now seen corresponding path program 1 times [2024-06-14 11:18:50,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:50,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558627292] [2024-06-14 11:18:50,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:50,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:50,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:50,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:50,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558627292] [2024-06-14 11:18:50,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558627292] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:50,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:50,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:50,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764827490] [2024-06-14 11:18:50,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:50,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:50,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:50,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:50,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:50,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:50,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 257 transitions, 3385 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:50,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:50,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:50,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:51,444 INFO L124 PetriNetUnfolderBase]: 1383/3147 cut-off events. [2024-06-14 11:18:51,444 INFO L125 PetriNetUnfolderBase]: For 126978/127195 co-relation queries the response was YES. [2024-06-14 11:18:51,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21138 conditions, 3147 events. 1383/3147 cut-off events. For 126978/127195 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 22570 event pairs, 666 based on Foata normal form. 67/3102 useless extension candidates. Maximal degree in co-relation 16525. Up to 1766 conditions per place. [2024-06-14 11:18:51,474 INFO L140 encePairwiseOnDemand]: 63/68 looper letters, 134 selfloop transitions, 25 changer transitions 0/271 dead transitions. [2024-06-14 11:18:51,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 271 transitions, 3825 flow [2024-06-14 11:18:51,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:51,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:51,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 227 transitions. [2024-06-14 11:18:51,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6676470588235294 [2024-06-14 11:18:51,475 INFO L175 Difference]: Start difference. First operand has 216 places, 257 transitions, 3385 flow. Second operand 5 states and 227 transitions. [2024-06-14 11:18:51,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 271 transitions, 3825 flow [2024-06-14 11:18:51,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 271 transitions, 3707 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 11:18:51,667 INFO L231 Difference]: Finished difference. Result has 214 places, 258 transitions, 3341 flow [2024-06-14 11:18:51,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3269, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3341, PETRI_PLACES=214, PETRI_TRANSITIONS=258} [2024-06-14 11:18:51,668 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 153 predicate places. [2024-06-14 11:18:51,668 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 258 transitions, 3341 flow [2024-06-14 11:18:51,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:51,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:51,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:51,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 11:18:51,669 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:51,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:51,669 INFO L85 PathProgramCache]: Analyzing trace with hash 869602939, now seen corresponding path program 2 times [2024-06-14 11:18:51,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:51,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609657015] [2024-06-14 11:18:51,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:51,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:51,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:51,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:51,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609657015] [2024-06-14 11:18:51,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609657015] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:51,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:51,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:51,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442799958] [2024-06-14 11:18:51,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:51,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:51,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:51,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:51,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:51,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:51,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 258 transitions, 3341 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:51,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:51,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:51,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:52,214 INFO L124 PetriNetUnfolderBase]: 1433/3273 cut-off events. [2024-06-14 11:18:52,214 INFO L125 PetriNetUnfolderBase]: For 122648/122876 co-relation queries the response was YES. [2024-06-14 11:18:52,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21301 conditions, 3273 events. 1433/3273 cut-off events. For 122648/122876 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 23321 event pairs, 476 based on Foata normal form. 74/3277 useless extension candidates. Maximal degree in co-relation 17511. Up to 1389 conditions per place. [2024-06-14 11:18:52,248 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 150 selfloop transitions, 15 changer transitions 1/278 dead transitions. [2024-06-14 11:18:52,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 278 transitions, 3950 flow [2024-06-14 11:18:52,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:52,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:52,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 228 transitions. [2024-06-14 11:18:52,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6705882352941176 [2024-06-14 11:18:52,249 INFO L175 Difference]: Start difference. First operand has 214 places, 258 transitions, 3341 flow. Second operand 5 states and 228 transitions. [2024-06-14 11:18:52,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 278 transitions, 3950 flow [2024-06-14 11:18:52,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 278 transitions, 3918 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-14 11:18:52,438 INFO L231 Difference]: Finished difference. Result has 217 places, 259 transitions, 3361 flow [2024-06-14 11:18:52,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3310, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3361, PETRI_PLACES=217, PETRI_TRANSITIONS=259} [2024-06-14 11:18:52,439 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 156 predicate places. [2024-06-14 11:18:52,439 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 259 transitions, 3361 flow [2024-06-14 11:18:52,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:52,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:52,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:52,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 11:18:52,440 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:52,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:52,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1208615487, now seen corresponding path program 3 times [2024-06-14 11:18:52,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:52,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191258236] [2024-06-14 11:18:52,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:52,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:52,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:52,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:52,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191258236] [2024-06-14 11:18:52,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191258236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:52,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:52,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:52,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883315406] [2024-06-14 11:18:52,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:52,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:52,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:52,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:52,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:52,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:52,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 259 transitions, 3361 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:52,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:52,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:52,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:53,045 INFO L124 PetriNetUnfolderBase]: 1425/3260 cut-off events. [2024-06-14 11:18:53,045 INFO L125 PetriNetUnfolderBase]: For 120998/121228 co-relation queries the response was YES. [2024-06-14 11:18:53,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21288 conditions, 3260 events. 1425/3260 cut-off events. For 120998/121228 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 23242 event pairs, 472 based on Foata normal form. 68/3256 useless extension candidates. Maximal degree in co-relation 17592. Up to 1389 conditions per place. [2024-06-14 11:18:53,074 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 141 selfloop transitions, 24 changer transitions 2/279 dead transitions. [2024-06-14 11:18:53,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 279 transitions, 3975 flow [2024-06-14 11:18:53,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:53,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:53,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 228 transitions. [2024-06-14 11:18:53,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6705882352941176 [2024-06-14 11:18:53,075 INFO L175 Difference]: Start difference. First operand has 217 places, 259 transitions, 3361 flow. Second operand 5 states and 228 transitions. [2024-06-14 11:18:53,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 279 transitions, 3975 flow [2024-06-14 11:18:53,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 279 transitions, 3928 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-14 11:18:53,279 INFO L231 Difference]: Finished difference. Result has 219 places, 259 transitions, 3366 flow [2024-06-14 11:18:53,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3314, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3366, PETRI_PLACES=219, PETRI_TRANSITIONS=259} [2024-06-14 11:18:53,280 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 158 predicate places. [2024-06-14 11:18:53,280 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 259 transitions, 3366 flow [2024-06-14 11:18:53,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:53,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:53,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:53,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 11:18:53,281 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:53,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:53,281 INFO L85 PathProgramCache]: Analyzing trace with hash 175927902, now seen corresponding path program 1 times [2024-06-14 11:18:53,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:53,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375781783] [2024-06-14 11:18:53,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:53,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:53,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:53,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:53,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375781783] [2024-06-14 11:18:53,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375781783] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:53,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:53,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:53,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649724561] [2024-06-14 11:18:53,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:53,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:53,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:53,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:53,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:53,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:53,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 259 transitions, 3366 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:53,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:53,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:53,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:53,824 INFO L124 PetriNetUnfolderBase]: 1433/3276 cut-off events. [2024-06-14 11:18:53,825 INFO L125 PetriNetUnfolderBase]: For 125726/125950 co-relation queries the response was YES. [2024-06-14 11:18:53,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21381 conditions, 3276 events. 1433/3276 cut-off events. For 125726/125950 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 23335 event pairs, 440 based on Foata normal form. 71/3278 useless extension candidates. Maximal degree in co-relation 17636. Up to 1146 conditions per place. [2024-06-14 11:18:53,858 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 135 selfloop transitions, 35 changer transitions 1/283 dead transitions. [2024-06-14 11:18:53,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 283 transitions, 4100 flow [2024-06-14 11:18:53,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:53,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:53,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 230 transitions. [2024-06-14 11:18:53,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2024-06-14 11:18:53,859 INFO L175 Difference]: Start difference. First operand has 219 places, 259 transitions, 3366 flow. Second operand 5 states and 230 transitions. [2024-06-14 11:18:53,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 283 transitions, 4100 flow [2024-06-14 11:18:54,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 283 transitions, 4049 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-14 11:18:54,082 INFO L231 Difference]: Finished difference. Result has 221 places, 265 transitions, 3538 flow [2024-06-14 11:18:54,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3317, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3538, PETRI_PLACES=221, PETRI_TRANSITIONS=265} [2024-06-14 11:18:54,083 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 160 predicate places. [2024-06-14 11:18:54,083 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 265 transitions, 3538 flow [2024-06-14 11:18:54,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:54,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:54,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:54,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 11:18:54,084 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:54,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:54,084 INFO L85 PathProgramCache]: Analyzing trace with hash 175926910, now seen corresponding path program 1 times [2024-06-14 11:18:54,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:54,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149753246] [2024-06-14 11:18:54,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:54,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:54,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:54,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:54,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149753246] [2024-06-14 11:18:54,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149753246] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:54,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:54,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:54,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954754908] [2024-06-14 11:18:54,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:54,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:18:54,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:54,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:18:54,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:18:54,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 68 [2024-06-14 11:18:54,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 265 transitions, 3538 flow. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:54,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:54,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 68 [2024-06-14 11:18:54,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:54,535 INFO L124 PetriNetUnfolderBase]: 1317/2929 cut-off events. [2024-06-14 11:18:54,535 INFO L125 PetriNetUnfolderBase]: For 56965/57209 co-relation queries the response was YES. [2024-06-14 11:18:54,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16599 conditions, 2929 events. 1317/2929 cut-off events. For 56965/57209 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 20182 event pairs, 647 based on Foata normal form. 82/2896 useless extension candidates. Maximal degree in co-relation 14276. Up to 1675 conditions per place. [2024-06-14 11:18:54,565 INFO L140 encePairwiseOnDemand]: 55/68 looper letters, 109 selfloop transitions, 35 changer transitions 1/259 dead transitions. [2024-06-14 11:18:54,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 259 transitions, 3663 flow [2024-06-14 11:18:54,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:54,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:54,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 226 transitions. [2024-06-14 11:18:54,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6647058823529411 [2024-06-14 11:18:54,566 INFO L175 Difference]: Start difference. First operand has 221 places, 265 transitions, 3538 flow. Second operand 5 states and 226 transitions. [2024-06-14 11:18:54,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 259 transitions, 3663 flow [2024-06-14 11:18:54,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 259 transitions, 3485 flow, removed 35 selfloop flow, removed 6 redundant places. [2024-06-14 11:18:54,735 INFO L231 Difference]: Finished difference. Result has 218 places, 238 transitions, 3093 flow [2024-06-14 11:18:54,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2967, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3093, PETRI_PLACES=218, PETRI_TRANSITIONS=238} [2024-06-14 11:18:54,735 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 157 predicate places. [2024-06-14 11:18:54,735 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 238 transitions, 3093 flow [2024-06-14 11:18:54,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:54,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:54,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:54,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 11:18:54,736 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:54,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:54,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1958798206, now seen corresponding path program 1 times [2024-06-14 11:18:54,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:54,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790246946] [2024-06-14 11:18:54,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:54,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:54,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:54,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:54,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790246946] [2024-06-14 11:18:54,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790246946] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:54,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:54,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:54,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265407927] [2024-06-14 11:18:54,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:54,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:54,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:54,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:54,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:54,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:54,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 238 transitions, 3093 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:54,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:54,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:54,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:55,177 INFO L124 PetriNetUnfolderBase]: 1171/2776 cut-off events. [2024-06-14 11:18:55,177 INFO L125 PetriNetUnfolderBase]: For 91749/91921 co-relation queries the response was YES. [2024-06-14 11:18:55,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16950 conditions, 2776 events. 1171/2776 cut-off events. For 91749/91921 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 19686 event pairs, 351 based on Foata normal form. 47/2771 useless extension candidates. Maximal degree in co-relation 13453. Up to 919 conditions per place. [2024-06-14 11:18:55,203 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 125 selfloop transitions, 36 changer transitions 1/259 dead transitions. [2024-06-14 11:18:55,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 259 transitions, 3716 flow [2024-06-14 11:18:55,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 233 transitions. [2024-06-14 11:18:55,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6852941176470588 [2024-06-14 11:18:55,204 INFO L175 Difference]: Start difference. First operand has 218 places, 238 transitions, 3093 flow. Second operand 5 states and 233 transitions. [2024-06-14 11:18:55,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 259 transitions, 3716 flow [2024-06-14 11:18:55,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 259 transitions, 3657 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-06-14 11:18:55,411 INFO L231 Difference]: Finished difference. Result has 221 places, 242 transitions, 3203 flow [2024-06-14 11:18:55,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3034, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3203, PETRI_PLACES=221, PETRI_TRANSITIONS=242} [2024-06-14 11:18:55,412 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 160 predicate places. [2024-06-14 11:18:55,412 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 242 transitions, 3203 flow [2024-06-14 11:18:55,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:55,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:55,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:55,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 11:18:55,413 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:55,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:55,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2146703006, now seen corresponding path program 2 times [2024-06-14 11:18:55,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:55,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144572777] [2024-06-14 11:18:55,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:55,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:55,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:55,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144572777] [2024-06-14 11:18:55,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144572777] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:55,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:55,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:55,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204029645] [2024-06-14 11:18:55,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:55,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:55,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:55,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:55,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:55,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:55,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 242 transitions, 3203 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:55,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:55,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:55,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:55,849 INFO L124 PetriNetUnfolderBase]: 1164/2768 cut-off events. [2024-06-14 11:18:55,850 INFO L125 PetriNetUnfolderBase]: For 93347/93525 co-relation queries the response was YES. [2024-06-14 11:18:55,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16484 conditions, 2768 events. 1164/2768 cut-off events. For 93347/93525 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 19580 event pairs, 342 based on Foata normal form. 57/2769 useless extension candidates. Maximal degree in co-relation 12957. Up to 921 conditions per place. [2024-06-14 11:18:55,876 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 132 selfloop transitions, 32 changer transitions 1/262 dead transitions. [2024-06-14 11:18:55,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 262 transitions, 3829 flow [2024-06-14 11:18:55,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:55,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:55,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 235 transitions. [2024-06-14 11:18:55,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6911764705882353 [2024-06-14 11:18:55,877 INFO L175 Difference]: Start difference. First operand has 221 places, 242 transitions, 3203 flow. Second operand 5 states and 235 transitions. [2024-06-14 11:18:55,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 262 transitions, 3829 flow [2024-06-14 11:18:56,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 262 transitions, 3754 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-06-14 11:18:56,087 INFO L231 Difference]: Finished difference. Result has 225 places, 245 transitions, 3302 flow [2024-06-14 11:18:56,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3131, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3302, PETRI_PLACES=225, PETRI_TRANSITIONS=245} [2024-06-14 11:18:56,088 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 164 predicate places. [2024-06-14 11:18:56,088 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 245 transitions, 3302 flow [2024-06-14 11:18:56,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:56,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:56,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:56,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 11:18:56,088 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:56,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:56,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1627707100, now seen corresponding path program 1 times [2024-06-14 11:18:56,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:56,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175891754] [2024-06-14 11:18:56,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:56,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:56,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:56,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:56,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175891754] [2024-06-14 11:18:56,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175891754] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:56,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:56,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:56,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139214909] [2024-06-14 11:18:56,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:56,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:56,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:56,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:56,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:56,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:56,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 245 transitions, 3302 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:56,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:56,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:56,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:56,561 INFO L124 PetriNetUnfolderBase]: 1174/2817 cut-off events. [2024-06-14 11:18:56,562 INFO L125 PetriNetUnfolderBase]: For 84818/84982 co-relation queries the response was YES. [2024-06-14 11:18:56,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16652 conditions, 2817 events. 1174/2817 cut-off events. For 84818/84982 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 20085 event pairs, 343 based on Foata normal form. 47/2813 useless extension candidates. Maximal degree in co-relation 13062. Up to 920 conditions per place. [2024-06-14 11:18:56,588 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 120 selfloop transitions, 36 changer transitions 10/261 dead transitions. [2024-06-14 11:18:56,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 261 transitions, 3843 flow [2024-06-14 11:18:56,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:56,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:56,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 231 transitions. [2024-06-14 11:18:56,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6794117647058824 [2024-06-14 11:18:56,589 INFO L175 Difference]: Start difference. First operand has 225 places, 245 transitions, 3302 flow. Second operand 5 states and 231 transitions. [2024-06-14 11:18:56,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 261 transitions, 3843 flow [2024-06-14 11:18:56,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 261 transitions, 3726 flow, removed 29 selfloop flow, removed 3 redundant places. [2024-06-14 11:18:56,794 INFO L231 Difference]: Finished difference. Result has 227 places, 236 transitions, 3129 flow [2024-06-14 11:18:56,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3185, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3129, PETRI_PLACES=227, PETRI_TRANSITIONS=236} [2024-06-14 11:18:56,795 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 166 predicate places. [2024-06-14 11:18:56,795 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 236 transitions, 3129 flow [2024-06-14 11:18:56,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:56,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:56,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:56,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 11:18:56,795 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:56,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:56,795 INFO L85 PathProgramCache]: Analyzing trace with hash 800377240, now seen corresponding path program 2 times [2024-06-14 11:18:56,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:56,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828770986] [2024-06-14 11:18:56,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:56,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:56,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:56,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828770986] [2024-06-14 11:18:56,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828770986] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:56,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:56,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:56,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811128761] [2024-06-14 11:18:56,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:56,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:56,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:56,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:56,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:56,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:56,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 236 transitions, 3129 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:56,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:56,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:56,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:57,234 INFO L124 PetriNetUnfolderBase]: 1134/2746 cut-off events. [2024-06-14 11:18:57,234 INFO L125 PetriNetUnfolderBase]: For 78773/78935 co-relation queries the response was YES. [2024-06-14 11:18:57,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15999 conditions, 2746 events. 1134/2746 cut-off events. For 78773/78935 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 19518 event pairs, 357 based on Foata normal form. 39/2732 useless extension candidates. Maximal degree in co-relation 12374. Up to 919 conditions per place. [2024-06-14 11:18:57,259 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 108 selfloop transitions, 24 changer transitions 37/249 dead transitions. [2024-06-14 11:18:57,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 249 transitions, 3641 flow [2024-06-14 11:18:57,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:57,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:57,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 228 transitions. [2024-06-14 11:18:57,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6705882352941176 [2024-06-14 11:18:57,260 INFO L175 Difference]: Start difference. First operand has 227 places, 236 transitions, 3129 flow. Second operand 5 states and 228 transitions. [2024-06-14 11:18:57,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 249 transitions, 3641 flow [2024-06-14 11:18:57,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 249 transitions, 3487 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-14 11:18:57,446 INFO L231 Difference]: Finished difference. Result has 226 places, 200 transitions, 2557 flow [2024-06-14 11:18:57,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2975, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2557, PETRI_PLACES=226, PETRI_TRANSITIONS=200} [2024-06-14 11:18:57,447 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 165 predicate places. [2024-06-14 11:18:57,447 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 200 transitions, 2557 flow [2024-06-14 11:18:57,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:57,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:57,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:57,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 11:18:57,447 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:57,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:57,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1435066758, now seen corresponding path program 2 times [2024-06-14 11:18:57,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:57,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951255840] [2024-06-14 11:18:57,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:57,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:57,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:57,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:57,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951255840] [2024-06-14 11:18:57,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951255840] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:57,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:57,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:57,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599602818] [2024-06-14 11:18:57,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:57,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:18:57,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:57,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:18:57,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:18:57,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 68 [2024-06-14 11:18:57,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 200 transitions, 2557 flow. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:57,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:57,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 68 [2024-06-14 11:18:57,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:57,746 INFO L124 PetriNetUnfolderBase]: 777/1860 cut-off events. [2024-06-14 11:18:57,746 INFO L125 PetriNetUnfolderBase]: For 28187/28314 co-relation queries the response was YES. [2024-06-14 11:18:57,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9527 conditions, 1860 events. 777/1860 cut-off events. For 28187/28314 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 12378 event pairs, 461 based on Foata normal form. 57/1868 useless extension candidates. Maximal degree in co-relation 8542. Up to 1123 conditions per place. [2024-06-14 11:18:57,763 INFO L140 encePairwiseOnDemand]: 58/68 looper letters, 65 selfloop transitions, 0 changer transitions 49/170 dead transitions. [2024-06-14 11:18:57,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 170 transitions, 2289 flow [2024-06-14 11:18:57,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:57,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:57,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 213 transitions. [2024-06-14 11:18:57,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6264705882352941 [2024-06-14 11:18:57,764 INFO L175 Difference]: Start difference. First operand has 226 places, 200 transitions, 2557 flow. Second operand 5 states and 213 transitions. [2024-06-14 11:18:57,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 170 transitions, 2289 flow [2024-06-14 11:18:57,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 170 transitions, 1959 flow, removed 37 selfloop flow, removed 24 redundant places. [2024-06-14 11:18:57,846 INFO L231 Difference]: Finished difference. Result has 203 places, 121 transitions, 1278 flow [2024-06-14 11:18:57,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=1671, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1278, PETRI_PLACES=203, PETRI_TRANSITIONS=121} [2024-06-14 11:18:57,846 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 142 predicate places. [2024-06-14 11:18:57,847 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 121 transitions, 1278 flow [2024-06-14 11:18:57,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:57,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:57,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:57,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 11:18:57,847 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:57,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:57,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1596110998, now seen corresponding path program 2 times [2024-06-14 11:18:57,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:57,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786463080] [2024-06-14 11:18:57,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:57,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:57,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:57,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:57,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786463080] [2024-06-14 11:18:57,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786463080] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:57,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:57,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:18:57,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787421708] [2024-06-14 11:18:57,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:57,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:57,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:57,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:57,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:57,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:57,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 121 transitions, 1278 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:57,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:57,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:57,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:58,074 INFO L124 PetriNetUnfolderBase]: 443/1190 cut-off events. [2024-06-14 11:18:58,074 INFO L125 PetriNetUnfolderBase]: For 24832/24946 co-relation queries the response was YES. [2024-06-14 11:18:58,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5724 conditions, 1190 events. 443/1190 cut-off events. For 24832/24946 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 7306 event pairs, 188 based on Foata normal form. 34/1206 useless extension candidates. Maximal degree in co-relation 5656. Up to 444 conditions per place. [2024-06-14 11:18:58,082 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 61 selfloop transitions, 9 changer transitions 34/132 dead transitions. [2024-06-14 11:18:58,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 132 transitions, 1626 flow [2024-06-14 11:18:58,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:58,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:58,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 221 transitions. [2024-06-14 11:18:58,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65 [2024-06-14 11:18:58,083 INFO L175 Difference]: Start difference. First operand has 203 places, 121 transitions, 1278 flow. Second operand 5 states and 221 transitions. [2024-06-14 11:18:58,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 132 transitions, 1626 flow [2024-06-14 11:18:58,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 132 transitions, 1483 flow, removed 42 selfloop flow, removed 17 redundant places. [2024-06-14 11:18:58,136 INFO L231 Difference]: Finished difference. Result has 176 places, 90 transitions, 923 flow [2024-06-14 11:18:58,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=1171, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=923, PETRI_PLACES=176, PETRI_TRANSITIONS=90} [2024-06-14 11:18:58,137 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 115 predicate places. [2024-06-14 11:18:58,137 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 90 transitions, 923 flow [2024-06-14 11:18:58,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:58,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:58,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:58,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 11:18:58,137 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:58,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:58,138 INFO L85 PathProgramCache]: Analyzing trace with hash -8001809, now seen corresponding path program 1 times [2024-06-14 11:18:58,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:58,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513039614] [2024-06-14 11:18:58,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:58,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:58,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:58,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:58,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513039614] [2024-06-14 11:18:58,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513039614] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:58,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:58,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:58,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754049718] [2024-06-14 11:18:58,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:58,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:58,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:58,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:58,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:58,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:58,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 90 transitions, 923 flow. Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:58,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:58,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:58,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:58,345 INFO L124 PetriNetUnfolderBase]: 344/927 cut-off events. [2024-06-14 11:18:58,345 INFO L125 PetriNetUnfolderBase]: For 14147/14237 co-relation queries the response was YES. [2024-06-14 11:18:58,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4125 conditions, 927 events. 344/927 cut-off events. For 14147/14237 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5292 event pairs, 91 based on Foata normal form. 34/952 useless extension candidates. Maximal degree in co-relation 4069. Up to 294 conditions per place. [2024-06-14 11:18:58,351 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 53 selfloop transitions, 22 changer transitions 2/105 dead transitions. [2024-06-14 11:18:58,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 105 transitions, 1231 flow [2024-06-14 11:18:58,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:58,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:58,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 225 transitions. [2024-06-14 11:18:58,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6617647058823529 [2024-06-14 11:18:58,352 INFO L175 Difference]: Start difference. First operand has 176 places, 90 transitions, 923 flow. Second operand 5 states and 225 transitions. [2024-06-14 11:18:58,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 105 transitions, 1231 flow [2024-06-14 11:18:58,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 105 transitions, 1072 flow, removed 38 selfloop flow, removed 19 redundant places. [2024-06-14 11:18:58,376 INFO L231 Difference]: Finished difference. Result has 145 places, 90 transitions, 845 flow [2024-06-14 11:18:58,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=845, PETRI_PLACES=145, PETRI_TRANSITIONS=90} [2024-06-14 11:18:58,377 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 84 predicate places. [2024-06-14 11:18:58,377 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 90 transitions, 845 flow [2024-06-14 11:18:58,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:58,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:58,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:58,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 11:18:58,378 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:58,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:58,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1279747813, now seen corresponding path program 1 times [2024-06-14 11:18:58,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:58,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69551478] [2024-06-14 11:18:58,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:58,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:58,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:58,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:58,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69551478] [2024-06-14 11:18:58,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69551478] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:58,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:58,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:58,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186145889] [2024-06-14 11:18:58,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:58,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:58,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:58,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:58,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:58,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:58,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 90 transitions, 845 flow. Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:58,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:58,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:58,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:58,568 INFO L124 PetriNetUnfolderBase]: 340/910 cut-off events. [2024-06-14 11:18:58,568 INFO L125 PetriNetUnfolderBase]: For 8854/8908 co-relation queries the response was YES. [2024-06-14 11:18:58,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3536 conditions, 910 events. 340/910 cut-off events. For 8854/8908 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5125 event pairs, 146 based on Foata normal form. 34/941 useless extension candidates. Maximal degree in co-relation 3491. Up to 377 conditions per place. [2024-06-14 11:18:58,573 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 52 selfloop transitions, 19 changer transitions 2/101 dead transitions. [2024-06-14 11:18:58,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 101 transitions, 1065 flow [2024-06-14 11:18:58,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:58,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:58,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 218 transitions. [2024-06-14 11:18:58,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6411764705882353 [2024-06-14 11:18:58,580 INFO L175 Difference]: Start difference. First operand has 145 places, 90 transitions, 845 flow. Second operand 5 states and 218 transitions. [2024-06-14 11:18:58,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 101 transitions, 1065 flow [2024-06-14 11:18:58,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 101 transitions, 1010 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-14 11:18:58,599 INFO L231 Difference]: Finished difference. Result has 144 places, 90 transitions, 837 flow [2024-06-14 11:18:58,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=837, PETRI_PLACES=144, PETRI_TRANSITIONS=90} [2024-06-14 11:18:58,600 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 83 predicate places. [2024-06-14 11:18:58,600 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 90 transitions, 837 flow [2024-06-14 11:18:58,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:58,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:58,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:58,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 11:18:58,600 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:58,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:58,600 INFO L85 PathProgramCache]: Analyzing trace with hash 541357216, now seen corresponding path program 1 times [2024-06-14 11:18:58,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:58,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788124411] [2024-06-14 11:18:58,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:58,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:58,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-06-14 11:18:58,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:58,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788124411] [2024-06-14 11:18:58,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788124411] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:58,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:58,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:58,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901264115] [2024-06-14 11:18:58,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:58,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:58,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:58,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:58,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:58,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:58,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 90 transitions, 837 flow. Second operand has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:58,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:58,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:58,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:58,774 INFO L124 PetriNetUnfolderBase]: 328/883 cut-off events. [2024-06-14 11:18:58,774 INFO L125 PetriNetUnfolderBase]: For 7775/7823 co-relation queries the response was YES. [2024-06-14 11:18:58,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3320 conditions, 883 events. 328/883 cut-off events. For 7775/7823 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4947 event pairs, 83 based on Foata normal form. 32/910 useless extension candidates. Maximal degree in co-relation 3276. Up to 260 conditions per place. [2024-06-14 11:18:58,778 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 38 selfloop transitions, 10 changer transitions 34/104 dead transitions. [2024-06-14 11:18:58,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 104 transitions, 1071 flow [2024-06-14 11:18:58,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:58,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:58,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2024-06-14 11:18:58,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6588235294117647 [2024-06-14 11:18:58,781 INFO L175 Difference]: Start difference. First operand has 144 places, 90 transitions, 837 flow. Second operand 5 states and 224 transitions. [2024-06-14 11:18:58,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 104 transitions, 1071 flow [2024-06-14 11:18:58,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 104 transitions, 1030 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-14 11:18:58,794 INFO L231 Difference]: Finished difference. Result has 146 places, 64 transitions, 571 flow [2024-06-14 11:18:58,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=571, PETRI_PLACES=146, PETRI_TRANSITIONS=64} [2024-06-14 11:18:58,795 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 85 predicate places. [2024-06-14 11:18:58,795 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 64 transitions, 571 flow [2024-06-14 11:18:58,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:58,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:58,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:58,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 11:18:58,795 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:58,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:58,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1460216054, now seen corresponding path program 1 times [2024-06-14 11:18:58,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:58,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699374419] [2024-06-14 11:18:58,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:58,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:58,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:58,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699374419] [2024-06-14 11:18:58,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699374419] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:58,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:58,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:58,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818360735] [2024-06-14 11:18:58,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:58,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:58,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:58,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:58,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:58,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:58,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 64 transitions, 571 flow. Second operand has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:58,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:58,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:58,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:58,943 INFO L124 PetriNetUnfolderBase]: 159/427 cut-off events. [2024-06-14 11:18:58,944 INFO L125 PetriNetUnfolderBase]: For 5212/5242 co-relation queries the response was YES. [2024-06-14 11:18:58,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1749 conditions, 427 events. 159/427 cut-off events. For 5212/5242 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1806 event pairs, 46 based on Foata normal form. 20/440 useless extension candidates. Maximal degree in co-relation 1705. Up to 131 conditions per place. [2024-06-14 11:18:58,945 INFO L140 encePairwiseOnDemand]: 63/68 looper letters, 34 selfloop transitions, 13 changer transitions 0/69 dead transitions. [2024-06-14 11:18:58,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 69 transitions, 675 flow [2024-06-14 11:18:58,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:58,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:58,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 208 transitions. [2024-06-14 11:18:58,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.611764705882353 [2024-06-14 11:18:58,946 INFO L175 Difference]: Start difference. First operand has 146 places, 64 transitions, 571 flow. Second operand 5 states and 208 transitions. [2024-06-14 11:18:58,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 69 transitions, 675 flow [2024-06-14 11:18:58,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 69 transitions, 508 flow, removed 17 selfloop flow, removed 40 redundant places. [2024-06-14 11:18:58,953 INFO L231 Difference]: Finished difference. Result has 98 places, 64 transitions, 434 flow [2024-06-14 11:18:58,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=434, PETRI_PLACES=98, PETRI_TRANSITIONS=64} [2024-06-14 11:18:58,953 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 37 predicate places. [2024-06-14 11:18:58,953 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 64 transitions, 434 flow [2024-06-14 11:18:58,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:58,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:18:58,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:58,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 11:18:58,954 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:18:58,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:18:58,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1712821912, now seen corresponding path program 1 times [2024-06-14 11:18:58,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:18:58,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750955392] [2024-06-14 11:18:58,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:18:58,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:18:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:18:58,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:18:58,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:18:58,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750955392] [2024-06-14 11:18:58,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750955392] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:18:58,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:18:58,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:18:58,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28260696] [2024-06-14 11:18:58,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:18:58,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:18:58,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:18:58,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:18:58,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:18:59,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 11:18:59,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 64 transitions, 434 flow. Second operand has 5 states, 5 states have (on average 39.2) internal successors, (196), 5 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:59,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:18:59,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 11:18:59,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:18:59,116 INFO L124 PetriNetUnfolderBase]: 143/402 cut-off events. [2024-06-14 11:18:59,116 INFO L125 PetriNetUnfolderBase]: For 2174/2200 co-relation queries the response was YES. [2024-06-14 11:18:59,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 402 events. 143/402 cut-off events. For 2174/2200 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1757 event pairs, 62 based on Foata normal form. 24/420 useless extension candidates. Maximal degree in co-relation 1195. Up to 156 conditions per place. [2024-06-14 11:18:59,118 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 0 selfloop transitions, 0 changer transitions 68/68 dead transitions. [2024-06-14 11:18:59,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 68 transitions, 500 flow [2024-06-14 11:18:59,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:18:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:18:59,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 206 transitions. [2024-06-14 11:18:59,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6058823529411764 [2024-06-14 11:18:59,119 INFO L175 Difference]: Start difference. First operand has 98 places, 64 transitions, 434 flow. Second operand 5 states and 206 transitions. [2024-06-14 11:18:59,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 68 transitions, 500 flow [2024-06-14 11:18:59,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 68 transitions, 422 flow, removed 0 selfloop flow, removed 21 redundant places. [2024-06-14 11:18:59,121 INFO L231 Difference]: Finished difference. Result has 80 places, 0 transitions, 0 flow [2024-06-14 11:18:59,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=80, PETRI_TRANSITIONS=0} [2024-06-14 11:18:59,121 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 19 predicate places. [2024-06-14 11:18:59,122 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 0 transitions, 0 flow [2024-06-14 11:18:59,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.2) internal successors, (196), 5 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:18:59,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-14 11:18:59,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-14 11:18:59,128 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-14 11:18:59,129 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-14 11:18:59,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 11:18:59,129 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:18:59,134 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-14 11:18:59,134 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-14 11:18:59,137 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-14 11:18:59,137 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-14 11:18:59,138 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.06 11:18:59 BasicIcfg [2024-06-14 11:18:59,138 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-14 11:18:59,139 INFO L158 Benchmark]: Toolchain (without parser) took 39984.53ms. Allocated memory was 140.5MB in the beginning and 5.4GB in the end (delta: 5.3GB). Free memory was 78.2MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2024-06-14 11:18:59,139 INFO L158 Benchmark]: CDTParser took 1.76ms. Allocated memory is still 140.5MB. Free memory is still 73.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-14 11:18:59,139 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 140.5MB. Free memory was 81.5MB in the beginning and 81.1MB in the end (delta: 406.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-14 11:18:59,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 477.92ms. Allocated memory was 140.5MB in the beginning and 184.5MB in the end (delta: 44.0MB). Free memory was 78.2MB in the beginning and 144.8MB in the end (delta: -66.6MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-06-14 11:18:59,140 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.74ms. Allocated memory is still 184.5MB. Free memory was 144.8MB in the beginning and 142.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-14 11:18:59,140 INFO L158 Benchmark]: Boogie Preprocessor took 33.28ms. Allocated memory is still 184.5MB. Free memory was 142.7MB in the beginning and 140.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-14 11:18:59,140 INFO L158 Benchmark]: RCFGBuilder took 343.20ms. Allocated memory is still 184.5MB. Free memory was 140.6MB in the beginning and 117.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-06-14 11:18:59,140 INFO L158 Benchmark]: TraceAbstraction took 39068.89ms. Allocated memory was 184.5MB in the beginning and 5.4GB in the end (delta: 5.2GB). Free memory was 116.7MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2024-06-14 11:18:59,145 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.76ms. Allocated memory is still 140.5MB. Free memory is still 73.9MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.14ms. Allocated memory is still 140.5MB. Free memory was 81.5MB in the beginning and 81.1MB in the end (delta: 406.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 477.92ms. Allocated memory was 140.5MB in the beginning and 184.5MB in the end (delta: 44.0MB). Free memory was 78.2MB in the beginning and 144.8MB in the end (delta: -66.6MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.74ms. Allocated memory is still 184.5MB. Free memory was 144.8MB in the beginning and 142.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.28ms. Allocated memory is still 184.5MB. Free memory was 142.7MB in the beginning and 140.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 343.20ms. Allocated memory is still 184.5MB. Free memory was 140.6MB in the beginning and 117.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 39068.89ms. Allocated memory was 184.5MB in the beginning and 5.4GB in the end (delta: 5.2GB). Free memory was 116.7MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 819]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 820]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 105 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 39.0s, OverallIterations: 58, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 35.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6821 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4314 mSDsluCounter, 2629 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1766 mSDsCounter, 309 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8989 IncrementalHoareTripleChecker+Invalid, 9298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 309 mSolverCounterUnsat, 863 mSDtfsCounter, 8989 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3538occurred in iteration=46, InterpolantAutomatonStates: 282, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1179 NumberOfCodeBlocks, 1179 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 1121 ConstructedInterpolants, 0 QuantifiedInterpolants, 3790 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 58 InterpolantComputations, 58 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-14 11:18:59,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE