./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe024_tso.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe024_tso.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 958ec4d9 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/safe024_tso.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe024_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 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-958ec4d-m [2024-02-07 14:24:45,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 14:24:45,647 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 14:24:45,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 14:24:45,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 14:24:45,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 14:24:45,677 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 14:24:45,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 14:24:45,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 14:24:45,681 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 14:24:45,681 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 14:24:45,681 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 14:24:45,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 14:24:45,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 14:24:45,684 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 14:24:45,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 14:24:45,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 14:24:45,684 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 14:24:45,684 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 14:24:45,685 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 14:24:45,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 14:24:45,685 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 14:24:45,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 14:24:45,686 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 14:24:45,686 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 14:24:45,686 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 14:24:45,686 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 14:24:45,687 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 14:24:45,687 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 14:24:45,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 14:24:45,688 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 14:24:45,689 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 14:24:45,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:24:45,689 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 14:24:45,690 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 14:24:45,690 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 14:24:45,690 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 14:24:45,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 14:24:45,690 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 14:24:45,691 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 14:24:45,691 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 14:24:45,691 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 14:24:45,691 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 14:24:45,691 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-02-07 14:24:45,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 14:24:45,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 14:24:45,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 14:24:45,914 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 14:24:45,914 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 14:24:45,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_tso.i [2024-02-07 14:24:46,868 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 14:24:47,091 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 14:24:47,095 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_tso.i [2024-02-07 14:24:47,111 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a208fea23/203af2ff4bcb4aafbc982d821cfe00c4/FLAGb194894d4 [2024-02-07 14:24:47,123 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a208fea23/203af2ff4bcb4aafbc982d821cfe00c4 [2024-02-07 14:24:47,127 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 14:24:47,136 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 14:24:47,137 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe024_tso.yml/witness.yml [2024-02-07 14:24:47,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 14:24:47,234 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 14:24:47,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 14:24:47,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 14:24:47,239 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 14:24:47,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:24:47" (1/2) ... [2024-02-07 14:24:47,240 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71b173dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:47, skipping insertion in model container [2024-02-07 14:24:47,240 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:24:47" (1/2) ... [2024-02-07 14:24:47,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1ac0bd2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:47, skipping insertion in model container [2024-02-07 14:24:47,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:24:47" (2/2) ... [2024-02-07 14:24:47,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71b173dd and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:47, skipping insertion in model container [2024-02-07 14:24:47,242 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:24:47" (2/2) ... [2024-02-07 14:24:47,243 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 14:24:47,327 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 14:24:47,329 INFO L76 edCorrectnessWitness]: Location invariant before [L763-L763] ((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) [2024-02-07 14:24:47,329 INFO L76 edCorrectnessWitness]: Location invariant before [L745-L745] x == 1 [2024-02-07 14:24:47,329 INFO L76 edCorrectnessWitness]: Location invariant before [L733-L733] ((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) [2024-02-07 14:24:47,329 INFO L76 edCorrectnessWitness]: Location invariant before [L738-L738] 1 <= __unbuffered_cnt [2024-02-07 14:24:47,329 INFO L76 edCorrectnessWitness]: Location invariant before [L762-L762] ((0 <= z) && (z <= 1)) && (z == 0 || z == 1) [2024-02-07 14:24:47,330 INFO L76 edCorrectnessWitness]: Location invariant before [L795-L795] ((((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 1)) && (__unbuffered_p0_EAX == 0)) && (__unbuffered_p2_EAX == 1 || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) [2024-02-07 14:24:47,330 INFO L76 edCorrectnessWitness]: Location invariant before [L796-L796] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 14:24:47,330 INFO L76 edCorrectnessWitness]: Location invariant before [L18-L18] ((0 <= expression) && (expression <= 1)) && (expression == 0 || expression == 1) [2024-02-07 14:24:47,331 INFO L76 edCorrectnessWitness]: Location invariant before [L728-L728] z == 1 [2024-02-07 14:24:47,331 INFO L76 edCorrectnessWitness]: Location invariant before [L791-L791] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 14:24:47,331 INFO L76 edCorrectnessWitness]: Location invariant before [L767-L767] 0 <= __unbuffered_cnt [2024-02-07 14:24:47,331 INFO L76 edCorrectnessWitness]: Location invariant before [L790-L790] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 14:24:47,331 INFO L76 edCorrectnessWitness]: Location invariant before [L797-L797] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 14:24:47,331 INFO L76 edCorrectnessWitness]: Location invariant before [L748-L748] y == 1 [2024-02-07 14:24:47,331 INFO L76 edCorrectnessWitness]: Location invariant before [L737-L737] 0 <= __unbuffered_cnt [2024-02-07 14:24:47,331 INFO L76 edCorrectnessWitness]: Location invariant before [L759-L759] ((0 <= y) && (y <= 1)) && (y == 0 || y == 1) [2024-02-07 14:24:47,332 INFO L76 edCorrectnessWitness]: Location invariant before [L753-L753] 1 <= __unbuffered_cnt [2024-02-07 14:24:47,332 INFO L76 edCorrectnessWitness]: Location invariant before [L760-L760] ((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) [2024-02-07 14:24:47,332 INFO L76 edCorrectnessWitness]: Location invariant before [L789-L789] 0 <= __unbuffered_cnt [2024-02-07 14:24:47,332 INFO L76 edCorrectnessWitness]: Location invariant before [L768-L768] 1 <= __unbuffered_cnt [2024-02-07 14:24:47,332 INFO L76 edCorrectnessWitness]: Location invariant before [L732-L732] ((0 <= x) && (x <= 1)) && (x == 0 || x == 1) [2024-02-07 14:24:47,333 INFO L76 edCorrectnessWitness]: Location invariant before [L752-L752] 0 <= __unbuffered_cnt [2024-02-07 14:24:47,395 INFO L178 MainTranslator]: Built tables and reachable declarations [2024-02-07 14:24:47,554 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_tso.i[945,958] [2024-02-07 14:24:47,675 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:24:47,683 INFO L203 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 14:24:47,713 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_tso.i[945,958] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 14:24:47,746 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:24:47,776 INFO L207 MainTranslator]: Completed translation [2024-02-07 14:24:47,776 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:47 WrapperNode [2024-02-07 14:24:47,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 14:24:47,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 14:24:47,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 14:24:47,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 14:24:47,784 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 07.02 02:24:47" (1/1) ... [2024-02-07 14:24:47,810 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 07.02 02:24:47" (1/1) ... [2024-02-07 14:24:47,836 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 78 [2024-02-07 14:24:47,838 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 14:24:47,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 14:24:47,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 14:24:47,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 14:24:47,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:47" (1/1) ... [2024-02-07 14:24:47,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:47" (1/1) ... [2024-02-07 14:24:47,861 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:47" (1/1) ... [2024-02-07 14:24:47,879 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-02-07 14:24:47,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:47" (1/1) ... [2024-02-07 14:24:47,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:47" (1/1) ... [2024-02-07 14:24:47,895 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:47" (1/1) ... [2024-02-07 14:24:47,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:47" (1/1) ... [2024-02-07 14:24:47,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:47" (1/1) ... [2024-02-07 14:24:47,907 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:47" (1/1) ... [2024-02-07 14:24:47,909 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 14:24:47,910 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 14:24:47,910 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 14:24:47,910 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 14:24:47,911 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:47" (1/1) ... [2024-02-07 14:24:47,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:24:47,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:24:47,933 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-02-07 14:24:47,944 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-02-07 14:24:47,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 14:24:47,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 14:24:47,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 14:24:47,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 14:24:47,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 14:24:47,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 14:24:47,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 14:24:47,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 14:24:47,975 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-02-07 14:24:47,976 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-02-07 14:24:47,976 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-02-07 14:24:47,977 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-02-07 14:24:47,977 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-02-07 14:24:47,980 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-02-07 14:24:47,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 14:24:47,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 14:24:47,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 14:24:47,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 14:24:47,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 14:24:47,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 14:24:47,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 14:24:47,982 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-07 14:24:48,093 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 14:24:48,094 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 14:24:48,288 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 14:24:48,288 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 14:24:48,365 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 14:24:48,365 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-07 14:24:48,366 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:24:48 BoogieIcfgContainer [2024-02-07 14:24:48,366 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 14:24:48,367 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 14:24:48,367 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 14:24:48,370 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 14:24:48,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 02:24:47" (1/4) ... [2024-02-07 14:24:48,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16071767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:24:48, skipping insertion in model container [2024-02-07 14:24:48,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:24:47" (2/4) ... [2024-02-07 14:24:48,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16071767 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:24:48, skipping insertion in model container [2024-02-07 14:24:48,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:47" (3/4) ... [2024-02-07 14:24:48,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16071767 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:24:48, skipping insertion in model container [2024-02-07 14:24:48,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:24:48" (4/4) ... [2024-02-07 14:24:48,372 INFO L112 eAbstractionObserver]: Analyzing ICFG safe024_tso.i [2024-02-07 14:24:48,385 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 14:24:48,385 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-02-07 14:24:48,385 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 14:24:48,423 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-07 14:24:48,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 62 transitions, 136 flow [2024-02-07 14:24:48,486 INFO L124 PetriNetUnfolderBase]: 1/59 cut-off events. [2024-02-07 14:24:48,487 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:24:48,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 59 events. 1/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 184 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2024-02-07 14:24:48,490 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 62 transitions, 136 flow [2024-02-07 14:24:48,493 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 59 transitions, 127 flow [2024-02-07 14:24:48,507 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 14:24:48,514 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;@76b09ee8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 14:24:48,514 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-02-07 14:24:48,520 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 14:24:48,520 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-02-07 14:24:48,520 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:24:48,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:48,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-07 14:24:48,522 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 14:24:48,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:48,527 INFO L85 PathProgramCache]: Analyzing trace with hash 9884516, now seen corresponding path program 1 times [2024-02-07 14:24:48,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:48,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152558022] [2024-02-07 14:24:48,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:48,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:48,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:48,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:48,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152558022] [2024-02-07 14:24:48,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152558022] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:48,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:48,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:24:48,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076943299] [2024-02-07 14:24:48,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:48,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-02-07 14:24:48,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:48,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-02-07 14:24:48,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-02-07 14:24:48,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 14:24:48,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 127 flow. Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:48,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:48,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 14:24:48,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:49,795 INFO L124 PetriNetUnfolderBase]: 7577/13079 cut-off events. [2024-02-07 14:24:49,796 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-02-07 14:24:49,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23884 conditions, 13079 events. 7577/13079 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 106137 event pairs, 7577 based on Foata normal form. 336/9397 useless extension candidates. Maximal degree in co-relation 23873. Up to 10701 conditions per place. [2024-02-07 14:24:49,926 INFO L140 encePairwiseOnDemand]: 50/62 looper letters, 32 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2024-02-07 14:24:49,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 47 transitions, 167 flow [2024-02-07 14:24:49,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-02-07 14:24:49,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-02-07 14:24:49,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 80 transitions. [2024-02-07 14:24:49,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2024-02-07 14:24:49,937 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 127 flow. Second operand 2 states and 80 transitions. [2024-02-07 14:24:49,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 47 transitions, 167 flow [2024-02-07 14:24:49,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-07 14:24:49,948 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 100 flow [2024-02-07 14:24:49,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=100, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2024-02-07 14:24:49,953 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -13 predicate places. [2024-02-07 14:24:49,953 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 100 flow [2024-02-07 14:24:49,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:49,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:49,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-07 14:24:49,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 14:24:49,955 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 14:24:49,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:49,956 INFO L85 PathProgramCache]: Analyzing trace with hash 909096582, now seen corresponding path program 1 times [2024-02-07 14:24:49,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:49,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496110036] [2024-02-07 14:24:49,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:49,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:50,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:50,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:50,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496110036] [2024-02-07 14:24:50,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496110036] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:50,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:50,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:24:50,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351676169] [2024-02-07 14:24:50,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:50,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:50,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:50,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:50,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:50,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 14:24:50,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:50,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:50,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 14:24:50,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:50,642 INFO L124 PetriNetUnfolderBase]: 7372/11221 cut-off events. [2024-02-07 14:24:50,642 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:24:50,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21739 conditions, 11221 events. 7372/11221 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 77877 event pairs, 1007 based on Foata normal form. 0/8004 useless extension candidates. Maximal degree in co-relation 21736. Up to 9252 conditions per place. [2024-02-07 14:24:50,694 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 52 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2024-02-07 14:24:50,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 254 flow [2024-02-07 14:24:50,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:50,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-02-07 14:24:50,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5860215053763441 [2024-02-07 14:24:50,696 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 100 flow. Second operand 3 states and 109 transitions. [2024-02-07 14:24:50,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 254 flow [2024-02-07 14:24:50,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 69 transitions, 254 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-07 14:24:50,698 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 108 flow [2024-02-07 14:24:50,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2024-02-07 14:24:50,699 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2024-02-07 14:24:50,699 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 108 flow [2024-02-07 14:24:50,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:50,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:50,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:50,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 14:24:50,700 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 14:24:50,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:50,700 INFO L85 PathProgramCache]: Analyzing trace with hash 878735885, now seen corresponding path program 1 times [2024-02-07 14:24:50,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:50,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856925722] [2024-02-07 14:24:50,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:50,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:50,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:50,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:50,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856925722] [2024-02-07 14:24:50,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856925722] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:50,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:50,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:24:50,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235936403] [2024-02-07 14:24:50,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:50,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:50,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:50,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:50,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:50,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 14:24:50,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:50,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:50,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 14:24:50,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:51,547 INFO L124 PetriNetUnfolderBase]: 7052/11106 cut-off events. [2024-02-07 14:24:51,547 INFO L125 PetriNetUnfolderBase]: For 750/750 co-relation queries the response was YES. [2024-02-07 14:24:51,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22331 conditions, 11106 events. 7052/11106 cut-off events. For 750/750 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 81276 event pairs, 1916 based on Foata normal form. 0/8319 useless extension candidates. Maximal degree in co-relation 22326. Up to 7398 conditions per place. [2024-02-07 14:24:51,678 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 52 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2024-02-07 14:24:51,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 264 flow [2024-02-07 14:24:51,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-02-07 14:24:51,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5860215053763441 [2024-02-07 14:24:51,680 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 108 flow. Second operand 3 states and 109 transitions. [2024-02-07 14:24:51,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 264 flow [2024-02-07 14:24:51,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 69 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:24:51,682 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 112 flow [2024-02-07 14:24:51,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2024-02-07 14:24:51,683 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -9 predicate places. [2024-02-07 14:24:51,683 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 112 flow [2024-02-07 14:24:51,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:51,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:51,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:51,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 14:24:51,684 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 14:24:51,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:51,684 INFO L85 PathProgramCache]: Analyzing trace with hash 878734029, now seen corresponding path program 1 times [2024-02-07 14:24:51,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:51,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374292004] [2024-02-07 14:24:51,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:51,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:51,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:51,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374292004] [2024-02-07 14:24:51,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374292004] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:51,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:51,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:24:51,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820667256] [2024-02-07 14:24:51,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:51,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:51,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:51,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:51,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:51,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 14:24:51,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:51,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:51,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 14:24:51,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:52,175 INFO L124 PetriNetUnfolderBase]: 5392/8152 cut-off events. [2024-02-07 14:24:52,175 INFO L125 PetriNetUnfolderBase]: For 818/818 co-relation queries the response was YES. [2024-02-07 14:24:52,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17468 conditions, 8152 events. 5392/8152 cut-off events. For 818/818 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 51378 event pairs, 1744 based on Foata normal form. 0/6612 useless extension candidates. Maximal degree in co-relation 17462. Up to 6544 conditions per place. [2024-02-07 14:24:52,215 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 51 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2024-02-07 14:24:52,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 70 transitions, 280 flow [2024-02-07 14:24:52,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:52,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:52,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-02-07 14:24:52,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6075268817204301 [2024-02-07 14:24:52,220 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 112 flow. Second operand 3 states and 113 transitions. [2024-02-07 14:24:52,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 70 transitions, 280 flow [2024-02-07 14:24:52,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 70 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:24:52,223 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 140 flow [2024-02-07 14:24:52,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2024-02-07 14:24:52,224 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -8 predicate places. [2024-02-07 14:24:52,224 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 140 flow [2024-02-07 14:24:52,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:52,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:52,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:52,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 14:24:52,225 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 14:24:52,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:52,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1471009067, now seen corresponding path program 1 times [2024-02-07 14:24:52,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:52,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64373352] [2024-02-07 14:24:52,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:52,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:52,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:52,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:52,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64373352] [2024-02-07 14:24:52,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64373352] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:52,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:52,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:24:52,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741684633] [2024-02-07 14:24:52,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:52,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:52,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:52,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:52,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:52,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 14:24:52,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:52,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:52,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 14:24:52,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:52,828 INFO L124 PetriNetUnfolderBase]: 5280/8275 cut-off events. [2024-02-07 14:24:52,828 INFO L125 PetriNetUnfolderBase]: For 1348/1348 co-relation queries the response was YES. [2024-02-07 14:24:52,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19306 conditions, 8275 events. 5280/8275 cut-off events. For 1348/1348 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 55229 event pairs, 1306 based on Foata normal form. 0/7052 useless extension candidates. Maximal degree in co-relation 19299. Up to 6883 conditions per place. [2024-02-07 14:24:52,878 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 58 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2024-02-07 14:24:52,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 75 transitions, 334 flow [2024-02-07 14:24:52,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:52,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:52,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2024-02-07 14:24:52,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5913978494623656 [2024-02-07 14:24:52,880 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 140 flow. Second operand 3 states and 110 transitions. [2024-02-07 14:24:52,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 75 transitions, 334 flow [2024-02-07 14:24:52,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 75 transitions, 328 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:24:52,883 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 144 flow [2024-02-07 14:24:52,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2024-02-07 14:24:52,886 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -6 predicate places. [2024-02-07 14:24:52,886 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 144 flow [2024-02-07 14:24:52,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:52,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:52,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:52,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 14:24:52,887 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 14:24:52,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:52,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1470951487, now seen corresponding path program 1 times [2024-02-07 14:24:52,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:52,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701037408] [2024-02-07 14:24:52,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:52,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:52,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:52,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:52,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701037408] [2024-02-07 14:24:52,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701037408] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:52,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:52,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:24:52,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896887681] [2024-02-07 14:24:52,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:52,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:52,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:52,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:52,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:52,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2024-02-07 14:24:52,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:52,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:52,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2024-02-07 14:24:52,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:53,473 INFO L124 PetriNetUnfolderBase]: 5280/8971 cut-off events. [2024-02-07 14:24:53,474 INFO L125 PetriNetUnfolderBase]: For 1981/1981 co-relation queries the response was YES. [2024-02-07 14:24:53,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20468 conditions, 8971 events. 5280/8971 cut-off events. For 1981/1981 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 67373 event pairs, 4970 based on Foata normal form. 0/7515 useless extension candidates. Maximal degree in co-relation 20460. Up to 7589 conditions per place. [2024-02-07 14:24:53,532 INFO L140 encePairwiseOnDemand]: 60/62 looper letters, 34 selfloop transitions, 1 changer transitions 0/49 dead transitions. [2024-02-07 14:24:53,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 49 transitions, 212 flow [2024-02-07 14:24:53,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:53,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-02-07 14:24:53,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2024-02-07 14:24:53,533 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 144 flow. Second operand 3 states and 84 transitions. [2024-02-07 14:24:53,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 49 transitions, 212 flow [2024-02-07 14:24:53,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:24:53,536 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 140 flow [2024-02-07 14:24:53,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2024-02-07 14:24:53,537 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -7 predicate places. [2024-02-07 14:24:53,537 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 140 flow [2024-02-07 14:24:53,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:53,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:53,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:53,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 14:24:53,538 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 14:24:53,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:53,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1501062861, now seen corresponding path program 1 times [2024-02-07 14:24:53,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:53,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615315955] [2024-02-07 14:24:53,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:53,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:53,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:53,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:53,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615315955] [2024-02-07 14:24:53,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615315955] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:53,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:53,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:24:53,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606888933] [2024-02-07 14:24:53,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:53,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:53,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:53,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:53,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:53,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 14:24:53,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:53,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:53,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 14:24:53,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:53,983 INFO L124 PetriNetUnfolderBase]: 4604/7073 cut-off events. [2024-02-07 14:24:53,983 INFO L125 PetriNetUnfolderBase]: For 1308/1308 co-relation queries the response was YES. [2024-02-07 14:24:53,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16776 conditions, 7073 events. 4604/7073 cut-off events. For 1308/1308 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 45008 event pairs, 1232 based on Foata normal form. 278/6426 useless extension candidates. Maximal degree in co-relation 16768. Up to 5889 conditions per place. [2024-02-07 14:24:54,023 INFO L140 encePairwiseOnDemand]: 60/62 looper letters, 56 selfloop transitions, 1 changer transitions 0/71 dead transitions. [2024-02-07 14:24:54,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 71 transitions, 315 flow [2024-02-07 14:24:54,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:54,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:54,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-02-07 14:24:54,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5752688172043011 [2024-02-07 14:24:54,025 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 140 flow. Second operand 3 states and 107 transitions. [2024-02-07 14:24:54,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 71 transitions, 315 flow [2024-02-07 14:24:54,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 71 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:24:54,027 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 135 flow [2024-02-07 14:24:54,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2024-02-07 14:24:54,028 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -8 predicate places. [2024-02-07 14:24:54,028 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 135 flow [2024-02-07 14:24:54,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:54,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:54,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:54,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 14:24:54,029 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 14:24:54,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:54,030 INFO L85 PathProgramCache]: Analyzing trace with hash -748791895, now seen corresponding path program 1 times [2024-02-07 14:24:54,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:54,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776296968] [2024-02-07 14:24:54,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:54,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:54,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:54,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:54,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776296968] [2024-02-07 14:24:54,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776296968] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:54,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:54,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:24:54,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346081029] [2024-02-07 14:24:54,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:54,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:54,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:54,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:54,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:54,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 14:24:54,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:54,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:54,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 14:24:54,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:54,400 INFO L124 PetriNetUnfolderBase]: 4097/6544 cut-off events. [2024-02-07 14:24:54,400 INFO L125 PetriNetUnfolderBase]: For 1298/1298 co-relation queries the response was YES. [2024-02-07 14:24:54,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15121 conditions, 6544 events. 4097/6544 cut-off events. For 1298/1298 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 42511 event pairs, 1154 based on Foata normal form. 210/5902 useless extension candidates. Maximal degree in co-relation 15114. Up to 5211 conditions per place. [2024-02-07 14:24:54,429 INFO L140 encePairwiseOnDemand]: 60/62 looper letters, 57 selfloop transitions, 1 changer transitions 0/72 dead transitions. [2024-02-07 14:24:54,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 72 transitions, 320 flow [2024-02-07 14:24:54,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:54,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:54,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-02-07 14:24:54,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226 [2024-02-07 14:24:54,430 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 135 flow. Second operand 3 states and 108 transitions. [2024-02-07 14:24:54,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 72 transitions, 320 flow [2024-02-07 14:24:54,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 72 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:24:54,432 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 130 flow [2024-02-07 14:24:54,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2024-02-07 14:24:54,433 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -9 predicate places. [2024-02-07 14:24:54,433 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 130 flow [2024-02-07 14:24:54,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:54,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:54,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:54,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 14:24:54,434 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 14:24:54,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:54,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1860981199, now seen corresponding path program 1 times [2024-02-07 14:24:54,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:54,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379806307] [2024-02-07 14:24:54,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:54,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:54,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:54,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:54,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379806307] [2024-02-07 14:24:54,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379806307] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:54,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:54,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:24:54,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906015046] [2024-02-07 14:24:54,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:54,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:54,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:54,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:54,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:54,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 14:24:54,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:54,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:54,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 14:24:54,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:54,717 INFO L124 PetriNetUnfolderBase]: 3702/5926 cut-off events. [2024-02-07 14:24:54,718 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2024-02-07 14:24:54,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13625 conditions, 5926 events. 3702/5926 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 38859 event pairs, 1391 based on Foata normal form. 168/5224 useless extension candidates. Maximal degree in co-relation 13619. Up to 3799 conditions per place. [2024-02-07 14:24:54,746 INFO L140 encePairwiseOnDemand]: 60/62 looper letters, 53 selfloop transitions, 1 changer transitions 0/68 dead transitions. [2024-02-07 14:24:54,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 68 transitions, 296 flow [2024-02-07 14:24:54,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:54,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-02-07 14:24:54,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5591397849462365 [2024-02-07 14:24:54,748 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 130 flow. Second operand 3 states and 104 transitions. [2024-02-07 14:24:54,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 68 transitions, 296 flow [2024-02-07 14:24:54,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 68 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:24:54,750 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 125 flow [2024-02-07 14:24:54,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-02-07 14:24:54,750 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2024-02-07 14:24:54,751 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 125 flow [2024-02-07 14:24:54,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:54,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:54,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:54,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 14:24:54,751 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 14:24:54,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:54,752 INFO L85 PathProgramCache]: Analyzing trace with hash 540148345, now seen corresponding path program 1 times [2024-02-07 14:24:54,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:54,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782868871] [2024-02-07 14:24:54,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:54,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:54,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:54,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:54,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782868871] [2024-02-07 14:24:54,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782868871] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:54,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:54,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:24:54,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507871744] [2024-02-07 14:24:54,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:54,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:54,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:54,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:54,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:54,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 14:24:54,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:54,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:54,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 14:24:54,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:55,047 INFO L124 PetriNetUnfolderBase]: 3674/5617 cut-off events. [2024-02-07 14:24:55,047 INFO L125 PetriNetUnfolderBase]: For 891/891 co-relation queries the response was YES. [2024-02-07 14:24:55,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13266 conditions, 5617 events. 3674/5617 cut-off events. For 891/891 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 33664 event pairs, 1152 based on Foata normal form. 0/4869 useless extension candidates. Maximal degree in co-relation 13261. Up to 5105 conditions per place. [2024-02-07 14:24:55,071 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 47 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2024-02-07 14:24:55,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 64 transitions, 273 flow [2024-02-07 14:24:55,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:55,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:55,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-02-07 14:24:55,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5483870967741935 [2024-02-07 14:24:55,073 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 125 flow. Second operand 3 states and 102 transitions. [2024-02-07 14:24:55,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 64 transitions, 273 flow [2024-02-07 14:24:55,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 64 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:24:55,075 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 143 flow [2024-02-07 14:24:55,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2024-02-07 14:24:55,076 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -8 predicate places. [2024-02-07 14:24:55,076 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 143 flow [2024-02-07 14:24:55,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:55,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:55,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:55,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 14:24:55,077 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 14:24:55,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:55,077 INFO L85 PathProgramCache]: Analyzing trace with hash -435270165, now seen corresponding path program 1 times [2024-02-07 14:24:55,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:55,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932714981] [2024-02-07 14:24:55,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:55,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:55,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:55,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:55,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932714981] [2024-02-07 14:24:55,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932714981] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:55,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:55,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:24:55,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614077256] [2024-02-07 14:24:55,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:55,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:55,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:55,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:55,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:55,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2024-02-07 14:24:55,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:55,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:55,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2024-02-07 14:24:55,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:55,367 INFO L124 PetriNetUnfolderBase]: 3674/6248 cut-off events. [2024-02-07 14:24:55,367 INFO L125 PetriNetUnfolderBase]: For 1365/1365 co-relation queries the response was YES. [2024-02-07 14:24:55,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14692 conditions, 6248 events. 3674/6248 cut-off events. For 1365/1365 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 43889 event pairs, 3208 based on Foata normal form. 0/5273 useless extension candidates. Maximal degree in co-relation 14686. Up to 5317 conditions per place. [2024-02-07 14:24:55,393 INFO L140 encePairwiseOnDemand]: 60/62 looper letters, 33 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2024-02-07 14:24:55,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 47 transitions, 209 flow [2024-02-07 14:24:55,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:55,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:55,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2024-02-07 14:24:55,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43548387096774194 [2024-02-07 14:24:55,395 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 143 flow. Second operand 3 states and 81 transitions. [2024-02-07 14:24:55,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 47 transitions, 209 flow [2024-02-07 14:24:55,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 47 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:24:55,397 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 140 flow [2024-02-07 14:24:55,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2024-02-07 14:24:55,397 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -8 predicate places. [2024-02-07 14:24:55,397 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 140 flow [2024-02-07 14:24:55,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:55,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:55,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:55,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-07 14:24:55,398 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 14:24:55,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:55,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1642054454, now seen corresponding path program 1 times [2024-02-07 14:24:55,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:55,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974126077] [2024-02-07 14:24:55,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:55,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:55,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:55,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:55,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974126077] [2024-02-07 14:24:55,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974126077] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:55,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:55,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:24:55,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506069364] [2024-02-07 14:24:55,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:55,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:55,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:55,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:55,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:55,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 14:24:55,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:55,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:55,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 14:24:55,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:55,610 INFO L124 PetriNetUnfolderBase]: 2336/3606 cut-off events. [2024-02-07 14:24:55,610 INFO L125 PetriNetUnfolderBase]: For 974/974 co-relation queries the response was YES. [2024-02-07 14:24:55,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8820 conditions, 3606 events. 2336/3606 cut-off events. For 974/974 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 20346 event pairs, 614 based on Foata normal form. 98/3621 useless extension candidates. Maximal degree in co-relation 8814. Up to 2734 conditions per place. [2024-02-07 14:24:55,623 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 44 selfloop transitions, 3 changer transitions 2/62 dead transitions. [2024-02-07 14:24:55,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 277 flow [2024-02-07 14:24:55,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:55,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:55,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-02-07 14:24:55,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.553763440860215 [2024-02-07 14:24:55,624 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 140 flow. Second operand 3 states and 103 transitions. [2024-02-07 14:24:55,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 277 flow [2024-02-07 14:24:55,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 62 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:24:55,626 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 127 flow [2024-02-07 14:24:55,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2024-02-07 14:24:55,627 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -11 predicate places. [2024-02-07 14:24:55,627 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 127 flow [2024-02-07 14:24:55,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:55,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:55,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:55,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-07 14:24:55,627 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 14:24:55,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:55,628 INFO L85 PathProgramCache]: Analyzing trace with hash 970497174, now seen corresponding path program 1 times [2024-02-07 14:24:55,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:55,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552121737] [2024-02-07 14:24:55,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:55,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:55,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:55,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:55,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552121737] [2024-02-07 14:24:55,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552121737] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:55,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:55,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:24:55,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216013098] [2024-02-07 14:24:55,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:55,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:24:55,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:55,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:24:55,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:24:55,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 14:24:55,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:55,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:55,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 14:24:55,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:55,880 INFO L124 PetriNetUnfolderBase]: 2114/3348 cut-off events. [2024-02-07 14:24:55,881 INFO L125 PetriNetUnfolderBase]: For 1315/1315 co-relation queries the response was YES. [2024-02-07 14:24:55,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8296 conditions, 3348 events. 2114/3348 cut-off events. For 1315/1315 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 19294 event pairs, 624 based on Foata normal form. 10/3338 useless extension candidates. Maximal degree in co-relation 8290. Up to 2739 conditions per place. [2024-02-07 14:24:55,895 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 48 selfloop transitions, 9 changer transitions 0/70 dead transitions. [2024-02-07 14:24:55,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 70 transitions, 319 flow [2024-02-07 14:24:55,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:24:55,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:24:55,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2024-02-07 14:24:55,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5080645161290323 [2024-02-07 14:24:55,896 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 127 flow. Second operand 4 states and 126 transitions. [2024-02-07 14:24:55,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 70 transitions, 319 flow [2024-02-07 14:24:55,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 70 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:24:55,898 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 187 flow [2024-02-07 14:24:55,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=187, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2024-02-07 14:24:55,898 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -8 predicate places. [2024-02-07 14:24:55,898 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 187 flow [2024-02-07 14:24:55,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:55,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:55,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:55,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-07 14:24:55,899 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 14:24:55,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:55,899 INFO L85 PathProgramCache]: Analyzing trace with hash -608472886, now seen corresponding path program 1 times [2024-02-07 14:24:55,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:55,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114360561] [2024-02-07 14:24:55,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:55,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:56,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:56,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:56,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114360561] [2024-02-07 14:24:56,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114360561] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:56,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:56,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:24:56,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435662870] [2024-02-07 14:24:56,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:56,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:24:56,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:56,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:24:56,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:24:56,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2024-02-07 14:24:56,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 187 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:56,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:56,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2024-02-07 14:24:56,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:56,260 INFO L124 PetriNetUnfolderBase]: 2746/4461 cut-off events. [2024-02-07 14:24:56,260 INFO L125 PetriNetUnfolderBase]: For 2770/2770 co-relation queries the response was YES. [2024-02-07 14:24:56,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12092 conditions, 4461 events. 2746/4461 cut-off events. For 2770/2770 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 27762 event pairs, 1436 based on Foata normal form. 0/4438 useless extension candidates. Maximal degree in co-relation 12084. Up to 2625 conditions per place. [2024-02-07 14:24:56,280 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 60 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2024-02-07 14:24:56,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 72 transitions, 425 flow [2024-02-07 14:24:56,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:24:56,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:24:56,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2024-02-07 14:24:56,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38306451612903225 [2024-02-07 14:24:56,282 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 187 flow. Second operand 4 states and 95 transitions. [2024-02-07 14:24:56,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 72 transitions, 425 flow [2024-02-07 14:24:56,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 425 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-07 14:24:56,285 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 189 flow [2024-02-07 14:24:56,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2024-02-07 14:24:56,285 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -6 predicate places. [2024-02-07 14:24:56,285 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 189 flow [2024-02-07 14:24:56,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:56,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:56,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:56,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-07 14:24:56,286 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 14:24:56,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:56,287 INFO L85 PathProgramCache]: Analyzing trace with hash 22010270, now seen corresponding path program 1 times [2024-02-07 14:24:56,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:56,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506277839] [2024-02-07 14:24:56,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:56,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:56,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:56,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:56,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506277839] [2024-02-07 14:24:56,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506277839] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:56,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:56,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:24:56,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689765497] [2024-02-07 14:24:56,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:56,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:24:56,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:56,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:24:56,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:24:56,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 14:24:56,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 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-02-07 14:24:56,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:56,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 14:24:56,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:56,613 INFO L124 PetriNetUnfolderBase]: 2501/4001 cut-off events. [2024-02-07 14:24:56,613 INFO L125 PetriNetUnfolderBase]: For 2765/2767 co-relation queries the response was YES. [2024-02-07 14:24:56,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11290 conditions, 4001 events. 2501/4001 cut-off events. For 2765/2767 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 23988 event pairs, 655 based on Foata normal form. 32/4019 useless extension candidates. Maximal degree in co-relation 11281. Up to 2772 conditions per place. [2024-02-07 14:24:56,631 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 77 selfloop transitions, 15 changer transitions 0/104 dead transitions. [2024-02-07 14:24:56,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 104 transitions, 579 flow [2024-02-07 14:24:56,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:24:56,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:24:56,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2024-02-07 14:24:56,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532258064516129 [2024-02-07 14:24:56,632 INFO L175 Difference]: Start difference. First operand has 62 places, 48 transitions, 189 flow. Second operand 5 states and 165 transitions. [2024-02-07 14:24:56,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 104 transitions, 579 flow [2024-02-07 14:24:56,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 104 transitions, 573 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:24:56,636 INFO L231 Difference]: Finished difference. Result has 67 places, 59 transitions, 320 flow [2024-02-07 14:24:56,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=320, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2024-02-07 14:24:56,636 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2024-02-07 14:24:56,636 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 320 flow [2024-02-07 14:24:56,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 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-02-07 14:24:56,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:56,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:56,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-07 14:24:56,637 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 14:24:56,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:56,637 INFO L85 PathProgramCache]: Analyzing trace with hash 907936824, now seen corresponding path program 1 times [2024-02-07 14:24:56,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:56,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814503259] [2024-02-07 14:24:56,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:56,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:56,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:56,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:56,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814503259] [2024-02-07 14:24:56,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814503259] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:56,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:56,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:24:56,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043587610] [2024-02-07 14:24:56,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:56,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:24:56,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:56,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:24:56,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:24:56,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 14:24:56,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 320 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:56,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:56,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 14:24:56,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:56,964 INFO L124 PetriNetUnfolderBase]: 2689/4235 cut-off events. [2024-02-07 14:24:56,964 INFO L125 PetriNetUnfolderBase]: For 5954/5954 co-relation queries the response was YES. [2024-02-07 14:24:56,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13707 conditions, 4235 events. 2689/4235 cut-off events. For 5954/5954 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 25101 event pairs, 222 based on Foata normal form. 14/4236 useless extension candidates. Maximal degree in co-relation 13695. Up to 3426 conditions per place. [2024-02-07 14:24:56,986 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 69 selfloop transitions, 12 changer transitions 0/93 dead transitions. [2024-02-07 14:24:56,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 93 transitions, 631 flow [2024-02-07 14:24:56,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:24:56,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:24:56,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2024-02-07 14:24:56,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5080645161290323 [2024-02-07 14:24:56,987 INFO L175 Difference]: Start difference. First operand has 67 places, 59 transitions, 320 flow. Second operand 4 states and 126 transitions. [2024-02-07 14:24:56,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 93 transitions, 631 flow [2024-02-07 14:24:56,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 93 transitions, 631 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-07 14:24:56,992 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 405 flow [2024-02-07 14:24:56,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=405, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2024-02-07 14:24:56,993 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 4 predicate places. [2024-02-07 14:24:56,993 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 405 flow [2024-02-07 14:24:56,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:56,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:56,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:56,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-02-07 14:24:56,994 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 14:24:56,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:56,994 INFO L85 PathProgramCache]: Analyzing trace with hash -626880498, now seen corresponding path program 1 times [2024-02-07 14:24:56,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:56,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538865224] [2024-02-07 14:24:56,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:56,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:57,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:57,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:57,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538865224] [2024-02-07 14:24:57,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538865224] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:57,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:57,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:24:57,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904023882] [2024-02-07 14:24:57,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:57,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:24:57,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:57,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:24:57,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:24:57,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2024-02-07 14:24:57,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 405 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:57,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:57,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2024-02-07 14:24:57,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:57,364 INFO L124 PetriNetUnfolderBase]: 2474/4457 cut-off events. [2024-02-07 14:24:57,364 INFO L125 PetriNetUnfolderBase]: For 8077/8077 co-relation queries the response was YES. [2024-02-07 14:24:57,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13859 conditions, 4457 events. 2474/4457 cut-off events. For 8077/8077 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 30376 event pairs, 225 based on Foata normal form. 172/4487 useless extension candidates. Maximal degree in co-relation 13844. Up to 2031 conditions per place. [2024-02-07 14:24:57,385 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 99 selfloop transitions, 5 changer transitions 1/117 dead transitions. [2024-02-07 14:24:57,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 117 transitions, 971 flow [2024-02-07 14:24:57,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:24:57,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:24:57,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2024-02-07 14:24:57,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4879032258064516 [2024-02-07 14:24:57,386 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 405 flow. Second operand 4 states and 121 transitions. [2024-02-07 14:24:57,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 117 transitions, 971 flow [2024-02-07 14:24:57,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 117 transitions, 967 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-02-07 14:24:57,394 INFO L231 Difference]: Finished difference. Result has 77 places, 65 transitions, 423 flow [2024-02-07 14:24:57,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=423, PETRI_PLACES=77, PETRI_TRANSITIONS=65} [2024-02-07 14:24:57,394 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 9 predicate places. [2024-02-07 14:24:57,394 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 65 transitions, 423 flow [2024-02-07 14:24:57,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:57,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:57,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:57,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-02-07 14:24:57,395 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 14:24:57,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:57,395 INFO L85 PathProgramCache]: Analyzing trace with hash -844669953, now seen corresponding path program 1 times [2024-02-07 14:24:57,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:57,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408565084] [2024-02-07 14:24:57,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:57,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:57,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:57,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:57,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408565084] [2024-02-07 14:24:57,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408565084] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:57,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:57,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:24:57,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617812574] [2024-02-07 14:24:57,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:57,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:24:57,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:57,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:24:57,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:24:57,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 14:24:57,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 65 transitions, 423 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:57,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:57,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 14:24:57,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:57,819 INFO L124 PetriNetUnfolderBase]: 2286/4144 cut-off events. [2024-02-07 14:24:57,819 INFO L125 PetriNetUnfolderBase]: For 8396/8398 co-relation queries the response was YES. [2024-02-07 14:24:57,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13337 conditions, 4144 events. 2286/4144 cut-off events. For 8396/8398 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 27811 event pairs, 803 based on Foata normal form. 14/4001 useless extension candidates. Maximal degree in co-relation 13319. Up to 2518 conditions per place. [2024-02-07 14:24:57,840 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 106 selfloop transitions, 25 changer transitions 0/143 dead transitions. [2024-02-07 14:24:57,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 143 transitions, 1034 flow [2024-02-07 14:24:57,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-07 14:24:57,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-07 14:24:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 250 transitions. [2024-02-07 14:24:57,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5040322580645161 [2024-02-07 14:24:57,842 INFO L175 Difference]: Start difference. First operand has 77 places, 65 transitions, 423 flow. Second operand 8 states and 250 transitions. [2024-02-07 14:24:57,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 143 transitions, 1034 flow [2024-02-07 14:24:57,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 143 transitions, 953 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-02-07 14:24:57,856 INFO L231 Difference]: Finished difference. Result has 84 places, 72 transitions, 548 flow [2024-02-07 14:24:57,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=548, PETRI_PLACES=84, PETRI_TRANSITIONS=72} [2024-02-07 14:24:57,858 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 16 predicate places. [2024-02-07 14:24:57,859 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 72 transitions, 548 flow [2024-02-07 14:24:57,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:57,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:57,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:57,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-02-07 14:24:57,859 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 14:24:57,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:57,860 INFO L85 PathProgramCache]: Analyzing trace with hash -572885567, now seen corresponding path program 1 times [2024-02-07 14:24:57,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:57,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369641815] [2024-02-07 14:24:57,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:57,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:57,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:57,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369641815] [2024-02-07 14:24:57,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369641815] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:57,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:57,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:24:57,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857537166] [2024-02-07 14:24:57,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:57,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:24:57,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:57,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:24:57,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:24:57,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 14:24:57,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 72 transitions, 548 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:57,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:57,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 14:24:57,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:58,213 INFO L124 PetriNetUnfolderBase]: 2276/4071 cut-off events. [2024-02-07 14:24:58,214 INFO L125 PetriNetUnfolderBase]: For 11376/11380 co-relation queries the response was YES. [2024-02-07 14:24:58,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13678 conditions, 4071 events. 2276/4071 cut-off events. For 11376/11380 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 27077 event pairs, 768 based on Foata normal form. 8/3977 useless extension candidates. Maximal degree in co-relation 13658. Up to 3069 conditions per place. [2024-02-07 14:24:58,234 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 68 selfloop transitions, 20 changer transitions 0/100 dead transitions. [2024-02-07 14:24:58,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 100 transitions, 835 flow [2024-02-07 14:24:58,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:24:58,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:24:58,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2024-02-07 14:24:58,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4806451612903226 [2024-02-07 14:24:58,236 INFO L175 Difference]: Start difference. First operand has 84 places, 72 transitions, 548 flow. Second operand 5 states and 149 transitions. [2024-02-07 14:24:58,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 100 transitions, 835 flow [2024-02-07 14:24:58,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 100 transitions, 805 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-02-07 14:24:58,255 INFO L231 Difference]: Finished difference. Result has 87 places, 74 transitions, 584 flow [2024-02-07 14:24:58,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=584, PETRI_PLACES=87, PETRI_TRANSITIONS=74} [2024-02-07 14:24:58,256 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 19 predicate places. [2024-02-07 14:24:58,256 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 74 transitions, 584 flow [2024-02-07 14:24:58,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:58,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:58,257 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:58,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-02-07 14:24:58,257 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 14:24:58,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:58,257 INFO L85 PathProgramCache]: Analyzing trace with hash 261093435, now seen corresponding path program 1 times [2024-02-07 14:24:58,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:58,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623357918] [2024-02-07 14:24:58,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:58,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:58,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:58,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:58,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623357918] [2024-02-07 14:24:58,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623357918] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:58,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:58,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:24:58,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244057110] [2024-02-07 14:24:58,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:58,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:24:58,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:58,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:24:58,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:24:58,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2024-02-07 14:24:58,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 74 transitions, 584 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:58,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:58,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2024-02-07 14:24:58,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:58,567 INFO L124 PetriNetUnfolderBase]: 1627/2870 cut-off events. [2024-02-07 14:24:58,567 INFO L125 PetriNetUnfolderBase]: For 8094/8094 co-relation queries the response was YES. [2024-02-07 14:24:58,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9840 conditions, 2870 events. 1627/2870 cut-off events. For 8094/8094 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 16872 event pairs, 123 based on Foata normal form. 142/2946 useless extension candidates. Maximal degree in co-relation 9818. Up to 833 conditions per place. [2024-02-07 14:24:58,580 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 122 selfloop transitions, 8 changer transitions 1/143 dead transitions. [2024-02-07 14:24:58,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 143 transitions, 1341 flow [2024-02-07 14:24:58,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:24:58,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:24:58,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2024-02-07 14:24:58,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4935483870967742 [2024-02-07 14:24:58,581 INFO L175 Difference]: Start difference. First operand has 87 places, 74 transitions, 584 flow. Second operand 5 states and 153 transitions. [2024-02-07 14:24:58,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 143 transitions, 1341 flow [2024-02-07 14:24:58,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 143 transitions, 1259 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-02-07 14:24:58,591 INFO L231 Difference]: Finished difference. Result has 89 places, 77 transitions, 578 flow [2024-02-07 14:24:58,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=578, PETRI_PLACES=89, PETRI_TRANSITIONS=77} [2024-02-07 14:24:58,591 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 21 predicate places. [2024-02-07 14:24:58,592 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 77 transitions, 578 flow [2024-02-07 14:24:58,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:58,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:58,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:58,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-02-07 14:24:58,592 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 14:24:58,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:58,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1233392512, now seen corresponding path program 1 times [2024-02-07 14:24:58,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:58,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548379450] [2024-02-07 14:24:58,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:58,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:58,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:58,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:58,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548379450] [2024-02-07 14:24:58,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548379450] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:58,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:58,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:24:58,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176284184] [2024-02-07 14:24:58,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:58,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:24:58,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:58,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:24:58,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:24:58,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 14:24:58,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 77 transitions, 578 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:58,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:58,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 14:24:58,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:58,946 INFO L124 PetriNetUnfolderBase]: 1423/2644 cut-off events. [2024-02-07 14:24:58,946 INFO L125 PetriNetUnfolderBase]: For 7433/7433 co-relation queries the response was YES. [2024-02-07 14:24:58,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9277 conditions, 2644 events. 1423/2644 cut-off events. For 7433/7433 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 15926 event pairs, 519 based on Foata normal form. 8/2590 useless extension candidates. Maximal degree in co-relation 9254. Up to 1849 conditions per place. [2024-02-07 14:24:58,960 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 105 selfloop transitions, 10 changer transitions 0/127 dead transitions. [2024-02-07 14:24:58,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 127 transitions, 1056 flow [2024-02-07 14:24:58,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-07 14:24:58,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-07 14:24:58,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 202 transitions. [2024-02-07 14:24:58,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46543778801843316 [2024-02-07 14:24:58,961 INFO L175 Difference]: Start difference. First operand has 89 places, 77 transitions, 578 flow. Second operand 7 states and 202 transitions. [2024-02-07 14:24:58,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 127 transitions, 1056 flow [2024-02-07 14:24:58,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 127 transitions, 985 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-02-07 14:24:58,971 INFO L231 Difference]: Finished difference. Result has 94 places, 80 transitions, 612 flow [2024-02-07 14:24:58,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=612, PETRI_PLACES=94, PETRI_TRANSITIONS=80} [2024-02-07 14:24:58,972 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 26 predicate places. [2024-02-07 14:24:58,972 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 80 transitions, 612 flow [2024-02-07 14:24:58,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:58,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:58,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:58,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-02-07 14:24:58,973 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 14:24:58,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:58,973 INFO L85 PathProgramCache]: Analyzing trace with hash 7739208, now seen corresponding path program 1 times [2024-02-07 14:24:58,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:58,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778484295] [2024-02-07 14:24:58,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:58,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:59,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:59,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:59,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778484295] [2024-02-07 14:24:59,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778484295] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:59,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:59,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 14:24:59,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212071694] [2024-02-07 14:24:59,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:59,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:24:59,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:59,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:24:59,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:24:59,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2024-02-07 14:24:59,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 80 transitions, 612 flow. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:59,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:59,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2024-02-07 14:24:59,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:59,271 INFO L124 PetriNetUnfolderBase]: 1027/1708 cut-off events. [2024-02-07 14:24:59,271 INFO L125 PetriNetUnfolderBase]: For 4883/4883 co-relation queries the response was YES. [2024-02-07 14:24:59,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6569 conditions, 1708 events. 1027/1708 cut-off events. For 4883/4883 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8439 event pairs, 99 based on Foata normal form. 64/1758 useless extension candidates. Maximal degree in co-relation 6544. Up to 590 conditions per place. [2024-02-07 14:24:59,280 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 117 selfloop transitions, 11 changer transitions 1/141 dead transitions. [2024-02-07 14:24:59,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 141 transitions, 1316 flow [2024-02-07 14:24:59,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:24:59,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:24:59,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2024-02-07 14:24:59,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4435483870967742 [2024-02-07 14:24:59,282 INFO L175 Difference]: Start difference. First operand has 94 places, 80 transitions, 612 flow. Second operand 6 states and 165 transitions. [2024-02-07 14:24:59,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 141 transitions, 1316 flow [2024-02-07 14:24:59,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 141 transitions, 1185 flow, removed 31 selfloop flow, removed 7 redundant places. [2024-02-07 14:24:59,288 INFO L231 Difference]: Finished difference. Result has 94 places, 80 transitions, 575 flow [2024-02-07 14:24:59,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=575, PETRI_PLACES=94, PETRI_TRANSITIONS=80} [2024-02-07 14:24:59,288 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 26 predicate places. [2024-02-07 14:24:59,288 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 80 transitions, 575 flow [2024-02-07 14:24:59,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:59,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:59,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:59,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-02-07 14:24:59,289 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 14:24:59,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:59,290 INFO L85 PathProgramCache]: Analyzing trace with hash -398352636, now seen corresponding path program 1 times [2024-02-07 14:24:59,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:59,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874959457] [2024-02-07 14:24:59,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:59,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:59,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:59,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874959457] [2024-02-07 14:24:59,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874959457] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:59,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:59,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 14:24:59,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304698976] [2024-02-07 14:24:59,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:59,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-07 14:24:59,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:59,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-07 14:24:59,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-02-07 14:24:59,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 14:24:59,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 80 transitions, 575 flow. Second operand has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:59,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:59,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 14:24:59,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:59,759 INFO L124 PetriNetUnfolderBase]: 1211/2151 cut-off events. [2024-02-07 14:24:59,759 INFO L125 PetriNetUnfolderBase]: For 4853/4853 co-relation queries the response was YES. [2024-02-07 14:24:59,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7694 conditions, 2151 events. 1211/2151 cut-off events. For 4853/4853 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12015 event pairs, 192 based on Foata normal form. 0/2125 useless extension candidates. Maximal degree in co-relation 7671. Up to 1221 conditions per place. [2024-02-07 14:24:59,770 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 144 selfloop transitions, 23 changer transitions 0/179 dead transitions. [2024-02-07 14:24:59,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 179 transitions, 1480 flow [2024-02-07 14:24:59,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-07 14:24:59,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-07 14:24:59,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 321 transitions. [2024-02-07 14:24:59,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4314516129032258 [2024-02-07 14:24:59,772 INFO L175 Difference]: Start difference. First operand has 94 places, 80 transitions, 575 flow. Second operand 12 states and 321 transitions. [2024-02-07 14:24:59,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 179 transitions, 1480 flow [2024-02-07 14:24:59,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 179 transitions, 1256 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-02-07 14:24:59,782 INFO L231 Difference]: Finished difference. Result has 103 places, 98 transitions, 727 flow [2024-02-07 14:24:59,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=727, PETRI_PLACES=103, PETRI_TRANSITIONS=98} [2024-02-07 14:24:59,782 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 35 predicate places. [2024-02-07 14:24:59,782 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 98 transitions, 727 flow [2024-02-07 14:24:59,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:59,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:59,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:59,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-02-07 14:24:59,783 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 14:24:59,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:59,783 INFO L85 PathProgramCache]: Analyzing trace with hash 957240524, now seen corresponding path program 2 times [2024-02-07 14:24:59,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:59,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272871211] [2024-02-07 14:24:59,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:59,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:59,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:59,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:59,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272871211] [2024-02-07 14:24:59,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272871211] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:59,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:59,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-07 14:24:59,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731287877] [2024-02-07 14:24:59,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:59,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-07 14:24:59,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:59,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-07 14:24:59,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-02-07 14:24:59,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 14:24:59,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 98 transitions, 727 flow. Second operand has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:59,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:59,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 14:24:59,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:00,246 INFO L124 PetriNetUnfolderBase]: 1547/2825 cut-off events. [2024-02-07 14:25:00,247 INFO L125 PetriNetUnfolderBase]: For 4350/4350 co-relation queries the response was YES. [2024-02-07 14:25:00,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8750 conditions, 2825 events. 1547/2825 cut-off events. For 4350/4350 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 16932 event pairs, 368 based on Foata normal form. 8/2799 useless extension candidates. Maximal degree in co-relation 8725. Up to 1092 conditions per place. [2024-02-07 14:25:00,262 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 149 selfloop transitions, 20 changer transitions 0/181 dead transitions. [2024-02-07 14:25:00,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 181 transitions, 1392 flow [2024-02-07 14:25:00,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-07 14:25:00,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-07 14:25:00,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 261 transitions. [2024-02-07 14:25:00,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46774193548387094 [2024-02-07 14:25:00,264 INFO L175 Difference]: Start difference. First operand has 103 places, 98 transitions, 727 flow. Second operand 9 states and 261 transitions. [2024-02-07 14:25:00,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 181 transitions, 1392 flow [2024-02-07 14:25:00,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 181 transitions, 1353 flow, removed 14 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:00,273 INFO L231 Difference]: Finished difference. Result has 112 places, 99 transitions, 747 flow [2024-02-07 14:25:00,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=747, PETRI_PLACES=112, PETRI_TRANSITIONS=99} [2024-02-07 14:25:00,273 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 44 predicate places. [2024-02-07 14:25:00,274 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 99 transitions, 747 flow [2024-02-07 14:25:00,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:00,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:00,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:00,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-02-07 14:25:00,274 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 14:25:00,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:00,275 INFO L85 PathProgramCache]: Analyzing trace with hash 789829056, now seen corresponding path program 3 times [2024-02-07 14:25:00,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:00,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696502431] [2024-02-07 14:25:00,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:00,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:25:00,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 14:25:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:25:00,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 14:25:00,331 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 14:25:00,332 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 41 remaining) [2024-02-07 14:25:00,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 41 remaining) [2024-02-07 14:25:00,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 41 remaining) [2024-02-07 14:25:00,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 41 remaining) [2024-02-07 14:25:00,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 41 remaining) [2024-02-07 14:25:00,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 41 remaining) [2024-02-07 14:25:00,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 41 remaining) [2024-02-07 14:25:00,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 41 remaining) [2024-02-07 14:25:00,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 41 remaining) [2024-02-07 14:25:00,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 41 remaining) [2024-02-07 14:25:00,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 41 remaining) [2024-02-07 14:25:00,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 41 remaining) [2024-02-07 14:25:00,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 41 remaining) [2024-02-07 14:25:00,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 41 remaining) [2024-02-07 14:25:00,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 41 remaining) [2024-02-07 14:25:00,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 41 remaining) [2024-02-07 14:25:00,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 41 remaining) [2024-02-07 14:25:00,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 41 remaining) [2024-02-07 14:25:00,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 41 remaining) [2024-02-07 14:25:00,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 41 remaining) [2024-02-07 14:25:00,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 41 remaining) [2024-02-07 14:25:00,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 41 remaining) [2024-02-07 14:25:00,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (18 of 41 remaining) [2024-02-07 14:25:00,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 41 remaining) [2024-02-07 14:25:00,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 41 remaining) [2024-02-07 14:25:00,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 41 remaining) [2024-02-07 14:25:00,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 41 remaining) [2024-02-07 14:25:00,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 41 remaining) [2024-02-07 14:25:00,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 41 remaining) [2024-02-07 14:25:00,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 41 remaining) [2024-02-07 14:25:00,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 41 remaining) [2024-02-07 14:25:00,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 41 remaining) [2024-02-07 14:25:00,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 41 remaining) [2024-02-07 14:25:00,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 41 remaining) [2024-02-07 14:25:00,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 41 remaining) [2024-02-07 14:25:00,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 41 remaining) [2024-02-07 14:25:00,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 41 remaining) [2024-02-07 14:25:00,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 41 remaining) [2024-02-07 14:25:00,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 41 remaining) [2024-02-07 14:25:00,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 41 remaining) [2024-02-07 14:25:00,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 41 remaining) [2024-02-07 14:25:00,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-02-07 14:25:00,342 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:00,347 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 14:25:00,347 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 14:25:00,377 INFO L503 ceAbstractionStarter]: Automizer considered 22 witness invariants [2024-02-07 14:25:00,377 INFO L504 ceAbstractionStarter]: WitnessConsidered=22 [2024-02-07 14:25:00,377 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 02:25:00 BasicIcfg [2024-02-07 14:25:00,377 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 14:25:00,378 INFO L158 Benchmark]: Toolchain (without parser) took 13143.98ms. Allocated memory was 163.6MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 84.4MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 667.6MB. Max. memory is 16.1GB. [2024-02-07 14:25:00,378 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 163.6MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:25:00,378 INFO L158 Benchmark]: Witness Parser took 0.11ms. Allocated memory is still 163.6MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:25:00,378 INFO L158 Benchmark]: CACSL2BoogieTranslator took 541.84ms. Allocated memory was 163.6MB in the beginning and 213.9MB in the end (delta: 50.3MB). Free memory was 84.1MB in the beginning and 165.3MB in the end (delta: -81.1MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2024-02-07 14:25:00,379 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.30ms. Allocated memory is still 213.9MB. Free memory was 165.3MB in the beginning and 163.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 14:25:00,379 INFO L158 Benchmark]: Boogie Preprocessor took 70.24ms. Allocated memory is still 213.9MB. Free memory was 163.1MB in the beginning and 161.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 14:25:00,379 INFO L158 Benchmark]: RCFGBuilder took 456.37ms. Allocated memory is still 213.9MB. Free memory was 161.1MB in the beginning and 127.5MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-02-07 14:25:00,379 INFO L158 Benchmark]: TraceAbstraction took 12010.44ms. Allocated memory was 213.9MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 126.5MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 658.0MB. Max. memory is 16.1GB. [2024-02-07 14:25:00,380 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.17ms. Allocated memory is still 163.6MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.11ms. Allocated memory is still 163.6MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 541.84ms. Allocated memory was 163.6MB in the beginning and 213.9MB in the end (delta: 50.3MB). Free memory was 84.1MB in the beginning and 165.3MB in the end (delta: -81.1MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.30ms. Allocated memory is still 213.9MB. Free memory was 165.3MB in the beginning and 163.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.24ms. Allocated memory is still 213.9MB. Free memory was 163.1MB in the beginning and 161.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 456.37ms. Allocated memory is still 213.9MB. Free memory was 161.1MB in the beginning and 127.5MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12010.44ms. Allocated memory was 213.9MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 126.5MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 658.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 795]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L723] 0 int z = 0; [L782] 0 pthread_t t2363; [L783] FCALL, FORK 0 pthread_create(&t2363, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2363={5:0}, x=0, y=0, z=0] [L784] 0 pthread_t t2364; [L785] FCALL, FORK 0 pthread_create(&t2364, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2363={5:0}, t2364={6:0}, x=0, y=0, z=0] [L786] 0 pthread_t t2365; [L787] FCALL, FORK 0 pthread_create(&t2365, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2363={5:0}, t2364={6:0}, t2365={3:0}, x=0, y=0, z=0] [L727] 1 z = 1 [L728] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[z],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=1] [L744] 2 x = 1 [L745] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=0, z=1] [L732] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]]]] [L732] 1 __unbuffered_p0_EAX = x [L733] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=0, z=1] [L747] 2 y = 1 [L748] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1, z=1] [L752] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L752] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1, z=1] [L759] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]]]] [L759] 3 __unbuffered_p2_EAX = y [L760] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1, z=1] [L737] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L737] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L738] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1, z=1] [L762] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[z]],BinaryExpression[COMPLEQ,IdentifierExpression[z],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[z],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[z],IntegerLiteral[1]]]]]] [L762] 3 __unbuffered_p2_EBX = z [L763] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EBX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1, z=1] [L767] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L767] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1, z=1] [L789] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L789] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L790] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2363={5:0}, t2364={6:0}, t2365={3:0}, x=1, y=1, z=1] [L791] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [L791] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L791] RET 0 assume_abort_if_not(main$tmp_guard0) [L795] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EBX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2363={5:0}, t2364={6:0}, t2365={3:0}, x=1, y=1, z=1] - UnprovableResult [Line: 728]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 732]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 737]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 738]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 745]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 748]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 753]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 759]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 760]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 763]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 768]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 789]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 790]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 791]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 796]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 797]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 785]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 783]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 787]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 102 locations, 41 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: 11.9s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 893 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 886 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2260 IncrementalHoareTripleChecker+Invalid, 2302 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 7 mSDtfsCounter, 2260 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=747occurred in iteration=24, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 361 NumberOfCodeBlocks, 361 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 310 ConstructedInterpolants, 0 QuantifiedInterpolants, 1767 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-02-07 14:25:00,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE