./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe033_tso.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/safe033_tso.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe033_tso.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe033_tso.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-bcb38a6-m [2024-06-03 20:49:23,097 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 20:49:23,145 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 20:49:23,149 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 20:49:23,150 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 20:49:23,169 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 20:49:23,170 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 20:49:23,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 20:49:23,171 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 20:49:23,171 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 20:49:23,172 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 20:49:23,172 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 20:49:23,173 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 20:49:23,173 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 20:49:23,173 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 20:49:23,174 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 20:49:23,174 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 20:49:23,175 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 20:49:23,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 20:49:23,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 20:49:23,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 20:49:23,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 20:49:23,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 20:49:23,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 20:49:23,177 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 20:49:23,178 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 20:49:23,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 20:49:23,179 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 20:49:23,179 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 20:49:23,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 20:49:23,180 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 20:49:23,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 20:49:23,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 20:49:23,181 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 20:49:23,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 20:49:23,182 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 20:49:23,182 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 20:49:23,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 20:49:23,183 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 20:49:23,183 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 20:49:23,184 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 20:49:23,184 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 20:49:23,185 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 20:49:23,185 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-03 20:49:23,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 20:49:23,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 20:49:23,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 20:49:23,494 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 20:49:23,495 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 20:49:23,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_tso.i [2024-06-03 20:49:24,678 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 20:49:24,950 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 20:49:24,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_tso.i [2024-06-03 20:49:24,981 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64d491cd7/e9276fb9de7d4870b512199073336dae/FLAGa1420a51c [2024-06-03 20:49:24,995 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64d491cd7/e9276fb9de7d4870b512199073336dae [2024-06-03 20:49:24,996 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 20:49:24,997 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 20:49:24,997 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/safe033_tso.yml/witness.yml [2024-06-03 20:49:25,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 20:49:25,116 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 20:49:25,118 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 20:49:25,118 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 20:49:25,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 20:49:25,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 08:49:24" (1/2) ... [2024-06-03 20:49:25,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b7cea72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:49:25, skipping insertion in model container [2024-06-03 20:49:25,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 08:49:24" (1/2) ... [2024-06-03 20:49:25,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@693cce9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:49:25, skipping insertion in model container [2024-06-03 20:49:25,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:49:25" (2/2) ... [2024-06-03 20:49:25,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b7cea72 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:49:25, skipping insertion in model container [2024-06-03 20:49:25,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:49:25" (2/2) ... [2024-06-03 20:49:25,132 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 20:49:25,169 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 20:49:25,171 INFO L97 edCorrectnessWitness]: Location invariant before [L763-L763] (((((! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2))) && (! multithreaded || ((((((((((((((long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )x + (long long )y >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= x) && 0 <= y) && __unbuffered_p0_EAX <= 1) && x <= 1) && y <= 2) && y <= 127) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-03 20:49:25,171 INFO L97 edCorrectnessWitness]: Location invariant before [L764-L764] (((((! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2))) && (! multithreaded || ((((((((((((((long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )x + (long long )y >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= x) && 0 <= y) && __unbuffered_p0_EAX <= 1) && x <= 1) && y <= 2) && y <= 127) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-03 20:49:25,171 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 20:49:25,171 INFO L106 edCorrectnessWitness]: ghost_update [L761-L761] multithreaded = 1; [2024-06-03 20:49:25,220 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 20:49:25,551 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 20:49:25,560 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 20:49:25,671 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 20:49:25,706 INFO L206 MainTranslator]: Completed translation [2024-06-03 20:49:25,707 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:49:25 WrapperNode [2024-06-03 20:49:25,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 20:49:25,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 20:49:25,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 20:49:25,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 20:49:25,715 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 03.06 08:49:25" (1/1) ... [2024-06-03 20:49:25,736 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 03.06 08:49:25" (1/1) ... [2024-06-03 20:49:25,765 INFO L138 Inliner]: procedures = 174, calls = 35, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 56 [2024-06-03 20:49:25,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 20:49:25,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 20:49:25,772 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 20:49:25,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 20:49:25,780 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:49:25" (1/1) ... [2024-06-03 20:49:25,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:49:25" (1/1) ... [2024-06-03 20:49:25,783 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:49:25" (1/1) ... [2024-06-03 20:49:25,802 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-03 20:49:25,804 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:49:25" (1/1) ... [2024-06-03 20:49:25,804 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:49:25" (1/1) ... [2024-06-03 20:49:25,810 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:49:25" (1/1) ... [2024-06-03 20:49:25,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:49:25" (1/1) ... [2024-06-03 20:49:25,813 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:49:25" (1/1) ... [2024-06-03 20:49:25,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:49:25" (1/1) ... [2024-06-03 20:49:25,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 20:49:25,820 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 20:49:25,820 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 20:49:25,820 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 20:49:25,821 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:49:25" (1/1) ... [2024-06-03 20:49:25,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 20:49:25,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 20:49:25,844 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-03 20:49:25,868 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-03 20:49:25,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 20:49:25,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 20:49:25,888 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 20:49:25,888 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 20:49:25,888 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 20:49:25,888 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 20:49:25,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 20:49:25,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 20:49:25,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 20:49:25,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 20:49:25,890 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 20:49:25,986 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 20:49:25,988 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 20:49:26,167 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 20:49:26,168 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 20:49:26,285 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 20:49:26,290 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 20:49:26,292 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 08:49:26 BoogieIcfgContainer [2024-06-03 20:49:26,293 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 20:49:26,296 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 20:49:26,297 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 20:49:26,299 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 20:49:26,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 08:49:24" (1/4) ... [2024-06-03 20:49:26,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5252cdcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 08:49:26, skipping insertion in model container [2024-06-03 20:49:26,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:49:25" (2/4) ... [2024-06-03 20:49:26,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5252cdcb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 08:49:26, skipping insertion in model container [2024-06-03 20:49:26,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:49:25" (3/4) ... [2024-06-03 20:49:26,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5252cdcb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 08:49:26, skipping insertion in model container [2024-06-03 20:49:26,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 08:49:26" (4/4) ... [2024-06-03 20:49:26,302 INFO L112 eAbstractionObserver]: Analyzing ICFG safe033_tso.i [2024-06-03 20:49:26,318 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 20:49:26,318 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-03 20:49:26,318 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 20:49:26,353 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 20:49:26,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 70 flow [2024-06-03 20:49:26,417 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2024-06-03 20:49:26,417 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 20:49:26,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 20:49:26,419 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 31 transitions, 70 flow [2024-06-03 20:49:26,427 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 52 flow [2024-06-03 20:49:26,440 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 20:49:26,449 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;@6bbdd24e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 20:49:26,449 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-03 20:49:26,458 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 20:49:26,458 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-03 20:49:26,458 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 20:49:26,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:26,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 20:49:26,460 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-03 20:49:26,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:26,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1558193034, now seen corresponding path program 1 times [2024-06-03 20:49:26,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:26,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718089076] [2024-06-03 20:49:26,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:26,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:49:27,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:27,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718089076] [2024-06-03 20:49:27,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718089076] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:27,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:27,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 20:49:27,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910991325] [2024-06-03 20:49:27,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:27,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 20:49:27,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:27,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 20:49:27,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 20:49:27,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 31 [2024-06-03 20:49:27,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:27,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:27,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 31 [2024-06-03 20:49:27,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:27,270 INFO L124 PetriNetUnfolderBase]: 83/183 cut-off events. [2024-06-03 20:49:27,270 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-03 20:49:27,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 183 events. 83/183 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 709 event pairs, 43 based on Foata normal form. 1/172 useless extension candidates. Maximal degree in co-relation 343. Up to 153 conditions per place. [2024-06-03 20:49:27,277 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 20 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-06-03 20:49:27,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 113 flow [2024-06-03 20:49:27,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 20:49:27,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 20:49:27,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2024-06-03 20:49:27,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6559139784946236 [2024-06-03 20:49:27,291 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 52 flow. Second operand 3 states and 61 transitions. [2024-06-03 20:49:27,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 113 flow [2024-06-03 20:49:27,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 20:49:27,296 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 71 flow [2024-06-03 20:49:27,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2024-06-03 20:49:27,301 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2024-06-03 20:49:27,301 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 71 flow [2024-06-03 20:49:27,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:27,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:27,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:27,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 20:49:27,302 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-03 20:49:27,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:27,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1519960829, now seen corresponding path program 1 times [2024-06-03 20:49:27,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:27,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135811219] [2024-06-03 20:49:27,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:27,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:27,500 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-03 20:49:27,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:27,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135811219] [2024-06-03 20:49:27,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135811219] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:27,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:27,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 20:49:27,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200249377] [2024-06-03 20:49:27,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:27,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 20:49:27,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:27,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 20:49:27,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-03 20:49:27,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 31 [2024-06-03 20:49:27,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:27,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:27,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 31 [2024-06-03 20:49:27,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:27,685 INFO L124 PetriNetUnfolderBase]: 80/178 cut-off events. [2024-06-03 20:49:27,685 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-06-03 20:49:27,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 178 events. 80/178 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 680 event pairs, 34 based on Foata normal form. 2/175 useless extension candidates. Maximal degree in co-relation 387. Up to 139 conditions per place. [2024-06-03 20:49:27,687 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 24 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2024-06-03 20:49:27,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 155 flow [2024-06-03 20:49:27,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 20:49:27,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 20:49:27,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2024-06-03 20:49:27,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6370967741935484 [2024-06-03 20:49:27,690 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 71 flow. Second operand 4 states and 79 transitions. [2024-06-03 20:49:27,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 155 flow [2024-06-03 20:49:27,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 152 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 20:49:27,691 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 95 flow [2024-06-03 20:49:27,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2024-06-03 20:49:27,692 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2024-06-03 20:49:27,693 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 95 flow [2024-06-03 20:49:27,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:27,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:27,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:27,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 20:49:27,694 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 20:49:27,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:27,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1618377718, now seen corresponding path program 1 times [2024-06-03 20:49:27,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:27,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995195595] [2024-06-03 20:49:27,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:27,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:27,929 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-03 20:49:27,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:27,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995195595] [2024-06-03 20:49:27,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995195595] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:27,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:27,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 20:49:27,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083139329] [2024-06-03 20:49:27,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:27,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 20:49:27,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:27,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 20:49:27,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-03 20:49:27,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-06-03 20:49:27,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:27,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:27,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-06-03 20:49:27,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:28,035 INFO L124 PetriNetUnfolderBase]: 101/210 cut-off events. [2024-06-03 20:49:28,035 INFO L125 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES. [2024-06-03 20:49:28,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 210 events. 101/210 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 779 event pairs, 48 based on Foata normal form. 1/209 useless extension candidates. Maximal degree in co-relation 521. Up to 182 conditions per place. [2024-06-03 20:49:28,041 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 24 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2024-06-03 20:49:28,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 34 transitions, 171 flow [2024-06-03 20:49:28,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 20:49:28,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 20:49:28,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2024-06-03 20:49:28,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226 [2024-06-03 20:49:28,045 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 95 flow. Second operand 4 states and 72 transitions. [2024-06-03 20:49:28,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 34 transitions, 171 flow [2024-06-03 20:49:28,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 34 transitions, 162 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-03 20:49:28,049 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 111 flow [2024-06-03 20:49:28,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2024-06-03 20:49:28,050 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2024-06-03 20:49:28,050 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 111 flow [2024-06-03 20:49:28,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:28,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:28,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:28,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 20:49:28,051 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 20:49:28,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:28,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1589661287, now seen corresponding path program 1 times [2024-06-03 20:49:28,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:28,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249551279] [2024-06-03 20:49:28,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:28,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:28,263 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-03 20:49:28,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:28,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249551279] [2024-06-03 20:49:28,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249551279] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:28,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:28,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:49:28,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275288744] [2024-06-03 20:49:28,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:28,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:49:28,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:28,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:49:28,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:49:28,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-06-03 20:49:28,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 111 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:28,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:28,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-06-03 20:49:28,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:28,379 INFO L124 PetriNetUnfolderBase]: 97/206 cut-off events. [2024-06-03 20:49:28,380 INFO L125 PetriNetUnfolderBase]: For 177/177 co-relation queries the response was YES. [2024-06-03 20:49:28,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 206 events. 97/206 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 747 event pairs, 14 based on Foata normal form. 4/208 useless extension candidates. Maximal degree in co-relation 537. Up to 141 conditions per place. [2024-06-03 20:49:28,382 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 31 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2024-06-03 20:49:28,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 44 transitions, 223 flow [2024-06-03 20:49:28,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:49:28,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:49:28,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2024-06-03 20:49:28,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5645161290322581 [2024-06-03 20:49:28,383 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 111 flow. Second operand 6 states and 105 transitions. [2024-06-03 20:49:28,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 44 transitions, 223 flow [2024-06-03 20:49:28,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 44 transitions, 214 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-03 20:49:28,385 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 127 flow [2024-06-03 20:49:28,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=127, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2024-06-03 20:49:28,386 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2024-06-03 20:49:28,387 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 127 flow [2024-06-03 20:49:28,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:28,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:28,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:28,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 20:49:28,388 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-03 20:49:28,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:28,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1369897695, now seen corresponding path program 1 times [2024-06-03 20:49:28,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:28,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833990907] [2024-06-03 20:49:28,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:28,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:28,614 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-03 20:49:28,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:28,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833990907] [2024-06-03 20:49:28,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833990907] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:28,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:28,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:49:28,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476484318] [2024-06-03 20:49:28,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:28,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:49:28,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:28,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:49:28,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:49:28,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-06-03 20:49:28,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 127 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:28,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:28,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-06-03 20:49:28,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:28,716 INFO L124 PetriNetUnfolderBase]: 99/213 cut-off events. [2024-06-03 20:49:28,717 INFO L125 PetriNetUnfolderBase]: For 293/293 co-relation queries the response was YES. [2024-06-03 20:49:28,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 213 events. 99/213 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 793 event pairs, 22 based on Foata normal form. 2/213 useless extension candidates. Maximal degree in co-relation 601. Up to 152 conditions per place. [2024-06-03 20:49:28,718 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 30 selfloop transitions, 13 changer transitions 0/48 dead transitions. [2024-06-03 20:49:28,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 271 flow [2024-06-03 20:49:28,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:49:28,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:49:28,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-03 20:49:28,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5483870967741935 [2024-06-03 20:49:28,720 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 127 flow. Second operand 7 states and 119 transitions. [2024-06-03 20:49:28,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 271 flow [2024-06-03 20:49:28,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 255 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-03 20:49:28,723 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 180 flow [2024-06-03 20:49:28,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=180, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2024-06-03 20:49:28,724 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2024-06-03 20:49:28,724 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 180 flow [2024-06-03 20:49:28,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:28,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:28,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:28,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 20:49:28,726 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-03 20:49:28,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:28,726 INFO L85 PathProgramCache]: Analyzing trace with hash 482598967, now seen corresponding path program 1 times [2024-06-03 20:49:28,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:28,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999663290] [2024-06-03 20:49:28,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:28,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:28,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:49:28,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:28,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999663290] [2024-06-03 20:49:28,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999663290] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:28,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:28,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:49:28,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64575716] [2024-06-03 20:49:28,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:28,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:49:28,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:28,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:49:28,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:49:28,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-06-03 20:49:28,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:28,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:28,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-06-03 20:49:28,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:29,043 INFO L124 PetriNetUnfolderBase]: 102/220 cut-off events. [2024-06-03 20:49:29,044 INFO L125 PetriNetUnfolderBase]: For 426/426 co-relation queries the response was YES. [2024-06-03 20:49:29,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 220 events. 102/220 cut-off events. For 426/426 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 824 event pairs, 24 based on Foata normal form. 1/219 useless extension candidates. Maximal degree in co-relation 712. Up to 154 conditions per place. [2024-06-03 20:49:29,046 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 30 selfloop transitions, 14 changer transitions 0/49 dead transitions. [2024-06-03 20:49:29,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 49 transitions, 319 flow [2024-06-03 20:49:29,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:49:29,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:49:29,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-03 20:49:29,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5752688172043011 [2024-06-03 20:49:29,047 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 180 flow. Second operand 6 states and 107 transitions. [2024-06-03 20:49:29,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 49 transitions, 319 flow [2024-06-03 20:49:29,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 49 transitions, 295 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-03 20:49:29,051 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 204 flow [2024-06-03 20:49:29,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=204, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2024-06-03 20:49:29,052 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2024-06-03 20:49:29,052 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 204 flow [2024-06-03 20:49:29,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:29,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:29,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:29,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 20:49:29,053 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 20:49:29,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:29,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1055717047, now seen corresponding path program 2 times [2024-06-03 20:49:29,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:29,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794095606] [2024-06-03 20:49:29,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:29,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:29,268 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-03 20:49:29,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:29,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794095606] [2024-06-03 20:49:29,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794095606] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:29,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:29,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:49:29,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724664183] [2024-06-03 20:49:29,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:29,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:49:29,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:29,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:49:29,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:49:29,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-06-03 20:49:29,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:29,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:29,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-06-03 20:49:29,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:29,386 INFO L124 PetriNetUnfolderBase]: 97/211 cut-off events. [2024-06-03 20:49:29,386 INFO L125 PetriNetUnfolderBase]: For 476/476 co-relation queries the response was YES. [2024-06-03 20:49:29,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 211 events. 97/211 cut-off events. For 476/476 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 776 event pairs, 23 based on Foata normal form. 2/211 useless extension candidates. Maximal degree in co-relation 693. Up to 149 conditions per place. [2024-06-03 20:49:29,388 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 30 selfloop transitions, 14 changer transitions 0/49 dead transitions. [2024-06-03 20:49:29,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 49 transitions, 318 flow [2024-06-03 20:49:29,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:49:29,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:49:29,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-03 20:49:29,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5483870967741935 [2024-06-03 20:49:29,391 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 204 flow. Second operand 7 states and 119 transitions. [2024-06-03 20:49:29,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 49 transitions, 318 flow [2024-06-03 20:49:29,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 49 transitions, 297 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-03 20:49:29,394 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 218 flow [2024-06-03 20:49:29,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=218, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2024-06-03 20:49:29,396 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2024-06-03 20:49:29,396 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 218 flow [2024-06-03 20:49:29,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:29,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:29,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:29,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 20:49:29,397 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 20:49:29,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:29,398 INFO L85 PathProgramCache]: Analyzing trace with hash 2083295168, now seen corresponding path program 1 times [2024-06-03 20:49:29,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:29,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848211589] [2024-06-03 20:49:29,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:29,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:29,678 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-03 20:49:29,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:29,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848211589] [2024-06-03 20:49:29,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848211589] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:29,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:29,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:49:29,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925635685] [2024-06-03 20:49:29,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:29,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:49:29,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:29,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:49:29,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:49:29,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-06-03 20:49:29,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 218 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:29,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:29,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-06-03 20:49:29,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:29,812 INFO L124 PetriNetUnfolderBase]: 98/214 cut-off events. [2024-06-03 20:49:29,813 INFO L125 PetriNetUnfolderBase]: For 637/637 co-relation queries the response was YES. [2024-06-03 20:49:29,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 214 events. 98/214 cut-off events. For 637/637 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 787 event pairs, 22 based on Foata normal form. 4/216 useless extension candidates. Maximal degree in co-relation 714. Up to 140 conditions per place. [2024-06-03 20:49:29,814 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 30 selfloop transitions, 17 changer transitions 0/52 dead transitions. [2024-06-03 20:49:29,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 52 transitions, 346 flow [2024-06-03 20:49:29,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:49:29,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:49:29,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-03 20:49:29,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532258064516129 [2024-06-03 20:49:29,816 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 218 flow. Second operand 8 states and 132 transitions. [2024-06-03 20:49:29,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 52 transitions, 346 flow [2024-06-03 20:49:29,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 307 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-03 20:49:29,819 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 224 flow [2024-06-03 20:49:29,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=224, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2024-06-03 20:49:29,820 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 22 predicate places. [2024-06-03 20:49:29,820 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 224 flow [2024-06-03 20:49:29,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:29,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:29,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:29,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 20:49:29,821 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-03 20:49:29,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:29,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1962414250, now seen corresponding path program 1 times [2024-06-03 20:49:29,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:29,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390474278] [2024-06-03 20:49:29,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:29,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:30,066 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-03 20:49:30,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:30,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390474278] [2024-06-03 20:49:30,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390474278] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:30,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:30,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:49:30,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850179926] [2024-06-03 20:49:30,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:30,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:49:30,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:30,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:49:30,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:49:30,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-06-03 20:49:30,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:30,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:30,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-06-03 20:49:30,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:30,224 INFO L124 PetriNetUnfolderBase]: 101/221 cut-off events. [2024-06-03 20:49:30,224 INFO L125 PetriNetUnfolderBase]: For 676/676 co-relation queries the response was YES. [2024-06-03 20:49:30,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 784 conditions, 221 events. 101/221 cut-off events. For 676/676 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 821 event pairs, 21 based on Foata normal form. 1/220 useless extension candidates. Maximal degree in co-relation 759. Up to 165 conditions per place. [2024-06-03 20:49:30,226 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 40 selfloop transitions, 9 changer transitions 0/54 dead transitions. [2024-06-03 20:49:30,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 364 flow [2024-06-03 20:49:30,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:49:30,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:49:30,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2024-06-03 20:49:30,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5645161290322581 [2024-06-03 20:49:30,228 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 224 flow. Second operand 6 states and 105 transitions. [2024-06-03 20:49:30,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 364 flow [2024-06-03 20:49:30,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 54 transitions, 325 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 20:49:30,231 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 222 flow [2024-06-03 20:49:30,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2024-06-03 20:49:30,232 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 22 predicate places. [2024-06-03 20:49:30,232 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 222 flow [2024-06-03 20:49:30,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:30,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:30,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:30,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 20:49:30,233 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-03 20:49:30,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:30,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1108162488, now seen corresponding path program 2 times [2024-06-03 20:49:30,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:30,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575542865] [2024-06-03 20:49:30,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:30,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:30,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:49:30,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:30,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575542865] [2024-06-03 20:49:30,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575542865] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:30,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:30,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:49:30,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236042436] [2024-06-03 20:49:30,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:30,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:49:30,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:30,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:49:30,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:49:30,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-06-03 20:49:30,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:30,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:30,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-06-03 20:49:30,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:30,533 INFO L124 PetriNetUnfolderBase]: 109/238 cut-off events. [2024-06-03 20:49:30,533 INFO L125 PetriNetUnfolderBase]: For 839/839 co-relation queries the response was YES. [2024-06-03 20:49:30,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 849 conditions, 238 events. 109/238 cut-off events. For 839/839 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 925 event pairs, 20 based on Foata normal form. 1/237 useless extension candidates. Maximal degree in co-relation 823. Up to 136 conditions per place. [2024-06-03 20:49:30,536 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 34 selfloop transitions, 22 changer transitions 0/61 dead transitions. [2024-06-03 20:49:30,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 61 transitions, 442 flow [2024-06-03 20:49:30,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:49:30,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:49:30,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-03 20:49:30,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.576036866359447 [2024-06-03 20:49:30,537 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 222 flow. Second operand 7 states and 125 transitions. [2024-06-03 20:49:30,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 61 transitions, 442 flow [2024-06-03 20:49:30,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 421 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-03 20:49:30,541 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 298 flow [2024-06-03 20:49:30,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=298, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2024-06-03 20:49:30,544 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 25 predicate places. [2024-06-03 20:49:30,546 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 298 flow [2024-06-03 20:49:30,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:30,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:30,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:30,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 20:49:30,547 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-03 20:49:30,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:30,548 INFO L85 PathProgramCache]: Analyzing trace with hash 931812566, now seen corresponding path program 3 times [2024-06-03 20:49:30,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:30,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691709943] [2024-06-03 20:49:30,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:30,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:30,775 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-03 20:49:30,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:30,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691709943] [2024-06-03 20:49:30,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691709943] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:30,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:30,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:49:30,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634790451] [2024-06-03 20:49:30,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:30,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:49:30,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:30,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:49:30,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:49:30,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-06-03 20:49:30,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 298 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:30,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:30,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-06-03 20:49:30,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:30,895 INFO L124 PetriNetUnfolderBase]: 105/232 cut-off events. [2024-06-03 20:49:30,896 INFO L125 PetriNetUnfolderBase]: For 1021/1021 co-relation queries the response was YES. [2024-06-03 20:49:30,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 232 events. 105/232 cut-off events. For 1021/1021 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 892 event pairs, 19 based on Foata normal form. 2/232 useless extension candidates. Maximal degree in co-relation 845. Up to 133 conditions per place. [2024-06-03 20:49:30,898 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 36 selfloop transitions, 20 changer transitions 0/61 dead transitions. [2024-06-03 20:49:30,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 61 transitions, 460 flow [2024-06-03 20:49:30,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:49:30,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:49:30,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-03 20:49:30,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5524193548387096 [2024-06-03 20:49:30,900 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 298 flow. Second operand 8 states and 137 transitions. [2024-06-03 20:49:30,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 61 transitions, 460 flow [2024-06-03 20:49:30,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 61 transitions, 432 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-06-03 20:49:30,906 INFO L231 Difference]: Finished difference. Result has 61 places, 48 transitions, 316 flow [2024-06-03 20:49:30,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=316, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2024-06-03 20:49:30,906 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 31 predicate places. [2024-06-03 20:49:30,906 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 316 flow [2024-06-03 20:49:30,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:30,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:30,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:30,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 20:49:30,907 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-03 20:49:30,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:30,908 INFO L85 PathProgramCache]: Analyzing trace with hash -440659065, now seen corresponding path program 1 times [2024-06-03 20:49:30,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:30,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015341484] [2024-06-03 20:49:30,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:30,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:31,096 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-03 20:49:31,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:31,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015341484] [2024-06-03 20:49:31,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015341484] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:31,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:31,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:49:31,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470196178] [2024-06-03 20:49:31,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:31,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:49:31,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:31,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:49:31,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:49:31,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-06-03 20:49:31,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 316 flow. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:31,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:31,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-06-03 20:49:31,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:31,209 INFO L124 PetriNetUnfolderBase]: 108/241 cut-off events. [2024-06-03 20:49:31,210 INFO L125 PetriNetUnfolderBase]: For 1177/1177 co-relation queries the response was YES. [2024-06-03 20:49:31,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 241 events. 108/241 cut-off events. For 1177/1177 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 952 event pairs, 20 based on Foata normal form. 1/240 useless extension candidates. Maximal degree in co-relation 918. Up to 154 conditions per place. [2024-06-03 20:49:31,212 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 36 selfloop transitions, 19 changer transitions 0/60 dead transitions. [2024-06-03 20:49:31,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 60 transitions, 468 flow [2024-06-03 20:49:31,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:49:31,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:49:31,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-06-03 20:49:31,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226 [2024-06-03 20:49:31,214 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 316 flow. Second operand 6 states and 108 transitions. [2024-06-03 20:49:31,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 60 transitions, 468 flow [2024-06-03 20:49:31,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 60 transitions, 403 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-03 20:49:31,219 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 322 flow [2024-06-03 20:49:31,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=322, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2024-06-03 20:49:31,220 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 29 predicate places. [2024-06-03 20:49:31,221 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 322 flow [2024-06-03 20:49:31,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:31,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:31,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:31,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 20:49:31,221 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-03 20:49:31,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:31,222 INFO L85 PathProgramCache]: Analyzing trace with hash -843677427, now seen corresponding path program 2 times [2024-06-03 20:49:31,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:31,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559887824] [2024-06-03 20:49:31,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:31,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:31,429 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-03 20:49:31,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:31,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559887824] [2024-06-03 20:49:31,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559887824] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:31,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:31,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:49:31,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148499848] [2024-06-03 20:49:31,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:31,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:49:31,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:31,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:49:31,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:49:31,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-06-03 20:49:31,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 322 flow. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:31,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:31,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-06-03 20:49:31,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:31,551 INFO L124 PetriNetUnfolderBase]: 111/246 cut-off events. [2024-06-03 20:49:31,552 INFO L125 PetriNetUnfolderBase]: For 1272/1272 co-relation queries the response was YES. [2024-06-03 20:49:31,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 967 conditions, 246 events. 111/246 cut-off events. For 1272/1272 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 985 event pairs, 20 based on Foata normal form. 1/245 useless extension candidates. Maximal degree in co-relation 938. Up to 141 conditions per place. [2024-06-03 20:49:31,554 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 33 selfloop transitions, 27 changer transitions 0/65 dead transitions. [2024-06-03 20:49:31,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 65 transitions, 514 flow [2024-06-03 20:49:31,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:49:31,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:49:31,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-03 20:49:31,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5483870967741935 [2024-06-03 20:49:31,556 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 322 flow. Second operand 8 states and 136 transitions. [2024-06-03 20:49:31,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 65 transitions, 514 flow [2024-06-03 20:49:31,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 65 transitions, 471 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-03 20:49:31,561 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 358 flow [2024-06-03 20:49:31,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=358, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2024-06-03 20:49:31,562 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 32 predicate places. [2024-06-03 20:49:31,562 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 358 flow [2024-06-03 20:49:31,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:31,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:31,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:31,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 20:49:31,563 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-03 20:49:31,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:31,564 INFO L85 PathProgramCache]: Analyzing trace with hash -843683007, now seen corresponding path program 3 times [2024-06-03 20:49:31,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:31,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293266751] [2024-06-03 20:49:31,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:31,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:31,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:49:31,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:31,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293266751] [2024-06-03 20:49:31,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293266751] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:31,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:31,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:49:31,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608786425] [2024-06-03 20:49:31,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:31,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:49:31,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:31,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:49:31,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:49:31,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-06-03 20:49:31,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 358 flow. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:31,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:31,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-06-03 20:49:31,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:31,878 INFO L124 PetriNetUnfolderBase]: 109/243 cut-off events. [2024-06-03 20:49:31,879 INFO L125 PetriNetUnfolderBase]: For 1251/1251 co-relation queries the response was YES. [2024-06-03 20:49:31,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 243 events. 109/243 cut-off events. For 1251/1251 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 970 event pairs, 20 based on Foata normal form. 1/242 useless extension candidates. Maximal degree in co-relation 929. Up to 139 conditions per place. [2024-06-03 20:49:31,881 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 34 selfloop transitions, 25 changer transitions 0/64 dead transitions. [2024-06-03 20:49:31,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 64 transitions, 504 flow [2024-06-03 20:49:31,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:49:31,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:49:31,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-03 20:49:31,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5443548387096774 [2024-06-03 20:49:31,883 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 358 flow. Second operand 8 states and 135 transitions. [2024-06-03 20:49:31,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 64 transitions, 504 flow [2024-06-03 20:49:31,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 64 transitions, 438 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-03 20:49:31,888 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 348 flow [2024-06-03 20:49:31,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=348, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2024-06-03 20:49:31,889 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 34 predicate places. [2024-06-03 20:49:31,889 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 348 flow [2024-06-03 20:49:31,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:31,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:31,889 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:31,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 20:49:31,890 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-03 20:49:31,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:31,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1694238871, now seen corresponding path program 1 times [2024-06-03 20:49:31,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:31,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890524239] [2024-06-03 20:49:31,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:31,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:32,109 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-03 20:49:32,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:32,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890524239] [2024-06-03 20:49:32,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890524239] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:32,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:32,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:49:32,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026992127] [2024-06-03 20:49:32,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:32,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:49:32,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:32,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:49:32,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:49:32,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-06-03 20:49:32,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 348 flow. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:32,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:32,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-06-03 20:49:32,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:32,226 INFO L124 PetriNetUnfolderBase]: 113/253 cut-off events. [2024-06-03 20:49:32,227 INFO L125 PetriNetUnfolderBase]: For 1496/1496 co-relation queries the response was YES. [2024-06-03 20:49:32,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 987 conditions, 253 events. 113/253 cut-off events. For 1496/1496 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1032 event pairs, 22 based on Foata normal form. 2/253 useless extension candidates. Maximal degree in co-relation 957. Up to 173 conditions per place. [2024-06-03 20:49:32,229 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 46 selfloop transitions, 15 changer transitions 0/66 dead transitions. [2024-06-03 20:49:32,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 66 transitions, 506 flow [2024-06-03 20:49:32,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:49:32,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:49:32,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-03 20:49:32,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5362903225806451 [2024-06-03 20:49:32,230 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 348 flow. Second operand 8 states and 133 transitions. [2024-06-03 20:49:32,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 66 transitions, 506 flow [2024-06-03 20:49:32,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 66 transitions, 441 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-03 20:49:32,235 INFO L231 Difference]: Finished difference. Result has 65 places, 53 transitions, 325 flow [2024-06-03 20:49:32,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=325, PETRI_PLACES=65, PETRI_TRANSITIONS=53} [2024-06-03 20:49:32,237 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 35 predicate places. [2024-06-03 20:49:32,237 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 53 transitions, 325 flow [2024-06-03 20:49:32,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:32,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:32,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:32,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 20:49:32,238 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-03 20:49:32,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:32,239 INFO L85 PathProgramCache]: Analyzing trace with hash 582652353, now seen corresponding path program 2 times [2024-06-03 20:49:32,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:32,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490539931] [2024-06-03 20:49:32,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:32,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:32,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:49:32,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:32,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490539931] [2024-06-03 20:49:32,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490539931] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:32,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:32,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:49:32,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424385179] [2024-06-03 20:49:32,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:32,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:49:32,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:32,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:49:32,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:49:32,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-06-03 20:49:32,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 53 transitions, 325 flow. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:32,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:32,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-06-03 20:49:32,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:32,592 INFO L124 PetriNetUnfolderBase]: 110/250 cut-off events. [2024-06-03 20:49:32,592 INFO L125 PetriNetUnfolderBase]: For 1413/1413 co-relation queries the response was YES. [2024-06-03 20:49:32,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 934 conditions, 250 events. 110/250 cut-off events. For 1413/1413 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1009 event pairs, 19 based on Foata normal form. 2/250 useless extension candidates. Maximal degree in co-relation 903. Up to 148 conditions per place. [2024-06-03 20:49:32,594 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 46 selfloop transitions, 16 changer transitions 0/67 dead transitions. [2024-06-03 20:49:32,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 67 transitions, 481 flow [2024-06-03 20:49:32,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:49:32,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:49:32,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-03 20:49:32,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5282258064516129 [2024-06-03 20:49:32,597 INFO L175 Difference]: Start difference. First operand has 65 places, 53 transitions, 325 flow. Second operand 8 states and 131 transitions. [2024-06-03 20:49:32,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 67 transitions, 481 flow [2024-06-03 20:49:32,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 67 transitions, 449 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-03 20:49:32,609 INFO L231 Difference]: Finished difference. Result has 67 places, 53 transitions, 329 flow [2024-06-03 20:49:32,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=329, PETRI_PLACES=67, PETRI_TRANSITIONS=53} [2024-06-03 20:49:32,610 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 37 predicate places. [2024-06-03 20:49:32,610 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 53 transitions, 329 flow [2024-06-03 20:49:32,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:32,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:32,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:32,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 20:49:32,611 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-03 20:49:32,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:32,611 INFO L85 PathProgramCache]: Analyzing trace with hash -76034585, now seen corresponding path program 1 times [2024-06-03 20:49:32,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:32,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203790020] [2024-06-03 20:49:32,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:32,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:32,835 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-03 20:49:32,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:32,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203790020] [2024-06-03 20:49:32,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203790020] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:32,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:32,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:49:32,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464870488] [2024-06-03 20:49:32,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:32,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:49:32,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:32,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:49:32,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:49:32,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-06-03 20:49:32,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 53 transitions, 329 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:32,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:32,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-06-03 20:49:32,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:33,000 INFO L124 PetriNetUnfolderBase]: 121/271 cut-off events. [2024-06-03 20:49:33,000 INFO L125 PetriNetUnfolderBase]: For 1881/1881 co-relation queries the response was YES. [2024-06-03 20:49:33,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1053 conditions, 271 events. 121/271 cut-off events. For 1881/1881 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1127 event pairs, 9 based on Foata normal form. 2/271 useless extension candidates. Maximal degree in co-relation 1021. Up to 168 conditions per place. [2024-06-03 20:49:33,003 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 56 selfloop transitions, 12 changer transitions 0/73 dead transitions. [2024-06-03 20:49:33,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 73 transitions, 553 flow [2024-06-03 20:49:33,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:49:33,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:49:33,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-03 20:49:33,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5403225806451613 [2024-06-03 20:49:33,004 INFO L175 Difference]: Start difference. First operand has 67 places, 53 transitions, 329 flow. Second operand 8 states and 134 transitions. [2024-06-03 20:49:33,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 73 transitions, 553 flow [2024-06-03 20:49:33,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 73 transitions, 517 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-03 20:49:33,011 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 339 flow [2024-06-03 20:49:33,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=339, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2024-06-03 20:49:33,012 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 39 predicate places. [2024-06-03 20:49:33,012 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 339 flow [2024-06-03 20:49:33,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:33,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:33,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:33,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 20:49:33,014 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-03 20:49:33,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:33,015 INFO L85 PathProgramCache]: Analyzing trace with hash -499664941, now seen corresponding path program 2 times [2024-06-03 20:49:33,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:33,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159108421] [2024-06-03 20:49:33,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:33,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:33,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:49:33,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:33,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159108421] [2024-06-03 20:49:33,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159108421] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:33,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:33,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:49:33,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541770712] [2024-06-03 20:49:33,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:33,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:49:33,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:33,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:49:33,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:49:33,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-06-03 20:49:33,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 339 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:33,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:33,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-06-03 20:49:33,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:33,426 INFO L124 PetriNetUnfolderBase]: 118/266 cut-off events. [2024-06-03 20:49:33,426 INFO L125 PetriNetUnfolderBase]: For 1793/1793 co-relation queries the response was YES. [2024-06-03 20:49:33,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1009 conditions, 266 events. 118/266 cut-off events. For 1793/1793 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1096 event pairs, 19 based on Foata normal form. 2/266 useless extension candidates. Maximal degree in co-relation 976. Up to 192 conditions per place. [2024-06-03 20:49:33,428 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 55 selfloop transitions, 10 changer transitions 0/70 dead transitions. [2024-06-03 20:49:33,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 70 transitions, 505 flow [2024-06-03 20:49:33,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:49:33,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:49:33,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-03 20:49:33,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5483870967741935 [2024-06-03 20:49:33,429 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 339 flow. Second operand 7 states and 119 transitions. [2024-06-03 20:49:33,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 70 transitions, 505 flow [2024-06-03 20:49:33,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 70 transitions, 479 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-03 20:49:33,436 INFO L231 Difference]: Finished difference. Result has 72 places, 55 transitions, 337 flow [2024-06-03 20:49:33,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=337, PETRI_PLACES=72, PETRI_TRANSITIONS=55} [2024-06-03 20:49:33,436 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 42 predicate places. [2024-06-03 20:49:33,436 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 55 transitions, 337 flow [2024-06-03 20:49:33,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:33,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:33,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:33,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 20:49:33,437 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-03 20:49:33,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:33,438 INFO L85 PathProgramCache]: Analyzing trace with hash -218734637, now seen corresponding path program 3 times [2024-06-03 20:49:33,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:33,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716215004] [2024-06-03 20:49:33,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:33,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:33,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:49:33,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:33,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716215004] [2024-06-03 20:49:33,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716215004] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:33,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:33,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:49:33,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364619051] [2024-06-03 20:49:33,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:33,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:49:33,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:33,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:49:33,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:49:33,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-06-03 20:49:33,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 55 transitions, 337 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:33,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:33,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-06-03 20:49:33,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:33,777 INFO L124 PetriNetUnfolderBase]: 122/274 cut-off events. [2024-06-03 20:49:33,777 INFO L125 PetriNetUnfolderBase]: For 2049/2049 co-relation queries the response was YES. [2024-06-03 20:49:33,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1044 conditions, 274 events. 122/274 cut-off events. For 2049/2049 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1142 event pairs, 20 based on Foata normal form. 2/274 useless extension candidates. Maximal degree in co-relation 1009. Up to 160 conditions per place. [2024-06-03 20:49:33,779 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 37 selfloop transitions, 27 changer transitions 0/69 dead transitions. [2024-06-03 20:49:33,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 69 transitions, 505 flow [2024-06-03 20:49:33,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:49:33,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:49:33,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-03 20:49:33,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5524193548387096 [2024-06-03 20:49:33,780 INFO L175 Difference]: Start difference. First operand has 72 places, 55 transitions, 337 flow. Second operand 8 states and 137 transitions. [2024-06-03 20:49:33,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 69 transitions, 505 flow [2024-06-03 20:49:33,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 69 transitions, 483 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-03 20:49:33,787 INFO L231 Difference]: Finished difference. Result has 74 places, 56 transitions, 385 flow [2024-06-03 20:49:33,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=385, PETRI_PLACES=74, PETRI_TRANSITIONS=56} [2024-06-03 20:49:33,787 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 44 predicate places. [2024-06-03 20:49:33,788 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 56 transitions, 385 flow [2024-06-03 20:49:33,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:33,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:33,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:33,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 20:49:33,788 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-03 20:49:33,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:33,789 INFO L85 PathProgramCache]: Analyzing trace with hash 2118692597, now seen corresponding path program 4 times [2024-06-03 20:49:33,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:33,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015484] [2024-06-03 20:49:33,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:33,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:33,987 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-03 20:49:33,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:33,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015484] [2024-06-03 20:49:33,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015484] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:33,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:33,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:49:33,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178721512] [2024-06-03 20:49:33,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:33,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:49:33,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:33,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:49:33,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:49:34,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-06-03 20:49:34,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 56 transitions, 385 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:34,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:34,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-06-03 20:49:34,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:34,139 INFO L124 PetriNetUnfolderBase]: 131/297 cut-off events. [2024-06-03 20:49:34,139 INFO L125 PetriNetUnfolderBase]: For 3345/3345 co-relation queries the response was YES. [2024-06-03 20:49:34,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 297 events. 131/297 cut-off events. For 3345/3345 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1288 event pairs, 22 based on Foata normal form. 10/305 useless extension candidates. Maximal degree in co-relation 1075. Up to 151 conditions per place. [2024-06-03 20:49:34,142 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 40 selfloop transitions, 24 changer transitions 4/73 dead transitions. [2024-06-03 20:49:34,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 73 transitions, 567 flow [2024-06-03 20:49:34,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:49:34,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:49:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-03 20:49:34,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5483870967741935 [2024-06-03 20:49:34,143 INFO L175 Difference]: Start difference. First operand has 74 places, 56 transitions, 385 flow. Second operand 9 states and 153 transitions. [2024-06-03 20:49:34,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 73 transitions, 567 flow [2024-06-03 20:49:34,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 73 transitions, 507 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 20:49:34,151 INFO L231 Difference]: Finished difference. Result has 77 places, 55 transitions, 372 flow [2024-06-03 20:49:34,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=372, PETRI_PLACES=77, PETRI_TRANSITIONS=55} [2024-06-03 20:49:34,151 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 47 predicate places. [2024-06-03 20:49:34,151 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 55 transitions, 372 flow [2024-06-03 20:49:34,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:34,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:34,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:34,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 20:49:34,152 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-03 20:49:34,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:34,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1937895760, now seen corresponding path program 1 times [2024-06-03 20:49:34,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:34,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529520576] [2024-06-03 20:49:34,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:34,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:34,344 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-03 20:49:34,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:34,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529520576] [2024-06-03 20:49:34,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529520576] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:34,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:34,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:49:34,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230556792] [2024-06-03 20:49:34,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:34,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:49:34,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:34,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:49:34,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:49:34,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-06-03 20:49:34,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 55 transitions, 372 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:34,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:34,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-06-03 20:49:34,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:34,512 INFO L124 PetriNetUnfolderBase]: 155/361 cut-off events. [2024-06-03 20:49:34,512 INFO L125 PetriNetUnfolderBase]: For 4339/4339 co-relation queries the response was YES. [2024-06-03 20:49:34,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 361 events. 155/361 cut-off events. For 4339/4339 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1704 event pairs, 25 based on Foata normal form. 6/365 useless extension candidates. Maximal degree in co-relation 1353. Up to 126 conditions per place. [2024-06-03 20:49:34,515 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 43 selfloop transitions, 16 changer transitions 12/76 dead transitions. [2024-06-03 20:49:34,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 76 transitions, 608 flow [2024-06-03 20:49:34,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:49:34,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:49:34,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-03 20:49:34,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5604838709677419 [2024-06-03 20:49:34,516 INFO L175 Difference]: Start difference. First operand has 77 places, 55 transitions, 372 flow. Second operand 8 states and 139 transitions. [2024-06-03 20:49:34,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 76 transitions, 608 flow [2024-06-03 20:49:34,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 76 transitions, 548 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-03 20:49:34,525 INFO L231 Difference]: Finished difference. Result has 77 places, 52 transitions, 329 flow [2024-06-03 20:49:34,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=329, PETRI_PLACES=77, PETRI_TRANSITIONS=52} [2024-06-03 20:49:34,526 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 47 predicate places. [2024-06-03 20:49:34,526 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 52 transitions, 329 flow [2024-06-03 20:49:34,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:34,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:34,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:34,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 20:49:34,527 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-03 20:49:34,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:34,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1939769710, now seen corresponding path program 2 times [2024-06-03 20:49:34,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:34,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070359439] [2024-06-03 20:49:34,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:34,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:34,728 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-03 20:49:34,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:34,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070359439] [2024-06-03 20:49:34,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070359439] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:34,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:34,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:49:34,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561874825] [2024-06-03 20:49:34,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:34,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:49:34,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:34,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:49:34,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:49:34,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-06-03 20:49:34,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 52 transitions, 329 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:34,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:34,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-06-03 20:49:34,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:34,882 INFO L124 PetriNetUnfolderBase]: 139/327 cut-off events. [2024-06-03 20:49:34,883 INFO L125 PetriNetUnfolderBase]: For 4685/4685 co-relation queries the response was YES. [2024-06-03 20:49:34,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 327 events. 139/327 cut-off events. For 4685/4685 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1515 event pairs, 23 based on Foata normal form. 6/331 useless extension candidates. Maximal degree in co-relation 1231. Up to 126 conditions per place. [2024-06-03 20:49:34,885 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 42 selfloop transitions, 15 changer transitions 6/68 dead transitions. [2024-06-03 20:49:34,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 68 transitions, 539 flow [2024-06-03 20:49:34,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:49:34,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:49:34,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-03 20:49:34,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5529953917050692 [2024-06-03 20:49:34,887 INFO L175 Difference]: Start difference. First operand has 77 places, 52 transitions, 329 flow. Second operand 7 states and 120 transitions. [2024-06-03 20:49:34,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 68 transitions, 539 flow [2024-06-03 20:49:34,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 68 transitions, 495 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-03 20:49:34,895 INFO L231 Difference]: Finished difference. Result has 72 places, 50 transitions, 312 flow [2024-06-03 20:49:34,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=312, PETRI_PLACES=72, PETRI_TRANSITIONS=50} [2024-06-03 20:49:34,896 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 42 predicate places. [2024-06-03 20:49:34,896 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 50 transitions, 312 flow [2024-06-03 20:49:34,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:34,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:34,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:34,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 20:49:34,897 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-03 20:49:34,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:34,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1690260332, now seen corresponding path program 3 times [2024-06-03 20:49:34,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:34,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544765827] [2024-06-03 20:49:34,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:34,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:35,093 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-03 20:49:35,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:35,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544765827] [2024-06-03 20:49:35,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544765827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:35,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:35,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:49:35,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6106740] [2024-06-03 20:49:35,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:35,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:49:35,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:35,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:49:35,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:49:35,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-06-03 20:49:35,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 50 transitions, 312 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:35,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:35,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-06-03 20:49:35,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:35,263 INFO L124 PetriNetUnfolderBase]: 115/275 cut-off events. [2024-06-03 20:49:35,263 INFO L125 PetriNetUnfolderBase]: For 2847/2847 co-relation queries the response was YES. [2024-06-03 20:49:35,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 275 events. 115/275 cut-off events. For 2847/2847 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1216 event pairs, 13 based on Foata normal form. 8/281 useless extension candidates. Maximal degree in co-relation 931. Up to 140 conditions per place. [2024-06-03 20:49:35,265 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 34 selfloop transitions, 15 changer transitions 8/62 dead transitions. [2024-06-03 20:49:35,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 62 transitions, 460 flow [2024-06-03 20:49:35,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:49:35,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:49:35,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-03 20:49:35,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5483870967741935 [2024-06-03 20:49:35,266 INFO L175 Difference]: Start difference. First operand has 72 places, 50 transitions, 312 flow. Second operand 7 states and 119 transitions. [2024-06-03 20:49:35,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 62 transitions, 460 flow [2024-06-03 20:49:35,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 62 transitions, 426 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-03 20:49:35,272 INFO L231 Difference]: Finished difference. Result has 70 places, 45 transitions, 284 flow [2024-06-03 20:49:35,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=284, PETRI_PLACES=70, PETRI_TRANSITIONS=45} [2024-06-03 20:49:35,272 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 40 predicate places. [2024-06-03 20:49:35,273 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 45 transitions, 284 flow [2024-06-03 20:49:35,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:35,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:35,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:35,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 20:49:35,273 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-03 20:49:35,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:35,274 INFO L85 PathProgramCache]: Analyzing trace with hash 573543614, now seen corresponding path program 4 times [2024-06-03 20:49:35,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:35,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770840309] [2024-06-03 20:49:35,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:35,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:35,469 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-03 20:49:35,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:35,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770840309] [2024-06-03 20:49:35,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770840309] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:35,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:35,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:49:35,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945959075] [2024-06-03 20:49:35,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:35,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:49:35,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:35,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:49:35,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:49:35,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-06-03 20:49:35,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 45 transitions, 284 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:35,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:35,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-06-03 20:49:35,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:35,627 INFO L124 PetriNetUnfolderBase]: 105/249 cut-off events. [2024-06-03 20:49:35,628 INFO L125 PetriNetUnfolderBase]: For 2488/2488 co-relation queries the response was YES. [2024-06-03 20:49:35,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 888 conditions, 249 events. 105/249 cut-off events. For 2488/2488 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1053 event pairs, 24 based on Foata normal form. 8/255 useless extension candidates. Maximal degree in co-relation 854. Up to 131 conditions per place. [2024-06-03 20:49:35,629 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 28 selfloop transitions, 17 changer transitions 9/59 dead transitions. [2024-06-03 20:49:35,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 59 transitions, 430 flow [2024-06-03 20:49:35,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:49:35,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:49:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2024-06-03 20:49:35,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5197132616487455 [2024-06-03 20:49:35,631 INFO L175 Difference]: Start difference. First operand has 70 places, 45 transitions, 284 flow. Second operand 9 states and 145 transitions. [2024-06-03 20:49:35,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 59 transitions, 430 flow [2024-06-03 20:49:35,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 59 transitions, 377 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-03 20:49:35,636 INFO L231 Difference]: Finished difference. Result has 67 places, 42 transitions, 253 flow [2024-06-03 20:49:35,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=253, PETRI_PLACES=67, PETRI_TRANSITIONS=42} [2024-06-03 20:49:35,637 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 37 predicate places. [2024-06-03 20:49:35,637 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 42 transitions, 253 flow [2024-06-03 20:49:35,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:35,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:35,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:35,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 20:49:35,638 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-03 20:49:35,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:35,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1942526772, now seen corresponding path program 1 times [2024-06-03 20:49:35,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:35,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716383888] [2024-06-03 20:49:35,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:35,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:49:35,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:35,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716383888] [2024-06-03 20:49:35,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716383888] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:35,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:35,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:49:35,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74642868] [2024-06-03 20:49:35,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:35,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:49:35,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:35,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:49:35,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:49:35,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-06-03 20:49:35,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 42 transitions, 253 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:35,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:35,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-06-03 20:49:35,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:36,004 INFO L124 PetriNetUnfolderBase]: 118/284 cut-off events. [2024-06-03 20:49:36,004 INFO L125 PetriNetUnfolderBase]: For 3064/3064 co-relation queries the response was YES. [2024-06-03 20:49:36,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 284 events. 118/284 cut-off events. For 3064/3064 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1281 event pairs, 32 based on Foata normal form. 6/288 useless extension candidates. Maximal degree in co-relation 1004. Up to 111 conditions per place. [2024-06-03 20:49:36,006 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 32 selfloop transitions, 16 changer transitions 7/60 dead transitions. [2024-06-03 20:49:36,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 60 transitions, 443 flow [2024-06-03 20:49:36,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:49:36,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:49:36,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2024-06-03 20:49:36,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5268817204301075 [2024-06-03 20:49:36,008 INFO L175 Difference]: Start difference. First operand has 67 places, 42 transitions, 253 flow. Second operand 9 states and 147 transitions. [2024-06-03 20:49:36,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 60 transitions, 443 flow [2024-06-03 20:49:36,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 60 transitions, 401 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-03 20:49:36,016 INFO L231 Difference]: Finished difference. Result has 65 places, 39 transitions, 233 flow [2024-06-03 20:49:36,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=233, PETRI_PLACES=65, PETRI_TRANSITIONS=39} [2024-06-03 20:49:36,017 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 35 predicate places. [2024-06-03 20:49:36,017 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 39 transitions, 233 flow [2024-06-03 20:49:36,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:36,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:36,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:36,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 20:49:36,018 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 20:49:36,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:36,019 INFO L85 PathProgramCache]: Analyzing trace with hash -2102342258, now seen corresponding path program 2 times [2024-06-03 20:49:36,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:36,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270012740] [2024-06-03 20:49:36,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:36,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:36,233 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-03 20:49:36,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:36,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270012740] [2024-06-03 20:49:36,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270012740] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:36,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:36,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:49:36,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807452671] [2024-06-03 20:49:36,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:36,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:49:36,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:36,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:49:36,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:49:36,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-06-03 20:49:36,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 39 transitions, 233 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:36,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:36,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-06-03 20:49:36,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:36,365 INFO L124 PetriNetUnfolderBase]: 91/227 cut-off events. [2024-06-03 20:49:36,365 INFO L125 PetriNetUnfolderBase]: For 2020/2020 co-relation queries the response was YES. [2024-06-03 20:49:36,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 227 events. 91/227 cut-off events. For 2020/2020 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 937 event pairs, 26 based on Foata normal form. 8/233 useless extension candidates. Maximal degree in co-relation 724. Up to 117 conditions per place. [2024-06-03 20:49:36,367 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 26 selfloop transitions, 12 changer transitions 10/53 dead transitions. [2024-06-03 20:49:36,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 53 transitions, 365 flow [2024-06-03 20:49:36,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:49:36,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:49:36,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2024-06-03 20:49:36,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5089605734767025 [2024-06-03 20:49:36,369 INFO L175 Difference]: Start difference. First operand has 65 places, 39 transitions, 233 flow. Second operand 9 states and 142 transitions. [2024-06-03 20:49:36,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 53 transitions, 365 flow [2024-06-03 20:49:36,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 53 transitions, 331 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-03 20:49:36,375 INFO L231 Difference]: Finished difference. Result has 65 places, 35 transitions, 203 flow [2024-06-03 20:49:36,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=203, PETRI_PLACES=65, PETRI_TRANSITIONS=35} [2024-06-03 20:49:36,376 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 35 predicate places. [2024-06-03 20:49:36,376 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 35 transitions, 203 flow [2024-06-03 20:49:36,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:36,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:36,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:36,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 20:49:36,377 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-03 20:49:36,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:36,377 INFO L85 PathProgramCache]: Analyzing trace with hash 374093954, now seen corresponding path program 5 times [2024-06-03 20:49:36,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:36,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920692923] [2024-06-03 20:49:36,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:36,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:36,555 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-03 20:49:36,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:36,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920692923] [2024-06-03 20:49:36,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920692923] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:36,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:36,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:49:36,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57526697] [2024-06-03 20:49:36,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:36,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:49:36,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:36,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:49:36,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:49:36,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-06-03 20:49:36,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 35 transitions, 203 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:36,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:36,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-06-03 20:49:36,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:36,678 INFO L124 PetriNetUnfolderBase]: 73/195 cut-off events. [2024-06-03 20:49:36,678 INFO L125 PetriNetUnfolderBase]: For 1520/1520 co-relation queries the response was YES. [2024-06-03 20:49:36,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 195 events. 73/195 cut-off events. For 1520/1520 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 733 event pairs, 19 based on Foata normal form. 6/199 useless extension candidates. Maximal degree in co-relation 594. Up to 62 conditions per place. [2024-06-03 20:49:36,680 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 18 selfloop transitions, 5 changer transitions 22/50 dead transitions. [2024-06-03 20:49:36,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 50 transitions, 327 flow [2024-06-03 20:49:36,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:49:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:49:36,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2024-06-03 20:49:36,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5017921146953405 [2024-06-03 20:49:36,681 INFO L175 Difference]: Start difference. First operand has 65 places, 35 transitions, 203 flow. Second operand 9 states and 140 transitions. [2024-06-03 20:49:36,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 50 transitions, 327 flow [2024-06-03 20:49:36,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 50 transitions, 299 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-03 20:49:36,684 INFO L231 Difference]: Finished difference. Result has 63 places, 25 transitions, 129 flow [2024-06-03 20:49:36,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=129, PETRI_PLACES=63, PETRI_TRANSITIONS=25} [2024-06-03 20:49:36,684 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 33 predicate places. [2024-06-03 20:49:36,685 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 25 transitions, 129 flow [2024-06-03 20:49:36,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:36,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:36,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:36,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 20:49:36,685 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-03 20:49:36,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:36,686 INFO L85 PathProgramCache]: Analyzing trace with hash 358009938, now seen corresponding path program 3 times [2024-06-03 20:49:36,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:36,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192538230] [2024-06-03 20:49:36,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:36,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:36,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-03 20:49:36,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:36,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192538230] [2024-06-03 20:49:36,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192538230] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:36,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:36,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:49:36,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420606128] [2024-06-03 20:49:36,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:36,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:49:36,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:36,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:49:36,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:49:36,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-06-03 20:49:36,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 25 transitions, 129 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:36,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:36,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-06-03 20:49:36,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:37,013 INFO L124 PetriNetUnfolderBase]: 42/116 cut-off events. [2024-06-03 20:49:37,013 INFO L125 PetriNetUnfolderBase]: For 1220/1220 co-relation queries the response was YES. [2024-06-03 20:49:37,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390 conditions, 116 events. 42/116 cut-off events. For 1220/1220 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 341 event pairs, 15 based on Foata normal form. 6/121 useless extension candidates. Maximal degree in co-relation 360. Up to 52 conditions per place. [2024-06-03 20:49:37,014 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 16 selfloop transitions, 4 changer transitions 10/35 dead transitions. [2024-06-03 20:49:37,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 35 transitions, 213 flow [2024-06-03 20:49:37,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:49:37,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:49:37,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2024-06-03 20:49:37,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4798387096774194 [2024-06-03 20:49:37,015 INFO L175 Difference]: Start difference. First operand has 63 places, 25 transitions, 129 flow. Second operand 8 states and 119 transitions. [2024-06-03 20:49:37,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 35 transitions, 213 flow [2024-06-03 20:49:37,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 35 transitions, 180 flow, removed 8 selfloop flow, removed 13 redundant places. [2024-06-03 20:49:37,017 INFO L231 Difference]: Finished difference. Result has 48 places, 22 transitions, 92 flow [2024-06-03 20:49:37,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=92, PETRI_PLACES=48, PETRI_TRANSITIONS=22} [2024-06-03 20:49:37,021 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 18 predicate places. [2024-06-03 20:49:37,021 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 22 transitions, 92 flow [2024-06-03 20:49:37,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:37,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:49:37,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:37,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 20:49:37,022 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-03 20:49:37,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:49:37,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1886747646, now seen corresponding path program 4 times [2024-06-03 20:49:37,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:49:37,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005649693] [2024-06-03 20:49:37,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:49:37,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:49:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:49:37,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:49:37,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:49:37,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005649693] [2024-06-03 20:49:37,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005649693] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:49:37,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:49:37,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:49:37,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484027700] [2024-06-03 20:49:37,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:49:37,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:49:37,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:49:37,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:49:37,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:49:37,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-06-03 20:49:37,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 22 transitions, 92 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:37,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:49:37,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-06-03 20:49:37,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:49:37,293 INFO L124 PetriNetUnfolderBase]: 20/64 cut-off events. [2024-06-03 20:49:37,293 INFO L125 PetriNetUnfolderBase]: For 268/268 co-relation queries the response was YES. [2024-06-03 20:49:37,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 64 events. 20/64 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 6/69 useless extension candidates. Maximal degree in co-relation 153. Up to 24 conditions per place. [2024-06-03 20:49:37,294 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 0 selfloop transitions, 0 changer transitions 28/28 dead transitions. [2024-06-03 20:49:37,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 28 transitions, 132 flow [2024-06-03 20:49:37,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:49:37,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:49:37,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2024-06-03 20:49:37,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2024-06-03 20:49:37,295 INFO L175 Difference]: Start difference. First operand has 48 places, 22 transitions, 92 flow. Second operand 8 states and 112 transitions. [2024-06-03 20:49:37,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 28 transitions, 132 flow [2024-06-03 20:49:37,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 28 transitions, 108 flow, removed 1 selfloop flow, removed 12 redundant places. [2024-06-03 20:49:37,296 INFO L231 Difference]: Finished difference. Result has 37 places, 0 transitions, 0 flow [2024-06-03 20:49:37,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=37, PETRI_TRANSITIONS=0} [2024-06-03 20:49:37,298 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2024-06-03 20:49:37,298 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 0 transitions, 0 flow [2024-06-03 20:49:37,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:49:37,301 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-03 20:49:37,301 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-03 20:49:37,301 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-03 20:49:37,301 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-03 20:49:37,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 20:49:37,302 INFO L445 BasicCegarLoop]: Path program histogram: [5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2024-06-03 20:49:37,305 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-03 20:49:37,305 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-03 20:49:37,308 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-03 20:49:37,308 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-03 20:49:37,309 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.06 08:49:37 BasicIcfg [2024-06-03 20:49:37,310 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-03 20:49:37,310 INFO L158 Benchmark]: Toolchain (without parser) took 12193.78ms. Allocated memory was 190.8MB in the beginning and 444.6MB in the end (delta: 253.8MB). Free memory was 160.5MB in the beginning and 294.3MB in the end (delta: -133.8MB). Peak memory consumption was 120.0MB. Max. memory is 16.1GB. [2024-06-03 20:49:37,310 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 130.0MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 20:49:37,311 INFO L158 Benchmark]: Witness Parser took 0.18ms. Allocated memory is still 190.8MB. Free memory is still 164.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 20:49:37,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 589.56ms. Allocated memory is still 190.8MB. Free memory was 160.5MB in the beginning and 133.3MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-06-03 20:49:37,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.84ms. Allocated memory is still 190.8MB. Free memory was 133.3MB in the beginning and 131.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-03 20:49:37,311 INFO L158 Benchmark]: Boogie Preprocessor took 52.97ms. Allocated memory is still 190.8MB. Free memory was 131.1MB in the beginning and 129.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-03 20:49:37,312 INFO L158 Benchmark]: RCFGBuilder took 473.36ms. Allocated memory is still 190.8MB. Free memory was 128.0MB in the beginning and 101.8MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-06-03 20:49:37,312 INFO L158 Benchmark]: TraceAbstraction took 11013.34ms. Allocated memory was 190.8MB in the beginning and 444.6MB in the end (delta: 253.8MB). Free memory was 101.8MB in the beginning and 294.3MB in the end (delta: -192.5MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. [2024-06-03 20:49:37,313 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.18ms. Allocated memory is still 130.0MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.18ms. Allocated memory is still 190.8MB. Free memory is still 164.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 589.56ms. Allocated memory is still 190.8MB. Free memory was 160.5MB in the beginning and 133.3MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.84ms. Allocated memory is still 190.8MB. Free memory was 133.3MB in the beginning and 131.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.97ms. Allocated memory is still 190.8MB. Free memory was 131.1MB in the beginning and 129.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 473.36ms. Allocated memory is still 190.8MB. Free memory was 128.0MB in the beginning and 101.8MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11013.34ms. Allocated memory was 190.8MB in the beginning and 444.6MB in the end (delta: 253.8MB). Free memory was 101.8MB in the beginning and 294.3MB in the end (delta: -192.5MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 763]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 764]: 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, 49 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: 10.9s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1402 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1081 mSDsluCounter, 397 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 253 mSDsCounter, 105 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4161 IncrementalHoareTripleChecker+Invalid, 4266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 105 mSolverCounterUnsat, 144 mSDtfsCounter, 4161 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=385occurred in iteration=19, InterpolantAutomatonStates: 210, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 444 NumberOfCodeBlocks, 444 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 415 ConstructedInterpolants, 0 QuantifiedInterpolants, 3405 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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-03 20:49:37,340 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