./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/mutex-meet/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/mutex-meet/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 13:51:13,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 13:51:13,093 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 13:51:13,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 13:51:13,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 13:51:13,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 13:51:13,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 13:51:13,123 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 13:51:13,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 13:51:13,126 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 13:51:13,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 13:51:13,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 13:51:13,127 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 13:51:13,128 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 13:51:13,128 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 13:51:13,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 13:51:13,129 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 13:51:13,129 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 13:51:13,129 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 13:51:13,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 13:51:13,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 13:51:13,130 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 13:51:13,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 13:51:13,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 13:51:13,131 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 13:51:13,131 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 13:51:13,131 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 13:51:13,131 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 13:51:13,132 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 13:51:13,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 13:51:13,133 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 13:51:13,133 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 13:51:13,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 13:51:13,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 13:51:13,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 13:51:13,134 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 13:51:13,134 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 13:51:13,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 13:51:13,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 13:51:13,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 13:51:13,135 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 13:51:13,135 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 13:51:13,135 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 13:51:13,136 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 13:51:13,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 13:51:13,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 13:51:13,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 13:51:13,333 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 13:51:13,334 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 13:51:13,335 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 13:51:14,461 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 13:51:14,641 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 13:51:14,641 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i [2024-06-14 13:51:14,657 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fdcbb873/3aa755cba21845a69eefda612013c47f/FLAG1e65606a6 [2024-06-14 13:51:14,680 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fdcbb873/3aa755cba21845a69eefda612013c47f [2024-06-14 13:51:14,682 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 13:51:14,682 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 13:51:14,683 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/szymanski.yml/witness.yml [2024-06-14 13:51:14,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 13:51:14,742 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 13:51:14,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 13:51:14,743 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 13:51:14,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 13:51:14,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 01:51:14" (1/2) ... [2024-06-14 13:51:14,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a4ac6c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:51:14, skipping insertion in model container [2024-06-14 13:51:14,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 01:51:14" (1/2) ... [2024-06-14 13:51:14,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@ef4fa54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:51:14, skipping insertion in model container [2024-06-14 13:51:14,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 01:51:14" (2/2) ... [2024-06-14 13:51:14,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a4ac6c6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 01:51:14, skipping insertion in model container [2024-06-14 13:51:14,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 01:51:14" (2/2) ... [2024-06-14 13:51:14,761 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 13:51:14,781 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 13:51:14,782 INFO L97 edCorrectnessWitness]: Location invariant before [L820-L820] ((((! multithreaded || ((4LL - (long long )flag1) + (long long )flag2 >= 0LL && (long long )flag1 + (long long )flag2 >= 0LL)) && (! multithreaded || (((((((0 <= flag1 && 0 <= flag2) && flag1 <= 4) && flag1 <= 127) && flag2 <= 4) && flag2 <= 127) && ((((flag1 == 0 || flag1 == 1) || flag1 == 2) || flag1 == 3) || flag1 == 4)) && ((((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)))) && (! 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))) [2024-06-14 13:51:14,782 INFO L97 edCorrectnessWitness]: Location invariant before [L819-L819] ((((! multithreaded || ((4LL - (long long )flag1) + (long long )flag2 >= 0LL && (long long )flag1 + (long long )flag2 >= 0LL)) && (! multithreaded || (((((((0 <= flag1 && 0 <= flag2) && flag1 <= 4) && flag1 <= 127) && flag2 <= 4) && flag2 <= 127) && ((((flag1 == 0 || flag1 == 1) || flag1 == 2) || flag1 == 3) || flag1 == 4)) && ((((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)))) && (! 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))) [2024-06-14 13:51:14,782 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 13:51:14,783 INFO L106 edCorrectnessWitness]: ghost_update [L818-L818] multithreaded = 1; [2024-06-14 13:51:14,804 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 13:51:15,071 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 13:51:15,082 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 13:51:15,224 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 13:51:15,257 INFO L206 MainTranslator]: Completed translation [2024-06-14 13:51:15,258 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 01:51:15 WrapperNode [2024-06-14 13:51:15,258 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 13:51:15,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 13:51:15,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 13:51:15,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 13:51:15,264 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 01:51:15" (1/1) ... [2024-06-14 13:51:15,288 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 01:51:15" (1/1) ... [2024-06-14 13:51:15,319 INFO L138 Inliner]: procedures = 169, calls = 66, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 170 [2024-06-14 13:51:15,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 13:51:15,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 13:51:15,322 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 13:51:15,322 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 13:51:15,330 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 01:51:15" (1/1) ... [2024-06-14 13:51:15,331 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 01:51:15" (1/1) ... [2024-06-14 13:51:15,340 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 01:51:15" (1/1) ... [2024-06-14 13:51:15,360 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 13:51:15,361 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 01:51:15" (1/1) ... [2024-06-14 13:51:15,361 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 01:51:15" (1/1) ... [2024-06-14 13:51:15,372 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 01:51:15" (1/1) ... [2024-06-14 13:51:15,376 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 01:51:15" (1/1) ... [2024-06-14 13:51:15,378 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 01:51:15" (1/1) ... [2024-06-14 13:51:15,379 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 01:51:15" (1/1) ... [2024-06-14 13:51:15,384 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 13:51:15,386 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 13:51:15,386 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 13:51:15,386 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 13:51:15,387 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 01:51:15" (1/1) ... [2024-06-14 13:51:15,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 13:51:15,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 13:51:15,408 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 13:51:15,414 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 13:51:15,436 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-06-14 13:51:15,436 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-06-14 13:51:15,436 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-06-14 13:51:15,437 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-06-14 13:51:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 13:51:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 13:51:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 13:51:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 13:51:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 13:51:15,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 13:51:15,438 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 13:51:15,554 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 13:51:15,556 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 13:51:15,738 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 13:51:15,738 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 13:51:15,786 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 13:51:15,787 INFO L320 CfgBuilder]: Removed 8 assume(true) statements. [2024-06-14 13:51:15,787 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 01:51:15 BoogieIcfgContainer [2024-06-14 13:51:15,787 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 13:51:15,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 13:51:15,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 13:51:15,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 13:51:15,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 01:51:14" (1/4) ... [2024-06-14 13:51:15,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a28a40a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 01:51:15, skipping insertion in model container [2024-06-14 13:51:15,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 01:51:14" (2/4) ... [2024-06-14 13:51:15,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a28a40a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 01:51:15, skipping insertion in model container [2024-06-14 13:51:15,792 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 01:51:15" (3/4) ... [2024-06-14 13:51:15,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a28a40a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 01:51:15, skipping insertion in model container [2024-06-14 13:51:15,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 01:51:15" (4/4) ... [2024-06-14 13:51:15,794 INFO L112 eAbstractionObserver]: Analyzing ICFG szymanski.i [2024-06-14 13:51:15,810 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 13:51:15,810 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 13:51:15,810 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 13:51:15,847 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-14 13:51:15,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 68 transitions, 150 flow [2024-06-14 13:51:15,906 INFO L124 PetriNetUnfolderBase]: 10/66 cut-off events. [2024-06-14 13:51:15,907 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-14 13:51:15,910 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 13:51:15,910 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 68 transitions, 150 flow [2024-06-14 13:51:15,915 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 64 transitions, 137 flow [2024-06-14 13:51:15,925 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 13:51:15,929 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;@532bae70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 13:51:15,930 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 13:51:15,932 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 13:51:15,934 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 13:51:15,934 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 13:51:15,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:15,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 13:51:15,935 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 13:51:15,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:15,939 INFO L85 PathProgramCache]: Analyzing trace with hash 833335324, now seen corresponding path program 1 times [2024-06-14 13:51:15,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:15,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284681209] [2024-06-14 13:51:15,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:15,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:16,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:16,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:16,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284681209] [2024-06-14 13:51:16,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284681209] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:16,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:16,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 13:51:16,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632675545] [2024-06-14 13:51:16,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:16,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 13:51:16,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:16,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 13:51:16,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 13:51:16,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 68 [2024-06-14 13:51:16,507 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 13:51:16,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:16,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 68 [2024-06-14 13:51:16,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:16,732 INFO L124 PetriNetUnfolderBase]: 616/1313 cut-off events. [2024-06-14 13:51:16,743 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-06-14 13:51:16,750 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 13:51:16,762 INFO L140 encePairwiseOnDemand]: 63/68 looper letters, 32 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2024-06-14 13:51:16,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 70 transitions, 222 flow [2024-06-14 13:51:16,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 13:51:16,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 13:51:16,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2024-06-14 13:51:16,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7254901960784313 [2024-06-14 13:51:16,775 INFO L175 Difference]: Start difference. First operand has 61 places, 64 transitions, 137 flow. Second operand 3 states and 148 transitions. [2024-06-14 13:51:16,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 70 transitions, 222 flow [2024-06-14 13:51:16,779 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 13:51:16,781 INFO L231 Difference]: Finished difference. Result has 61 places, 66 transitions, 153 flow [2024-06-14 13:51:16,783 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 13:51:16,786 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 0 predicate places. [2024-06-14 13:51:16,786 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 66 transitions, 153 flow [2024-06-14 13:51:16,786 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 13:51:16,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:16,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:51:16,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 13:51:16,787 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 13:51:16,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:16,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1973982471, now seen corresponding path program 1 times [2024-06-14 13:51:16,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:16,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077284806] [2024-06-14 13:51:16,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:16,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:16,894 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 13:51:16,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:16,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077284806] [2024-06-14 13:51:16,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077284806] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:16,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:16,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 13:51:16,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348021714] [2024-06-14 13:51:16,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:16,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 13:51:16,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:16,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 13:51:16,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 13:51:16,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 68 [2024-06-14 13:51:16,983 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 13:51:16,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:16,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 68 [2024-06-14 13:51:16,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:17,151 INFO L124 PetriNetUnfolderBase]: 672/1436 cut-off events. [2024-06-14 13:51:17,151 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2024-06-14 13:51:17,154 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 13:51:17,158 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 42 selfloop transitions, 6 changer transitions 1/83 dead transitions. [2024-06-14 13:51:17,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 83 transitions, 292 flow [2024-06-14 13:51:17,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 13:51:17,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 13:51:17,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2024-06-14 13:51:17,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7132352941176471 [2024-06-14 13:51:17,160 INFO L175 Difference]: Start difference. First operand has 61 places, 66 transitions, 153 flow. Second operand 4 states and 194 transitions. [2024-06-14 13:51:17,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 83 transitions, 292 flow [2024-06-14 13:51:17,161 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 13:51:17,162 INFO L231 Difference]: Finished difference. Result has 64 places, 68 transitions, 177 flow [2024-06-14 13:51:17,162 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 13:51:17,163 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 3 predicate places. [2024-06-14 13:51:17,163 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 68 transitions, 177 flow [2024-06-14 13:51:17,163 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 13:51:17,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:17,164 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:51:17,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 13:51:17,164 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 13:51:17,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:17,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1467278947, now seen corresponding path program 1 times [2024-06-14 13:51:17,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:17,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309115638] [2024-06-14 13:51:17,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:17,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:17,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:17,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309115638] [2024-06-14 13:51:17,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309115638] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:17,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:17,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 13:51:17,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031989248] [2024-06-14 13:51:17,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:17,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 13:51:17,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:17,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 13:51:17,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 13:51:17,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 68 [2024-06-14 13:51:17,286 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 13:51:17,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:17,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 68 [2024-06-14 13:51:17,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:17,393 INFO L124 PetriNetUnfolderBase]: 676/1461 cut-off events. [2024-06-14 13:51:17,394 INFO L125 PetriNetUnfolderBase]: For 442/442 co-relation queries the response was YES. [2024-06-14 13:51:17,397 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 13:51:17,402 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 42 selfloop transitions, 8 changer transitions 1/85 dead transitions. [2024-06-14 13:51:17,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 85 transitions, 324 flow [2024-06-14 13:51:17,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 13:51:17,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 13:51:17,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2024-06-14 13:51:17,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7169117647058824 [2024-06-14 13:51:17,404 INFO L175 Difference]: Start difference. First operand has 64 places, 68 transitions, 177 flow. Second operand 4 states and 195 transitions. [2024-06-14 13:51:17,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 85 transitions, 324 flow [2024-06-14 13:51:17,406 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 13:51:17,407 INFO L231 Difference]: Finished difference. Result has 67 places, 71 transitions, 208 flow [2024-06-14 13:51:17,407 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 13:51:17,408 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 6 predicate places. [2024-06-14 13:51:17,408 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 71 transitions, 208 flow [2024-06-14 13:51:17,408 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 13:51:17,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:17,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:51:17,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 13:51:17,409 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 13:51:17,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:17,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1117092599, now seen corresponding path program 1 times [2024-06-14 13:51:17,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:17,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075514875] [2024-06-14 13:51:17,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:17,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:17,477 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 13:51:17,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:17,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075514875] [2024-06-14 13:51:17,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075514875] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:17,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:17,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 13:51:17,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003052262] [2024-06-14 13:51:17,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:17,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 13:51:17,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:17,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 13:51:17,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 13:51:17,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 68 [2024-06-14 13:51:17,517 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 13:51:17,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:17,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 68 [2024-06-14 13:51:17,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:17,644 INFO L124 PetriNetUnfolderBase]: 667/1385 cut-off events. [2024-06-14 13:51:17,644 INFO L125 PetriNetUnfolderBase]: For 855/863 co-relation queries the response was YES. [2024-06-14 13:51:17,648 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 13:51:17,653 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 44 selfloop transitions, 7 changer transitions 0/85 dead transitions. [2024-06-14 13:51:17,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 85 transitions, 350 flow [2024-06-14 13:51:17,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 13:51:17,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 13:51:17,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2024-06-14 13:51:17,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6985294117647058 [2024-06-14 13:51:17,655 INFO L175 Difference]: Start difference. First operand has 67 places, 71 transitions, 208 flow. Second operand 4 states and 190 transitions. [2024-06-14 13:51:17,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 85 transitions, 350 flow [2024-06-14 13:51:17,657 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 13:51:17,658 INFO L231 Difference]: Finished difference. Result has 71 places, 75 transitions, 244 flow [2024-06-14 13:51:17,658 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 13:51:17,658 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 10 predicate places. [2024-06-14 13:51:17,659 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 75 transitions, 244 flow [2024-06-14 13:51:17,659 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 13:51:17,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:17,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:51:17,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 13:51:17,660 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 13:51:17,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:17,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1767742354, now seen corresponding path program 1 times [2024-06-14 13:51:17,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:17,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011230226] [2024-06-14 13:51:17,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:17,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:17,737 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 13:51:17,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:17,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011230226] [2024-06-14 13:51:17,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011230226] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:17,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:17,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:17,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403194722] [2024-06-14 13:51:17,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:17,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:17,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:17,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:17,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:17,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:17,786 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 13:51:17,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:17,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:17,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:17,912 INFO L124 PetriNetUnfolderBase]: 786/1571 cut-off events. [2024-06-14 13:51:17,913 INFO L125 PetriNetUnfolderBase]: For 1611/1611 co-relation queries the response was YES. [2024-06-14 13:51:17,916 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 13:51:17,922 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 60 selfloop transitions, 13 changer transitions 0/106 dead transitions. [2024-06-14 13:51:17,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 106 transitions, 485 flow [2024-06-14 13:51:17,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:17,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:17,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2024-06-14 13:51:17,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-06-14 13:51:17,924 INFO L175 Difference]: Start difference. First operand has 71 places, 75 transitions, 244 flow. Second operand 5 states and 240 transitions. [2024-06-14 13:51:17,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 106 transitions, 485 flow [2024-06-14 13:51:17,926 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 13:51:17,927 INFO L231 Difference]: Finished difference. Result has 77 places, 80 transitions, 302 flow [2024-06-14 13:51:17,927 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 13:51:17,928 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 16 predicate places. [2024-06-14 13:51:17,928 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 80 transitions, 302 flow [2024-06-14 13:51:17,928 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 13:51:17,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:17,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:51:17,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 13:51:17,929 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 13:51:17,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:17,929 INFO L85 PathProgramCache]: Analyzing trace with hash 258813064, now seen corresponding path program 2 times [2024-06-14 13:51:17,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:17,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858816211] [2024-06-14 13:51:17,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:17,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:17,998 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 13:51:17,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:17,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858816211] [2024-06-14 13:51:17,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858816211] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:17,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:17,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:17,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840850400] [2024-06-14 13:51:17,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:17,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:17,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:18,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:18,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:18,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:18,037 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 13:51:18,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:18,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:18,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:18,207 INFO L124 PetriNetUnfolderBase]: 805/1615 cut-off events. [2024-06-14 13:51:18,208 INFO L125 PetriNetUnfolderBase]: For 2567/2575 co-relation queries the response was YES. [2024-06-14 13:51:18,211 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 13:51:18,218 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 61 selfloop transitions, 15 changer transitions 0/109 dead transitions. [2024-06-14 13:51:18,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 109 transitions, 552 flow [2024-06-14 13:51:18,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:18,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:18,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 241 transitions. [2024-06-14 13:51:18,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7088235294117647 [2024-06-14 13:51:18,220 INFO L175 Difference]: Start difference. First operand has 77 places, 80 transitions, 302 flow. Second operand 5 states and 241 transitions. [2024-06-14 13:51:18,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 109 transitions, 552 flow [2024-06-14 13:51:18,223 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 13:51:18,224 INFO L231 Difference]: Finished difference. Result has 82 places, 82 transitions, 345 flow [2024-06-14 13:51:18,224 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 13:51:18,225 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 21 predicate places. [2024-06-14 13:51:18,225 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 82 transitions, 345 flow [2024-06-14 13:51:18,225 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 13:51:18,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:18,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:51:18,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 13:51:18,226 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 13:51:18,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:18,226 INFO L85 PathProgramCache]: Analyzing trace with hash -187682116, now seen corresponding path program 1 times [2024-06-14 13:51:18,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:18,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110645882] [2024-06-14 13:51:18,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:18,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:18,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:18,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:18,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110645882] [2024-06-14 13:51:18,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110645882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:18,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:18,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:18,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267661837] [2024-06-14 13:51:18,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:18,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 13:51:18,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:18,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 13:51:18,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 13:51:18,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 68 [2024-06-14 13:51:18,290 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 13:51:18,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:18,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 68 [2024-06-14 13:51:18,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:18,497 INFO L124 PetriNetUnfolderBase]: 1309/2778 cut-off events. [2024-06-14 13:51:18,497 INFO L125 PetriNetUnfolderBase]: For 2498/2534 co-relation queries the response was YES. [2024-06-14 13:51:18,503 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 13:51:18,514 INFO L140 encePairwiseOnDemand]: 51/68 looper letters, 80 selfloop transitions, 20 changer transitions 2/137 dead transitions. [2024-06-14 13:51:18,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 137 transitions, 711 flow [2024-06-14 13:51:18,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:18,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 243 transitions. [2024-06-14 13:51:18,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7147058823529412 [2024-06-14 13:51:18,516 INFO L175 Difference]: Start difference. First operand has 82 places, 82 transitions, 345 flow. Second operand 5 states and 243 transitions. [2024-06-14 13:51:18,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 137 transitions, 711 flow [2024-06-14 13:51:18,520 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 13:51:18,522 INFO L231 Difference]: Finished difference. Result has 87 places, 95 transitions, 466 flow [2024-06-14 13:51:18,522 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 13:51:18,522 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 26 predicate places. [2024-06-14 13:51:18,522 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 95 transitions, 466 flow [2024-06-14 13:51:18,523 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 13:51:18,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:18,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:51:18,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 13:51:18,523 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 13:51:18,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:18,524 INFO L85 PathProgramCache]: Analyzing trace with hash -696309160, now seen corresponding path program 1 times [2024-06-14 13:51:18,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:18,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760148619] [2024-06-14 13:51:18,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:18,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:18,600 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 13:51:18,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:18,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760148619] [2024-06-14 13:51:18,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760148619] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:18,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:18,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 13:51:18,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370634699] [2024-06-14 13:51:18,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:18,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 13:51:18,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:18,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 13:51:18,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 13:51:18,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 68 [2024-06-14 13:51:18,638 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 13:51:18,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:18,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 68 [2024-06-14 13:51:18,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:18,816 INFO L124 PetriNetUnfolderBase]: 1253/2538 cut-off events. [2024-06-14 13:51:18,817 INFO L125 PetriNetUnfolderBase]: For 5722/5754 co-relation queries the response was YES. [2024-06-14 13:51:18,823 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 13:51:18,835 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 52 selfloop transitions, 9 changer transitions 0/108 dead transitions. [2024-06-14 13:51:18,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 108 transitions, 640 flow [2024-06-14 13:51:18,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 13:51:18,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 13:51:18,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2024-06-14 13:51:18,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-06-14 13:51:18,838 INFO L175 Difference]: Start difference. First operand has 87 places, 95 transitions, 466 flow. Second operand 4 states and 192 transitions. [2024-06-14 13:51:18,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 108 transitions, 640 flow [2024-06-14 13:51:18,843 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 13:51:18,844 INFO L231 Difference]: Finished difference. Result has 91 places, 97 transitions, 506 flow [2024-06-14 13:51:18,848 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 13:51:18,850 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 30 predicate places. [2024-06-14 13:51:18,851 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 97 transitions, 506 flow [2024-06-14 13:51:18,851 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 13:51:18,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:18,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:51:18,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 13:51:18,851 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 13:51:18,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:18,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1897335129, now seen corresponding path program 1 times [2024-06-14 13:51:18,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:18,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140675569] [2024-06-14 13:51:18,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:18,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:18,937 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 13:51:18,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:18,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140675569] [2024-06-14 13:51:18,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140675569] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:18,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:18,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 13:51:18,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828223971] [2024-06-14 13:51:18,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:18,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 13:51:18,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:18,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 13:51:18,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 13:51:18,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 68 [2024-06-14 13:51:18,989 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 13:51:18,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:18,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 68 [2024-06-14 13:51:18,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:19,204 INFO L124 PetriNetUnfolderBase]: 1299/2656 cut-off events. [2024-06-14 13:51:19,204 INFO L125 PetriNetUnfolderBase]: For 7782/7820 co-relation queries the response was YES. [2024-06-14 13:51:19,211 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 13:51:19,225 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 53 selfloop transitions, 9 changer transitions 0/109 dead transitions. [2024-06-14 13:51:19,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 109 transitions, 677 flow [2024-06-14 13:51:19,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 13:51:19,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 13:51:19,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 191 transitions. [2024-06-14 13:51:19,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7022058823529411 [2024-06-14 13:51:19,226 INFO L175 Difference]: Start difference. First operand has 91 places, 97 transitions, 506 flow. Second operand 4 states and 191 transitions. [2024-06-14 13:51:19,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 109 transitions, 677 flow [2024-06-14 13:51:19,233 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 13:51:19,234 INFO L231 Difference]: Finished difference. Result has 94 places, 100 transitions, 538 flow [2024-06-14 13:51:19,234 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 13:51:19,235 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 33 predicate places. [2024-06-14 13:51:19,235 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 100 transitions, 538 flow [2024-06-14 13:51:19,235 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 13:51:19,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:19,236 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:51:19,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 13:51:19,236 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 13:51:19,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:19,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1387491418, now seen corresponding path program 1 times [2024-06-14 13:51:19,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:19,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970327429] [2024-06-14 13:51:19,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:19,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:19,348 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 13:51:19,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:19,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970327429] [2024-06-14 13:51:19,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970327429] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:19,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:19,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:19,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606316783] [2024-06-14 13:51:19,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:19,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:19,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:19,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:19,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:19,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:19,416 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 13:51:19,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:19,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:19,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:19,709 INFO L124 PetriNetUnfolderBase]: 1373/2782 cut-off events. [2024-06-14 13:51:19,710 INFO L125 PetriNetUnfolderBase]: For 9946/9999 co-relation queries the response was YES. [2024-06-14 13:51:19,719 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 13:51:19,730 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 69 selfloop transitions, 17 changer transitions 0/131 dead transitions. [2024-06-14 13:51:19,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 131 transitions, 847 flow [2024-06-14 13:51:19,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:19,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:19,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 241 transitions. [2024-06-14 13:51:19,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7088235294117647 [2024-06-14 13:51:19,732 INFO L175 Difference]: Start difference. First operand has 94 places, 100 transitions, 538 flow. Second operand 5 states and 241 transitions. [2024-06-14 13:51:19,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 131 transitions, 847 flow [2024-06-14 13:51:19,737 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 13:51:19,742 INFO L231 Difference]: Finished difference. Result has 99 places, 106 transitions, 618 flow [2024-06-14 13:51:19,743 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 13:51:19,744 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 38 predicate places. [2024-06-14 13:51:19,745 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 106 transitions, 618 flow [2024-06-14 13:51:19,745 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 13:51:19,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:19,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:51:19,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 13:51:19,746 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 13:51:19,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:19,746 INFO L85 PathProgramCache]: Analyzing trace with hash -57058194, now seen corresponding path program 2 times [2024-06-14 13:51:19,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:19,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286285500] [2024-06-14 13:51:19,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:19,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:19,829 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 13:51:19,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:19,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286285500] [2024-06-14 13:51:19,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286285500] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:19,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:19,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:19,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46231741] [2024-06-14 13:51:19,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:19,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:19,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:19,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:19,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:19,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:19,876 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 13:51:19,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:19,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:19,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:20,157 INFO L124 PetriNetUnfolderBase]: 1404/2719 cut-off events. [2024-06-14 13:51:20,157 INFO L125 PetriNetUnfolderBase]: For 13416/13492 co-relation queries the response was YES. [2024-06-14 13:51:20,164 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 13:51:20,175 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 67 selfloop transitions, 22 changer transitions 0/134 dead transitions. [2024-06-14 13:51:20,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 134 transitions, 936 flow [2024-06-14 13:51:20,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:20,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:20,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 241 transitions. [2024-06-14 13:51:20,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7088235294117647 [2024-06-14 13:51:20,177 INFO L175 Difference]: Start difference. First operand has 99 places, 106 transitions, 618 flow. Second operand 5 states and 241 transitions. [2024-06-14 13:51:20,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 134 transitions, 936 flow [2024-06-14 13:51:20,185 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 13:51:20,187 INFO L231 Difference]: Finished difference. Result has 104 places, 109 transitions, 686 flow [2024-06-14 13:51:20,187 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 13:51:20,188 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 43 predicate places. [2024-06-14 13:51:20,188 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 109 transitions, 686 flow [2024-06-14 13:51:20,188 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 13:51:20,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:20,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:51:20,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 13:51:20,189 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 13:51:20,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:20,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1917078450, now seen corresponding path program 1 times [2024-06-14 13:51:20,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:20,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732991705] [2024-06-14 13:51:20,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:20,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:20,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 13:51:20,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:20,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732991705] [2024-06-14 13:51:20,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732991705] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:20,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:20,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:20,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656466117] [2024-06-14 13:51:20,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:20,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:20,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:20,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:20,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:20,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:20,312 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 13:51:20,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:20,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:20,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:20,540 INFO L124 PetriNetUnfolderBase]: 1368/2742 cut-off events. [2024-06-14 13:51:20,540 INFO L125 PetriNetUnfolderBase]: For 15708/15749 co-relation queries the response was YES. [2024-06-14 13:51:20,548 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 13:51:20,559 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 72 selfloop transitions, 19 changer transitions 0/136 dead transitions. [2024-06-14 13:51:20,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 136 transitions, 999 flow [2024-06-14 13:51:20,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:20,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:20,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2024-06-14 13:51:20,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-06-14 13:51:20,561 INFO L175 Difference]: Start difference. First operand has 104 places, 109 transitions, 686 flow. Second operand 5 states and 240 transitions. [2024-06-14 13:51:20,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 136 transitions, 999 flow [2024-06-14 13:51:20,573 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 13:51:20,575 INFO L231 Difference]: Finished difference. Result has 107 places, 112 transitions, 720 flow [2024-06-14 13:51:20,575 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 13:51:20,575 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 46 predicate places. [2024-06-14 13:51:20,576 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 112 transitions, 720 flow [2024-06-14 13:51:20,576 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 13:51:20,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:20,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:51:20,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 13:51:20,576 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 13:51:20,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:20,577 INFO L85 PathProgramCache]: Analyzing trace with hash 675332066, now seen corresponding path program 2 times [2024-06-14 13:51:20,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:20,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420045678] [2024-06-14 13:51:20,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:20,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:20,637 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 13:51:20,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:20,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420045678] [2024-06-14 13:51:20,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420045678] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:20,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:20,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:20,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249720214] [2024-06-14 13:51:20,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:20,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:20,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:20,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:20,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:20,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:20,698 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 13:51:20,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:20,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:20,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:20,960 INFO L124 PetriNetUnfolderBase]: 1432/2891 cut-off events. [2024-06-14 13:51:20,961 INFO L125 PetriNetUnfolderBase]: For 19279/19332 co-relation queries the response was YES. [2024-06-14 13:51:20,971 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 13:51:20,983 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 76 selfloop transitions, 22 changer transitions 0/143 dead transitions. [2024-06-14 13:51:20,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 143 transitions, 1090 flow [2024-06-14 13:51:20,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:20,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:20,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2024-06-14 13:51:20,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.711764705882353 [2024-06-14 13:51:20,985 INFO L175 Difference]: Start difference. First operand has 107 places, 112 transitions, 720 flow. Second operand 5 states and 242 transitions. [2024-06-14 13:51:20,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 143 transitions, 1090 flow [2024-06-14 13:51:20,997 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 13:51:20,999 INFO L231 Difference]: Finished difference. Result has 110 places, 116 transitions, 776 flow [2024-06-14 13:51:20,999 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 13:51:21,000 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 49 predicate places. [2024-06-14 13:51:21,000 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 116 transitions, 776 flow [2024-06-14 13:51:21,000 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 13:51:21,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:21,000 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 13:51:21,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 13:51:21,001 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 13:51:21,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:21,001 INFO L85 PathProgramCache]: Analyzing trace with hash -540124792, now seen corresponding path program 1 times [2024-06-14 13:51:21,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:21,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897113370] [2024-06-14 13:51:21,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:21,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:21,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:21,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:21,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897113370] [2024-06-14 13:51:21,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897113370] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:21,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:21,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:21,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277986967] [2024-06-14 13:51:21,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:21,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 13:51:21,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:21,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 13:51:21,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 13:51:21,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 68 [2024-06-14 13:51:21,050 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 13:51:21,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:21,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 68 [2024-06-14 13:51:21,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:21,437 INFO L124 PetriNetUnfolderBase]: 2235/4439 cut-off events. [2024-06-14 13:51:21,437 INFO L125 PetriNetUnfolderBase]: For 16062/16390 co-relation queries the response was YES. [2024-06-14 13:51:21,449 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 13:51:21,463 INFO L140 encePairwiseOnDemand]: 51/68 looper letters, 97 selfloop transitions, 22 changer transitions 1/176 dead transitions. [2024-06-14 13:51:21,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 176 transitions, 1284 flow [2024-06-14 13:51:21,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:21,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:21,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 241 transitions. [2024-06-14 13:51:21,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7088235294117647 [2024-06-14 13:51:21,464 INFO L175 Difference]: Start difference. First operand has 110 places, 116 transitions, 776 flow. Second operand 5 states and 241 transitions. [2024-06-14 13:51:21,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 176 transitions, 1284 flow [2024-06-14 13:51:21,482 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 13:51:21,484 INFO L231 Difference]: Finished difference. Result has 116 places, 129 transitions, 913 flow [2024-06-14 13:51:21,484 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 13:51:21,484 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 55 predicate places. [2024-06-14 13:51:21,485 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 129 transitions, 913 flow [2024-06-14 13:51:21,485 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 13:51:21,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:21,485 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 13:51:21,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 13:51:21,485 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 13:51:21,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:21,486 INFO L85 PathProgramCache]: Analyzing trace with hash -353404956, now seen corresponding path program 1 times [2024-06-14 13:51:21,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:21,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348702400] [2024-06-14 13:51:21,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:21,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:21,539 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 13:51:21,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:21,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348702400] [2024-06-14 13:51:21,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348702400] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:21,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:21,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 13:51:21,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409525121] [2024-06-14 13:51:21,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:21,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 13:51:21,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:21,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 13:51:21,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 13:51:21,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 68 [2024-06-14 13:51:21,582 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 13:51:21,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:21,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 68 [2024-06-14 13:51:21,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:22,039 INFO L124 PetriNetUnfolderBase]: 2095/4271 cut-off events. [2024-06-14 13:51:22,039 INFO L125 PetriNetUnfolderBase]: For 36454/36559 co-relation queries the response was YES. [2024-06-14 13:51:22,063 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 13:51:22,086 INFO L140 encePairwiseOnDemand]: 63/68 looper letters, 67 selfloop transitions, 8 changer transitions 0/135 dead transitions. [2024-06-14 13:51:22,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 135 transitions, 1077 flow [2024-06-14 13:51:22,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 13:51:22,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 13:51:22,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2024-06-14 13:51:22,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6875 [2024-06-14 13:51:22,088 INFO L175 Difference]: Start difference. First operand has 116 places, 129 transitions, 913 flow. Second operand 4 states and 187 transitions. [2024-06-14 13:51:22,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 135 transitions, 1077 flow [2024-06-14 13:51:22,118 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 13:51:22,120 INFO L231 Difference]: Finished difference. Result has 120 places, 129 transitions, 934 flow [2024-06-14 13:51:22,120 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 13:51:22,121 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 59 predicate places. [2024-06-14 13:51:22,121 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 129 transitions, 934 flow [2024-06-14 13:51:22,121 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 13:51:22,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:22,136 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 13:51:22,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 13:51:22,136 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 13:51:22,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:22,137 INFO L85 PathProgramCache]: Analyzing trace with hash -739200223, now seen corresponding path program 1 times [2024-06-14 13:51:22,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:22,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831685176] [2024-06-14 13:51:22,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:22,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:22,219 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 13:51:22,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:22,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831685176] [2024-06-14 13:51:22,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831685176] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:22,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:22,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:22,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107327467] [2024-06-14 13:51:22,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:22,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:22,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:22,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:22,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:22,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:22,272 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 13:51:22,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:22,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:22,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:22,834 INFO L124 PetriNetUnfolderBase]: 2203/4397 cut-off events. [2024-06-14 13:51:22,834 INFO L125 PetriNetUnfolderBase]: For 42346/42466 co-relation queries the response was YES. [2024-06-14 13:51:22,847 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 13:51:22,864 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 89 selfloop transitions, 18 changer transitions 0/164 dead transitions. [2024-06-14 13:51:22,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 164 transitions, 1365 flow [2024-06-14 13:51:22,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:22,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:22,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 243 transitions. [2024-06-14 13:51:22,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7147058823529412 [2024-06-14 13:51:22,866 INFO L175 Difference]: Start difference. First operand has 120 places, 129 transitions, 934 flow. Second operand 5 states and 243 transitions. [2024-06-14 13:51:22,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 164 transitions, 1365 flow [2024-06-14 13:51:22,894 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 13:51:22,896 INFO L231 Difference]: Finished difference. Result has 123 places, 135 transitions, 1033 flow [2024-06-14 13:51:22,896 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 13:51:22,897 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 62 predicate places. [2024-06-14 13:51:22,897 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 135 transitions, 1033 flow [2024-06-14 13:51:22,897 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 13:51:22,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:22,898 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 13:51:22,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 13:51:22,898 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 13:51:22,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:22,898 INFO L85 PathProgramCache]: Analyzing trace with hash -525305469, now seen corresponding path program 2 times [2024-06-14 13:51:22,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:22,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645147827] [2024-06-14 13:51:22,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:22,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:22,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:22,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:22,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645147827] [2024-06-14 13:51:22,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645147827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:22,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:22,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:22,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520456606] [2024-06-14 13:51:22,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:22,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:22,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:22,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:22,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:23,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:23,000 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 13:51:23,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:23,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:23,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:23,407 INFO L124 PetriNetUnfolderBase]: 2228/4368 cut-off events. [2024-06-14 13:51:23,408 INFO L125 PetriNetUnfolderBase]: For 50582/50731 co-relation queries the response was YES. [2024-06-14 13:51:23,425 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 13:51:23,445 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 81 selfloop transitions, 26 changer transitions 0/164 dead transitions. [2024-06-14 13:51:23,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 164 transitions, 1436 flow [2024-06-14 13:51:23,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:23,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:23,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2024-06-14 13:51:23,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.711764705882353 [2024-06-14 13:51:23,447 INFO L175 Difference]: Start difference. First operand has 123 places, 135 transitions, 1033 flow. Second operand 5 states and 242 transitions. [2024-06-14 13:51:23,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 164 transitions, 1436 flow [2024-06-14 13:51:23,537 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 13:51:23,539 INFO L231 Difference]: Finished difference. Result has 128 places, 139 transitions, 1147 flow [2024-06-14 13:51:23,540 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 13:51:23,540 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 67 predicate places. [2024-06-14 13:51:23,540 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 139 transitions, 1147 flow [2024-06-14 13:51:23,540 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 13:51:23,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:23,540 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 13:51:23,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 13:51:23,541 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 13:51:23,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:23,541 INFO L85 PathProgramCache]: Analyzing trace with hash -554859102, now seen corresponding path program 1 times [2024-06-14 13:51:23,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:23,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639247670] [2024-06-14 13:51:23,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:23,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:23,569 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 13:51:23,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:23,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639247670] [2024-06-14 13:51:23,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639247670] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:23,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:23,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 13:51:23,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965363258] [2024-06-14 13:51:23,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:23,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 13:51:23,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:23,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 13:51:23,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 13:51:23,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 68 [2024-06-14 13:51:23,594 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 13:51:23,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:23,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 68 [2024-06-14 13:51:23,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:23,972 INFO L124 PetriNetUnfolderBase]: 2082/4285 cut-off events. [2024-06-14 13:51:23,973 INFO L125 PetriNetUnfolderBase]: For 26698/27055 co-relation queries the response was YES. [2024-06-14 13:51:23,989 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 13:51:24,003 INFO L140 encePairwiseOnDemand]: 50/68 looper letters, 88 selfloop transitions, 61 changer transitions 0/207 dead transitions. [2024-06-14 13:51:24,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 207 transitions, 1841 flow [2024-06-14 13:51:24,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:24,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:24,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 246 transitions. [2024-06-14 13:51:24,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7235294117647059 [2024-06-14 13:51:24,005 INFO L175 Difference]: Start difference. First operand has 128 places, 139 transitions, 1147 flow. Second operand 5 states and 246 transitions. [2024-06-14 13:51:24,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 207 transitions, 1841 flow [2024-06-14 13:51:24,049 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 13:51:24,052 INFO L231 Difference]: Finished difference. Result has 134 places, 176 transitions, 1672 flow [2024-06-14 13:51:24,052 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 13:51:24,053 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 73 predicate places. [2024-06-14 13:51:24,053 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 176 transitions, 1672 flow [2024-06-14 13:51:24,053 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 13:51:24,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:24,053 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 13:51:24,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 13:51:24,053 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 13:51:24,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:24,054 INFO L85 PathProgramCache]: Analyzing trace with hash -553905821, now seen corresponding path program 1 times [2024-06-14 13:51:24,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:24,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855245516] [2024-06-14 13:51:24,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:24,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:24,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 13:51:24,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:24,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855245516] [2024-06-14 13:51:24,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855245516] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:24,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:24,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:24,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109260532] [2024-06-14 13:51:24,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:24,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:24,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:24,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:24,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:24,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:24,173 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 13:51:24,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:24,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:24,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:24,640 INFO L124 PetriNetUnfolderBase]: 2411/4810 cut-off events. [2024-06-14 13:51:24,640 INFO L125 PetriNetUnfolderBase]: For 67465/67693 co-relation queries the response was YES. [2024-06-14 13:51:24,658 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 13:51:24,678 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 95 selfloop transitions, 26 changer transitions 0/200 dead transitions. [2024-06-14 13:51:24,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 200 transitions, 2089 flow [2024-06-14 13:51:24,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:24,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:24,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2024-06-14 13:51:24,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-06-14 13:51:24,679 INFO L175 Difference]: Start difference. First operand has 134 places, 176 transitions, 1672 flow. Second operand 5 states and 240 transitions. [2024-06-14 13:51:24,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 200 transitions, 2089 flow [2024-06-14 13:51:24,752 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 13:51:24,755 INFO L231 Difference]: Finished difference. Result has 138 places, 177 transitions, 1707 flow [2024-06-14 13:51:24,755 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 13:51:24,755 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 77 predicate places. [2024-06-14 13:51:24,756 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 177 transitions, 1707 flow [2024-06-14 13:51:24,756 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 13:51:24,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:24,756 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 13:51:24,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 13:51:24,756 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 13:51:24,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:24,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1929039442, now seen corresponding path program 2 times [2024-06-14 13:51:24,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:24,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533622457] [2024-06-14 13:51:24,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:24,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:24,810 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 13:51:24,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:24,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533622457] [2024-06-14 13:51:24,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533622457] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:24,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:24,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:24,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340967148] [2024-06-14 13:51:24,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:24,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:24,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:24,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:24,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:24,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:24,858 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 13:51:24,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:24,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:24,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:25,360 INFO L124 PetriNetUnfolderBase]: 2445/4920 cut-off events. [2024-06-14 13:51:25,360 INFO L125 PetriNetUnfolderBase]: For 73197/73415 co-relation queries the response was YES. [2024-06-14 13:51:25,379 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 13:51:25,399 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 96 selfloop transitions, 31 changer transitions 0/206 dead transitions. [2024-06-14 13:51:25,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 206 transitions, 2199 flow [2024-06-14 13:51:25,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:25,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2024-06-14 13:51:25,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-06-14 13:51:25,401 INFO L175 Difference]: Start difference. First operand has 138 places, 177 transitions, 1707 flow. Second operand 5 states and 240 transitions. [2024-06-14 13:51:25,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 206 transitions, 2199 flow [2024-06-14 13:51:25,465 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 13:51:25,467 INFO L231 Difference]: Finished difference. Result has 141 places, 181 transitions, 1779 flow [2024-06-14 13:51:25,467 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 13:51:25,467 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 80 predicate places. [2024-06-14 13:51:25,468 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 181 transitions, 1779 flow [2024-06-14 13:51:25,468 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 13:51:25,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:25,468 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 13:51:25,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 13:51:25,468 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 13:51:25,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:25,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1931390482, now seen corresponding path program 3 times [2024-06-14 13:51:25,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:25,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360408096] [2024-06-14 13:51:25,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:25,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:25,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:25,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:25,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360408096] [2024-06-14 13:51:25,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360408096] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:25,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:25,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:25,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355175464] [2024-06-14 13:51:25,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:25,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:25,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:25,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:25,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:25,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:25,578 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 13:51:25,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:25,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:25,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:26,096 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 13:51:26,096 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-06-14 13:51:26,096 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-14 13:51:26,096 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-14 13:51:26,097 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-14 13:51:26,147 INFO L124 PetriNetUnfolderBase]: 2389/4801 cut-off events. [2024-06-14 13:51:26,148 INFO L125 PetriNetUnfolderBase]: For 80083/80292 co-relation queries the response was YES. [2024-06-14 13:51:26,169 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 13:51:26,189 INFO L140 encePairwiseOnDemand]: 58/68 looper letters, 105 selfloop transitions, 29 changer transitions 0/213 dead transitions. [2024-06-14 13:51:26,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 213 transitions, 2352 flow [2024-06-14 13:51:26,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:26,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:26,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2024-06-14 13:51:26,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.711764705882353 [2024-06-14 13:51:26,191 INFO L175 Difference]: Start difference. First operand has 141 places, 181 transitions, 1779 flow. Second operand 5 states and 242 transitions. [2024-06-14 13:51:26,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 213 transitions, 2352 flow [2024-06-14 13:51:26,267 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 13:51:26,270 INFO L231 Difference]: Finished difference. Result has 144 places, 186 transitions, 1858 flow [2024-06-14 13:51:26,270 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 13:51:26,270 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 83 predicate places. [2024-06-14 13:51:26,270 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 186 transitions, 1858 flow [2024-06-14 13:51:26,271 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 13:51:26,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:26,271 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 13:51:26,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 13:51:26,271 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 13:51:26,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:26,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1324426055, now seen corresponding path program 1 times [2024-06-14 13:51:26,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:26,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360103063] [2024-06-14 13:51:26,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:26,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:26,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:26,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:26,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360103063] [2024-06-14 13:51:26,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360103063] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:26,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:26,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 13:51:26,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400194783] [2024-06-14 13:51:26,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:26,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 13:51:26,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:26,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 13:51:26,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 13:51:26,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 68 [2024-06-14 13:51:26,315 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 13:51:26,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:26,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 68 [2024-06-14 13:51:26,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:26,884 INFO L124 PetriNetUnfolderBase]: 2454/4993 cut-off events. [2024-06-14 13:51:26,885 INFO L125 PetriNetUnfolderBase]: For 48071/48480 co-relation queries the response was YES. [2024-06-14 13:51:26,906 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 13:51:26,923 INFO L140 encePairwiseOnDemand]: 54/68 looper letters, 156 selfloop transitions, 36 changer transitions 0/250 dead transitions. [2024-06-14 13:51:26,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 250 transitions, 2782 flow [2024-06-14 13:51:26,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:26,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:26,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 230 transitions. [2024-06-14 13:51:26,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2024-06-14 13:51:26,925 INFO L175 Difference]: Start difference. First operand has 144 places, 186 transitions, 1858 flow. Second operand 5 states and 230 transitions. [2024-06-14 13:51:26,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 250 transitions, 2782 flow [2024-06-14 13:51:26,997 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 13:51:27,000 INFO L231 Difference]: Finished difference. Result has 150 places, 203 transitions, 2148 flow [2024-06-14 13:51:27,000 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 13:51:27,001 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 89 predicate places. [2024-06-14 13:51:27,001 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 203 transitions, 2148 flow [2024-06-14 13:51:27,001 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 13:51:27,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:27,001 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 13:51:27,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 13:51:27,002 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 13:51:27,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:27,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1909772417, now seen corresponding path program 1 times [2024-06-14 13:51:27,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:27,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157687687] [2024-06-14 13:51:27,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:27,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:27,068 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 13:51:27,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:27,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157687687] [2024-06-14 13:51:27,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157687687] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:27,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:27,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:27,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811031302] [2024-06-14 13:51:27,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:27,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:27,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:27,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:27,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:27,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:27,124 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 13:51:27,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:27,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:27,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:27,675 INFO L124 PetriNetUnfolderBase]: 2569/5237 cut-off events. [2024-06-14 13:51:27,676 INFO L125 PetriNetUnfolderBase]: For 98508/98709 co-relation queries the response was YES. [2024-06-14 13:51:27,698 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 13:51:27,718 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 105 selfloop transitions, 26 changer transitions 0/225 dead transitions. [2024-06-14 13:51:27,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 225 transitions, 2596 flow [2024-06-14 13:51:27,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 237 transitions. [2024-06-14 13:51:27,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6970588235294117 [2024-06-14 13:51:27,719 INFO L175 Difference]: Start difference. First operand has 150 places, 203 transitions, 2148 flow. Second operand 5 states and 237 transitions. [2024-06-14 13:51:27,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 225 transitions, 2596 flow [2024-06-14 13:51:27,796 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 13:51:27,799 INFO L231 Difference]: Finished difference. Result has 155 places, 204 transitions, 2215 flow [2024-06-14 13:51:27,799 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 13:51:27,799 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 94 predicate places. [2024-06-14 13:51:27,799 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 204 transitions, 2215 flow [2024-06-14 13:51:27,800 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 13:51:27,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:27,800 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 13:51:27,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 13:51:27,800 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 13:51:27,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:27,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1174715329, now seen corresponding path program 2 times [2024-06-14 13:51:27,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:27,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625629442] [2024-06-14 13:51:27,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:27,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:27,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:27,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:27,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625629442] [2024-06-14 13:51:27,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625629442] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:27,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:27,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:27,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178355815] [2024-06-14 13:51:27,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:27,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:27,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:27,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:27,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:27,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:27,910 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 13:51:27,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:27,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:27,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:28,469 INFO L124 PetriNetUnfolderBase]: 2562/5209 cut-off events. [2024-06-14 13:51:28,469 INFO L125 PetriNetUnfolderBase]: For 107982/108199 co-relation queries the response was YES. [2024-06-14 13:51:28,492 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 13:51:28,513 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 106 selfloop transitions, 28 changer transitions 0/228 dead transitions. [2024-06-14 13:51:28,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 228 transitions, 2712 flow [2024-06-14 13:51:28,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:28,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:28,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 238 transitions. [2024-06-14 13:51:28,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-06-14 13:51:28,516 INFO L175 Difference]: Start difference. First operand has 155 places, 204 transitions, 2215 flow. Second operand 5 states and 238 transitions. [2024-06-14 13:51:28,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 228 transitions, 2712 flow [2024-06-14 13:51:28,626 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 13:51:28,629 INFO L231 Difference]: Finished difference. Result has 158 places, 207 transitions, 2299 flow [2024-06-14 13:51:28,629 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 13:51:28,629 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 97 predicate places. [2024-06-14 13:51:28,629 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 207 transitions, 2299 flow [2024-06-14 13:51:28,630 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 13:51:28,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:28,630 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 13:51:28,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 13:51:28,630 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 13:51:28,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:28,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1562890865, now seen corresponding path program 3 times [2024-06-14 13:51:28,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:28,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577092961] [2024-06-14 13:51:28,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:28,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:28,686 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 13:51:28,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:28,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577092961] [2024-06-14 13:51:28,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577092961] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:28,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:28,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:28,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784402629] [2024-06-14 13:51:28,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:28,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:28,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:28,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:28,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:28,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:28,751 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 13:51:28,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:28,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:28,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:29,320 INFO L124 PetriNetUnfolderBase]: 2598/5270 cut-off events. [2024-06-14 13:51:29,321 INFO L125 PetriNetUnfolderBase]: For 116393/116613 co-relation queries the response was YES. [2024-06-14 13:51:29,345 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 13:51:29,366 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 127 selfloop transitions, 17 changer transitions 0/238 dead transitions. [2024-06-14 13:51:29,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 238 transitions, 2891 flow [2024-06-14 13:51:29,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:29,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:29,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2024-06-14 13:51:29,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-06-14 13:51:29,367 INFO L175 Difference]: Start difference. First operand has 158 places, 207 transitions, 2299 flow. Second operand 5 states and 240 transitions. [2024-06-14 13:51:29,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 238 transitions, 2891 flow [2024-06-14 13:51:29,488 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 13:51:29,491 INFO L231 Difference]: Finished difference. Result has 161 places, 207 transitions, 2294 flow [2024-06-14 13:51:29,492 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 13:51:29,492 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 100 predicate places. [2024-06-14 13:51:29,492 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 207 transitions, 2294 flow [2024-06-14 13:51:29,492 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 13:51:29,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:29,493 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 13:51:29,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 13:51:29,493 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 13:51:29,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:29,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1008395796, now seen corresponding path program 1 times [2024-06-14 13:51:29,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:29,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700184945] [2024-06-14 13:51:29,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:29,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:29,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 13:51:29,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:29,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700184945] [2024-06-14 13:51:29,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700184945] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:29,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:29,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:29,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746779402] [2024-06-14 13:51:29,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:29,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:29,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:29,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:29,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:29,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:29,617 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 13:51:29,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:29,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:29,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:30,288 INFO L124 PetriNetUnfolderBase]: 2661/5465 cut-off events. [2024-06-14 13:51:30,288 INFO L125 PetriNetUnfolderBase]: For 133767/133991 co-relation queries the response was YES. [2024-06-14 13:51:30,312 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 13:51:30,333 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 130 selfloop transitions, 15 changer transitions 2/241 dead transitions. [2024-06-14 13:51:30,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 241 transitions, 2908 flow [2024-06-14 13:51:30,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:30,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:30,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 238 transitions. [2024-06-14 13:51:30,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-06-14 13:51:30,335 INFO L175 Difference]: Start difference. First operand has 161 places, 207 transitions, 2294 flow. Second operand 5 states and 238 transitions. [2024-06-14 13:51:30,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 241 transitions, 2908 flow [2024-06-14 13:51:30,446 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 13:51:30,449 INFO L231 Difference]: Finished difference. Result has 161 places, 210 transitions, 2286 flow [2024-06-14 13:51:30,450 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 13:51:30,450 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 100 predicate places. [2024-06-14 13:51:30,450 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 210 transitions, 2286 flow [2024-06-14 13:51:30,450 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 13:51:30,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:30,450 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 13:51:30,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 13:51:30,451 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 13:51:30,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:30,451 INFO L85 PathProgramCache]: Analyzing trace with hash -808075808, now seen corresponding path program 1 times [2024-06-14 13:51:30,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:30,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624053771] [2024-06-14 13:51:30,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:30,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:30,505 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 13:51:30,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:30,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624053771] [2024-06-14 13:51:30,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624053771] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:30,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:30,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:30,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082312520] [2024-06-14 13:51:30,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:30,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:30,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:30,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:30,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:30,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:30,569 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 13:51:30,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:30,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:30,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:31,149 INFO L124 PetriNetUnfolderBase]: 2678/5520 cut-off events. [2024-06-14 13:51:31,150 INFO L125 PetriNetUnfolderBase]: For 142899/143135 co-relation queries the response was YES. [2024-06-14 13:51:31,175 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 13:51:31,196 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 111 selfloop transitions, 30 changer transitions 1/236 dead transitions. [2024-06-14 13:51:31,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 236 transitions, 2808 flow [2024-06-14 13:51:31,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:31,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:31,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 233 transitions. [2024-06-14 13:51:31,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6852941176470588 [2024-06-14 13:51:31,198 INFO L175 Difference]: Start difference. First operand has 161 places, 210 transitions, 2286 flow. Second operand 5 states and 233 transitions. [2024-06-14 13:51:31,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 236 transitions, 2808 flow [2024-06-14 13:51:31,323 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 13:51:31,326 INFO L231 Difference]: Finished difference. Result has 167 places, 215 transitions, 2441 flow [2024-06-14 13:51:31,326 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 13:51:31,327 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 106 predicate places. [2024-06-14 13:51:31,327 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 215 transitions, 2441 flow [2024-06-14 13:51:31,327 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 13:51:31,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:31,327 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 13:51:31,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 13:51:31,328 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 13:51:31,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:31,328 INFO L85 PathProgramCache]: Analyzing trace with hash 254139939, now seen corresponding path program 1 times [2024-06-14 13:51:31,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:31,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793585930] [2024-06-14 13:51:31,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:31,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:31,386 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 13:51:31,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:31,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793585930] [2024-06-14 13:51:31,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793585930] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:31,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:31,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 13:51:31,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927352292] [2024-06-14 13:51:31,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:31,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:31,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:31,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:31,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:31,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:31,458 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 13:51:31,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:31,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:31,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:31,863 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 13:51:31,863 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-14 13:51:31,863 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-14 13:51:31,863 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-14 13:51:31,863 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-14 13:51:31,864 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 13:51:31,864 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-14 13:51:31,864 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-14 13:51:31,864 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-14 13:51:31,864 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-14 13:51:31,935 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 13:51:31,935 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-14 13:51:31,935 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-06-14 13:51:31,935 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-14 13:51:31,935 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-06-14 13:51:31,975 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 13:51:31,975 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2024-06-14 13:51:31,975 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2024-06-14 13:51:31,975 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-06-14 13:51:31,975 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2024-06-14 13:51:32,074 INFO L124 PetriNetUnfolderBase]: 2635/5346 cut-off events. [2024-06-14 13:51:32,074 INFO L125 PetriNetUnfolderBase]: For 154646/154884 co-relation queries the response was YES. [2024-06-14 13:51:32,101 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 13:51:32,121 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 110 selfloop transitions, 27 changer transitions 0/231 dead transitions. [2024-06-14 13:51:32,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 231 transitions, 2825 flow [2024-06-14 13:51:32,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:32,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:32,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 229 transitions. [2024-06-14 13:51:32,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6735294117647059 [2024-06-14 13:51:32,123 INFO L175 Difference]: Start difference. First operand has 167 places, 215 transitions, 2441 flow. Second operand 5 states and 229 transitions. [2024-06-14 13:51:32,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 231 transitions, 2825 flow [2024-06-14 13:51:32,265 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 13:51:32,268 INFO L231 Difference]: Finished difference. Result has 171 places, 217 transitions, 2498 flow [2024-06-14 13:51:32,268 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 13:51:32,268 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 110 predicate places. [2024-06-14 13:51:32,268 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 217 transitions, 2498 flow [2024-06-14 13:51:32,269 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 13:51:32,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:32,269 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 13:51:32,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 13:51:32,269 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 13:51:32,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:32,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1892534533, now seen corresponding path program 2 times [2024-06-14 13:51:32,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:32,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133537361] [2024-06-14 13:51:32,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:32,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:32,321 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 13:51:32,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:32,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133537361] [2024-06-14 13:51:32,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133537361] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:32,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:32,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 13:51:32,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148661713] [2024-06-14 13:51:32,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:32,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:32,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:32,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:32,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:32,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:32,381 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 13:51:32,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:32,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:32,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:33,087 INFO L124 PetriNetUnfolderBase]: 2676/5459 cut-off events. [2024-06-14 13:51:33,088 INFO L125 PetriNetUnfolderBase]: For 163578/163814 co-relation queries the response was YES. [2024-06-14 13:51:33,114 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 13:51:33,137 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 137 selfloop transitions, 23 changer transitions 0/254 dead transitions. [2024-06-14 13:51:33,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 254 transitions, 3282 flow [2024-06-14 13:51:33,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:33,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:33,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 231 transitions. [2024-06-14 13:51:33,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6794117647058824 [2024-06-14 13:51:33,138 INFO L175 Difference]: Start difference. First operand has 171 places, 217 transitions, 2498 flow. Second operand 5 states and 231 transitions. [2024-06-14 13:51:33,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 254 transitions, 3282 flow [2024-06-14 13:51:33,276 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 13:51:33,279 INFO L231 Difference]: Finished difference. Result has 174 places, 223 transitions, 2602 flow [2024-06-14 13:51:33,279 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 13:51:33,280 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 113 predicate places. [2024-06-14 13:51:33,280 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 223 transitions, 2602 flow [2024-06-14 13:51:33,280 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 13:51:33,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:33,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] [2024-06-14 13:51:33,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 13:51:33,280 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 13:51:33,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:33,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1892265763, now seen corresponding path program 3 times [2024-06-14 13:51:33,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:33,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392252519] [2024-06-14 13:51:33,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:33,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:33,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:33,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:33,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392252519] [2024-06-14 13:51:33,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392252519] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:33,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:33,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 13:51:33,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861341482] [2024-06-14 13:51:33,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:33,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:33,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:33,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:33,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:33,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:33,392 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 13:51:33,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:33,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:33,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:34,144 INFO L124 PetriNetUnfolderBase]: 2660/5434 cut-off events. [2024-06-14 13:51:34,144 INFO L125 PetriNetUnfolderBase]: For 174596/174839 co-relation queries the response was YES. [2024-06-14 13:51:34,175 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 13:51:34,198 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 142 selfloop transitions, 26 changer transitions 0/262 dead transitions. [2024-06-14 13:51:34,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 262 transitions, 3400 flow [2024-06-14 13:51:34,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:34,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:34,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 239 transitions. [2024-06-14 13:51:34,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7029411764705882 [2024-06-14 13:51:34,199 INFO L175 Difference]: Start difference. First operand has 174 places, 223 transitions, 2602 flow. Second operand 5 states and 239 transitions. [2024-06-14 13:51:34,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 262 transitions, 3400 flow [2024-06-14 13:51:34,408 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 13:51:34,411 INFO L231 Difference]: Finished difference. Result has 179 places, 224 transitions, 2653 flow [2024-06-14 13:51:34,411 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 13:51:34,412 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 118 predicate places. [2024-06-14 13:51:34,412 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 224 transitions, 2653 flow [2024-06-14 13:51:34,412 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 13:51:34,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:34,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] [2024-06-14 13:51:34,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 13:51:34,413 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 13:51:34,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:34,413 INFO L85 PathProgramCache]: Analyzing trace with hash -142289907, now seen corresponding path program 1 times [2024-06-14 13:51:34,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:34,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202456886] [2024-06-14 13:51:34,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:34,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:34,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:34,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:34,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202456886] [2024-06-14 13:51:34,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202456886] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:34,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:34,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:34,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756897580] [2024-06-14 13:51:34,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:34,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:34,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:34,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:34,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:34,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:34,587 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 13:51:34,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:34,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:34,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:35,255 INFO L124 PetriNetUnfolderBase]: 2687/5489 cut-off events. [2024-06-14 13:51:35,256 INFO L125 PetriNetUnfolderBase]: For 188372/188629 co-relation queries the response was YES. [2024-06-14 13:51:35,284 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 13:51:35,305 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 127 selfloop transitions, 29 changer transitions 0/250 dead transitions. [2024-06-14 13:51:35,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 250 transitions, 3286 flow [2024-06-14 13:51:35,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:35,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:35,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 236 transitions. [2024-06-14 13:51:35,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6941176470588235 [2024-06-14 13:51:35,306 INFO L175 Difference]: Start difference. First operand has 179 places, 224 transitions, 2653 flow. Second operand 5 states and 236 transitions. [2024-06-14 13:51:35,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 250 transitions, 3286 flow [2024-06-14 13:51:35,618 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 13:51:35,621 INFO L231 Difference]: Finished difference. Result has 181 places, 228 transitions, 2745 flow [2024-06-14 13:51:35,621 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 13:51:35,622 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 120 predicate places. [2024-06-14 13:51:35,622 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 228 transitions, 2745 flow [2024-06-14 13:51:35,622 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 13:51:35,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:35,622 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 13:51:35,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 13:51:35,623 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 13:51:35,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:35,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1924012341, now seen corresponding path program 1 times [2024-06-14 13:51:35,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:35,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617101565] [2024-06-14 13:51:35,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:35,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:35,675 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 13:51:35,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:35,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617101565] [2024-06-14 13:51:35,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617101565] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:35,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:35,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 13:51:35,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252259400] [2024-06-14 13:51:35,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:35,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 13:51:35,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:35,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 13:51:35,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 13:51:35,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 68 [2024-06-14 13:51:35,711 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 13:51:35,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:35,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 68 [2024-06-14 13:51:35,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:36,320 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 13:51:36,321 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-06-14 13:51:36,321 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-06-14 13:51:36,321 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-14 13:51:36,321 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-06-14 13:51:36,392 INFO L124 PetriNetUnfolderBase]: 2952/5814 cut-off events. [2024-06-14 13:51:36,392 INFO L125 PetriNetUnfolderBase]: For 116499/117327 co-relation queries the response was YES. [2024-06-14 13:51:36,424 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 13:51:36,446 INFO L140 encePairwiseOnDemand]: 54/68 looper letters, 114 selfloop transitions, 26 changer transitions 1/274 dead transitions. [2024-06-14 13:51:36,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 274 transitions, 3338 flow [2024-06-14 13:51:36,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:36,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:36,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2024-06-14 13:51:36,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6588235294117647 [2024-06-14 13:51:36,447 INFO L175 Difference]: Start difference. First operand has 181 places, 228 transitions, 2745 flow. Second operand 5 states and 224 transitions. [2024-06-14 13:51:36,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 274 transitions, 3338 flow [2024-06-14 13:51:36,644 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 13:51:36,648 INFO L231 Difference]: Finished difference. Result has 187 places, 233 transitions, 2825 flow [2024-06-14 13:51:36,648 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 13:51:36,648 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 126 predicate places. [2024-06-14 13:51:36,648 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 233 transitions, 2825 flow [2024-06-14 13:51:36,649 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 13:51:36,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:36,649 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 13:51:36,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 13:51:36,649 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 13:51:36,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:36,649 INFO L85 PathProgramCache]: Analyzing trace with hash 828603239, now seen corresponding path program 2 times [2024-06-14 13:51:36,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:36,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896747633] [2024-06-14 13:51:36,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:36,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:36,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:36,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:36,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896747633] [2024-06-14 13:51:36,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896747633] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:36,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:36,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:36,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621932228] [2024-06-14 13:51:36,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:36,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:36,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:36,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:36,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:36,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:36,774 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 13:51:36,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:36,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:36,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:37,461 INFO L124 PetriNetUnfolderBase]: 2610/5446 cut-off events. [2024-06-14 13:51:37,461 INFO L125 PetriNetUnfolderBase]: For 204745/204999 co-relation queries the response was YES. [2024-06-14 13:51:37,491 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 13:51:37,511 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 118 selfloop transitions, 43 changer transitions 0/261 dead transitions. [2024-06-14 13:51:37,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 261 transitions, 3487 flow [2024-06-14 13:51:37,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:37,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:37,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 239 transitions. [2024-06-14 13:51:37,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7029411764705882 [2024-06-14 13:51:37,512 INFO L175 Difference]: Start difference. First operand has 187 places, 233 transitions, 2825 flow. Second operand 5 states and 239 transitions. [2024-06-14 13:51:37,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 261 transitions, 3487 flow [2024-06-14 13:51:37,759 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 13:51:37,762 INFO L231 Difference]: Finished difference. Result has 193 places, 240 transitions, 3083 flow [2024-06-14 13:51:37,763 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 13:51:37,763 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 132 predicate places. [2024-06-14 13:51:37,763 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 240 transitions, 3083 flow [2024-06-14 13:51:37,763 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 13:51:37,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:37,764 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 13:51:37,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 13:51:37,764 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 13:51:37,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:37,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1602497195, now seen corresponding path program 1 times [2024-06-14 13:51:37,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:37,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098425856] [2024-06-14 13:51:37,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:37,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:37,816 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 13:51:37,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:37,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098425856] [2024-06-14 13:51:37,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098425856] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:37,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:37,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:37,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784797266] [2024-06-14 13:51:37,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:37,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:37,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:37,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:37,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:37,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:37,861 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 13:51:37,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:37,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:37,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:38,546 INFO L124 PetriNetUnfolderBase]: 2673/5587 cut-off events. [2024-06-14 13:51:38,546 INFO L125 PetriNetUnfolderBase]: For 217221/217472 co-relation queries the response was YES. [2024-06-14 13:51:38,577 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 13:51:38,599 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 121 selfloop transitions, 45 changer transitions 0/266 dead transitions. [2024-06-14 13:51:38,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 266 transitions, 3721 flow [2024-06-14 13:51:38,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:38,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:38,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2024-06-14 13:51:38,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-06-14 13:51:38,600 INFO L175 Difference]: Start difference. First operand has 193 places, 240 transitions, 3083 flow. Second operand 5 states and 240 transitions. [2024-06-14 13:51:38,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 266 transitions, 3721 flow [2024-06-14 13:51:38,840 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 13:51:38,843 INFO L231 Difference]: Finished difference. Result has 196 places, 244 transitions, 3167 flow [2024-06-14 13:51:38,843 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 13:51:38,843 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 135 predicate places. [2024-06-14 13:51:38,844 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 244 transitions, 3167 flow [2024-06-14 13:51:38,844 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 13:51:38,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:38,844 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 13:51:38,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 13:51:38,844 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 13:51:38,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:38,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1601784815, now seen corresponding path program 2 times [2024-06-14 13:51:38,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:38,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723279228] [2024-06-14 13:51:38,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:38,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:38,896 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 13:51:38,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:38,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723279228] [2024-06-14 13:51:38,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723279228] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:38,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:38,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:38,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361821063] [2024-06-14 13:51:38,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:38,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:38,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:38,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:38,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:38,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:38,937 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 13:51:38,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:38,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:38,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:39,637 INFO L124 PetriNetUnfolderBase]: 2626/5498 cut-off events. [2024-06-14 13:51:39,638 INFO L125 PetriNetUnfolderBase]: For 225747/225957 co-relation queries the response was YES. [2024-06-14 13:51:39,669 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 13:51:39,691 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 149 selfloop transitions, 25 changer transitions 0/274 dead transitions. [2024-06-14 13:51:39,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 274 transitions, 3900 flow [2024-06-14 13:51:39,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:39,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:39,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2024-06-14 13:51:39,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-06-14 13:51:39,693 INFO L175 Difference]: Start difference. First operand has 196 places, 244 transitions, 3167 flow. Second operand 5 states and 240 transitions. [2024-06-14 13:51:39,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 274 transitions, 3900 flow [2024-06-14 13:51:39,948 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 13:51:39,951 INFO L231 Difference]: Finished difference. Result has 199 places, 248 transitions, 3219 flow [2024-06-14 13:51:39,952 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 13:51:39,952 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 138 predicate places. [2024-06-14 13:51:39,952 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 248 transitions, 3219 flow [2024-06-14 13:51:39,952 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 13:51:39,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:39,953 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 13:51:39,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 13:51:39,953 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 13:51:39,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:39,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1949779479, now seen corresponding path program 1 times [2024-06-14 13:51:39,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:39,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902721868] [2024-06-14 13:51:39,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:39,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:40,003 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 13:51:40,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:40,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902721868] [2024-06-14 13:51:40,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902721868] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:40,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:40,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:40,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957361907] [2024-06-14 13:51:40,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:40,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:40,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:40,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:40,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:40,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:40,051 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 13:51:40,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:40,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:40,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:40,824 INFO L124 PetriNetUnfolderBase]: 2642/5517 cut-off events. [2024-06-14 13:51:40,825 INFO L125 PetriNetUnfolderBase]: For 236961/237216 co-relation queries the response was YES. [2024-06-14 13:51:40,865 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 13:51:40,892 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 118 selfloop transitions, 53 changer transitions 0/271 dead transitions. [2024-06-14 13:51:40,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 271 transitions, 3848 flow [2024-06-14 13:51:40,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:40,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 238 transitions. [2024-06-14 13:51:40,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-06-14 13:51:40,893 INFO L175 Difference]: Start difference. First operand has 199 places, 248 transitions, 3219 flow. Second operand 5 states and 238 transitions. [2024-06-14 13:51:40,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 271 transitions, 3848 flow [2024-06-14 13:51:41,160 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 13:51:41,163 INFO L231 Difference]: Finished difference. Result has 201 places, 251 transitions, 3293 flow [2024-06-14 13:51:41,163 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 13:51:41,164 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 140 predicate places. [2024-06-14 13:51:41,164 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 251 transitions, 3293 flow [2024-06-14 13:51:41,164 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 13:51:41,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:41,164 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 13:51:41,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 13:51:41,165 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 13:51:41,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:41,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1924849403, now seen corresponding path program 2 times [2024-06-14 13:51:41,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:41,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243395308] [2024-06-14 13:51:41,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:41,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:41,216 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 13:51:41,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:41,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243395308] [2024-06-14 13:51:41,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243395308] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:41,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:41,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:41,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873637116] [2024-06-14 13:51:41,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:41,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:41,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:41,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:41,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:41,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:41,260 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 13:51:41,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:41,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:41,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:41,939 INFO L124 PetriNetUnfolderBase]: 2565/5369 cut-off events. [2024-06-14 13:51:41,940 INFO L125 PetriNetUnfolderBase]: For 245604/245848 co-relation queries the response was YES. [2024-06-14 13:51:41,971 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 13:51:41,994 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 132 selfloop transitions, 42 changer transitions 0/274 dead transitions. [2024-06-14 13:51:41,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 274 transitions, 3894 flow [2024-06-14 13:51:41,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:41,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:41,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 241 transitions. [2024-06-14 13:51:41,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7088235294117647 [2024-06-14 13:51:41,995 INFO L175 Difference]: Start difference. First operand has 201 places, 251 transitions, 3293 flow. Second operand 5 states and 241 transitions. [2024-06-14 13:51:41,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 274 transitions, 3894 flow [2024-06-14 13:51:42,275 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 13:51:42,279 INFO L231 Difference]: Finished difference. Result has 204 places, 252 transitions, 3317 flow [2024-06-14 13:51:42,279 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 13:51:42,279 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 143 predicate places. [2024-06-14 13:51:42,279 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 252 transitions, 3317 flow [2024-06-14 13:51:42,280 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 13:51:42,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:42,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] [2024-06-14 13:51:42,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 13:51:42,280 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 13:51:42,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:42,280 INFO L85 PathProgramCache]: Analyzing trace with hash -646318099, now seen corresponding path program 2 times [2024-06-14 13:51:42,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:42,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846236100] [2024-06-14 13:51:42,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:42,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:42,297 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 13:51:42,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:42,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846236100] [2024-06-14 13:51:42,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846236100] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:42,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:42,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 13:51:42,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706830815] [2024-06-14 13:51:42,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:42,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 13:51:42,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:42,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 13:51:42,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 13:51:42,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 68 [2024-06-14 13:51:42,320 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 13:51:42,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:42,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 68 [2024-06-14 13:51:42,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:42,894 INFO L124 PetriNetUnfolderBase]: 1792/3888 cut-off events. [2024-06-14 13:51:42,894 INFO L125 PetriNetUnfolderBase]: For 94468/94859 co-relation queries the response was YES. [2024-06-14 13:51:42,914 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 13:51:42,926 INFO L140 encePairwiseOnDemand]: 52/68 looper letters, 111 selfloop transitions, 45 changer transitions 1/284 dead transitions. [2024-06-14 13:51:42,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 284 transitions, 3749 flow [2024-06-14 13:51:42,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:42,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:42,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 239 transitions. [2024-06-14 13:51:42,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7029411764705882 [2024-06-14 13:51:42,928 INFO L175 Difference]: Start difference. First operand has 204 places, 252 transitions, 3317 flow. Second operand 5 states and 239 transitions. [2024-06-14 13:51:42,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 284 transitions, 3749 flow [2024-06-14 13:51:43,108 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 13:51:43,111 INFO L231 Difference]: Finished difference. Result has 207 places, 250 transitions, 3278 flow [2024-06-14 13:51:43,111 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 13:51:43,112 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 146 predicate places. [2024-06-14 13:51:43,112 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 250 transitions, 3278 flow [2024-06-14 13:51:43,112 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 13:51:43,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:43,112 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 13:51:43,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 13:51:43,113 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 13:51:43,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:43,113 INFO L85 PathProgramCache]: Analyzing trace with hash -150218033, now seen corresponding path program 3 times [2024-06-14 13:51:43,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:43,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350148423] [2024-06-14 13:51:43,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:43,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:43,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:43,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:43,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350148423] [2024-06-14 13:51:43,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350148423] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:43,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:43,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 13:51:43,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498030323] [2024-06-14 13:51:43,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:43,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 13:51:43,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:43,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 13:51:43,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 13:51:43,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 68 [2024-06-14 13:51:43,154 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 13:51:43,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:43,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 68 [2024-06-14 13:51:43,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:43,588 INFO L124 PetriNetUnfolderBase]: 1490/3287 cut-off events. [2024-06-14 13:51:43,589 INFO L125 PetriNetUnfolderBase]: For 74186/74488 co-relation queries the response was YES. [2024-06-14 13:51:43,607 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 13:51:43,617 INFO L140 encePairwiseOnDemand]: 50/68 looper letters, 110 selfloop transitions, 70 changer transitions 1/289 dead transitions. [2024-06-14 13:51:43,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 289 transitions, 3880 flow [2024-06-14 13:51:43,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:43,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:43,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 239 transitions. [2024-06-14 13:51:43,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7029411764705882 [2024-06-14 13:51:43,619 INFO L175 Difference]: Start difference. First operand has 207 places, 250 transitions, 3278 flow. Second operand 5 states and 239 transitions. [2024-06-14 13:51:43,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 289 transitions, 3880 flow [2024-06-14 13:51:43,768 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 13:51:43,772 INFO L231 Difference]: Finished difference. Result has 209 places, 254 transitions, 3339 flow [2024-06-14 13:51:43,772 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 13:51:43,772 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 148 predicate places. [2024-06-14 13:51:43,773 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 254 transitions, 3339 flow [2024-06-14 13:51:43,773 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 13:51:43,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:43,773 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 13:51:43,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 13:51:43,773 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 13:51:43,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:43,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1469484678, now seen corresponding path program 1 times [2024-06-14 13:51:43,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:43,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717819511] [2024-06-14 13:51:43,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:43,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:43,822 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 13:51:43,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:43,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717819511] [2024-06-14 13:51:43,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717819511] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:43,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:43,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:43,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833406208] [2024-06-14 13:51:43,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:43,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:43,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:43,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:43,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:43,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:43,872 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 13:51:43,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:43,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:43,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:44,288 INFO L124 PetriNetUnfolderBase]: 1410/3265 cut-off events. [2024-06-14 13:51:44,288 INFO L125 PetriNetUnfolderBase]: For 127844/128013 co-relation queries the response was YES. [2024-06-14 13:51:44,308 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 13:51:44,321 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 135 selfloop transitions, 25 changer transitions 2/274 dead transitions. [2024-06-14 13:51:44,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 274 transitions, 3891 flow [2024-06-14 13:51:44,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:44,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:44,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 230 transitions. [2024-06-14 13:51:44,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2024-06-14 13:51:44,323 INFO L175 Difference]: Start difference. First operand has 209 places, 254 transitions, 3339 flow. Second operand 5 states and 230 transitions. [2024-06-14 13:51:44,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 274 transitions, 3891 flow [2024-06-14 13:51:44,510 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 13:51:44,514 INFO L231 Difference]: Finished difference. Result has 215 places, 256 transitions, 3438 flow [2024-06-14 13:51:44,514 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 13:51:44,515 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 154 predicate places. [2024-06-14 13:51:44,515 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 256 transitions, 3438 flow [2024-06-14 13:51:44,515 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 13:51:44,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:44,515 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 13:51:44,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 13:51:44,515 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 13:51:44,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:44,516 INFO L85 PathProgramCache]: Analyzing trace with hash 144859089, now seen corresponding path program 1 times [2024-06-14 13:51:44,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:44,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388454306] [2024-06-14 13:51:44,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:44,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:44,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:44,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:44,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388454306] [2024-06-14 13:51:44,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388454306] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:44,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:44,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 13:51:44,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19892297] [2024-06-14 13:51:44,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:44,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:44,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:44,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:44,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:44,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:44,629 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 13:51:44,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:44,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:44,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:45,190 INFO L124 PetriNetUnfolderBase]: 1384/3191 cut-off events. [2024-06-14 13:51:45,191 INFO L125 PetriNetUnfolderBase]: For 128647/128843 co-relation queries the response was YES. [2024-06-14 13:51:45,210 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 13:51:45,222 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 135 selfloop transitions, 30 changer transitions 2/279 dead transitions. [2024-06-14 13:51:45,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 279 transitions, 4068 flow [2024-06-14 13:51:45,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:45,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:45,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 234 transitions. [2024-06-14 13:51:45,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6882352941176471 [2024-06-14 13:51:45,224 INFO L175 Difference]: Start difference. First operand has 215 places, 256 transitions, 3438 flow. Second operand 5 states and 234 transitions. [2024-06-14 13:51:45,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 279 transitions, 4068 flow [2024-06-14 13:51:45,427 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 13:51:45,430 INFO L231 Difference]: Finished difference. Result has 214 places, 257 transitions, 3396 flow [2024-06-14 13:51:45,430 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 13:51:45,431 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 153 predicate places. [2024-06-14 13:51:45,431 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 257 transitions, 3396 flow [2024-06-14 13:51:45,431 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 13:51:45,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:45,432 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 13:51:45,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 13:51:45,432 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 13:51:45,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:45,432 INFO L85 PathProgramCache]: Analyzing trace with hash -449486491, now seen corresponding path program 2 times [2024-06-14 13:51:45,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:45,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505902709] [2024-06-14 13:51:45,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:45,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:45,494 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 13:51:45,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:45,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505902709] [2024-06-14 13:51:45,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505902709] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:45,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:45,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 13:51:45,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777326157] [2024-06-14 13:51:45,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:45,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:45,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:45,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:45,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:45,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:45,540 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 13:51:45,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:45,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:45,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:46,080 INFO L124 PetriNetUnfolderBase]: 1408/3242 cut-off events. [2024-06-14 13:51:46,080 INFO L125 PetriNetUnfolderBase]: For 126222/126427 co-relation queries the response was YES. [2024-06-14 13:51:46,104 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 13:51:46,118 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 139 selfloop transitions, 28 changer transitions 2/281 dead transitions. [2024-06-14 13:51:46,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 281 transitions, 4016 flow [2024-06-14 13:51:46,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:46,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:46,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 235 transitions. [2024-06-14 13:51:46,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6911764705882353 [2024-06-14 13:51:46,120 INFO L175 Difference]: Start difference. First operand has 214 places, 257 transitions, 3396 flow. Second operand 5 states and 235 transitions. [2024-06-14 13:51:46,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 281 transitions, 4016 flow [2024-06-14 13:51:46,309 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 13:51:46,313 INFO L231 Difference]: Finished difference. Result has 216 places, 257 transitions, 3385 flow [2024-06-14 13:51:46,313 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 13:51:46,313 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 155 predicate places. [2024-06-14 13:51:46,314 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 257 transitions, 3385 flow [2024-06-14 13:51:46,314 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 13:51:46,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:46,314 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 13:51:46,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 13:51:46,314 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 13:51:46,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:46,315 INFO L85 PathProgramCache]: Analyzing trace with hash 434587141, now seen corresponding path program 1 times [2024-06-14 13:51:46,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:46,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726301022] [2024-06-14 13:51:46,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:46,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:46,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:46,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:46,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726301022] [2024-06-14 13:51:46,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726301022] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:46,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:46,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 13:51:46,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694450874] [2024-06-14 13:51:46,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:46,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:46,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:46,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:46,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:46,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:46,460 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 13:51:46,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:46,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:46,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:46,975 INFO L124 PetriNetUnfolderBase]: 1383/3147 cut-off events. [2024-06-14 13:51:46,975 INFO L125 PetriNetUnfolderBase]: For 126978/127195 co-relation queries the response was YES. [2024-06-14 13:51:46,997 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 13:51:47,013 INFO L140 encePairwiseOnDemand]: 63/68 looper letters, 134 selfloop transitions, 25 changer transitions 0/271 dead transitions. [2024-06-14 13:51:47,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 271 transitions, 3825 flow [2024-06-14 13:51:47,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:47,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:47,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 227 transitions. [2024-06-14 13:51:47,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6676470588235294 [2024-06-14 13:51:47,014 INFO L175 Difference]: Start difference. First operand has 216 places, 257 transitions, 3385 flow. Second operand 5 states and 227 transitions. [2024-06-14 13:51:47,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 271 transitions, 3825 flow [2024-06-14 13:51:47,212 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 13:51:47,215 INFO L231 Difference]: Finished difference. Result has 214 places, 258 transitions, 3341 flow [2024-06-14 13:51:47,215 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 13:51:47,216 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 153 predicate places. [2024-06-14 13:51:47,216 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 258 transitions, 3341 flow [2024-06-14 13:51:47,216 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 13:51:47,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:47,216 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 13:51:47,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 13:51:47,217 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 13:51:47,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:47,217 INFO L85 PathProgramCache]: Analyzing trace with hash 869602939, now seen corresponding path program 2 times [2024-06-14 13:51:47,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:47,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717167474] [2024-06-14 13:51:47,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:47,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:47,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:47,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:47,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717167474] [2024-06-14 13:51:47,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717167474] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:47,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:47,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 13:51:47,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129272002] [2024-06-14 13:51:47,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:47,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:47,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:47,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:47,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:47,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:47,329 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 13:51:47,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:47,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:47,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:47,841 INFO L124 PetriNetUnfolderBase]: 1433/3273 cut-off events. [2024-06-14 13:51:47,841 INFO L125 PetriNetUnfolderBase]: For 122648/122876 co-relation queries the response was YES. [2024-06-14 13:51:47,865 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 13:51:47,879 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 150 selfloop transitions, 15 changer transitions 1/278 dead transitions. [2024-06-14 13:51:47,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 278 transitions, 3950 flow [2024-06-14 13:51:47,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:47,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:47,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 228 transitions. [2024-06-14 13:51:47,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6705882352941176 [2024-06-14 13:51:47,881 INFO L175 Difference]: Start difference. First operand has 214 places, 258 transitions, 3341 flow. Second operand 5 states and 228 transitions. [2024-06-14 13:51:47,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 278 transitions, 3950 flow [2024-06-14 13:51:48,072 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 13:51:48,075 INFO L231 Difference]: Finished difference. Result has 217 places, 259 transitions, 3361 flow [2024-06-14 13:51:48,076 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 13:51:48,076 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 156 predicate places. [2024-06-14 13:51:48,076 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 259 transitions, 3361 flow [2024-06-14 13:51:48,076 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 13:51:48,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:48,076 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 13:51:48,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 13:51:48,077 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 13:51:48,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:48,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1208615487, now seen corresponding path program 3 times [2024-06-14 13:51:48,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:48,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772445982] [2024-06-14 13:51:48,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:48,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:48,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:48,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:48,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772445982] [2024-06-14 13:51:48,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772445982] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:48,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:48,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 13:51:48,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503144763] [2024-06-14 13:51:48,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:48,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:48,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:48,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:48,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:48,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:48,171 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 13:51:48,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:48,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:48,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:48,607 INFO L124 PetriNetUnfolderBase]: 1425/3260 cut-off events. [2024-06-14 13:51:48,608 INFO L125 PetriNetUnfolderBase]: For 120998/121228 co-relation queries the response was YES. [2024-06-14 13:51:48,629 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 13:51:48,641 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 141 selfloop transitions, 24 changer transitions 2/279 dead transitions. [2024-06-14 13:51:48,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 279 transitions, 3975 flow [2024-06-14 13:51:48,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:48,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:48,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 228 transitions. [2024-06-14 13:51:48,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6705882352941176 [2024-06-14 13:51:48,642 INFO L175 Difference]: Start difference. First operand has 217 places, 259 transitions, 3361 flow. Second operand 5 states and 228 transitions. [2024-06-14 13:51:48,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 279 transitions, 3975 flow [2024-06-14 13:51:48,841 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 13:51:48,845 INFO L231 Difference]: Finished difference. Result has 219 places, 259 transitions, 3366 flow [2024-06-14 13:51:48,845 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 13:51:48,845 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 158 predicate places. [2024-06-14 13:51:48,846 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 259 transitions, 3366 flow [2024-06-14 13:51:48,846 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 13:51:48,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:48,846 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 13:51:48,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 13:51:48,846 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 13:51:48,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:48,847 INFO L85 PathProgramCache]: Analyzing trace with hash 175927902, now seen corresponding path program 1 times [2024-06-14 13:51:48,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:48,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77937119] [2024-06-14 13:51:48,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:48,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:48,894 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 13:51:48,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:48,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77937119] [2024-06-14 13:51:48,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77937119] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:48,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:48,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:48,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746842163] [2024-06-14 13:51:48,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:48,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:48,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:48,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:48,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:48,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:48,951 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 13:51:48,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:48,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:48,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:49,467 INFO L124 PetriNetUnfolderBase]: 1433/3276 cut-off events. [2024-06-14 13:51:49,467 INFO L125 PetriNetUnfolderBase]: For 125726/125950 co-relation queries the response was YES. [2024-06-14 13:51:49,484 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 13:51:49,496 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 135 selfloop transitions, 35 changer transitions 1/283 dead transitions. [2024-06-14 13:51:49,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 283 transitions, 4100 flow [2024-06-14 13:51:49,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:49,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:49,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 230 transitions. [2024-06-14 13:51:49,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2024-06-14 13:51:49,497 INFO L175 Difference]: Start difference. First operand has 219 places, 259 transitions, 3366 flow. Second operand 5 states and 230 transitions. [2024-06-14 13:51:49,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 283 transitions, 4100 flow [2024-06-14 13:51:49,702 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 13:51:49,706 INFO L231 Difference]: Finished difference. Result has 221 places, 265 transitions, 3538 flow [2024-06-14 13:51:49,706 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 13:51:49,706 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 160 predicate places. [2024-06-14 13:51:49,706 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 265 transitions, 3538 flow [2024-06-14 13:51:49,707 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 13:51:49,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:49,707 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 13:51:49,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 13:51:49,707 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 13:51:49,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:49,707 INFO L85 PathProgramCache]: Analyzing trace with hash 175926910, now seen corresponding path program 1 times [2024-06-14 13:51:49,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:49,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391925225] [2024-06-14 13:51:49,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:49,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:49,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:49,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:49,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391925225] [2024-06-14 13:51:49,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391925225] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:49,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:49,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 13:51:49,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849395121] [2024-06-14 13:51:49,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:49,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 13:51:49,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:49,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 13:51:49,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 13:51:49,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 68 [2024-06-14 13:51:49,749 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 13:51:49,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:49,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 68 [2024-06-14 13:51:49,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:50,148 INFO L124 PetriNetUnfolderBase]: 1317/2929 cut-off events. [2024-06-14 13:51:50,148 INFO L125 PetriNetUnfolderBase]: For 56965/57209 co-relation queries the response was YES. [2024-06-14 13:51:50,166 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 13:51:50,175 INFO L140 encePairwiseOnDemand]: 55/68 looper letters, 109 selfloop transitions, 35 changer transitions 1/259 dead transitions. [2024-06-14 13:51:50,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 259 transitions, 3663 flow [2024-06-14 13:51:50,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:50,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 226 transitions. [2024-06-14 13:51:50,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6647058823529411 [2024-06-14 13:51:50,176 INFO L175 Difference]: Start difference. First operand has 221 places, 265 transitions, 3538 flow. Second operand 5 states and 226 transitions. [2024-06-14 13:51:50,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 259 transitions, 3663 flow [2024-06-14 13:51:50,342 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 13:51:50,345 INFO L231 Difference]: Finished difference. Result has 218 places, 238 transitions, 3093 flow [2024-06-14 13:51:50,345 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 13:51:50,346 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 157 predicate places. [2024-06-14 13:51:50,346 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 238 transitions, 3093 flow [2024-06-14 13:51:50,347 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 13:51:50,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:50,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, 1] [2024-06-14 13:51:50,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 13:51:50,348 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 13:51:50,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:50,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1958798206, now seen corresponding path program 1 times [2024-06-14 13:51:50,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:50,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408951193] [2024-06-14 13:51:50,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:50,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:50,409 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 13:51:50,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:50,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408951193] [2024-06-14 13:51:50,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408951193] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:50,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:50,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:50,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253370190] [2024-06-14 13:51:50,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:50,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:50,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:50,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:50,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:50,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:50,451 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 13:51:50,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:50,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:50,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:50,824 INFO L124 PetriNetUnfolderBase]: 1171/2776 cut-off events. [2024-06-14 13:51:50,824 INFO L125 PetriNetUnfolderBase]: For 91749/91921 co-relation queries the response was YES. [2024-06-14 13:51:50,842 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 13:51:50,852 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 125 selfloop transitions, 36 changer transitions 1/259 dead transitions. [2024-06-14 13:51:50,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 259 transitions, 3716 flow [2024-06-14 13:51:50,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:50,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:50,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 233 transitions. [2024-06-14 13:51:50,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6852941176470588 [2024-06-14 13:51:50,853 INFO L175 Difference]: Start difference. First operand has 218 places, 238 transitions, 3093 flow. Second operand 5 states and 233 transitions. [2024-06-14 13:51:50,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 259 transitions, 3716 flow [2024-06-14 13:51:51,060 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 13:51:51,063 INFO L231 Difference]: Finished difference. Result has 221 places, 242 transitions, 3203 flow [2024-06-14 13:51:51,063 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 13:51:51,064 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 160 predicate places. [2024-06-14 13:51:51,064 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 242 transitions, 3203 flow [2024-06-14 13:51:51,064 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 13:51:51,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:51,064 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 13:51:51,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 13:51:51,065 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 13:51:51,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:51,065 INFO L85 PathProgramCache]: Analyzing trace with hash -2146703006, now seen corresponding path program 2 times [2024-06-14 13:51:51,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:51,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561116660] [2024-06-14 13:51:51,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:51,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:51,112 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 13:51:51,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:51,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561116660] [2024-06-14 13:51:51,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561116660] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:51,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:51,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:51,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064883530] [2024-06-14 13:51:51,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:51,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:51,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:51,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:51,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:51,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:51,152 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 13:51:51,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:51,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:51,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:51,523 INFO L124 PetriNetUnfolderBase]: 1164/2768 cut-off events. [2024-06-14 13:51:51,523 INFO L125 PetriNetUnfolderBase]: For 93347/93525 co-relation queries the response was YES. [2024-06-14 13:51:51,540 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 13:51:51,549 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 132 selfloop transitions, 32 changer transitions 1/262 dead transitions. [2024-06-14 13:51:51,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 262 transitions, 3829 flow [2024-06-14 13:51:51,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:51,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:51,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 235 transitions. [2024-06-14 13:51:51,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6911764705882353 [2024-06-14 13:51:51,551 INFO L175 Difference]: Start difference. First operand has 221 places, 242 transitions, 3203 flow. Second operand 5 states and 235 transitions. [2024-06-14 13:51:51,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 262 transitions, 3829 flow [2024-06-14 13:51:51,736 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 13:51:51,740 INFO L231 Difference]: Finished difference. Result has 225 places, 245 transitions, 3302 flow [2024-06-14 13:51:51,740 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 13:51:51,741 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 164 predicate places. [2024-06-14 13:51:51,741 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 245 transitions, 3302 flow [2024-06-14 13:51:51,741 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 13:51:51,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:51,741 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 13:51:51,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 13:51:51,741 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 13:51:51,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:51,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1627707100, now seen corresponding path program 1 times [2024-06-14 13:51:51,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:51,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522171986] [2024-06-14 13:51:51,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:51,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:51,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:51,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:51,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522171986] [2024-06-14 13:51:51,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522171986] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:51,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:51,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:51,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181492332] [2024-06-14 13:51:51,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:51,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:51,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:51,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:51,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:51,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:51,848 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 13:51:51,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:51,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:51,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:52,238 INFO L124 PetriNetUnfolderBase]: 1174/2817 cut-off events. [2024-06-14 13:51:52,238 INFO L125 PetriNetUnfolderBase]: For 84818/84982 co-relation queries the response was YES. [2024-06-14 13:51:52,257 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 13:51:52,266 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 120 selfloop transitions, 36 changer transitions 10/261 dead transitions. [2024-06-14 13:51:52,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 261 transitions, 3843 flow [2024-06-14 13:51:52,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:52,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:52,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 231 transitions. [2024-06-14 13:51:52,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6794117647058824 [2024-06-14 13:51:52,267 INFO L175 Difference]: Start difference. First operand has 225 places, 245 transitions, 3302 flow. Second operand 5 states and 231 transitions. [2024-06-14 13:51:52,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 261 transitions, 3843 flow [2024-06-14 13:51:52,470 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 13:51:52,474 INFO L231 Difference]: Finished difference. Result has 227 places, 236 transitions, 3129 flow [2024-06-14 13:51:52,474 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 13:51:52,474 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 166 predicate places. [2024-06-14 13:51:52,474 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 236 transitions, 3129 flow [2024-06-14 13:51:52,475 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 13:51:52,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:52,475 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 13:51:52,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 13:51:52,475 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 13:51:52,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:52,475 INFO L85 PathProgramCache]: Analyzing trace with hash 800377240, now seen corresponding path program 2 times [2024-06-14 13:51:52,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:52,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048444695] [2024-06-14 13:51:52,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:52,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:52,522 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 13:51:52,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:52,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048444695] [2024-06-14 13:51:52,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048444695] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:52,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:52,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:52,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482831761] [2024-06-14 13:51:52,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:52,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:52,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:52,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:52,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:52,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:52,567 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 13:51:52,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:52,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:52,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:52,919 INFO L124 PetriNetUnfolderBase]: 1134/2746 cut-off events. [2024-06-14 13:51:52,919 INFO L125 PetriNetUnfolderBase]: For 78773/78935 co-relation queries the response was YES. [2024-06-14 13:51:52,936 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 13:51:52,943 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 108 selfloop transitions, 24 changer transitions 37/249 dead transitions. [2024-06-14 13:51:52,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 249 transitions, 3641 flow [2024-06-14 13:51:52,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:52,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:52,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 228 transitions. [2024-06-14 13:51:52,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6705882352941176 [2024-06-14 13:51:52,945 INFO L175 Difference]: Start difference. First operand has 227 places, 236 transitions, 3129 flow. Second operand 5 states and 228 transitions. [2024-06-14 13:51:52,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 249 transitions, 3641 flow [2024-06-14 13:51:53,127 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 13:51:53,130 INFO L231 Difference]: Finished difference. Result has 226 places, 200 transitions, 2557 flow [2024-06-14 13:51:53,131 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 13:51:53,131 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 165 predicate places. [2024-06-14 13:51:53,131 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 200 transitions, 2557 flow [2024-06-14 13:51:53,131 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 13:51:53,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:53,132 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 13:51:53,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 13:51:53,132 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 13:51:53,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:53,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1435066758, now seen corresponding path program 2 times [2024-06-14 13:51:53,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:53,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142967407] [2024-06-14 13:51:53,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:53,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:53,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:53,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142967407] [2024-06-14 13:51:53,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142967407] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:53,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:53,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 13:51:53,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546831705] [2024-06-14 13:51:53,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:53,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 13:51:53,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:53,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 13:51:53,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 13:51:53,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 68 [2024-06-14 13:51:53,173 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 13:51:53,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:53,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 68 [2024-06-14 13:51:53,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:53,411 INFO L124 PetriNetUnfolderBase]: 777/1860 cut-off events. [2024-06-14 13:51:53,411 INFO L125 PetriNetUnfolderBase]: For 28187/28314 co-relation queries the response was YES. [2024-06-14 13:51:53,421 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 13:51:53,425 INFO L140 encePairwiseOnDemand]: 58/68 looper letters, 65 selfloop transitions, 0 changer transitions 49/170 dead transitions. [2024-06-14 13:51:53,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 170 transitions, 2289 flow [2024-06-14 13:51:53,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:53,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 213 transitions. [2024-06-14 13:51:53,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6264705882352941 [2024-06-14 13:51:53,426 INFO L175 Difference]: Start difference. First operand has 226 places, 200 transitions, 2557 flow. Second operand 5 states and 213 transitions. [2024-06-14 13:51:53,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 170 transitions, 2289 flow [2024-06-14 13:51:53,504 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 13:51:53,506 INFO L231 Difference]: Finished difference. Result has 203 places, 121 transitions, 1278 flow [2024-06-14 13:51:53,506 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 13:51:53,507 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 142 predicate places. [2024-06-14 13:51:53,507 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 121 transitions, 1278 flow [2024-06-14 13:51:53,507 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 13:51:53,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:53,507 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 13:51:53,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 13:51:53,508 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 13:51:53,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:53,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1596110998, now seen corresponding path program 2 times [2024-06-14 13:51:53,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:53,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231496579] [2024-06-14 13:51:53,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:53,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:53,561 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 13:51:53,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:53,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231496579] [2024-06-14 13:51:53,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231496579] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:53,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:53,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:53,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676423273] [2024-06-14 13:51:53,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:53,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:53,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:53,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:53,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:53,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:53,611 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 13:51:53,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:53,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:53,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:53,751 INFO L124 PetriNetUnfolderBase]: 443/1190 cut-off events. [2024-06-14 13:51:53,751 INFO L125 PetriNetUnfolderBase]: For 24832/24946 co-relation queries the response was YES. [2024-06-14 13:51:53,757 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 13:51:53,759 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 61 selfloop transitions, 9 changer transitions 34/132 dead transitions. [2024-06-14 13:51:53,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 132 transitions, 1626 flow [2024-06-14 13:51:53,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:53,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:53,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 221 transitions. [2024-06-14 13:51:53,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65 [2024-06-14 13:51:53,760 INFO L175 Difference]: Start difference. First operand has 203 places, 121 transitions, 1278 flow. Second operand 5 states and 221 transitions. [2024-06-14 13:51:53,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 132 transitions, 1626 flow [2024-06-14 13:51:53,805 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 13:51:53,806 INFO L231 Difference]: Finished difference. Result has 176 places, 90 transitions, 923 flow [2024-06-14 13:51:53,806 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 13:51:53,807 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 115 predicate places. [2024-06-14 13:51:53,807 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 90 transitions, 923 flow [2024-06-14 13:51:53,807 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 13:51:53,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:53,807 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 13:51:53,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 13:51:53,807 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 13:51:53,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:53,808 INFO L85 PathProgramCache]: Analyzing trace with hash -8001809, now seen corresponding path program 1 times [2024-06-14 13:51:53,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:53,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164986668] [2024-06-14 13:51:53,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:53,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:53,857 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 13:51:53,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:53,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164986668] [2024-06-14 13:51:53,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164986668] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:53,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:53,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 13:51:53,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807274091] [2024-06-14 13:51:53,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:53,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:53,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:53,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:53,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:53,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:53,910 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 13:51:53,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:53,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:53,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:54,019 INFO L124 PetriNetUnfolderBase]: 344/927 cut-off events. [2024-06-14 13:51:54,020 INFO L125 PetriNetUnfolderBase]: For 14147/14237 co-relation queries the response was YES. [2024-06-14 13:51:54,023 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 13:51:54,025 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 53 selfloop transitions, 22 changer transitions 2/105 dead transitions. [2024-06-14 13:51:54,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 105 transitions, 1231 flow [2024-06-14 13:51:54,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:54,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 225 transitions. [2024-06-14 13:51:54,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6617647058823529 [2024-06-14 13:51:54,026 INFO L175 Difference]: Start difference. First operand has 176 places, 90 transitions, 923 flow. Second operand 5 states and 225 transitions. [2024-06-14 13:51:54,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 105 transitions, 1231 flow [2024-06-14 13:51:54,048 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 13:51:54,049 INFO L231 Difference]: Finished difference. Result has 145 places, 90 transitions, 845 flow [2024-06-14 13:51:54,049 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 13:51:54,049 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 84 predicate places. [2024-06-14 13:51:54,050 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 90 transitions, 845 flow [2024-06-14 13:51:54,050 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 13:51:54,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:54,050 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 13:51:54,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 13:51:54,050 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 13:51:54,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:54,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1279747813, now seen corresponding path program 1 times [2024-06-14 13:51:54,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:54,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762704349] [2024-06-14 13:51:54,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:54,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:54,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 13:51:54,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:54,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762704349] [2024-06-14 13:51:54,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762704349] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:54,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:54,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 13:51:54,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383152306] [2024-06-14 13:51:54,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:54,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:54,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:54,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:54,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:54,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:54,143 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 13:51:54,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:54,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:54,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:54,239 INFO L124 PetriNetUnfolderBase]: 340/910 cut-off events. [2024-06-14 13:51:54,239 INFO L125 PetriNetUnfolderBase]: For 8854/8908 co-relation queries the response was YES. [2024-06-14 13:51:54,242 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 13:51:54,244 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 52 selfloop transitions, 19 changer transitions 2/101 dead transitions. [2024-06-14 13:51:54,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 101 transitions, 1065 flow [2024-06-14 13:51:54,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:54,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:54,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 218 transitions. [2024-06-14 13:51:54,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6411764705882353 [2024-06-14 13:51:54,245 INFO L175 Difference]: Start difference. First operand has 145 places, 90 transitions, 845 flow. Second operand 5 states and 218 transitions. [2024-06-14 13:51:54,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 101 transitions, 1065 flow [2024-06-14 13:51:54,261 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 13:51:54,262 INFO L231 Difference]: Finished difference. Result has 144 places, 90 transitions, 837 flow [2024-06-14 13:51:54,262 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 13:51:54,263 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 83 predicate places. [2024-06-14 13:51:54,263 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 90 transitions, 837 flow [2024-06-14 13:51:54,263 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 13:51:54,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:54,263 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 13:51:54,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 13:51:54,263 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 13:51:54,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:54,264 INFO L85 PathProgramCache]: Analyzing trace with hash 541357216, now seen corresponding path program 1 times [2024-06-14 13:51:54,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:54,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032110075] [2024-06-14 13:51:54,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:54,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:54,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:54,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:54,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032110075] [2024-06-14 13:51:54,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032110075] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:54,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:54,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 13:51:54,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112162348] [2024-06-14 13:51:54,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:54,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:54,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:54,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:54,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:54,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:54,364 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 13:51:54,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:54,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:54,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:54,460 INFO L124 PetriNetUnfolderBase]: 328/883 cut-off events. [2024-06-14 13:51:54,460 INFO L125 PetriNetUnfolderBase]: For 7775/7823 co-relation queries the response was YES. [2024-06-14 13:51:54,463 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 13:51:54,464 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 38 selfloop transitions, 10 changer transitions 34/104 dead transitions. [2024-06-14 13:51:54,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 104 transitions, 1071 flow [2024-06-14 13:51:54,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:54,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:54,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2024-06-14 13:51:54,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6588235294117647 [2024-06-14 13:51:54,466 INFO L175 Difference]: Start difference. First operand has 144 places, 90 transitions, 837 flow. Second operand 5 states and 224 transitions. [2024-06-14 13:51:54,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 104 transitions, 1071 flow [2024-06-14 13:51:54,479 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 13:51:54,480 INFO L231 Difference]: Finished difference. Result has 146 places, 64 transitions, 571 flow [2024-06-14 13:51:54,480 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 13:51:54,480 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 85 predicate places. [2024-06-14 13:51:54,481 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 64 transitions, 571 flow [2024-06-14 13:51:54,481 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 13:51:54,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:54,481 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 13:51:54,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 13:51:54,481 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 13:51:54,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:54,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1460216054, now seen corresponding path program 1 times [2024-06-14 13:51:54,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:54,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329282294] [2024-06-14 13:51:54,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:54,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:54,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:54,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:54,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329282294] [2024-06-14 13:51:54,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329282294] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:54,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:54,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 13:51:54,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712146715] [2024-06-14 13:51:54,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:54,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:54,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:54,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:54,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:54,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:54,583 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 13:51:54,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:54,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:54,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:54,636 INFO L124 PetriNetUnfolderBase]: 159/427 cut-off events. [2024-06-14 13:51:54,636 INFO L125 PetriNetUnfolderBase]: For 5212/5242 co-relation queries the response was YES. [2024-06-14 13:51:54,638 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 13:51:54,638 INFO L140 encePairwiseOnDemand]: 63/68 looper letters, 34 selfloop transitions, 13 changer transitions 0/69 dead transitions. [2024-06-14 13:51:54,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 69 transitions, 675 flow [2024-06-14 13:51:54,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:54,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:54,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 208 transitions. [2024-06-14 13:51:54,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.611764705882353 [2024-06-14 13:51:54,639 INFO L175 Difference]: Start difference. First operand has 146 places, 64 transitions, 571 flow. Second operand 5 states and 208 transitions. [2024-06-14 13:51:54,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 69 transitions, 675 flow [2024-06-14 13:51:54,646 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 13:51:54,647 INFO L231 Difference]: Finished difference. Result has 98 places, 64 transitions, 434 flow [2024-06-14 13:51:54,647 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 13:51:54,647 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 37 predicate places. [2024-06-14 13:51:54,647 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 64 transitions, 434 flow [2024-06-14 13:51:54,647 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 13:51:54,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:54,648 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 13:51:54,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 13:51:54,648 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 13:51:54,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:54,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1712821912, now seen corresponding path program 1 times [2024-06-14 13:51:54,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:54,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866930542] [2024-06-14 13:51:54,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:54,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:54,696 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 13:51:54,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:54,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866930542] [2024-06-14 13:51:54,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866930542] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:54,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:54,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 13:51:54,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621473610] [2024-06-14 13:51:54,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:54,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:51:54,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:54,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:51:54,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:51:54,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68 [2024-06-14 13:51:54,759 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 13:51:54,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:54,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68 [2024-06-14 13:51:54,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:54,805 INFO L124 PetriNetUnfolderBase]: 143/402 cut-off events. [2024-06-14 13:51:54,805 INFO L125 PetriNetUnfolderBase]: For 2174/2200 co-relation queries the response was YES. [2024-06-14 13:51:54,806 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 13:51:54,807 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 0 selfloop transitions, 0 changer transitions 68/68 dead transitions. [2024-06-14 13:51:54,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 68 transitions, 500 flow [2024-06-14 13:51:54,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:54,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:54,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 206 transitions. [2024-06-14 13:51:54,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6058823529411764 [2024-06-14 13:51:54,808 INFO L175 Difference]: Start difference. First operand has 98 places, 64 transitions, 434 flow. Second operand 5 states and 206 transitions. [2024-06-14 13:51:54,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 68 transitions, 500 flow [2024-06-14 13:51:54,809 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 13:51:54,810 INFO L231 Difference]: Finished difference. Result has 80 places, 0 transitions, 0 flow [2024-06-14 13:51:54,810 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 13:51:54,810 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 19 predicate places. [2024-06-14 13:51:54,810 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 0 transitions, 0 flow [2024-06-14 13:51:54,811 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 13:51:54,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-14 13:51:54,814 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-14 13:51:54,814 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-14 13:51:54,814 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-14 13:51:54,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 13:51:54,814 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 13:51:54,817 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-14 13:51:54,817 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-14 13:51:54,819 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-14 13:51:54,820 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-14 13:51:54,820 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.06 01:51:54 BasicIcfg [2024-06-14 13:51:54,820 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-14 13:51:54,821 INFO L158 Benchmark]: Toolchain (without parser) took 40078.57ms. Allocated memory was 157.3MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 96.6MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 534.6MB. Max. memory is 16.1GB. [2024-06-14 13:51:54,821 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 157.3MB. Free memory was 91.0MB in the beginning and 90.8MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-14 13:51:54,821 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 157.3MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-14 13:51:54,821 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.79ms. Allocated memory was 157.3MB in the beginning and 245.4MB in the end (delta: 88.1MB). Free memory was 96.3MB in the beginning and 206.4MB in the end (delta: -110.2MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2024-06-14 13:51:54,821 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.84ms. Allocated memory is still 245.4MB. Free memory was 206.4MB in the beginning and 204.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-14 13:51:54,822 INFO L158 Benchmark]: Boogie Preprocessor took 63.81ms. Allocated memory is still 245.4MB. Free memory was 204.3MB in the beginning and 202.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-14 13:51:54,822 INFO L158 Benchmark]: RCFGBuilder took 401.37ms. Allocated memory is still 245.4MB. Free memory was 202.3MB in the beginning and 177.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-06-14 13:51:54,822 INFO L158 Benchmark]: TraceAbstraction took 39031.69ms. Allocated memory was 245.4MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 176.0MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 523.1MB. Max. memory is 16.1GB. [2024-06-14 13:51:54,823 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 157.3MB. Free memory was 91.0MB in the beginning and 90.8MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.14ms. Allocated memory is still 157.3MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 514.79ms. Allocated memory was 157.3MB in the beginning and 245.4MB in the end (delta: 88.1MB). Free memory was 96.3MB in the beginning and 206.4MB in the end (delta: -110.2MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.84ms. Allocated memory is still 245.4MB. Free memory was 206.4MB in the beginning and 204.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.81ms. Allocated memory is still 245.4MB. Free memory was 204.3MB in the beginning and 202.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 401.37ms. Allocated memory is still 245.4MB. Free memory was 202.3MB in the beginning and 177.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 39031.69ms. Allocated memory was 245.4MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 176.0MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 523.1MB. 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: 38.9s, OverallIterations: 58, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 35.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6821 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4314 mSDsluCounter, 2629 SdHoareTripleChecker+Invalid, 4.0s 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s 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 13:51:54,855 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