./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.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/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.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/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-958ec4d-m [2024-02-07 14:24:33,684 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 14:24:33,719 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:33,722 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 14:24:33,723 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 14:24:33,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 14:24:33,742 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 14:24:33,742 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 14:24:33,743 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 14:24:33,746 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 14:24:33,746 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 14:24:33,746 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 14:24:33,747 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 14:24:33,748 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 14:24:33,749 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 14:24:33,749 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 14:24:33,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 14:24:33,749 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 14:24:33,750 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 14:24:33,750 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 14:24:33,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 14:24:33,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 14:24:33,751 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 14:24:33,751 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 14:24:33,751 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 14:24:33,751 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 14:24:33,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 14:24:33,752 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 14:24:33,752 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 14:24:33,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 14:24:33,753 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 14:24:33,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 14:24:33,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:24:33,754 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 14:24:33,754 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 14:24:33,754 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 14:24:33,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 14:24:33,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 14:24:33,762 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 14:24:33,762 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 14:24:33,762 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 14:24:33,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 14:24:33,763 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 14:24:33,763 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:34,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 14:24:34,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 14:24:34,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 14:24:34,020 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 14:24:34,020 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 14:24:34,021 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/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.yml/witness.yml [2024-02-07 14:24:34,087 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 14:24:34,088 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 14:24:34,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-02-07 14:24:35,151 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 14:24:35,329 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 14:24:35,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-02-07 14:24:35,340 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dff3db3cc/c50d989619ce4463966ebfdd7ace4151/FLAG68a14e6f4 [2024-02-07 14:24:35,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dff3db3cc/c50d989619ce4463966ebfdd7ace4151 [2024-02-07 14:24:35,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 14:24:35,361 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 14:24:35,362 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 14:24:35,362 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 14:24:35,365 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 14:24:35,366 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:34" (1/2) ... [2024-02-07 14:24:35,367 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50720bd0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:35, skipping insertion in model container [2024-02-07 14:24:35,367 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:34" (1/2) ... [2024-02-07 14:24:35,368 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7dc2402b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:35, skipping insertion in model container [2024-02-07 14:24:35,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:24:35" (2/2) ... [2024-02-07 14:24:35,368 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50720bd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:35, skipping insertion in model container [2024-02-07 14:24:35,368 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:24:35" (2/2) ... [2024-02-07 14:24:35,369 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 14:24:35,436 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 14:24:35,438 INFO L76 edCorrectnessWitness]: Location invariant before [L729-L729] ((0 <= x) && (x <= 1)) && (x == 0 || x == 1) [2024-02-07 14:24:35,438 INFO L76 edCorrectnessWitness]: Location invariant before [L730-L730] ((0 <= __unbuffered_p0_EBX) && (__unbuffered_p0_EBX <= 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1) [2024-02-07 14:24:35,438 INFO L76 edCorrectnessWitness]: Location invariant before [L726-L726] (((0 <= y) && (y <= 2)) && (y <= 127)) && ((y == 0 || y == 1) || y == 2) [2024-02-07 14:24:35,438 INFO L76 edCorrectnessWitness]: Location invariant before [L769-L769] y == 2 [2024-02-07 14:24:35,438 INFO L76 edCorrectnessWitness]: Location invariant before [L774-L774] 1 <= __unbuffered_cnt [2024-02-07 14:24:35,439 INFO L76 edCorrectnessWitness]: Location invariant before [L734-L734] 0 <= __unbuffered_cnt [2024-02-07 14:24:35,439 INFO L76 edCorrectnessWitness]: Location invariant before [L797-L797] 0 <= __unbuffered_cnt [2024-02-07 14:24:35,439 INFO L76 edCorrectnessWitness]: Location invariant before [L761-L761] 0 <= __unbuffered_cnt [2024-02-07 14:24:35,439 INFO L76 edCorrectnessWitness]: Location invariant before [L18-L18] ((0 <= expression) && (expression <= 1)) && (expression == 0 || expression == 1) [2024-02-07 14:24:35,440 INFO L76 edCorrectnessWitness]: Location invariant before [L798-L798] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 14:24:35,440 INFO L76 edCorrectnessWitness]: Location invariant before [L735-L735] 1 <= __unbuffered_cnt [2024-02-07 14:24:35,440 INFO L76 edCorrectnessWitness]: Location invariant before [L803-L803] ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && (y == 2)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && ((__unbuffered_p0_EAX == 2 && (__unbuffered_p0_EBX == 0 || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) || (((((0 <= __unbuffered_p0_EAX && 0 <= __unbuffered_p0_EBX) && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2))) [2024-02-07 14:24:35,440 INFO L76 edCorrectnessWitness]: Location invariant before [L762-L762] 1 <= __unbuffered_cnt [2024-02-07 14:24:35,440 INFO L76 edCorrectnessWitness]: Location invariant before [L773-L773] 0 <= __unbuffered_cnt [2024-02-07 14:24:35,440 INFO L76 edCorrectnessWitness]: Location invariant before [L799-L799] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 14:24:35,440 INFO L76 edCorrectnessWitness]: Location invariant before [L742-L742] x == 1 [2024-02-07 14:24:35,440 INFO L76 edCorrectnessWitness]: Location invariant before [L747-L747] 1 <= __unbuffered_cnt [2024-02-07 14:24:35,441 INFO L76 edCorrectnessWitness]: Location invariant before [L805-L805] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 14:24:35,441 INFO L76 edCorrectnessWitness]: Location invariant before [L754-L754] ((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) [2024-02-07 14:24:35,441 INFO L76 edCorrectnessWitness]: Location invariant before [L804-L804] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 14:24:35,441 INFO L76 edCorrectnessWitness]: Location invariant before [L746-L746] 0 <= __unbuffered_cnt [2024-02-07 14:24:35,442 INFO L76 edCorrectnessWitness]: Location invariant before [L757-L757] y == 1 [2024-02-07 14:24:35,442 INFO L76 edCorrectnessWitness]: Location invariant before [L753-L753] ((0 <= x) && (x <= 1)) && (x == 0 || x == 1) [2024-02-07 14:24:35,442 INFO L76 edCorrectnessWitness]: Location invariant before [L727-L727] (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2) [2024-02-07 14:24:35,491 INFO L178 MainTranslator]: Built tables and reachable declarations [2024-02-07 14:24:35,658 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/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2024-02-07 14:24:35,762 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:24:35,769 INFO L203 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 14:24:35,797 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/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] 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 Start Parsing Local Start Parsing Local [2024-02-07 14:24:35,848 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:24:35,884 INFO L207 MainTranslator]: Completed translation [2024-02-07 14:24:35,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:35 WrapperNode [2024-02-07 14:24:35,884 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 14:24:35,886 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 14:24:35,886 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 14:24:35,886 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 14:24:35,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:35" (1/1) ... [2024-02-07 14:24:35,919 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:35" (1/1) ... [2024-02-07 14:24:35,955 INFO L138 Inliner]: procedures = 177, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2024-02-07 14:24:35,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 14:24:35,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 14:24:35,957 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 14:24:35,957 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 14:24:35,966 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:35" (1/1) ... [2024-02-07 14:24:35,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:35" (1/1) ... [2024-02-07 14:24:35,985 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:35" (1/1) ... [2024-02-07 14:24:35,995 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-02-07 14:24:36,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:35" (1/1) ... [2024-02-07 14:24:36,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:35" (1/1) ... [2024-02-07 14:24:36,027 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:35" (1/1) ... [2024-02-07 14:24:36,036 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:35" (1/1) ... [2024-02-07 14:24:36,038 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:35" (1/1) ... [2024-02-07 14:24:36,067 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:35" (1/1) ... [2024-02-07 14:24:36,069 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 14:24:36,071 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 14:24:36,072 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 14:24:36,072 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 14:24:36,073 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:35" (1/1) ... [2024-02-07 14:24:36,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:24:36,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:24:36,126 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:36,141 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:36,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 14:24:36,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 14:24:36,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 14:24:36,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 14:24:36,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-07 14:24:36,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 14:24:36,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 14:24:36,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 14:24:36,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 14:24:36,173 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-02-07 14:24:36,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-02-07 14:24:36,174 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-02-07 14:24:36,176 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-02-07 14:24:36,176 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-02-07 14:24:36,177 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-02-07 14:24:36,177 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-02-07 14:24:36,177 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-02-07 14:24:36,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 14:24:36,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 14:24:36,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 14:24:36,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 14:24:36,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-07 14:24:36,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 14:24:36,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 14:24:36,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 14:24:36,179 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:36,306 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 14:24:36,308 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 14:24:36,499 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 14:24:36,501 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 14:24:36,598 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 14:24:36,601 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-07 14:24:36,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:24:36 BoogieIcfgContainer [2024-02-07 14:24:36,602 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 14:24:36,604 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 14:24:36,604 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 14:24:36,606 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 14:24:36,606 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:34" (1/4) ... [2024-02-07 14:24:36,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c84a18f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:24:36, skipping insertion in model container [2024-02-07 14:24:36,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 02:24:35" (2/4) ... [2024-02-07 14:24:36,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c84a18f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:24:36, skipping insertion in model container [2024-02-07 14:24:36,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:35" (3/4) ... [2024-02-07 14:24:36,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c84a18f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:24:36, skipping insertion in model container [2024-02-07 14:24:36,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:24:36" (4/4) ... [2024-02-07 14:24:36,608 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-02-07 14:24:36,620 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 14:24:36,621 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2024-02-07 14:24:36,621 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 14:24:36,657 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-07 14:24:36,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 70 transitions, 156 flow [2024-02-07 14:24:36,722 INFO L124 PetriNetUnfolderBase]: 1/66 cut-off events. [2024-02-07 14:24:36,722 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:24:36,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 66 events. 1/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 198 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2024-02-07 14:24:36,727 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 70 transitions, 156 flow [2024-02-07 14:24:36,730 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 66 transitions, 144 flow [2024-02-07 14:24:36,743 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 14:24:36,749 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;@6aae45b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 14:24:36,750 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-02-07 14:24:36,753 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 14:24:36,753 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-02-07 14:24:36,753 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:24:36,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:36,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-07 14:24:36,755 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 43 more)] === [2024-02-07 14:24:36,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:36,761 INFO L85 PathProgramCache]: Analyzing trace with hash 10818735, now seen corresponding path program 1 times [2024-02-07 14:24:36,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:36,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727895147] [2024-02-07 14:24:36,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:36,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:37,009 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:37,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:37,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727895147] [2024-02-07 14:24:37,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727895147] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:37,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:37,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:24:37,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842709687] [2024-02-07 14:24:37,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:37,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:37,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:37,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:37,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:37,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 70 [2024-02-07 14:24:37,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 144 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:37,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:37,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 70 [2024-02-07 14:24:37,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:41,118 INFO L124 PetriNetUnfolderBase]: 40398/62794 cut-off events. [2024-02-07 14:24:41,119 INFO L125 PetriNetUnfolderBase]: For 225/225 co-relation queries the response was YES. [2024-02-07 14:24:41,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116579 conditions, 62794 events. 40398/62794 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 2727. Compared 525878 event pairs, 11006 based on Foata normal form. 1280/45380 useless extension candidates. Maximal degree in co-relation 116567. Up to 50263 conditions per place. [2024-02-07 14:24:41,520 INFO L140 encePairwiseOnDemand]: 52/70 looper letters, 55 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2024-02-07 14:24:41,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 74 transitions, 279 flow [2024-02-07 14:24:41,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:41,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:41,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2024-02-07 14:24:41,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.680952380952381 [2024-02-07 14:24:41,532 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 144 flow. Second operand 3 states and 143 transitions. [2024-02-07 14:24:41,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 74 transitions, 279 flow [2024-02-07 14:24:41,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 74 transitions, 274 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-07 14:24:41,553 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 135 flow [2024-02-07 14:24:41,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2024-02-07 14:24:41,558 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -13 predicate places. [2024-02-07 14:24:41,559 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 135 flow [2024-02-07 14:24:41,559 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:41,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:41,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-07 14:24:41,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 14:24:41,559 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 43 more)] === [2024-02-07 14:24:41,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:41,560 INFO L85 PathProgramCache]: Analyzing trace with hash 335381205, now seen corresponding path program 1 times [2024-02-07 14:24:41,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:41,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634262219] [2024-02-07 14:24:41,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:41,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:41,634 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:41,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:41,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634262219] [2024-02-07 14:24:41,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634262219] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:41,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:41,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:24:41,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593739657] [2024-02-07 14:24:41,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:41,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:41,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:41,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:41,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:41,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 70 [2024-02-07 14:24:41,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 135 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:41,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:41,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 70 [2024-02-07 14:24:41,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:44,676 INFO L124 PetriNetUnfolderBase]: 38224/53683 cut-off events. [2024-02-07 14:24:44,677 INFO L125 PetriNetUnfolderBase]: For 6199/6215 co-relation queries the response was YES. [2024-02-07 14:24:44,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111807 conditions, 53683 events. 38224/53683 cut-off events. For 6199/6215 co-relation queries the response was YES. Maximal size of possible extension queue 2380. Compared 386870 event pairs, 6288 based on Foata normal form. 0/40918 useless extension candidates. Maximal degree in co-relation 111796. Up to 43927 conditions per place. [2024-02-07 14:24:44,949 INFO L140 encePairwiseOnDemand]: 66/70 looper letters, 66 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2024-02-07 14:24:44,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 84 transitions, 347 flow [2024-02-07 14:24:44,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:44,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2024-02-07 14:24:44,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-02-07 14:24:44,955 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 135 flow. Second operand 3 states and 126 transitions. [2024-02-07 14:24:44,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 84 transitions, 347 flow [2024-02-07 14:24:44,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 84 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:24:44,957 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 142 flow [2024-02-07 14:24:44,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2024-02-07 14:24:44,959 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -11 predicate places. [2024-02-07 14:24:44,960 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 142 flow [2024-02-07 14:24:44,960 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:44,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:44,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:44,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 14:24:44,960 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 43 more)] === [2024-02-07 14:24:44,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:44,961 INFO L85 PathProgramCache]: Analyzing trace with hash 178804280, now seen corresponding path program 1 times [2024-02-07 14:24:44,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:44,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766675193] [2024-02-07 14:24:44,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:44,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:45,023 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:45,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:45,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766675193] [2024-02-07 14:24:45,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766675193] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:45,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:45,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:24:45,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167201080] [2024-02-07 14:24:45,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:45,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:45,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:45,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:45,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:45,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 70 [2024-02-07 14:24:45,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 142 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:45,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:45,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 70 [2024-02-07 14:24:45,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:47,061 INFO L124 PetriNetUnfolderBase]: 31873/42811 cut-off events. [2024-02-07 14:24:47,061 INFO L125 PetriNetUnfolderBase]: For 8967/8986 co-relation queries the response was YES. [2024-02-07 14:24:47,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96271 conditions, 42811 events. 31873/42811 cut-off events. For 8967/8986 co-relation queries the response was YES. Maximal size of possible extension queue 1923. Compared 263116 event pairs, 11415 based on Foata normal form. 0/35611 useless extension candidates. Maximal degree in co-relation 96258. Up to 40887 conditions per place. [2024-02-07 14:24:47,484 INFO L140 encePairwiseOnDemand]: 60/70 looper letters, 62 selfloop transitions, 5 changer transitions 0/83 dead transitions. [2024-02-07 14:24:47,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 83 transitions, 357 flow [2024-02-07 14:24:47,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:47,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:47,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2024-02-07 14:24:47,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6095238095238096 [2024-02-07 14:24:47,486 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 142 flow. Second operand 3 states and 128 transitions. [2024-02-07 14:24:47,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 83 transitions, 357 flow [2024-02-07 14:24:47,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 83 transitions, 351 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:24:47,489 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 179 flow [2024-02-07 14:24:47,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=179, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2024-02-07 14:24:47,490 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -10 predicate places. [2024-02-07 14:24:47,490 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 179 flow [2024-02-07 14:24:47,490 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:47,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:47,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:47,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 14:24:47,491 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 43 more)] === [2024-02-07 14:24:47,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:47,491 INFO L85 PathProgramCache]: Analyzing trace with hash 19545884, now seen corresponding path program 1 times [2024-02-07 14:24:47,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:47,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446846086] [2024-02-07 14:24:47,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:47,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:47,542 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:47,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:47,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446846086] [2024-02-07 14:24:47,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446846086] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:47,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:47,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:24:47,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483803899] [2024-02-07 14:24:47,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:47,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:47,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:47,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:47,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:47,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 70 [2024-02-07 14:24:47,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:47,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:47,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 70 [2024-02-07 14:24:47,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:49,417 INFO L124 PetriNetUnfolderBase]: 25346/35521 cut-off events. [2024-02-07 14:24:49,418 INFO L125 PetriNetUnfolderBase]: For 9160/9173 co-relation queries the response was YES. [2024-02-07 14:24:49,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87858 conditions, 35521 events. 25346/35521 cut-off events. For 9160/9173 co-relation queries the response was YES. Maximal size of possible extension queue 1589. Compared 230943 event pairs, 8460 based on Foata normal form. 1947/32103 useless extension candidates. Maximal degree in co-relation 87844. Up to 28680 conditions per place. [2024-02-07 14:24:49,684 INFO L140 encePairwiseOnDemand]: 67/70 looper letters, 72 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2024-02-07 14:24:49,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 89 transitions, 420 flow [2024-02-07 14:24:49,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:49,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:49,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2024-02-07 14:24:49,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5904761904761905 [2024-02-07 14:24:49,686 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 179 flow. Second operand 3 states and 124 transitions. [2024-02-07 14:24:49,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 89 transitions, 420 flow [2024-02-07 14:24:49,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 89 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:24:49,689 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 166 flow [2024-02-07 14:24:49,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-02-07 14:24:49,691 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -12 predicate places. [2024-02-07 14:24:49,691 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 166 flow [2024-02-07 14:24:49,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 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,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:49,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:49,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 14:24:49,692 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 43 more)] === [2024-02-07 14:24:49,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:49,693 INFO L85 PathProgramCache]: Analyzing trace with hash -2139232056, now seen corresponding path program 1 times [2024-02-07 14:24:49,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:49,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761776750] [2024-02-07 14:24:49,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:49,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:49,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:49,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:49,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761776750] [2024-02-07 14:24:49,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761776750] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:49,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:49,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:24:49,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198722905] [2024-02-07 14:24:49,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:49,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:49,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:49,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:49,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:49,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 70 [2024-02-07 14:24:49,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 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,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:49,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 70 [2024-02-07 14:24:49,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:52,886 INFO L124 PetriNetUnfolderBase]: 36159/54655 cut-off events. [2024-02-07 14:24:52,887 INFO L125 PetriNetUnfolderBase]: For 13747/13803 co-relation queries the response was YES. [2024-02-07 14:24:53,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128328 conditions, 54655 events. 36159/54655 cut-off events. For 13747/13803 co-relation queries the response was YES. Maximal size of possible extension queue 2615. Compared 443558 event pairs, 17193 based on Foata normal form. 1406/46202 useless extension candidates. Maximal degree in co-relation 128315. Up to 27923 conditions per place. [2024-02-07 14:24:53,254 INFO L140 encePairwiseOnDemand]: 66/70 looper letters, 66 selfloop transitions, 3 changer transitions 0/85 dead transitions. [2024-02-07 14:24:53,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 85 transitions, 390 flow [2024-02-07 14:24:53,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:53,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2024-02-07 14:24:53,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2024-02-07 14:24:53,256 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 166 flow. Second operand 3 states and 122 transitions. [2024-02-07 14:24:53,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 85 transitions, 390 flow [2024-02-07 14:24:53,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 85 transitions, 388 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:24:53,260 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 178 flow [2024-02-07 14:24:53,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2024-02-07 14:24:53,260 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -10 predicate places. [2024-02-07 14:24:53,261 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 178 flow [2024-02-07 14:24:53,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 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,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:53,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:53,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 14:24:53,261 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 43 more)] === [2024-02-07 14:24:53,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:53,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1527538452, now seen corresponding path program 1 times [2024-02-07 14:24:53,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:53,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122966147] [2024-02-07 14:24:53,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:53,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:53,302 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,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:53,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122966147] [2024-02-07 14:24:53,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122966147] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:53,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:53,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:24:53,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556597757] [2024-02-07 14:24:53,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:53,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:53,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:53,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:53,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:53,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 70 [2024-02-07 14:24:53,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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:53,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:53,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 70 [2024-02-07 14:24:53,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:56,735 INFO L124 PetriNetUnfolderBase]: 36159/56638 cut-off events. [2024-02-07 14:24:56,735 INFO L125 PetriNetUnfolderBase]: For 20359/20397 co-relation queries the response was YES. [2024-02-07 14:24:56,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134420 conditions, 56638 events. 36159/56638 cut-off events. For 20359/20397 co-relation queries the response was YES. Maximal size of possible extension queue 2638. Compared 483781 event pairs, 32671 based on Foata normal form. 0/45785 useless extension candidates. Maximal degree in co-relation 134406. Up to 48636 conditions per place. [2024-02-07 14:24:57,091 INFO L140 encePairwiseOnDemand]: 68/70 looper letters, 40 selfloop transitions, 1 changer transitions 0/56 dead transitions. [2024-02-07 14:24:57,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 56 transitions, 258 flow [2024-02-07 14:24:57,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:57,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:57,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-02-07 14:24:57,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2024-02-07 14:24:57,093 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 178 flow. Second operand 3 states and 93 transitions. [2024-02-07 14:24:57,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 56 transitions, 258 flow [2024-02-07 14:24:57,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 56 transitions, 253 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-02-07 14:24:57,101 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 173 flow [2024-02-07 14:24:57,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=173, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2024-02-07 14:24:57,102 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -10 predicate places. [2024-02-07 14:24:57,102 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 173 flow [2024-02-07 14:24:57,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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:57,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:57,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:57,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 14:24:57,103 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 43 more)] === [2024-02-07 14:24:57,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:57,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1929839454, now seen corresponding path program 1 times [2024-02-07 14:24:57,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:57,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340629369] [2024-02-07 14:24:57,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:57,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:57,150 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,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:57,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340629369] [2024-02-07 14:24:57,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340629369] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:57,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:57,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:24:57,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761724191] [2024-02-07 14:24:57,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:57,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:57,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:57,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:57,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:57,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 70 [2024-02-07 14:24:57,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 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,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:57,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 70 [2024-02-07 14:24:57,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:59,638 INFO L124 PetriNetUnfolderBase]: 32039/48245 cut-off events. [2024-02-07 14:24:59,639 INFO L125 PetriNetUnfolderBase]: For 13448/13486 co-relation queries the response was YES. [2024-02-07 14:24:59,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114684 conditions, 48245 events. 32039/48245 cut-off events. For 13448/13486 co-relation queries the response was YES. Maximal size of possible extension queue 2246. Compared 378270 event pairs, 12075 based on Foata normal form. 912/40232 useless extension candidates. Maximal degree in co-relation 114673. Up to 23052 conditions per place. [2024-02-07 14:25:00,167 INFO L140 encePairwiseOnDemand]: 67/70 looper letters, 64 selfloop transitions, 3 changer transitions 0/82 dead transitions. [2024-02-07 14:25:00,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 82 transitions, 382 flow [2024-02-07 14:25:00,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:00,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:00,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-02-07 14:25:00,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2024-02-07 14:25:00,169 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 173 flow. Second operand 3 states and 119 transitions. [2024-02-07 14:25:00,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 82 transitions, 382 flow [2024-02-07 14:25:00,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 82 transitions, 381 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:00,174 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 172 flow [2024-02-07 14:25:00,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2024-02-07 14:25:00,176 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -10 predicate places. [2024-02-07 14:25:00,177 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 172 flow [2024-02-07 14:25:00,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 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,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:00,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:00,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 14:25:00,181 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 43 more)] === [2024-02-07 14:25:00,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:00,182 INFO L85 PathProgramCache]: Analyzing trace with hash -691965458, now seen corresponding path program 1 times [2024-02-07 14:25:00,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:00,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789460131] [2024-02-07 14:25:00,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:00,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:00,218 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:25:00,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:00,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789460131] [2024-02-07 14:25:00,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789460131] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:00,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:00,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:25:00,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818850068] [2024-02-07 14:25:00,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:00,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:00,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:00,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:00,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:00,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 70 [2024-02-07 14:25:00,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 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,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:00,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 70 [2024-02-07 14:25:00,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:01,205 INFO L124 PetriNetUnfolderBase]: 12848/17732 cut-off events. [2024-02-07 14:25:01,206 INFO L125 PetriNetUnfolderBase]: For 8502/8520 co-relation queries the response was YES. [2024-02-07 14:25:01,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44340 conditions, 17732 events. 12848/17732 cut-off events. For 8502/8520 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 102035 event pairs, 4124 based on Foata normal form. 538/18152 useless extension candidates. Maximal degree in co-relation 44329. Up to 16490 conditions per place. [2024-02-07 14:25:01,277 INFO L140 encePairwiseOnDemand]: 61/70 looper letters, 50 selfloop transitions, 4 changer transitions 2/71 dead transitions. [2024-02-07 14:25:01,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 71 transitions, 335 flow [2024-02-07 14:25:01,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:01,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:01,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2024-02-07 14:25:01,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2024-02-07 14:25:01,279 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 172 flow. Second operand 3 states and 117 transitions. [2024-02-07 14:25:01,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 71 transitions, 335 flow [2024-02-07 14:25:01,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 71 transitions, 329 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:01,281 INFO L231 Difference]: Finished difference. Result has 64 places, 49 transitions, 155 flow [2024-02-07 14:25:01,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2024-02-07 14:25:01,282 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -14 predicate places. [2024-02-07 14:25:01,282 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 155 flow [2024-02-07 14:25:01,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 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:01,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:01,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:01,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 14:25:01,283 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 43 more)] === [2024-02-07 14:25:01,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:01,283 INFO L85 PathProgramCache]: Analyzing trace with hash -914352359, now seen corresponding path program 1 times [2024-02-07 14:25:01,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:01,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470077898] [2024-02-07 14:25:01,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:01,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:01,372 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:25:01,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:01,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470077898] [2024-02-07 14:25:01,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470077898] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:01,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:01,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:25:01,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776010763] [2024-02-07 14:25:01,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:01,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:25:01,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:01,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:25:01,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:25:01,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 70 [2024-02-07 14:25:01,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:01,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:01,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 70 [2024-02-07 14:25:01,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:02,461 INFO L124 PetriNetUnfolderBase]: 11883/19565 cut-off events. [2024-02-07 14:25:02,461 INFO L125 PetriNetUnfolderBase]: For 8087/8105 co-relation queries the response was YES. [2024-02-07 14:25:02,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44519 conditions, 19565 events. 11883/19565 cut-off events. For 8087/8105 co-relation queries the response was YES. Maximal size of possible extension queue 903. Compared 151298 event pairs, 1714 based on Foata normal form. 580/19219 useless extension candidates. Maximal degree in co-relation 44508. Up to 9686 conditions per place. [2024-02-07 14:25:02,542 INFO L140 encePairwiseOnDemand]: 63/70 looper letters, 59 selfloop transitions, 6 changer transitions 1/81 dead transitions. [2024-02-07 14:25:02,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 81 transitions, 397 flow [2024-02-07 14:25:02,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:25:02,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:25:02,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2024-02-07 14:25:02,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4928571428571429 [2024-02-07 14:25:02,543 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 155 flow. Second operand 4 states and 138 transitions. [2024-02-07 14:25:02,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 81 transitions, 397 flow [2024-02-07 14:25:02,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 81 transitions, 393 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:02,546 INFO L231 Difference]: Finished difference. Result has 67 places, 49 transitions, 177 flow [2024-02-07 14:25:02,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=67, PETRI_TRANSITIONS=49} [2024-02-07 14:25:02,547 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -11 predicate places. [2024-02-07 14:25:02,547 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 49 transitions, 177 flow [2024-02-07 14:25:02,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:02,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:02,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:02,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 14:25:02,547 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 43 more)] === [2024-02-07 14:25:02,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:02,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1714447226, now seen corresponding path program 1 times [2024-02-07 14:25:02,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:02,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133139747] [2024-02-07 14:25:02,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:02,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:02,618 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:25:02,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:02,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133139747] [2024-02-07 14:25:02,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133139747] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:02,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:02,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:25:02,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287970944] [2024-02-07 14:25:02,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:02,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:25:02,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:02,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:25:02,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:25:02,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 70 [2024-02-07 14:25:02,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 49 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 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:02,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:02,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 70 [2024-02-07 14:25:02,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:03,368 INFO L124 PetriNetUnfolderBase]: 9354/15258 cut-off events. [2024-02-07 14:25:03,368 INFO L125 PetriNetUnfolderBase]: For 8085/8103 co-relation queries the response was YES. [2024-02-07 14:25:03,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36887 conditions, 15258 events. 9354/15258 cut-off events. For 8085/8103 co-relation queries the response was YES. Maximal size of possible extension queue 669. Compared 110714 event pairs, 754 based on Foata normal form. 538/15158 useless extension candidates. Maximal degree in co-relation 36873. Up to 6421 conditions per place. [2024-02-07 14:25:03,425 INFO L140 encePairwiseOnDemand]: 63/70 looper letters, 76 selfloop transitions, 10 changer transitions 1/102 dead transitions. [2024-02-07 14:25:03,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 102 transitions, 534 flow [2024-02-07 14:25:03,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:25:03,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:25:03,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2024-02-07 14:25:03,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5028571428571429 [2024-02-07 14:25:03,427 INFO L175 Difference]: Start difference. First operand has 67 places, 49 transitions, 177 flow. Second operand 5 states and 176 transitions. [2024-02-07 14:25:03,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 102 transitions, 534 flow [2024-02-07 14:25:03,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 102 transitions, 511 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-02-07 14:25:03,433 INFO L231 Difference]: Finished difference. Result has 69 places, 53 transitions, 217 flow [2024-02-07 14:25:03,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=217, PETRI_PLACES=69, PETRI_TRANSITIONS=53} [2024-02-07 14:25:03,435 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -9 predicate places. [2024-02-07 14:25:03,435 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 217 flow [2024-02-07 14:25:03,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 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:03,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:03,436 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:25:03,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 14:25:03,436 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 43 more)] === [2024-02-07 14:25:03,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:03,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1602591589, now seen corresponding path program 1 times [2024-02-07 14:25:03,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:03,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874906558] [2024-02-07 14:25:03,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:03,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:03,574 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:25:03,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:03,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874906558] [2024-02-07 14:25:03,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874906558] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:03,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:03,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:25:03,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072861969] [2024-02-07 14:25:03,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:03,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:25:03,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:03,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:25:03,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:25:03,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 70 [2024-02-07 14:25:03,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 53 transitions, 217 flow. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 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:03,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:03,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 70 [2024-02-07 14:25:03,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:04,287 INFO L124 PetriNetUnfolderBase]: 8135/13617 cut-off events. [2024-02-07 14:25:04,287 INFO L125 PetriNetUnfolderBase]: For 11552/11552 co-relation queries the response was YES. [2024-02-07 14:25:04,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35057 conditions, 13617 events. 8135/13617 cut-off events. For 11552/11552 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 100139 event pairs, 4223 based on Foata normal form. 4/13015 useless extension candidates. Maximal degree in co-relation 35043. Up to 11167 conditions per place. [2024-02-07 14:25:04,335 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 59 selfloop transitions, 6 changer transitions 0/80 dead transitions. [2024-02-07 14:25:04,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 80 transitions, 457 flow [2024-02-07 14:25:04,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:25:04,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:25:04,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2024-02-07 14:25:04,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4785714285714286 [2024-02-07 14:25:04,337 INFO L175 Difference]: Start difference. First operand has 69 places, 53 transitions, 217 flow. Second operand 4 states and 134 transitions. [2024-02-07 14:25:04,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 80 transitions, 457 flow [2024-02-07 14:25:04,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 80 transitions, 413 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-02-07 14:25:04,347 INFO L231 Difference]: Finished difference. Result has 70 places, 58 transitions, 230 flow [2024-02-07 14:25:04,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=70, PETRI_TRANSITIONS=58} [2024-02-07 14:25:04,347 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -8 predicate places. [2024-02-07 14:25:04,347 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 58 transitions, 230 flow [2024-02-07 14:25:04,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 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:04,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:04,348 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:25:04,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-07 14:25:04,348 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 43 more)] === [2024-02-07 14:25:04,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:04,348 INFO L85 PathProgramCache]: Analyzing trace with hash -2072975622, now seen corresponding path program 1 times [2024-02-07 14:25:04,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:04,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141288168] [2024-02-07 14:25:04,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:04,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:04,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:04,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:04,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141288168] [2024-02-07 14:25:04,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141288168] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:04,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:04,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 14:25:04,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82419229] [2024-02-07 14:25:04,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:04,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:25:04,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:04,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:25:04,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:25:04,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 70 [2024-02-07 14:25:04,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 58 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:04,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:04,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 70 [2024-02-07 14:25:04,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:04,953 INFO L124 PetriNetUnfolderBase]: 6079/9509 cut-off events. [2024-02-07 14:25:04,953 INFO L125 PetriNetUnfolderBase]: For 6582/6600 co-relation queries the response was YES. [2024-02-07 14:25:04,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25158 conditions, 9509 events. 6079/9509 cut-off events. For 6582/6600 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 57904 event pairs, 369 based on Foata normal form. 384/9631 useless extension candidates. Maximal degree in co-relation 25143. Up to 2452 conditions per place. [2024-02-07 14:25:04,995 INFO L140 encePairwiseOnDemand]: 63/70 looper letters, 99 selfloop transitions, 14 changer transitions 1/129 dead transitions. [2024-02-07 14:25:04,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 129 transitions, 740 flow [2024-02-07 14:25:04,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:25:04,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:25:04,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2024-02-07 14:25:04,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2024-02-07 14:25:04,997 INFO L175 Difference]: Start difference. First operand has 70 places, 58 transitions, 230 flow. Second operand 6 states and 212 transitions. [2024-02-07 14:25:04,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 129 transitions, 740 flow [2024-02-07 14:25:05,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 129 transitions, 730 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:05,006 INFO L231 Difference]: Finished difference. Result has 76 places, 62 transitions, 302 flow [2024-02-07 14:25:05,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=302, PETRI_PLACES=76, PETRI_TRANSITIONS=62} [2024-02-07 14:25:05,007 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -2 predicate places. [2024-02-07 14:25:05,008 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 62 transitions, 302 flow [2024-02-07 14:25:05,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:05,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:05,008 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] [2024-02-07 14:25:05,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-07 14:25:05,008 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 43 more)] === [2024-02-07 14:25:05,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:05,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1668999133, now seen corresponding path program 1 times [2024-02-07 14:25:05,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:05,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109812263] [2024-02-07 14:25:05,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:05,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:05,167 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:25:05,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:05,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109812263] [2024-02-07 14:25:05,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109812263] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:05,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:05,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:25:05,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923965922] [2024-02-07 14:25:05,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:05,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:25:05,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:05,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:25:05,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:25:05,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 70 [2024-02-07 14:25:05,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 62 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:05,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:05,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 70 [2024-02-07 14:25:05,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:05,648 INFO L124 PetriNetUnfolderBase]: 5531/9037 cut-off events. [2024-02-07 14:25:05,648 INFO L125 PetriNetUnfolderBase]: For 12348/12348 co-relation queries the response was YES. [2024-02-07 14:25:05,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25937 conditions, 9037 events. 5531/9037 cut-off events. For 12348/12348 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 58197 event pairs, 1239 based on Foata normal form. 8/8783 useless extension candidates. Maximal degree in co-relation 25919. Up to 7071 conditions per place. [2024-02-07 14:25:05,699 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 72 selfloop transitions, 8 changer transitions 0/95 dead transitions. [2024-02-07 14:25:05,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 95 transitions, 644 flow [2024-02-07 14:25:05,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:25:05,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:25:05,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2024-02-07 14:25:05,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-02-07 14:25:05,701 INFO L175 Difference]: Start difference. First operand has 76 places, 62 transitions, 302 flow. Second operand 4 states and 136 transitions. [2024-02-07 14:25:05,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 95 transitions, 644 flow [2024-02-07 14:25:05,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 95 transitions, 561 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-02-07 14:25:05,729 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 306 flow [2024-02-07 14:25:05,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=306, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2024-02-07 14:25:05,730 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -2 predicate places. [2024-02-07 14:25:05,731 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 306 flow [2024-02-07 14:25:05,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:05,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:05,731 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] [2024-02-07 14:25:05,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-07 14:25:05,732 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 43 more)] === [2024-02-07 14:25:05,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:05,732 INFO L85 PathProgramCache]: Analyzing trace with hash -58054221, now seen corresponding path program 2 times [2024-02-07 14:25:05,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:05,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169380304] [2024-02-07 14:25:05,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:05,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:05,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:05,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:05,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169380304] [2024-02-07 14:25:05,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169380304] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:05,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:05,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:25:05,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902309169] [2024-02-07 14:25:05,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:05,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:25:05,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:05,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:25:05,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:25:05,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 70 [2024-02-07 14:25:05,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 306 flow. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:05,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:05,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 70 [2024-02-07 14:25:05,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:06,314 INFO L124 PetriNetUnfolderBase]: 5511/9009 cut-off events. [2024-02-07 14:25:06,315 INFO L125 PetriNetUnfolderBase]: For 7850/7850 co-relation queries the response was YES. [2024-02-07 14:25:06,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24586 conditions, 9009 events. 5511/9009 cut-off events. For 7850/7850 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 58016 event pairs, 1219 based on Foata normal form. 8/8755 useless extension candidates. Maximal degree in co-relation 24567. Up to 6683 conditions per place. [2024-02-07 14:25:06,364 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 97 selfloop transitions, 11 changer transitions 0/123 dead transitions. [2024-02-07 14:25:06,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 123 transitions, 774 flow [2024-02-07 14:25:06,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:25:06,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:25:06,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2024-02-07 14:25:06,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-02-07 14:25:06,366 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 306 flow. Second operand 6 states and 196 transitions. [2024-02-07 14:25:06,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 123 transitions, 774 flow [2024-02-07 14:25:06,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 123 transitions, 772 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-02-07 14:25:06,382 INFO L231 Difference]: Finished difference. Result has 83 places, 67 transitions, 343 flow [2024-02-07 14:25:06,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=343, PETRI_PLACES=83, PETRI_TRANSITIONS=67} [2024-02-07 14:25:06,382 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 5 predicate places. [2024-02-07 14:25:06,383 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 67 transitions, 343 flow [2024-02-07 14:25:06,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:06,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:06,383 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] [2024-02-07 14:25:06,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-07 14:25:06,383 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 43 more)] === [2024-02-07 14:25:06,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:06,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1126659094, now seen corresponding path program 1 times [2024-02-07 14:25:06,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:06,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911412632] [2024-02-07 14:25:06,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:06,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:06,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:06,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:06,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911412632] [2024-02-07 14:25:06,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911412632] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:06,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:06,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:25:06,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806035781] [2024-02-07 14:25:06,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:06,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:25:06,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:06,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:25:06,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:25:06,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 70 [2024-02-07 14:25:06,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 67 transitions, 343 flow. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:06,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:06,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 70 [2024-02-07 14:25:06,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:07,218 INFO L124 PetriNetUnfolderBase]: 6151/9986 cut-off events. [2024-02-07 14:25:07,219 INFO L125 PetriNetUnfolderBase]: For 10701/10704 co-relation queries the response was YES. [2024-02-07 14:25:07,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28359 conditions, 9986 events. 6151/9986 cut-off events. For 10701/10704 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 64582 event pairs, 3074 based on Foata normal form. 8/9723 useless extension candidates. Maximal degree in co-relation 28336. Up to 7105 conditions per place. [2024-02-07 14:25:07,276 INFO L140 encePairwiseOnDemand]: 63/70 looper letters, 129 selfloop transitions, 15 changer transitions 0/159 dead transitions. [2024-02-07 14:25:07,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 159 transitions, 1085 flow [2024-02-07 14:25:07,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:25:07,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:25:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2024-02-07 14:25:07,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2024-02-07 14:25:07,278 INFO L175 Difference]: Start difference. First operand has 83 places, 67 transitions, 343 flow. Second operand 6 states and 212 transitions. [2024-02-07 14:25:07,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 159 transitions, 1085 flow [2024-02-07 14:25:07,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 159 transitions, 1044 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-02-07 14:25:07,298 INFO L231 Difference]: Finished difference. Result has 88 places, 78 transitions, 437 flow [2024-02-07 14:25:07,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=437, PETRI_PLACES=88, PETRI_TRANSITIONS=78} [2024-02-07 14:25:07,299 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 10 predicate places. [2024-02-07 14:25:07,299 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 78 transitions, 437 flow [2024-02-07 14:25:07,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:07,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:07,300 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] [2024-02-07 14:25:07,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-07 14:25:07,300 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 43 more)] === [2024-02-07 14:25:07,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:07,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1310527154, now seen corresponding path program 2 times [2024-02-07 14:25:07,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:07,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609141875] [2024-02-07 14:25:07,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:07,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:07,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:07,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:07,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609141875] [2024-02-07 14:25:07,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609141875] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:07,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:07,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:25:07,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455704512] [2024-02-07 14:25:07,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:07,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:25:07,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:07,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:25:07,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:25:07,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 70 [2024-02-07 14:25:07,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 78 transitions, 437 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 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:07,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:07,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 70 [2024-02-07 14:25:07,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:08,037 INFO L124 PetriNetUnfolderBase]: 6131/9975 cut-off events. [2024-02-07 14:25:08,037 INFO L125 PetriNetUnfolderBase]: For 12670/12673 co-relation queries the response was YES. [2024-02-07 14:25:08,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29743 conditions, 9975 events. 6131/9975 cut-off events. For 12670/12673 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 64774 event pairs, 3031 based on Foata normal form. 8/9711 useless extension candidates. Maximal degree in co-relation 29717. Up to 7767 conditions per place. [2024-02-07 14:25:08,095 INFO L140 encePairwiseOnDemand]: 63/70 looper letters, 111 selfloop transitions, 21 changer transitions 0/147 dead transitions. [2024-02-07 14:25:08,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 147 transitions, 1048 flow [2024-02-07 14:25:08,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:25:08,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:25:08,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2024-02-07 14:25:08,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49047619047619045 [2024-02-07 14:25:08,097 INFO L175 Difference]: Start difference. First operand has 88 places, 78 transitions, 437 flow. Second operand 6 states and 206 transitions. [2024-02-07 14:25:08,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 147 transitions, 1048 flow [2024-02-07 14:25:08,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 147 transitions, 1031 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:08,121 INFO L231 Difference]: Finished difference. Result has 93 places, 88 transitions, 561 flow [2024-02-07 14:25:08,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=561, PETRI_PLACES=93, PETRI_TRANSITIONS=88} [2024-02-07 14:25:08,122 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 15 predicate places. [2024-02-07 14:25:08,122 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 88 transitions, 561 flow [2024-02-07 14:25:08,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 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:08,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:08,122 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] [2024-02-07 14:25:08,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-02-07 14:25:08,122 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 43 more)] === [2024-02-07 14:25:08,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:08,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1889340482, now seen corresponding path program 3 times [2024-02-07 14:25:08,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:08,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994582838] [2024-02-07 14:25:08,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:08,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:08,194 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:25:08,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:08,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994582838] [2024-02-07 14:25:08,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994582838] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:08,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:08,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-07 14:25:08,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735271501] [2024-02-07 14:25:08,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:08,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-07 14:25:08,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:08,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-07 14:25:08,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-02-07 14:25:08,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 70 [2024-02-07 14:25:08,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 88 transitions, 561 flow. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 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:08,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:08,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 70 [2024-02-07 14:25:08,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:08,746 INFO L124 PetriNetUnfolderBase]: 4923/7167 cut-off events. [2024-02-07 14:25:08,746 INFO L125 PetriNetUnfolderBase]: For 12876/12897 co-relation queries the response was YES. [2024-02-07 14:25:08,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23311 conditions, 7167 events. 4923/7167 cut-off events. For 12876/12897 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 37235 event pairs, 257 based on Foata normal form. 192/7285 useless extension candidates. Maximal degree in co-relation 23283. Up to 2256 conditions per place. [2024-02-07 14:25:08,789 INFO L140 encePairwiseOnDemand]: 63/70 looper letters, 158 selfloop transitions, 18 changer transitions 1/192 dead transitions. [2024-02-07 14:25:08,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 192 transitions, 1578 flow [2024-02-07 14:25:08,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-07 14:25:08,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-07 14:25:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 226 transitions. [2024-02-07 14:25:08,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46122448979591835 [2024-02-07 14:25:08,791 INFO L175 Difference]: Start difference. First operand has 93 places, 88 transitions, 561 flow. Second operand 7 states and 226 transitions. [2024-02-07 14:25:08,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 192 transitions, 1578 flow [2024-02-07 14:25:08,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 192 transitions, 1436 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-02-07 14:25:08,830 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 553 flow [2024-02-07 14:25:08,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=553, PETRI_PLACES=96, PETRI_TRANSITIONS=88} [2024-02-07 14:25:08,831 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 18 predicate places. [2024-02-07 14:25:08,831 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 553 flow [2024-02-07 14:25:08,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 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:08,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:08,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:08,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-02-07 14:25:08,832 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 43 more)] === [2024-02-07 14:25:08,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:08,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1327353284, now seen corresponding path program 1 times [2024-02-07 14:25:08,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:08,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60100537] [2024-02-07 14:25:08,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:08,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:08,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:08,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:08,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60100537] [2024-02-07 14:25:08,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60100537] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:08,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:08,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-07 14:25:08,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765140389] [2024-02-07 14:25:08,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:08,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-07 14:25:09,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:09,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-07 14:25:09,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-02-07 14:25:09,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 70 [2024-02-07 14:25:09,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 553 flow. Second operand has 8 states, 8 states have (on average 22.75) internal successors, (182), 8 states have internal predecessors, (182), 0 states have call successors, (0), 0 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:09,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:09,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 70 [2024-02-07 14:25:09,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:10,115 INFO L124 PetriNetUnfolderBase]: 9976/15512 cut-off events. [2024-02-07 14:25:10,115 INFO L125 PetriNetUnfolderBase]: For 33393/33406 co-relation queries the response was YES. [2024-02-07 14:25:10,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51421 conditions, 15512 events. 9976/15512 cut-off events. For 33393/33406 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 104011 event pairs, 1587 based on Foata normal form. 24/15426 useless extension candidates. Maximal degree in co-relation 51393. Up to 4085 conditions per place. [2024-02-07 14:25:10,226 INFO L140 encePairwiseOnDemand]: 61/70 looper letters, 224 selfloop transitions, 37 changer transitions 0/276 dead transitions. [2024-02-07 14:25:10,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 276 transitions, 2304 flow [2024-02-07 14:25:10,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-07 14:25:10,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-07 14:25:10,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 378 transitions. [2024-02-07 14:25:10,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2024-02-07 14:25:10,228 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 553 flow. Second operand 11 states and 378 transitions. [2024-02-07 14:25:10,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 276 transitions, 2304 flow [2024-02-07 14:25:10,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 276 transitions, 1729 flow, removed 86 selfloop flow, removed 11 redundant places. [2024-02-07 14:25:10,475 INFO L231 Difference]: Finished difference. Result has 102 places, 109 transitions, 739 flow [2024-02-07 14:25:10,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=739, PETRI_PLACES=102, PETRI_TRANSITIONS=109} [2024-02-07 14:25:10,476 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 24 predicate places. [2024-02-07 14:25:10,476 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 109 transitions, 739 flow [2024-02-07 14:25:10,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.75) internal successors, (182), 8 states have internal predecessors, (182), 0 states have call successors, (0), 0 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:10,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:10,476 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:10,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-02-07 14:25:10,476 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 43 more)] === [2024-02-07 14:25:10,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:10,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1665181604, now seen corresponding path program 2 times [2024-02-07 14:25:10,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:10,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623795248] [2024-02-07 14:25:10,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:10,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:10,601 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:25:10,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:10,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623795248] [2024-02-07 14:25:10,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623795248] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:10,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:10,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 14:25:10,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873322858] [2024-02-07 14:25:10,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:10,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-07 14:25:10,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:10,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-07 14:25:10,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-02-07 14:25:10,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 70 [2024-02-07 14:25:10,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 109 transitions, 739 flow. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 0 states have call successors, (0), 0 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:10,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:10,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 70 [2024-02-07 14:25:10,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:12,066 INFO L124 PetriNetUnfolderBase]: 13519/21203 cut-off events. [2024-02-07 14:25:12,066 INFO L125 PetriNetUnfolderBase]: For 31497/31510 co-relation queries the response was YES. [2024-02-07 14:25:12,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61464 conditions, 21203 events. 13519/21203 cut-off events. For 31497/31510 co-relation queries the response was YES. Maximal size of possible extension queue 1006. Compared 150408 event pairs, 2615 based on Foata normal form. 40/21101 useless extension candidates. Maximal degree in co-relation 61435. Up to 12280 conditions per place. [2024-02-07 14:25:12,241 INFO L140 encePairwiseOnDemand]: 63/70 looper letters, 166 selfloop transitions, 40 changer transitions 0/221 dead transitions. [2024-02-07 14:25:12,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 221 transitions, 1691 flow [2024-02-07 14:25:12,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-07 14:25:12,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-07 14:25:12,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 245 transitions. [2024-02-07 14:25:12,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-02-07 14:25:12,243 INFO L175 Difference]: Start difference. First operand has 102 places, 109 transitions, 739 flow. Second operand 7 states and 245 transitions. [2024-02-07 14:25:12,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 221 transitions, 1691 flow [2024-02-07 14:25:12,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 221 transitions, 1622 flow, removed 23 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:12,397 INFO L231 Difference]: Finished difference. Result has 109 places, 122 transitions, 957 flow [2024-02-07 14:25:12,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=957, PETRI_PLACES=109, PETRI_TRANSITIONS=122} [2024-02-07 14:25:12,397 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 31 predicate places. [2024-02-07 14:25:12,397 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 122 transitions, 957 flow [2024-02-07 14:25:12,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 0 states have call successors, (0), 0 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:12,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:12,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:12,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-02-07 14:25:12,398 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 43 more)] === [2024-02-07 14:25:12,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:12,399 INFO L85 PathProgramCache]: Analyzing trace with hash 353923930, now seen corresponding path program 3 times [2024-02-07 14:25:12,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:12,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984185947] [2024-02-07 14:25:12,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:12,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:25:12,412 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 14:25:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:25:12,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 14:25:12,440 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 14:25:12,440 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 46 remaining) [2024-02-07 14:25:12,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 46 remaining) [2024-02-07 14:25:12,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 46 remaining) [2024-02-07 14:25:12,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 46 remaining) [2024-02-07 14:25:12,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 46 remaining) [2024-02-07 14:25:12,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 46 remaining) [2024-02-07 14:25:12,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 46 remaining) [2024-02-07 14:25:12,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 46 remaining) [2024-02-07 14:25:12,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 46 remaining) [2024-02-07 14:25:12,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 46 remaining) [2024-02-07 14:25:12,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 46 remaining) [2024-02-07 14:25:12,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 46 remaining) [2024-02-07 14:25:12,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 46 remaining) [2024-02-07 14:25:12,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 46 remaining) [2024-02-07 14:25:12,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 46 remaining) [2024-02-07 14:25:12,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 46 remaining) [2024-02-07 14:25:12,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 46 remaining) [2024-02-07 14:25:12,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 46 remaining) [2024-02-07 14:25:12,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 46 remaining) [2024-02-07 14:25:12,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 46 remaining) [2024-02-07 14:25:12,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 46 remaining) [2024-02-07 14:25:12,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 46 remaining) [2024-02-07 14:25:12,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 46 remaining) [2024-02-07 14:25:12,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 46 remaining) [2024-02-07 14:25:12,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (21 of 46 remaining) [2024-02-07 14:25:12,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 46 remaining) [2024-02-07 14:25:12,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 46 remaining) [2024-02-07 14:25:12,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 46 remaining) [2024-02-07 14:25:12,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 46 remaining) [2024-02-07 14:25:12,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 46 remaining) [2024-02-07 14:25:12,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 46 remaining) [2024-02-07 14:25:12,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 46 remaining) [2024-02-07 14:25:12,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 46 remaining) [2024-02-07 14:25:12,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 46 remaining) [2024-02-07 14:25:12,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 46 remaining) [2024-02-07 14:25:12,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 46 remaining) [2024-02-07 14:25:12,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 46 remaining) [2024-02-07 14:25:12,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 46 remaining) [2024-02-07 14:25:12,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 46 remaining) [2024-02-07 14:25:12,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 46 remaining) [2024-02-07 14:25:12,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 46 remaining) [2024-02-07 14:25:12,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 46 remaining) [2024-02-07 14:25:12,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 46 remaining) [2024-02-07 14:25:12,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 46 remaining) [2024-02-07 14:25:12,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 46 remaining) [2024-02-07 14:25:12,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 46 remaining) [2024-02-07 14:25:12,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-02-07 14:25:12,450 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:12,455 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 14:25:12,455 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 14:25:12,487 INFO L503 ceAbstractionStarter]: Automizer considered 24 witness invariants [2024-02-07 14:25:12,488 INFO L504 ceAbstractionStarter]: WitnessConsidered=24 [2024-02-07 14:25:12,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 02:25:12 BasicIcfg [2024-02-07 14:25:12,488 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 14:25:12,489 INFO L158 Benchmark]: Toolchain (without parser) took 37128.20ms. Allocated memory was 148.9MB in the beginning and 14.4GB in the end (delta: 14.3GB). Free memory was 107.8MB in the beginning and 8.2GB in the end (delta: -8.1GB). Peak memory consumption was 6.2GB. Max. memory is 16.1GB. [2024-02-07 14:25:12,489 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 148.9MB. Free memory was 118.1MB in the beginning and 118.0MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:25:12,489 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 148.9MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:25:12,489 INFO L158 Benchmark]: CACSL2BoogieTranslator took 523.16ms. Allocated memory is still 148.9MB. Free memory was 107.8MB in the beginning and 76.0MB in the end (delta: 31.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-02-07 14:25:12,490 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.92ms. Allocated memory is still 148.9MB. Free memory was 76.0MB in the beginning and 73.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 14:25:12,490 INFO L158 Benchmark]: Boogie Preprocessor took 114.32ms. Allocated memory is still 148.9MB. Free memory was 73.9MB in the beginning and 118.2MB in the end (delta: -44.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-02-07 14:25:12,490 INFO L158 Benchmark]: RCFGBuilder took 530.61ms. Allocated memory is still 148.9MB. Free memory was 118.2MB in the beginning and 81.5MB in the end (delta: 36.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-02-07 14:25:12,490 INFO L158 Benchmark]: TraceAbstraction took 35884.74ms. Allocated memory was 148.9MB in the beginning and 14.4GB in the end (delta: 14.3GB). Free memory was 80.9MB in the beginning and 8.2GB in the end (delta: -8.1GB). Peak memory consumption was 6.2GB. Max. memory is 16.1GB. [2024-02-07 14:25:12,493 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.16ms. Allocated memory is still 148.9MB. Free memory was 118.1MB in the beginning and 118.0MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.12ms. Allocated memory is still 148.9MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 523.16ms. Allocated memory is still 148.9MB. Free memory was 107.8MB in the beginning and 76.0MB in the end (delta: 31.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.92ms. Allocated memory is still 148.9MB. Free memory was 76.0MB in the beginning and 73.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 114.32ms. Allocated memory is still 148.9MB. Free memory was 73.9MB in the beginning and 118.2MB in the end (delta: -44.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 530.61ms. Allocated memory is still 148.9MB. Free memory was 118.2MB in the beginning and 81.5MB in the end (delta: 36.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 35884.74ms. Allocated memory was 148.9MB in the beginning and 14.4GB in the end (delta: 14.3GB). Free memory was 80.9MB in the beginning and 8.2GB in the end (delta: -8.1GB). Peak memory consumption was 6.2GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 803]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L788] 0 pthread_t t2233; [L789] FCALL, FORK 0 pthread_create(&t2233, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2233={5:0}, x=0, y=0] [L726] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]]]] [L726] 1 __unbuffered_p0_EAX = y [L727] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[2]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L790] 0 pthread_t t2234; [L791] FCALL, FORK 0 pthread_create(&t2234, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2233={5:0}, t2234={6:0}, x=0, y=0] [L792] 0 pthread_t t2235; [L729] 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]]]]]] [L729] 1 __unbuffered_p0_EBX = x [L730] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EBX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L734] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L734] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L735] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L793] FCALL, FORK 0 pthread_create(&t2235, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2233={5:0}, t2234={6:0}, t2235={7:0}, x=0, y=0] [L753] 3 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]]]]]] [L753] 3 __unbuffered_p2_EAX = x [L754] 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=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=0, y=0] [L794] 0 pthread_t t2236; [L795] FCALL, FORK 0 pthread_create(&t2236, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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, t2233={5:0}, t2234={6:0}, t2235={7:0}, t2236={3:0}, x=0, y=0] [L741] 2 x = 1 [L742] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0: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=0] [L746] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L746] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0: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=0] [L768] 4 y = 2 [L769] 4 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]] VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0: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=2] [L756] 3 y = 1 [L757] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0: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] [L761] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L761] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0: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] [L773] 4 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L773] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L774] 4 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0: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] [L797] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L798] 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=4, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, 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, t2233={5:0}, t2234={6:0}, t2235={7:0}, t2236={3:0}, x=1, y=1] [L799] 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]]]]]] [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L803] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[2]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[0]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EBX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[1]]]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EAX]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EBX]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[1]]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[2]]]]]]]] VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, 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, t2233={5:0}, t2234={6:0}, t2235={7:0}, t2236={3:0}, x=1, y=1] - UnprovableResult [Line: 726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 727]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 730]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 734]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 735]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 742]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 746]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 747]: 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: 754]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 757]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 761]: 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: 769]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 773]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 774]: 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: 798]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 799]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 804]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 805]: 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: 793]: 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: 789]: 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: 795]: 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: 791]: 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 9 procedures, 117 locations, 46 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: 35.8s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 33.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1055 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1050 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2225 IncrementalHoareTripleChecker+Invalid, 2306 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 3 mSDtfsCounter, 2225 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=957occurred in iteration=19, InterpolantAutomatonStates: 90, 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.5s InterpolantComputationTime, 368 NumberOfCodeBlocks, 368 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 2366 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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:12,515 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