./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe032_tso.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe032_tso.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 958ec4d9 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_tso.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe032_tso.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-958ec4d-m [2024-02-07 14:25:16,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 14:25:16,371 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 14:25:16,376 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 14:25:16,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 14:25:16,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 14:25:16,395 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 14:25:16,396 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 14:25:16,396 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 14:25:16,397 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 14:25:16,397 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 14:25:16,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 14:25:16,398 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 14:25:16,398 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 14:25:16,399 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 14:25:16,399 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 14:25:16,400 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 14:25:16,400 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 14:25:16,400 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 14:25:16,401 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 14:25:16,401 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 14:25:16,402 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 14:25:16,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 14:25:16,402 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 14:25:16,403 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 14:25:16,403 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 14:25:16,404 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 14:25:16,404 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 14:25:16,404 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 14:25:16,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 14:25:16,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 14:25:16,406 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 14:25:16,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:25:16,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 14:25:16,407 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 14:25:16,407 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 14:25:16,408 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 14:25:16,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 14:25:16,408 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 14:25:16,409 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 14:25:16,409 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 14:25:16,410 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 14:25:16,410 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 14:25:16,410 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:25:16,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 14:25:16,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 14:25:16,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 14:25:16,688 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 14:25:16,689 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 14:25:16,690 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/safe032_tso.yml/witness.yml [2024-02-07 14:25:16,853 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 14:25:16,854 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 14:25:16,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_tso.i [2024-02-07 14:25:18,021 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 14:25:18,271 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 14:25:18,272 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_tso.i [2024-02-07 14:25:18,286 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8530268cd/a81768f34ba94fb497fe72acb2170138/FLAGae7803438 [2024-02-07 14:25:18,302 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8530268cd/a81768f34ba94fb497fe72acb2170138 [2024-02-07 14:25:18,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 14:25:18,307 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 14:25:18,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 14:25:18,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 14:25:18,313 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 14:25:18,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:25:16" (1/2) ... [2024-02-07 14:25:18,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44302e62 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:25:18, skipping insertion in model container [2024-02-07 14:25:18,316 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:25:16" (1/2) ... [2024-02-07 14:25:18,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5e865061 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:25:18, skipping insertion in model container [2024-02-07 14:25:18,317 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:25:18" (2/2) ... [2024-02-07 14:25:18,318 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44302e62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:18, skipping insertion in model container [2024-02-07 14:25:18,318 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:25:18" (2/2) ... [2024-02-07 14:25:18,319 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 14:25:18,402 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 14:25:18,403 INFO L76 edCorrectnessWitness]: Location invariant before [L766-L766] 1 <= __unbuffered_cnt [2024-02-07 14:25:18,403 INFO L76 edCorrectnessWitness]: Location invariant before [L750-L750] 0 <= __unbuffered_cnt [2024-02-07 14:25:18,404 INFO L76 edCorrectnessWitness]: Location invariant before [L793-L793] (((((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 2)) && (__unbuffered_p1_EAX <= 127)) && (x == 2)) && ((y == 2 && (__unbuffered_p0_EAX == 0 || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) || ((((((0 <= __unbuffered_p0_EAX && 0 <= y) && __unbuffered_p0_EAX <= 2) && y <= 2) && y <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((y == 0 || y == 1) || y == 2)))) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2) [2024-02-07 14:25:18,404 INFO L76 edCorrectnessWitness]: Location invariant before [L789-L789] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 14:25:18,404 INFO L76 edCorrectnessWitness]: Location invariant before [L741-L741] x == 1 [2024-02-07 14:25:18,405 INFO L76 edCorrectnessWitness]: Location invariant before [L746-L746] (((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 2)) && (__unbuffered_p1_EAX <= 127)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2) [2024-02-07 14:25:18,405 INFO L76 edCorrectnessWitness]: Location invariant before [L745-L745] (((0 <= x) && (x <= 2)) && (x <= 127)) && ((x == 0 || x == 1) || x == 2) [2024-02-07 14:25:18,405 INFO L76 edCorrectnessWitness]: Location invariant before [L788-L788] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 14:25:18,405 INFO L76 edCorrectnessWitness]: Location invariant before [L765-L765] 0 <= __unbuffered_cnt [2024-02-07 14:25:18,405 INFO L76 edCorrectnessWitness]: Location invariant before [L18-L18] ((0 <= expression) && (expression <= 1)) && (expression == 0 || expression == 1) [2024-02-07 14:25:18,406 INFO L76 edCorrectnessWitness]: Location invariant before [L733-L733] 0 <= __unbuffered_cnt [2024-02-07 14:25:18,406 INFO L76 edCorrectnessWitness]: Location invariant before [L795-L795] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 14:25:18,406 INFO L76 edCorrectnessWitness]: Location invariant before [L729-L729] (((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:25:18,406 INFO L76 edCorrectnessWitness]: Location invariant before [L751-L751] 1 <= __unbuffered_cnt [2024-02-07 14:25:18,406 INFO L76 edCorrectnessWitness]: Location invariant before [L728-L728] (((0 <= x) && (x <= 2)) && (x <= 127)) && ((x == 0 || x == 1) || x == 2) [2024-02-07 14:25:18,406 INFO L76 edCorrectnessWitness]: Location invariant before [L787-L787] 0 <= __unbuffered_cnt [2024-02-07 14:25:18,407 INFO L76 edCorrectnessWitness]: Location invariant before [L794-L794] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 14:25:18,407 INFO L76 edCorrectnessWitness]: Location invariant before [L758-L758] x == 2 [2024-02-07 14:25:18,407 INFO L76 edCorrectnessWitness]: Location invariant before [L724-L724] y == 2 [2024-02-07 14:25:18,407 INFO L76 edCorrectnessWitness]: Location invariant before [L734-L734] 1 <= __unbuffered_cnt [2024-02-07 14:25:18,407 INFO L76 edCorrectnessWitness]: Location invariant before [L761-L761] y == 1 [2024-02-07 14:25:18,460 INFO L178 MainTranslator]: Built tables and reachable declarations [2024-02-07 14:25:18,643 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/safe032_tso.i[945,958] [2024-02-07 14:25:18,864 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:25:18,873 INFO L203 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 14:25:18,912 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/safe032_tso.i[945,958] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 14:25:18,976 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:25:19,039 INFO L207 MainTranslator]: Completed translation [2024-02-07 14:25:19,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:19 WrapperNode [2024-02-07 14:25:19,040 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 14:25:19,041 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 14:25:19,041 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 14:25:19,041 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 14:25:19,047 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:25:19" (1/1) ... [2024-02-07 14:25:19,060 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:25:19" (1/1) ... [2024-02-07 14:25:19,081 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2024-02-07 14:25:19,082 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 14:25:19,082 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 14:25:19,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 14:25:19,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 14:25:19,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:19" (1/1) ... [2024-02-07 14:25:19,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:19" (1/1) ... [2024-02-07 14:25:19,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:19" (1/1) ... [2024-02-07 14:25:19,116 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-02-07 14:25:19,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:19" (1/1) ... [2024-02-07 14:25:19,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:19" (1/1) ... [2024-02-07 14:25:19,124 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:19" (1/1) ... [2024-02-07 14:25:19,125 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:19" (1/1) ... [2024-02-07 14:25:19,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:19" (1/1) ... [2024-02-07 14:25:19,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:19" (1/1) ... [2024-02-07 14:25:19,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 14:25:19,132 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 14:25:19,132 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 14:25:19,132 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 14:25:19,133 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:19" (1/1) ... [2024-02-07 14:25:19,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:25:19,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:25:19,159 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:25:19,195 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:25:19,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 14:25:19,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 14:25:19,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 14:25:19,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 14:25:19,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 14:25:19,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 14:25:19,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 14:25:19,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 14:25:19,214 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-02-07 14:25:19,214 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-02-07 14:25:19,215 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-02-07 14:25:19,215 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-02-07 14:25:19,215 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-02-07 14:25:19,215 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-02-07 14:25:19,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 14:25:19,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 14:25:19,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 14:25:19,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 14:25:19,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 14:25:19,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 14:25:19,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 14:25:19,219 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:25:19,372 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 14:25:19,375 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 14:25:19,578 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 14:25:19,578 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 14:25:19,737 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 14:25:19,737 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-07 14:25:19,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:25:19 BoogieIcfgContainer [2024-02-07 14:25:19,738 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 14:25:19,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 14:25:19,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 14:25:19,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 14:25:19,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:25:16" (1/4) ... [2024-02-07 14:25:19,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed2f6df and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:25:19, skipping insertion in model container [2024-02-07 14:25:19,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 02:25:18" (2/4) ... [2024-02-07 14:25:19,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed2f6df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:25:19, skipping insertion in model container [2024-02-07 14:25:19,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:19" (3/4) ... [2024-02-07 14:25:19,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed2f6df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:25:19, skipping insertion in model container [2024-02-07 14:25:19,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:25:19" (4/4) ... [2024-02-07 14:25:19,746 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_tso.i [2024-02-07 14:25:19,763 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 14:25:19,764 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-02-07 14:25:19,764 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 14:25:19,817 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-07 14:25:19,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 62 transitions, 136 flow [2024-02-07 14:25:19,902 INFO L124 PetriNetUnfolderBase]: 1/59 cut-off events. [2024-02-07 14:25:19,902 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:25:19,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 59 events. 1/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 196 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2024-02-07 14:25:19,907 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 62 transitions, 136 flow [2024-02-07 14:25:19,911 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 59 transitions, 127 flow [2024-02-07 14:25:19,926 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 14:25:19,934 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;@6db12a01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 14:25:19,934 INFO L358 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2024-02-07 14:25:19,940 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 14:25:19,940 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-02-07 14:25:19,941 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:25:19,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:19,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-07 14:25:19,943 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:19,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:19,952 INFO L85 PathProgramCache]: Analyzing trace with hash 9491147, now seen corresponding path program 1 times [2024-02-07 14:25:19,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:19,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449381441] [2024-02-07 14:25:19,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:19,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:20,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:20,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:20,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449381441] [2024-02-07 14:25:20,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449381441] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:20,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:20,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:25:20,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815958812] [2024-02-07 14:25:20,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:20,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-02-07 14:25:20,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:20,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-02-07 14:25:20,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-02-07 14:25:20,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2024-02-07 14:25:20,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 127 flow. Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 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:20,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:20,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2024-02-07 14:25:20,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:21,573 INFO L124 PetriNetUnfolderBase]: 6628/11137 cut-off events. [2024-02-07 14:25:21,573 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-02-07 14:25:21,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20643 conditions, 11137 events. 6628/11137 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 86503 event pairs, 6628 based on Foata normal form. 245/8095 useless extension candidates. Maximal degree in co-relation 20632. Up to 9388 conditions per place. [2024-02-07 14:25:21,661 INFO L140 encePairwiseOnDemand]: 50/62 looper letters, 31 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2024-02-07 14:25:21,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 47 transitions, 165 flow [2024-02-07 14:25:21,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-02-07 14:25:21,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-02-07 14:25:21,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 81 transitions. [2024-02-07 14:25:21,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6532258064516129 [2024-02-07 14:25:21,674 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 127 flow. Second operand 2 states and 81 transitions. [2024-02-07 14:25:21,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 47 transitions, 165 flow [2024-02-07 14:25:21,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-07 14:25:21,687 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 100 flow [2024-02-07 14:25:21,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=100, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2024-02-07 14:25:21,692 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -13 predicate places. [2024-02-07 14:25:21,693 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 100 flow [2024-02-07 14:25:21,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 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:21,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:21,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-07 14:25:21,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 14:25:21,694 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:21,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:21,695 INFO L85 PathProgramCache]: Analyzing trace with hash 531068653, now seen corresponding path program 1 times [2024-02-07 14:25:21,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:21,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166171421] [2024-02-07 14:25:21,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:21,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:21,807 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:21,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:21,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166171421] [2024-02-07 14:25:21,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166171421] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:21,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:21,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:25:21,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523181965] [2024-02-07 14:25:21,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:21,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:21,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:21,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:21,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:21,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2024-02-07 14:25:21,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:21,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:21,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2024-02-07 14:25:21,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:22,787 INFO L124 PetriNetUnfolderBase]: 6545/11317 cut-off events. [2024-02-07 14:25:22,787 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:25:22,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20703 conditions, 11317 events. 6545/11317 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 596. Compared 89250 event pairs, 2806 based on Foata normal form. 0/8152 useless extension candidates. Maximal degree in co-relation 20700. Up to 9168 conditions per place. [2024-02-07 14:25:22,870 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 42 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2024-02-07 14:25:22,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 61 transitions, 220 flow [2024-02-07 14:25:22,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:22,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:22,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-02-07 14:25:22,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5591397849462365 [2024-02-07 14:25:22,874 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 100 flow. Second operand 3 states and 104 transitions. [2024-02-07 14:25:22,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 61 transitions, 220 flow [2024-02-07 14:25:22,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 61 transitions, 220 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-07 14:25:22,878 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 121 flow [2024-02-07 14:25:22,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2024-02-07 14:25:22,879 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2024-02-07 14:25:22,879 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 121 flow [2024-02-07 14:25:22,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:22,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:22,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:22,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 14:25:22,881 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:22,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:22,881 INFO L85 PathProgramCache]: Analyzing trace with hash 2091503824, now seen corresponding path program 1 times [2024-02-07 14:25:22,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:22,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147741235] [2024-02-07 14:25:22,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:22,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:22,953 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:22,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:22,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147741235] [2024-02-07 14:25:22,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147741235] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:22,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:22,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:25:22,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352569755] [2024-02-07 14:25:22,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:22,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:22,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:22,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:22,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:22,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2024-02-07 14:25:22,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 121 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:25:22,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:22,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2024-02-07 14:25:22,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:23,659 INFO L124 PetriNetUnfolderBase]: 5023/7642 cut-off events. [2024-02-07 14:25:23,660 INFO L125 PetriNetUnfolderBase]: For 1091/1091 co-relation queries the response was YES. [2024-02-07 14:25:23,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16155 conditions, 7642 events. 5023/7642 cut-off events. For 1091/1091 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 48291 event pairs, 1631 based on Foata normal form. 0/6368 useless extension candidates. Maximal degree in co-relation 16150. Up to 6030 conditions per place. [2024-02-07 14:25:23,718 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 53 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2024-02-07 14:25:23,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 73 transitions, 301 flow [2024-02-07 14:25:23,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:23,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:23,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-02-07 14:25:23,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6129032258064516 [2024-02-07 14:25:23,724 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 121 flow. Second operand 3 states and 114 transitions. [2024-02-07 14:25:23,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 73 transitions, 301 flow [2024-02-07 14:25:23,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 73 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:23,727 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 150 flow [2024-02-07 14:25:23,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2024-02-07 14:25:23,729 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -8 predicate places. [2024-02-07 14:25:23,729 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 150 flow [2024-02-07 14:25:23,731 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:25:23,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:23,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:23,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 14:25:23,732 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:23,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:23,732 INFO L85 PathProgramCache]: Analyzing trace with hash 2092883076, now seen corresponding path program 1 times [2024-02-07 14:25:23,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:23,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496720941] [2024-02-07 14:25:23,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:23,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:23,799 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:23,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:23,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496720941] [2024-02-07 14:25:23,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496720941] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:23,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:23,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:25:23,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147446327] [2024-02-07 14:25:23,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:23,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:23,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:23,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:23,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:23,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2024-02-07 14:25:23,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 150 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:25:23,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:23,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2024-02-07 14:25:23,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:24,929 INFO L124 PetriNetUnfolderBase]: 7151/12025 cut-off events. [2024-02-07 14:25:24,930 INFO L125 PetriNetUnfolderBase]: For 2484/2484 co-relation queries the response was YES. [2024-02-07 14:25:24,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26928 conditions, 12025 events. 7151/12025 cut-off events. For 2484/2484 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 92703 event pairs, 3434 based on Foata normal form. 376/10555 useless extension candidates. Maximal degree in co-relation 26922. Up to 5874 conditions per place. [2024-02-07 14:25:25,135 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 58 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2024-02-07 14:25:25,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 77 transitions, 347 flow [2024-02-07 14:25:25,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:25,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:25,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-02-07 14:25:25,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6129032258064516 [2024-02-07 14:25:25,138 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 150 flow. Second operand 3 states and 114 transitions. [2024-02-07 14:25:25,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 77 transitions, 347 flow [2024-02-07 14:25:25,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 77 transitions, 340 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:25,141 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 161 flow [2024-02-07 14:25:25,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2024-02-07 14:25:25,143 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -6 predicate places. [2024-02-07 14:25:25,143 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 161 flow [2024-02-07 14:25:25,144 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:25:25,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:25,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:25,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 14:25:25,144 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:25,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:25,145 INFO L85 PathProgramCache]: Analyzing trace with hash 412109447, now seen corresponding path program 1 times [2024-02-07 14:25:25,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:25,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849367602] [2024-02-07 14:25:25,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:25,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:25,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:25,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:25,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849367602] [2024-02-07 14:25:25,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849367602] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:25,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:25,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:25:25,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929489172] [2024-02-07 14:25:25,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:25,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:25,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:25,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:25,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:25,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 14:25:25,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 161 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:25:25,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:25,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 14:25:25,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:26,072 INFO L124 PetriNetUnfolderBase]: 7151/12276 cut-off events. [2024-02-07 14:25:26,073 INFO L125 PetriNetUnfolderBase]: For 4843/4843 co-relation queries the response was YES. [2024-02-07 14:25:26,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27967 conditions, 12276 events. 7151/12276 cut-off events. For 4843/4843 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 98838 event pairs, 6631 based on Foata normal form. 0/10371 useless extension candidates. Maximal degree in co-relation 27960. Up to 10469 conditions per place. [2024-02-07 14:25:26,282 INFO L140 encePairwiseOnDemand]: 60/62 looper letters, 35 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2024-02-07 14:25:26,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 51 transitions, 231 flow [2024-02-07 14:25:26,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:26,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:26,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2024-02-07 14:25:26,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46236559139784944 [2024-02-07 14:25:26,284 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 161 flow. Second operand 3 states and 86 transitions. [2024-02-07 14:25:26,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 51 transitions, 231 flow [2024-02-07 14:25:26,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 51 transitions, 226 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:26,289 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 156 flow [2024-02-07 14:25:26,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2024-02-07 14:25:26,292 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -6 predicate places. [2024-02-07 14:25:26,292 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 156 flow [2024-02-07 14:25:26,293 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:25:26,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:26,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:26,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 14:25:26,293 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:26,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:26,295 INFO L85 PathProgramCache]: Analyzing trace with hash 900196394, now seen corresponding path program 1 times [2024-02-07 14:25:26,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:26,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552028827] [2024-02-07 14:25:26,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:26,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:26,444 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:26,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:26,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552028827] [2024-02-07 14:25:26,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552028827] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:26,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:26,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:25:26,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422183908] [2024-02-07 14:25:26,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:26,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:25:26,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:26,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:25:26,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:25:26,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 14:25:26,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 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:26,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:26,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 14:25:26,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:27,330 INFO L124 PetriNetUnfolderBase]: 6634/11900 cut-off events. [2024-02-07 14:25:27,330 INFO L125 PetriNetUnfolderBase]: For 3295/3295 co-relation queries the response was YES. [2024-02-07 14:25:27,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26481 conditions, 11900 events. 6634/11900 cut-off events. For 3295/3295 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 98642 event pairs, 1385 based on Foata normal form. 377/10519 useless extension candidates. Maximal degree in co-relation 26474. Up to 5628 conditions per place. [2024-02-07 14:25:27,426 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 66 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2024-02-07 14:25:27,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 86 transitions, 420 flow [2024-02-07 14:25:27,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:25:27,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:25:27,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2024-02-07 14:25:27,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5604838709677419 [2024-02-07 14:25:27,428 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 156 flow. Second operand 4 states and 139 transitions. [2024-02-07 14:25:27,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 86 transitions, 420 flow [2024-02-07 14:25:27,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 86 transitions, 419 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:27,431 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 181 flow [2024-02-07 14:25:27,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2024-02-07 14:25:27,432 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2024-02-07 14:25:27,432 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 181 flow [2024-02-07 14:25:27,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 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:27,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:27,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:27,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 14:25:27,433 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:27,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:27,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1638411986, now seen corresponding path program 1 times [2024-02-07 14:25:27,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:27,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864149389] [2024-02-07 14:25:27,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:27,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:27,495 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:27,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:27,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864149389] [2024-02-07 14:25:27,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864149389] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:27,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:27,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:25:27,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193152395] [2024-02-07 14:25:27,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:27,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:27,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:27,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:27,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:27,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2024-02-07 14:25:27,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 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:27,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:27,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2024-02-07 14:25:27,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:28,052 INFO L124 PetriNetUnfolderBase]: 5517/9446 cut-off events. [2024-02-07 14:25:28,053 INFO L125 PetriNetUnfolderBase]: For 4120/4120 co-relation queries the response was YES. [2024-02-07 14:25:28,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22599 conditions, 9446 events. 5517/9446 cut-off events. For 4120/4120 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 72016 event pairs, 2291 based on Foata normal form. 396/8442 useless extension candidates. Maximal degree in co-relation 22590. Up to 4223 conditions per place. [2024-02-07 14:25:28,122 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 56 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2024-02-07 14:25:28,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 74 transitions, 378 flow [2024-02-07 14:25:28,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:28,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:28,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-02-07 14:25:28,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5860215053763441 [2024-02-07 14:25:28,124 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 181 flow. Second operand 3 states and 109 transitions. [2024-02-07 14:25:28,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 74 transitions, 378 flow [2024-02-07 14:25:28,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 74 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:25:28,127 INFO L231 Difference]: Finished difference. Result has 64 places, 50 transitions, 171 flow [2024-02-07 14:25:28,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=171, PETRI_PLACES=64, PETRI_TRANSITIONS=50} [2024-02-07 14:25:28,128 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -4 predicate places. [2024-02-07 14:25:28,128 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 50 transitions, 171 flow [2024-02-07 14:25:28,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 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:28,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:28,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:28,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 14:25:28,129 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:28,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:28,130 INFO L85 PathProgramCache]: Analyzing trace with hash -495382931, now seen corresponding path program 1 times [2024-02-07 14:25:28,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:28,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529940433] [2024-02-07 14:25:28,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:28,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:28,156 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:28,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:28,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529940433] [2024-02-07 14:25:28,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529940433] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:28,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:28,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:25:28,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814346062] [2024-02-07 14:25:28,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:28,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:28,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:28,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:28,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:28,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2024-02-07 14:25:28,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 50 transitions, 171 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:25:28,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:28,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2024-02-07 14:25:28,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:28,596 INFO L124 PetriNetUnfolderBase]: 3112/5622 cut-off events. [2024-02-07 14:25:28,596 INFO L125 PetriNetUnfolderBase]: For 2953/2953 co-relation queries the response was YES. [2024-02-07 14:25:28,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13024 conditions, 5622 events. 3112/5622 cut-off events. For 2953/2953 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 40563 event pairs, 1432 based on Foata normal form. 166/5491 useless extension candidates. Maximal degree in co-relation 13015. Up to 4346 conditions per place. [2024-02-07 14:25:28,635 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 39 selfloop transitions, 3 changer transitions 2/59 dead transitions. [2024-02-07 14:25:28,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 291 flow [2024-02-07 14:25:28,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:28,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:28,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-02-07 14:25:28,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.543010752688172 [2024-02-07 14:25:28,637 INFO L175 Difference]: Start difference. First operand has 64 places, 50 transitions, 171 flow. Second operand 3 states and 101 transitions. [2024-02-07 14:25:28,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 291 flow [2024-02-07 14:25:28,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 59 transitions, 285 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:28,641 INFO L231 Difference]: Finished difference. Result has 61 places, 44 transitions, 152 flow [2024-02-07 14:25:28,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=61, PETRI_TRANSITIONS=44} [2024-02-07 14:25:28,643 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -7 predicate places. [2024-02-07 14:25:28,643 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 152 flow [2024-02-07 14:25:28,643 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:25:28,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:28,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:28,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 14:25:28,644 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:28,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:28,645 INFO L85 PathProgramCache]: Analyzing trace with hash -325751567, now seen corresponding path program 1 times [2024-02-07 14:25:28,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:28,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138309153] [2024-02-07 14:25:28,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:28,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:28,826 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:28,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:28,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138309153] [2024-02-07 14:25:28,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138309153] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:28,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:28,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:25:28,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721580641] [2024-02-07 14:25:28,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:28,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:25:28,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:28,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:25:28,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:25:28,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2024-02-07 14:25:28,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 44 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 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:28,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:28,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2024-02-07 14:25:28,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:29,216 INFO L124 PetriNetUnfolderBase]: 2551/4706 cut-off events. [2024-02-07 14:25:29,216 INFO L125 PetriNetUnfolderBase]: For 2554/2554 co-relation queries the response was YES. [2024-02-07 14:25:29,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10786 conditions, 4706 events. 2551/4706 cut-off events. For 2554/2554 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 33622 event pairs, 1248 based on Foata normal form. 8/4500 useless extension candidates. Maximal degree in co-relation 10777. Up to 3501 conditions per place. [2024-02-07 14:25:29,246 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 58 selfloop transitions, 13 changer transitions 0/86 dead transitions. [2024-02-07 14:25:29,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 86 transitions, 449 flow [2024-02-07 14:25:29,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:25:29,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:25:29,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2024-02-07 14:25:29,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5193548387096775 [2024-02-07 14:25:29,249 INFO L175 Difference]: Start difference. First operand has 61 places, 44 transitions, 152 flow. Second operand 5 states and 161 transitions. [2024-02-07 14:25:29,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 86 transitions, 449 flow [2024-02-07 14:25:29,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 86 transitions, 410 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-02-07 14:25:29,253 INFO L231 Difference]: Finished difference. Result has 64 places, 56 transitions, 238 flow [2024-02-07 14:25:29,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=238, PETRI_PLACES=64, PETRI_TRANSITIONS=56} [2024-02-07 14:25:29,254 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -4 predicate places. [2024-02-07 14:25:29,254 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 56 transitions, 238 flow [2024-02-07 14:25:29,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 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:29,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:29,254 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:29,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 14:25:29,255 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:29,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:29,255 INFO L85 PathProgramCache]: Analyzing trace with hash -2129121796, now seen corresponding path program 1 times [2024-02-07 14:25:29,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:29,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563557392] [2024-02-07 14:25:29,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:29,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:29,390 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:29,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:29,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563557392] [2024-02-07 14:25:29,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563557392] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:29,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:29,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:25:29,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835832112] [2024-02-07 14:25:29,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:29,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:25:29,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:29,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:25:29,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:25:29,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 14:25:29,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 238 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 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:29,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:29,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 14:25:29,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:29,749 INFO L124 PetriNetUnfolderBase]: 1823/3303 cut-off events. [2024-02-07 14:25:29,749 INFO L125 PetriNetUnfolderBase]: For 2532/2532 co-relation queries the response was YES. [2024-02-07 14:25:29,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8405 conditions, 3303 events. 1823/3303 cut-off events. For 2532/2532 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 20881 event pairs, 185 based on Foata normal form. 170/3340 useless extension candidates. Maximal degree in co-relation 8395. Up to 1001 conditions per place. [2024-02-07 14:25:29,767 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 82 selfloop transitions, 8 changer transitions 1/106 dead transitions. [2024-02-07 14:25:29,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 106 transitions, 648 flow [2024-02-07 14:25:29,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:25:29,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:25:29,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2024-02-07 14:25:29,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5096774193548387 [2024-02-07 14:25:29,769 INFO L175 Difference]: Start difference. First operand has 64 places, 56 transitions, 238 flow. Second operand 5 states and 158 transitions. [2024-02-07 14:25:29,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 106 transitions, 648 flow [2024-02-07 14:25:29,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 106 transitions, 640 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-02-07 14:25:29,775 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 282 flow [2024-02-07 14:25:29,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2024-02-07 14:25:29,776 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 2 predicate places. [2024-02-07 14:25:29,776 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 282 flow [2024-02-07 14:25:29,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 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:29,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:29,777 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:29,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 14:25:29,777 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:29,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:29,778 INFO L85 PathProgramCache]: Analyzing trace with hash -37970503, now seen corresponding path program 1 times [2024-02-07 14:25:29,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:29,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936022604] [2024-02-07 14:25:29,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:29,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:29,943 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:29,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:29,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936022604] [2024-02-07 14:25:29,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936022604] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:29,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:29,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:25:29,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350230330] [2024-02-07 14:25:29,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:29,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:25:29,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:29,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:25:29,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:25:29,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2024-02-07 14:25:29,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 282 flow. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:29,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:29,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2024-02-07 14:25:29,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:30,296 INFO L124 PetriNetUnfolderBase]: 1656/3108 cut-off events. [2024-02-07 14:25:30,296 INFO L125 PetriNetUnfolderBase]: For 3754/3754 co-relation queries the response was YES. [2024-02-07 14:25:30,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8695 conditions, 3108 events. 1656/3108 cut-off events. For 3754/3754 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 20037 event pairs, 477 based on Foata normal form. 8/2989 useless extension candidates. Maximal degree in co-relation 8682. Up to 1820 conditions per place. [2024-02-07 14:25:30,320 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 70 selfloop transitions, 18 changer transitions 0/103 dead transitions. [2024-02-07 14:25:30,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 103 transitions, 686 flow [2024-02-07 14:25:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:25:30,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:25:30,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2024-02-07 14:25:30,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5258064516129032 [2024-02-07 14:25:30,322 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 282 flow. Second operand 5 states and 163 transitions. [2024-02-07 14:25:30,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 103 transitions, 686 flow [2024-02-07 14:25:30,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 103 transitions, 619 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-02-07 14:25:30,332 INFO L231 Difference]: Finished difference. Result has 73 places, 64 transitions, 359 flow [2024-02-07 14:25:30,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=359, PETRI_PLACES=73, PETRI_TRANSITIONS=64} [2024-02-07 14:25:30,335 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2024-02-07 14:25:30,335 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 64 transitions, 359 flow [2024-02-07 14:25:30,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:30,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:30,336 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:30,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-07 14:25:30,337 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:30,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:30,338 INFO L85 PathProgramCache]: Analyzing trace with hash -213826315, now seen corresponding path program 2 times [2024-02-07 14:25:30,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:30,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309226612] [2024-02-07 14:25:30,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:30,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:30,523 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:30,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:30,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309226612] [2024-02-07 14:25:30,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309226612] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:30,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:30,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:25:30,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81867780] [2024-02-07 14:25:30,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:30,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:25:30,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:30,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:25:30,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:25:30,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2024-02-07 14:25:30,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 64 transitions, 359 flow. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:30,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:30,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2024-02-07 14:25:30,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:30,853 INFO L124 PetriNetUnfolderBase]: 1676/3145 cut-off events. [2024-02-07 14:25:30,853 INFO L125 PetriNetUnfolderBase]: For 4643/4643 co-relation queries the response was YES. [2024-02-07 14:25:30,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9212 conditions, 3145 events. 1676/3145 cut-off events. For 4643/4643 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 20285 event pairs, 483 based on Foata normal form. 8/3035 useless extension candidates. Maximal degree in co-relation 9197. Up to 1824 conditions per place. [2024-02-07 14:25:30,870 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 73 selfloop transitions, 24 changer transitions 0/112 dead transitions. [2024-02-07 14:25:30,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 112 transitions, 783 flow [2024-02-07 14:25:30,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:25:30,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:25:30,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 187 transitions. [2024-02-07 14:25:30,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5026881720430108 [2024-02-07 14:25:30,872 INFO L175 Difference]: Start difference. First operand has 73 places, 64 transitions, 359 flow. Second operand 6 states and 187 transitions. [2024-02-07 14:25:30,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 112 transitions, 783 flow [2024-02-07 14:25:30,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 112 transitions, 757 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-02-07 14:25:30,881 INFO L231 Difference]: Finished difference. Result has 79 places, 72 transitions, 487 flow [2024-02-07 14:25:30,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=487, PETRI_PLACES=79, PETRI_TRANSITIONS=72} [2024-02-07 14:25:30,882 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 11 predicate places. [2024-02-07 14:25:30,882 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 72 transitions, 487 flow [2024-02-07 14:25:30,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:30,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:30,883 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:30,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-07 14:25:30,884 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:30,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:30,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1159541167, now seen corresponding path program 1 times [2024-02-07 14:25:30,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:30,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321416719] [2024-02-07 14:25:30,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:30,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:31,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:31,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:31,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321416719] [2024-02-07 14:25:31,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321416719] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:31,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:31,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 14:25:31,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721938422] [2024-02-07 14:25:31,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:31,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-07 14:25:31,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:31,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-07 14:25:31,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-02-07 14:25:31,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2024-02-07 14:25:31,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 72 transitions, 487 flow. Second operand has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 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:31,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:31,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2024-02-07 14:25:31,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:31,487 INFO L124 PetriNetUnfolderBase]: 1905/3658 cut-off events. [2024-02-07 14:25:31,487 INFO L125 PetriNetUnfolderBase]: For 6122/6122 co-relation queries the response was YES. [2024-02-07 14:25:31,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10818 conditions, 3658 events. 1905/3658 cut-off events. For 6122/6122 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 24560 event pairs, 811 based on Foata normal form. 8/3516 useless extension candidates. Maximal degree in co-relation 10800. Up to 1996 conditions per place. [2024-02-07 14:25:31,504 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 108 selfloop transitions, 19 changer transitions 0/142 dead transitions. [2024-02-07 14:25:31,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 142 transitions, 1041 flow [2024-02-07 14:25:31,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-07 14:25:31,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-07 14:25:31,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 224 transitions. [2024-02-07 14:25:31,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2024-02-07 14:25:31,509 INFO L175 Difference]: Start difference. First operand has 79 places, 72 transitions, 487 flow. Second operand 7 states and 224 transitions. [2024-02-07 14:25:31,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 142 transitions, 1041 flow [2024-02-07 14:25:31,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 142 transitions, 1013 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-02-07 14:25:31,522 INFO L231 Difference]: Finished difference. Result has 87 places, 80 transitions, 567 flow [2024-02-07 14:25:31,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=567, PETRI_PLACES=87, PETRI_TRANSITIONS=80} [2024-02-07 14:25:31,524 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 19 predicate places. [2024-02-07 14:25:31,524 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 80 transitions, 567 flow [2024-02-07 14:25:31,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 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:31,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:31,525 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:31,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-07 14:25:31,525 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:31,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:31,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1765890123, now seen corresponding path program 2 times [2024-02-07 14:25:31,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:31,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17330350] [2024-02-07 14:25:31,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:31,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:31,652 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:31,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:31,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17330350] [2024-02-07 14:25:31,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17330350] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:31,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:31,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:25:31,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558647102] [2024-02-07 14:25:31,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:31,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:25:31,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:31,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:25:31,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:25:31,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2024-02-07 14:25:31,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 80 transitions, 567 flow. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:31,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:31,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2024-02-07 14:25:31,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:31,998 INFO L124 PetriNetUnfolderBase]: 2108/4055 cut-off events. [2024-02-07 14:25:31,998 INFO L125 PetriNetUnfolderBase]: For 7863/7863 co-relation queries the response was YES. [2024-02-07 14:25:32,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12574 conditions, 4055 events. 2108/4055 cut-off events. For 7863/7863 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 27958 event pairs, 845 based on Foata normal form. 8/3863 useless extension candidates. Maximal degree in co-relation 12552. Up to 2068 conditions per place. [2024-02-07 14:25:32,021 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 94 selfloop transitions, 27 changer transitions 0/136 dead transitions. [2024-02-07 14:25:32,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 136 transitions, 1073 flow [2024-02-07 14:25:32,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:25:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:25:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2024-02-07 14:25:32,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5241935483870968 [2024-02-07 14:25:32,026 INFO L175 Difference]: Start difference. First operand has 87 places, 80 transitions, 567 flow. Second operand 6 states and 195 transitions. [2024-02-07 14:25:32,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 136 transitions, 1073 flow [2024-02-07 14:25:32,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 136 transitions, 1047 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:32,041 INFO L231 Difference]: Finished difference. Result has 94 places, 85 transitions, 671 flow [2024-02-07 14:25:32,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=671, PETRI_PLACES=94, PETRI_TRANSITIONS=85} [2024-02-07 14:25:32,041 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 26 predicate places. [2024-02-07 14:25:32,041 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 85 transitions, 671 flow [2024-02-07 14:25:32,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:32,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:32,042 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:32,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-07 14:25:32,042 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:32,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:32,043 INFO L85 PathProgramCache]: Analyzing trace with hash 375995279, now seen corresponding path program 3 times [2024-02-07 14:25:32,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:32,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418012972] [2024-02-07 14:25:32,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:32,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:32,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:32,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418012972] [2024-02-07 14:25:32,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418012972] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:32,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:32,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:25:32,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432068726] [2024-02-07 14:25:32,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:32,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:25:32,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:32,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:25:32,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:25:32,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2024-02-07 14:25:32,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 85 transitions, 671 flow. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:32,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:32,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2024-02-07 14:25:32,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:32,547 INFO L124 PetriNetUnfolderBase]: 2092/4039 cut-off events. [2024-02-07 14:25:32,547 INFO L125 PetriNetUnfolderBase]: For 10748/10748 co-relation queries the response was YES. [2024-02-07 14:25:32,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13196 conditions, 4039 events. 2092/4039 cut-off events. For 10748/10748 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 27998 event pairs, 879 based on Foata normal form. 8/3851 useless extension candidates. Maximal degree in co-relation 13171. Up to 2064 conditions per place. [2024-02-07 14:25:32,570 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 99 selfloop transitions, 23 changer transitions 0/137 dead transitions. [2024-02-07 14:25:32,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 137 transitions, 1167 flow [2024-02-07 14:25:32,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:25:32,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:25:32,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2024-02-07 14:25:32,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.521505376344086 [2024-02-07 14:25:32,572 INFO L175 Difference]: Start difference. First operand has 94 places, 85 transitions, 671 flow. Second operand 6 states and 194 transitions. [2024-02-07 14:25:32,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 137 transitions, 1167 flow [2024-02-07 14:25:32,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 137 transitions, 1133 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-02-07 14:25:32,589 INFO L231 Difference]: Finished difference. Result has 98 places, 85 transitions, 690 flow [2024-02-07 14:25:32,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=690, PETRI_PLACES=98, PETRI_TRANSITIONS=85} [2024-02-07 14:25:32,590 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 30 predicate places. [2024-02-07 14:25:32,590 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 85 transitions, 690 flow [2024-02-07 14:25:32,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:32,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:32,591 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:32,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-07 14:25:32,591 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:32,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:32,592 INFO L85 PathProgramCache]: Analyzing trace with hash 72449273, now seen corresponding path program 4 times [2024-02-07 14:25:32,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:32,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183894520] [2024-02-07 14:25:32,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:32,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:32,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:32,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183894520] [2024-02-07 14:25:32,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183894520] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:32,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:32,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 14:25:32,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582993671] [2024-02-07 14:25:32,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:32,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:25:32,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:32,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:25:32,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:25:32,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 14:25:32,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 85 transitions, 690 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:32,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:32,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 14:25:32,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:32,935 INFO L124 PetriNetUnfolderBase]: 1500/2494 cut-off events. [2024-02-07 14:25:32,935 INFO L125 PetriNetUnfolderBase]: For 9172/9172 co-relation queries the response was YES. [2024-02-07 14:25:32,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9296 conditions, 2494 events. 1500/2494 cut-off events. For 9172/9172 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 13423 event pairs, 148 based on Foata normal form. 112/2573 useless extension candidates. Maximal degree in co-relation 9270. Up to 912 conditions per place. [2024-02-07 14:25:32,948 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 130 selfloop transitions, 11 changer transitions 1/157 dead transitions. [2024-02-07 14:25:32,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 157 transitions, 1566 flow [2024-02-07 14:25:32,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:25:32,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:25:32,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2024-02-07 14:25:32,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4596774193548387 [2024-02-07 14:25:32,950 INFO L175 Difference]: Start difference. First operand has 98 places, 85 transitions, 690 flow. Second operand 6 states and 171 transitions. [2024-02-07 14:25:32,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 157 transitions, 1566 flow [2024-02-07 14:25:32,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 157 transitions, 1361 flow, removed 34 selfloop flow, removed 8 redundant places. [2024-02-07 14:25:32,962 INFO L231 Difference]: Finished difference. Result has 97 places, 85 transitions, 623 flow [2024-02-07 14:25:32,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=623, PETRI_PLACES=97, PETRI_TRANSITIONS=85} [2024-02-07 14:25:32,963 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 29 predicate places. [2024-02-07 14:25:32,963 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 85 transitions, 623 flow [2024-02-07 14:25:32,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:32,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:32,964 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] [2024-02-07 14:25:32,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-02-07 14:25:32,964 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:32,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:32,964 INFO L85 PathProgramCache]: Analyzing trace with hash -962655027, now seen corresponding path program 1 times [2024-02-07 14:25:32,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:32,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216094244] [2024-02-07 14:25:32,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:32,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:33,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:33,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:33,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216094244] [2024-02-07 14:25:33,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216094244] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:33,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:33,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-07 14:25:33,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738015463] [2024-02-07 14:25:33,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:33,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-07 14:25:33,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:33,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-07 14:25:33,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-02-07 14:25:33,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2024-02-07 14:25:33,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 85 transitions, 623 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:33,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:33,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2024-02-07 14:25:33,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:33,464 INFO L124 PetriNetUnfolderBase]: 1669/3037 cut-off events. [2024-02-07 14:25:33,464 INFO L125 PetriNetUnfolderBase]: For 8183/8183 co-relation queries the response was YES. [2024-02-07 14:25:33,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10396 conditions, 3037 events. 1669/3037 cut-off events. For 8183/8183 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 18680 event pairs, 504 based on Foata normal form. 8/3002 useless extension candidates. Maximal degree in co-relation 10372. Up to 1236 conditions per place. [2024-02-07 14:25:33,481 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 129 selfloop transitions, 17 changer transitions 0/161 dead transitions. [2024-02-07 14:25:33,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 161 transitions, 1388 flow [2024-02-07 14:25:33,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-07 14:25:33,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-07 14:25:33,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 217 transitions. [2024-02-07 14:25:33,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-02-07 14:25:33,483 INFO L175 Difference]: Start difference. First operand has 97 places, 85 transitions, 623 flow. Second operand 7 states and 217 transitions. [2024-02-07 14:25:33,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 161 transitions, 1388 flow [2024-02-07 14:25:33,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 161 transitions, 1134 flow, removed 42 selfloop flow, removed 9 redundant places. [2024-02-07 14:25:33,507 INFO L231 Difference]: Finished difference. Result has 96 places, 87 transitions, 617 flow [2024-02-07 14:25:33,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=617, PETRI_PLACES=96, PETRI_TRANSITIONS=87} [2024-02-07 14:25:33,508 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 28 predicate places. [2024-02-07 14:25:33,508 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 87 transitions, 617 flow [2024-02-07 14:25:33,508 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:33,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:33,509 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] [2024-02-07 14:25:33,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-02-07 14:25:33,509 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:33,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:33,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1418134927, now seen corresponding path program 2 times [2024-02-07 14:25:33,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:33,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457987204] [2024-02-07 14:25:33,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:33,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:33,657 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:33,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:33,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457987204] [2024-02-07 14:25:33,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457987204] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:33,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:33,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-07 14:25:33,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101843591] [2024-02-07 14:25:33,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:33,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-07 14:25:33,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:33,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-07 14:25:33,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-02-07 14:25:33,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2024-02-07 14:25:33,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 87 transitions, 617 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:33,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:33,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2024-02-07 14:25:33,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:34,052 INFO L124 PetriNetUnfolderBase]: 2113/3985 cut-off events. [2024-02-07 14:25:34,053 INFO L125 PetriNetUnfolderBase]: For 6384/6384 co-relation queries the response was YES. [2024-02-07 14:25:34,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11228 conditions, 3985 events. 2113/3985 cut-off events. For 6384/6384 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 26585 event pairs, 617 based on Foata normal form. 8/3902 useless extension candidates. Maximal degree in co-relation 11207. Up to 1015 conditions per place. [2024-02-07 14:25:34,080 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 138 selfloop transitions, 20 changer transitions 0/173 dead transitions. [2024-02-07 14:25:34,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 173 transitions, 1255 flow [2024-02-07 14:25:34,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-07 14:25:34,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-07 14:25:34,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 226 transitions. [2024-02-07 14:25:34,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5207373271889401 [2024-02-07 14:25:34,082 INFO L175 Difference]: Start difference. First operand has 96 places, 87 transitions, 617 flow. Second operand 7 states and 226 transitions. [2024-02-07 14:25:34,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 173 transitions, 1255 flow [2024-02-07 14:25:34,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 173 transitions, 1194 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-02-07 14:25:34,095 INFO L231 Difference]: Finished difference. Result has 100 places, 88 transitions, 616 flow [2024-02-07 14:25:34,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=616, PETRI_PLACES=100, PETRI_TRANSITIONS=88} [2024-02-07 14:25:34,096 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 32 predicate places. [2024-02-07 14:25:34,096 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 88 transitions, 616 flow [2024-02-07 14:25:34,097 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:34,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:34,097 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] [2024-02-07 14:25:34,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-02-07 14:25:34,097 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:34,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:34,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1542354161, now seen corresponding path program 3 times [2024-02-07 14:25:34,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:34,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310092463] [2024-02-07 14:25:34,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:34,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:34,230 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:34,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:34,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310092463] [2024-02-07 14:25:34,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310092463] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:34,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:34,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-07 14:25:34,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862698805] [2024-02-07 14:25:34,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:34,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-07 14:25:34,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:34,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-07 14:25:34,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-02-07 14:25:34,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2024-02-07 14:25:34,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 88 transitions, 616 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:34,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:34,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2024-02-07 14:25:34,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:34,690 INFO L124 PetriNetUnfolderBase]: 2275/4319 cut-off events. [2024-02-07 14:25:34,690 INFO L125 PetriNetUnfolderBase]: For 6500/6500 co-relation queries the response was YES. [2024-02-07 14:25:34,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12086 conditions, 4319 events. 2275/4319 cut-off events. For 6500/6500 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 29523 event pairs, 613 based on Foata normal form. 8/4220 useless extension candidates. Maximal degree in co-relation 12064. Up to 1015 conditions per place. [2024-02-07 14:25:34,723 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 141 selfloop transitions, 18 changer transitions 0/174 dead transitions. [2024-02-07 14:25:34,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 174 transitions, 1269 flow [2024-02-07 14:25:34,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-07 14:25:34,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-07 14:25:34,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 225 transitions. [2024-02-07 14:25:34,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5184331797235023 [2024-02-07 14:25:34,725 INFO L175 Difference]: Start difference. First operand has 100 places, 88 transitions, 616 flow. Second operand 7 states and 225 transitions. [2024-02-07 14:25:34,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 174 transitions, 1269 flow [2024-02-07 14:25:34,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 174 transitions, 1226 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-02-07 14:25:34,740 INFO L231 Difference]: Finished difference. Result has 104 places, 89 transitions, 632 flow [2024-02-07 14:25:34,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=632, PETRI_PLACES=104, PETRI_TRANSITIONS=89} [2024-02-07 14:25:34,741 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 36 predicate places. [2024-02-07 14:25:34,741 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 89 transitions, 632 flow [2024-02-07 14:25:34,741 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:34,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:34,742 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] [2024-02-07 14:25:34,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-02-07 14:25:34,742 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:34,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:34,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1708478027, now seen corresponding path program 4 times [2024-02-07 14:25:34,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:34,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738776372] [2024-02-07 14:25:34,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:34,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:34,891 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:34,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:34,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738776372] [2024-02-07 14:25:34,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738776372] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:34,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:34,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-07 14:25:34,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543284977] [2024-02-07 14:25:34,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:34,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-07 14:25:34,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:34,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-07 14:25:34,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-02-07 14:25:34,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2024-02-07 14:25:34,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 89 transitions, 632 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:34,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:34,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2024-02-07 14:25:34,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:35,457 INFO L124 PetriNetUnfolderBase]: 3074/5902 cut-off events. [2024-02-07 14:25:35,457 INFO L125 PetriNetUnfolderBase]: For 7937/7937 co-relation queries the response was YES. [2024-02-07 14:25:35,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15952 conditions, 5902 events. 3074/5902 cut-off events. For 7937/7937 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 43304 event pairs, 1184 based on Foata normal form. 8/5755 useless extension candidates. Maximal degree in co-relation 15928. Up to 2238 conditions per place. [2024-02-07 14:25:35,490 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 141 selfloop transitions, 22 changer transitions 0/178 dead transitions. [2024-02-07 14:25:35,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 178 transitions, 1334 flow [2024-02-07 14:25:35,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-07 14:25:35,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-07 14:25:35,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 221 transitions. [2024-02-07 14:25:35,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5092165898617511 [2024-02-07 14:25:35,491 INFO L175 Difference]: Start difference. First operand has 104 places, 89 transitions, 632 flow. Second operand 7 states and 221 transitions. [2024-02-07 14:25:35,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 178 transitions, 1334 flow [2024-02-07 14:25:35,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 178 transitions, 1292 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-02-07 14:25:35,511 INFO L231 Difference]: Finished difference. Result has 109 places, 95 transitions, 715 flow [2024-02-07 14:25:35,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=715, PETRI_PLACES=109, PETRI_TRANSITIONS=95} [2024-02-07 14:25:35,511 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 41 predicate places. [2024-02-07 14:25:35,511 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 95 transitions, 715 flow [2024-02-07 14:25:35,512 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:35,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:35,512 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] [2024-02-07 14:25:35,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-02-07 14:25:35,513 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:35,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:35,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1287863643, now seen corresponding path program 5 times [2024-02-07 14:25:35,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:35,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163458112] [2024-02-07 14:25:35,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:35,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:35,661 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:35,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:35,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163458112] [2024-02-07 14:25:35,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163458112] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:35,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:35,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 14:25:35,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964793449] [2024-02-07 14:25:35,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:35,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:25:35,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:35,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:25:35,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:25:35,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2024-02-07 14:25:35,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 95 transitions, 715 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:35,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:35,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2024-02-07 14:25:35,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:36,106 INFO L124 PetriNetUnfolderBase]: 3269/6263 cut-off events. [2024-02-07 14:25:36,106 INFO L125 PetriNetUnfolderBase]: For 9260/9260 co-relation queries the response was YES. [2024-02-07 14:25:36,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17143 conditions, 6263 events. 3269/6263 cut-off events. For 9260/9260 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 46848 event pairs, 1167 based on Foata normal form. 8/6072 useless extension candidates. Maximal degree in co-relation 17116. Up to 1662 conditions per place. [2024-02-07 14:25:36,149 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 115 selfloop transitions, 38 changer transitions 0/168 dead transitions. [2024-02-07 14:25:36,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 168 transitions, 1315 flow [2024-02-07 14:25:36,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:25:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:25:36,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2024-02-07 14:25:36,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5241935483870968 [2024-02-07 14:25:36,150 INFO L175 Difference]: Start difference. First operand has 109 places, 95 transitions, 715 flow. Second operand 6 states and 195 transitions. [2024-02-07 14:25:36,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 168 transitions, 1315 flow [2024-02-07 14:25:36,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 168 transitions, 1284 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:36,172 INFO L231 Difference]: Finished difference. Result has 116 places, 98 transitions, 833 flow [2024-02-07 14:25:36,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=833, PETRI_PLACES=116, PETRI_TRANSITIONS=98} [2024-02-07 14:25:36,173 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 48 predicate places. [2024-02-07 14:25:36,173 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 98 transitions, 833 flow [2024-02-07 14:25:36,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:36,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:36,173 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] [2024-02-07 14:25:36,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-02-07 14:25:36,174 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:36,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:36,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1430982693, now seen corresponding path program 6 times [2024-02-07 14:25:36,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:36,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774485610] [2024-02-07 14:25:36,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:36,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:36,345 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:36,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:36,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774485610] [2024-02-07 14:25:36,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774485610] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:36,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:36,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-07 14:25:36,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251932598] [2024-02-07 14:25:36,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:36,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-07 14:25:36,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:36,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-07 14:25:36,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-02-07 14:25:36,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2024-02-07 14:25:36,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 98 transitions, 833 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:36,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:36,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2024-02-07 14:25:36,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:37,042 INFO L124 PetriNetUnfolderBase]: 3398/6600 cut-off events. [2024-02-07 14:25:37,042 INFO L125 PetriNetUnfolderBase]: For 12502/12502 co-relation queries the response was YES. [2024-02-07 14:25:37,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18522 conditions, 6600 events. 3398/6600 cut-off events. For 12502/12502 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 50006 event pairs, 1799 based on Foata normal form. 8/6421 useless extension candidates. Maximal degree in co-relation 18492. Up to 3633 conditions per place. [2024-02-07 14:25:37,087 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 145 selfloop transitions, 20 changer transitions 0/180 dead transitions. [2024-02-07 14:25:37,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 180 transitions, 1493 flow [2024-02-07 14:25:37,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-07 14:25:37,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-07 14:25:37,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 221 transitions. [2024-02-07 14:25:37,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5092165898617511 [2024-02-07 14:25:37,089 INFO L175 Difference]: Start difference. First operand has 116 places, 98 transitions, 833 flow. Second operand 7 states and 221 transitions. [2024-02-07 14:25:37,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 180 transitions, 1493 flow [2024-02-07 14:25:37,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 180 transitions, 1447 flow, removed 15 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:37,123 INFO L231 Difference]: Finished difference. Result has 123 places, 99 transitions, 859 flow [2024-02-07 14:25:37,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=859, PETRI_PLACES=123, PETRI_TRANSITIONS=99} [2024-02-07 14:25:37,124 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 55 predicate places. [2024-02-07 14:25:37,124 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 99 transitions, 859 flow [2024-02-07 14:25:37,125 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:37,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:37,125 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] [2024-02-07 14:25:37,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-02-07 14:25:37,125 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:37,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:37,126 INFO L85 PathProgramCache]: Analyzing trace with hash 21495089, now seen corresponding path program 7 times [2024-02-07 14:25:37,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:37,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768356729] [2024-02-07 14:25:37,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:37,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:37,275 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:37,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:37,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768356729] [2024-02-07 14:25:37,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768356729] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:37,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:37,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-07 14:25:37,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311858432] [2024-02-07 14:25:37,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:37,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-07 14:25:37,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:37,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-07 14:25:37,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-02-07 14:25:37,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2024-02-07 14:25:37,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 99 transitions, 859 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:37,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:37,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2024-02-07 14:25:37,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:37,936 INFO L124 PetriNetUnfolderBase]: 3386/6580 cut-off events. [2024-02-07 14:25:37,936 INFO L125 PetriNetUnfolderBase]: For 11899/11899 co-relation queries the response was YES. [2024-02-07 14:25:37,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18418 conditions, 6580 events. 3386/6580 cut-off events. For 11899/11899 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 49882 event pairs, 1448 based on Foata normal form. 8/6401 useless extension candidates. Maximal degree in co-relation 18386. Up to 2772 conditions per place. [2024-02-07 14:25:37,979 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 153 selfloop transitions, 21 changer transitions 0/189 dead transitions. [2024-02-07 14:25:37,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 189 transitions, 1545 flow [2024-02-07 14:25:37,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-07 14:25:37,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-07 14:25:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 226 transitions. [2024-02-07 14:25:37,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5207373271889401 [2024-02-07 14:25:37,980 INFO L175 Difference]: Start difference. First operand has 123 places, 99 transitions, 859 flow. Second operand 7 states and 226 transitions. [2024-02-07 14:25:37,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 189 transitions, 1545 flow [2024-02-07 14:25:38,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 189 transitions, 1504 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-02-07 14:25:38,010 INFO L231 Difference]: Finished difference. Result has 127 places, 100 transitions, 878 flow [2024-02-07 14:25:38,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=878, PETRI_PLACES=127, PETRI_TRANSITIONS=100} [2024-02-07 14:25:38,010 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 59 predicate places. [2024-02-07 14:25:38,010 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 100 transitions, 878 flow [2024-02-07 14:25:38,011 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:38,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:38,011 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] [2024-02-07 14:25:38,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-02-07 14:25:38,011 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:38,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:38,011 INFO L85 PathProgramCache]: Analyzing trace with hash -832993137, now seen corresponding path program 8 times [2024-02-07 14:25:38,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:38,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257296698] [2024-02-07 14:25:38,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:38,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:38,146 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:38,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:38,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257296698] [2024-02-07 14:25:38,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257296698] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:38,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:38,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 14:25:38,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243527934] [2024-02-07 14:25:38,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:38,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:25:38,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:38,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:25:38,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:25:38,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2024-02-07 14:25:38,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 100 transitions, 878 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:38,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:38,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2024-02-07 14:25:38,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:38,792 INFO L124 PetriNetUnfolderBase]: 3656/7134 cut-off events. [2024-02-07 14:25:38,792 INFO L125 PetriNetUnfolderBase]: For 13105/13105 co-relation queries the response was YES. [2024-02-07 14:25:38,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19689 conditions, 7134 events. 3656/7134 cut-off events. For 13105/13105 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 55642 event pairs, 1283 based on Foata normal form. 8/6895 useless extension candidates. Maximal degree in co-relation 19656. Up to 2092 conditions per place. [2024-02-07 14:25:38,840 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 117 selfloop transitions, 38 changer transitions 0/170 dead transitions. [2024-02-07 14:25:38,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 170 transitions, 1470 flow [2024-02-07 14:25:38,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:25:38,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:25:38,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2024-02-07 14:25:38,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5241935483870968 [2024-02-07 14:25:38,841 INFO L175 Difference]: Start difference. First operand has 127 places, 100 transitions, 878 flow. Second operand 6 states and 195 transitions. [2024-02-07 14:25:38,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 170 transitions, 1470 flow [2024-02-07 14:25:38,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 170 transitions, 1431 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-02-07 14:25:38,875 INFO L231 Difference]: Finished difference. Result has 130 places, 100 transitions, 918 flow [2024-02-07 14:25:38,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=918, PETRI_PLACES=130, PETRI_TRANSITIONS=100} [2024-02-07 14:25:38,876 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 62 predicate places. [2024-02-07 14:25:38,876 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 100 transitions, 918 flow [2024-02-07 14:25:38,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:38,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:38,877 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] [2024-02-07 14:25:38,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-02-07 14:25:38,877 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:38,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:38,878 INFO L85 PathProgramCache]: Analyzing trace with hash 913885209, now seen corresponding path program 9 times [2024-02-07 14:25:38,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:38,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39559483] [2024-02-07 14:25:38,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:38,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:39,010 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:39,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:39,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39559483] [2024-02-07 14:25:39,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39559483] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:39,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:39,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 14:25:39,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796891565] [2024-02-07 14:25:39,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:39,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:25:39,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:39,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:25:39,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:25:39,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2024-02-07 14:25:39,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 100 transitions, 918 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:39,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:39,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2024-02-07 14:25:39,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:39,646 INFO L124 PetriNetUnfolderBase]: 4051/7941 cut-off events. [2024-02-07 14:25:39,646 INFO L125 PetriNetUnfolderBase]: For 16096/16096 co-relation queries the response was YES. [2024-02-07 14:25:39,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22192 conditions, 7941 events. 4051/7941 cut-off events. For 16096/16096 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 63235 event pairs, 1281 based on Foata normal form. 8/7658 useless extension candidates. Maximal degree in co-relation 22158. Up to 2345 conditions per place. [2024-02-07 14:25:39,702 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 130 selfloop transitions, 31 changer transitions 0/176 dead transitions. [2024-02-07 14:25:39,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 176 transitions, 1610 flow [2024-02-07 14:25:39,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:25:39,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:25:39,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2024-02-07 14:25:39,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.521505376344086 [2024-02-07 14:25:39,703 INFO L175 Difference]: Start difference. First operand has 130 places, 100 transitions, 918 flow. Second operand 6 states and 194 transitions. [2024-02-07 14:25:39,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 176 transitions, 1610 flow [2024-02-07 14:25:39,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 176 transitions, 1525 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-07 14:25:39,743 INFO L231 Difference]: Finished difference. Result has 134 places, 105 transitions, 997 flow [2024-02-07 14:25:39,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=997, PETRI_PLACES=134, PETRI_TRANSITIONS=105} [2024-02-07 14:25:39,743 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 66 predicate places. [2024-02-07 14:25:39,744 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 105 transitions, 997 flow [2024-02-07 14:25:39,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:39,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:39,744 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] [2024-02-07 14:25:39,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-02-07 14:25:39,744 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:39,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:39,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1936100815, now seen corresponding path program 10 times [2024-02-07 14:25:39,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:39,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342833447] [2024-02-07 14:25:39,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:39,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:39,863 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:39,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:39,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342833447] [2024-02-07 14:25:39,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342833447] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:39,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:39,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 14:25:39,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838727844] [2024-02-07 14:25:39,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:39,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:25:39,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:39,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:25:39,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:25:39,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2024-02-07 14:25:39,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 105 transitions, 997 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:39,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:39,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2024-02-07 14:25:39,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:40,714 INFO L124 PetriNetUnfolderBase]: 4213/8291 cut-off events. [2024-02-07 14:25:40,715 INFO L125 PetriNetUnfolderBase]: For 18487/18487 co-relation queries the response was YES. [2024-02-07 14:25:40,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23161 conditions, 8291 events. 4213/8291 cut-off events. For 18487/18487 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 67048 event pairs, 1315 based on Foata normal form. 8/8004 useless extension candidates. Maximal degree in co-relation 23124. Up to 2110 conditions per place. [2024-02-07 14:25:40,802 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 131 selfloop transitions, 31 changer transitions 0/177 dead transitions. [2024-02-07 14:25:40,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 177 transitions, 1642 flow [2024-02-07 14:25:40,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:25:40,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:25:40,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 193 transitions. [2024-02-07 14:25:40,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5188172043010753 [2024-02-07 14:25:40,805 INFO L175 Difference]: Start difference. First operand has 134 places, 105 transitions, 997 flow. Second operand 6 states and 193 transitions. [2024-02-07 14:25:40,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 177 transitions, 1642 flow [2024-02-07 14:25:40,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 177 transitions, 1602 flow, removed 11 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:40,877 INFO L231 Difference]: Finished difference. Result has 141 places, 107 transitions, 1074 flow [2024-02-07 14:25:40,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1074, PETRI_PLACES=141, PETRI_TRANSITIONS=107} [2024-02-07 14:25:40,878 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 73 predicate places. [2024-02-07 14:25:40,878 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 107 transitions, 1074 flow [2024-02-07 14:25:40,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:40,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:40,879 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] [2024-02-07 14:25:40,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-02-07 14:25:40,879 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:40,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:40,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1669900887, now seen corresponding path program 11 times [2024-02-07 14:25:40,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:40,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865748851] [2024-02-07 14:25:40,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:40,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:41,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:41,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:41,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865748851] [2024-02-07 14:25:41,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865748851] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:41,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:41,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 14:25:41,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970484432] [2024-02-07 14:25:41,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:41,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:25:41,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:41,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:25:41,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:25:41,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2024-02-07 14:25:41,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 107 transitions, 1074 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:41,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:41,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2024-02-07 14:25:41,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:41,831 INFO L124 PetriNetUnfolderBase]: 4483/8875 cut-off events. [2024-02-07 14:25:41,831 INFO L125 PetriNetUnfolderBase]: For 22050/22050 co-relation queries the response was YES. [2024-02-07 14:25:41,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24790 conditions, 8875 events. 4483/8875 cut-off events. For 22050/22050 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 72807 event pairs, 1341 based on Foata normal form. 8/8544 useless extension candidates. Maximal degree in co-relation 24750. Up to 2313 conditions per place. [2024-02-07 14:25:41,893 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 127 selfloop transitions, 36 changer transitions 0/178 dead transitions. [2024-02-07 14:25:41,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 178 transitions, 1708 flow [2024-02-07 14:25:41,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:25:41,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:25:41,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2024-02-07 14:25:41,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.521505376344086 [2024-02-07 14:25:41,894 INFO L175 Difference]: Start difference. First operand has 141 places, 107 transitions, 1074 flow. Second operand 6 states and 194 transitions. [2024-02-07 14:25:41,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 178 transitions, 1708 flow [2024-02-07 14:25:41,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 178 transitions, 1658 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-02-07 14:25:41,971 INFO L231 Difference]: Finished difference. Result has 145 places, 107 transitions, 1099 flow [2024-02-07 14:25:41,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1099, PETRI_PLACES=145, PETRI_TRANSITIONS=107} [2024-02-07 14:25:41,971 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 77 predicate places. [2024-02-07 14:25:41,972 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 107 transitions, 1099 flow [2024-02-07 14:25:41,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:41,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:41,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:41,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-02-07 14:25:41,972 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:41,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:41,973 INFO L85 PathProgramCache]: Analyzing trace with hash -337168117, now seen corresponding path program 12 times [2024-02-07 14:25:41,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:41,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395493660] [2024-02-07 14:25:41,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:41,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:42,106 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:42,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:42,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395493660] [2024-02-07 14:25:42,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395493660] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:42,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:42,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 14:25:42,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732459697] [2024-02-07 14:25:42,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:42,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:25:42,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:42,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:25:42,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:25:42,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2024-02-07 14:25:42,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 107 transitions, 1099 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:42,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:42,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2024-02-07 14:25:42,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:42,955 INFO L124 PetriNetUnfolderBase]: 4471/8873 cut-off events. [2024-02-07 14:25:42,955 INFO L125 PetriNetUnfolderBase]: For 23175/23175 co-relation queries the response was YES. [2024-02-07 14:25:42,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24965 conditions, 8873 events. 4471/8873 cut-off events. For 23175/23175 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 73215 event pairs, 1427 based on Foata normal form. 8/8554 useless extension candidates. Maximal degree in co-relation 24924. Up to 2313 conditions per place. [2024-02-07 14:25:43,004 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 130 selfloop transitions, 33 changer transitions 0/178 dead transitions. [2024-02-07 14:25:43,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 178 transitions, 1739 flow [2024-02-07 14:25:43,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:25:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:25:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 193 transitions. [2024-02-07 14:25:43,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5188172043010753 [2024-02-07 14:25:43,006 INFO L175 Difference]: Start difference. First operand has 145 places, 107 transitions, 1099 flow. Second operand 6 states and 193 transitions. [2024-02-07 14:25:43,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 178 transitions, 1739 flow [2024-02-07 14:25:43,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 178 transitions, 1644 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-02-07 14:25:43,079 INFO L231 Difference]: Finished difference. Result has 146 places, 107 transitions, 1073 flow [2024-02-07 14:25:43,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1073, PETRI_PLACES=146, PETRI_TRANSITIONS=107} [2024-02-07 14:25:43,080 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 78 predicate places. [2024-02-07 14:25:43,080 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 107 transitions, 1073 flow [2024-02-07 14:25:43,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:43,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:43,081 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] [2024-02-07 14:25:43,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-02-07 14:25:43,081 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:43,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:43,081 INFO L85 PathProgramCache]: Analyzing trace with hash 686788925, now seen corresponding path program 13 times [2024-02-07 14:25:43,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:43,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102910123] [2024-02-07 14:25:43,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:43,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:43,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:43,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:43,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102910123] [2024-02-07 14:25:43,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102910123] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:43,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:43,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-07 14:25:43,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407368129] [2024-02-07 14:25:43,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:43,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-07 14:25:43,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:43,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-07 14:25:43,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-02-07 14:25:43,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2024-02-07 14:25:43,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 107 transitions, 1073 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:43,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:43,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2024-02-07 14:25:43,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:44,209 INFO L124 PetriNetUnfolderBase]: 4459/8853 cut-off events. [2024-02-07 14:25:44,209 INFO L125 PetriNetUnfolderBase]: For 22852/22852 co-relation queries the response was YES. [2024-02-07 14:25:44,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24720 conditions, 8853 events. 4459/8853 cut-off events. For 22852/22852 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 72262 event pairs, 2257 based on Foata normal form. 8/8562 useless extension candidates. Maximal degree in co-relation 24680. Up to 3868 conditions per place. [2024-02-07 14:25:44,318 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 130 selfloop transitions, 28 changer transitions 0/173 dead transitions. [2024-02-07 14:25:44,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 173 transitions, 1673 flow [2024-02-07 14:25:44,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-07 14:25:44,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-07 14:25:44,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 214 transitions. [2024-02-07 14:25:44,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4930875576036866 [2024-02-07 14:25:44,320 INFO L175 Difference]: Start difference. First operand has 146 places, 107 transitions, 1073 flow. Second operand 7 states and 214 transitions. [2024-02-07 14:25:44,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 173 transitions, 1673 flow [2024-02-07 14:25:44,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 173 transitions, 1605 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-02-07 14:25:44,438 INFO L231 Difference]: Finished difference. Result has 149 places, 107 transitions, 1069 flow [2024-02-07 14:25:44,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1005, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1069, PETRI_PLACES=149, PETRI_TRANSITIONS=107} [2024-02-07 14:25:44,439 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 81 predicate places. [2024-02-07 14:25:44,439 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 107 transitions, 1069 flow [2024-02-07 14:25:44,439 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:44,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:44,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:44,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-02-07 14:25:44,440 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:44,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:44,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1801429501, now seen corresponding path program 14 times [2024-02-07 14:25:44,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:44,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629387140] [2024-02-07 14:25:44,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:44,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:44,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:44,587 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:44,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:44,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629387140] [2024-02-07 14:25:44,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629387140] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:44,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:44,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 14:25:44,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231694499] [2024-02-07 14:25:44,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:44,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:25:44,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:44,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:25:44,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:25:44,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2024-02-07 14:25:44,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 107 transitions, 1069 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:44,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:44,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2024-02-07 14:25:44,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:45,424 INFO L124 PetriNetUnfolderBase]: 4447/8805 cut-off events. [2024-02-07 14:25:45,424 INFO L125 PetriNetUnfolderBase]: For 22083/22083 co-relation queries the response was YES. [2024-02-07 14:25:45,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24665 conditions, 8805 events. 4447/8805 cut-off events. For 22083/22083 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 72258 event pairs, 1503 based on Foata normal form. 8/8486 useless extension candidates. Maximal degree in co-relation 24625. Up to 2831 conditions per place. [2024-02-07 14:25:45,490 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 100 selfloop transitions, 44 changer transitions 0/159 dead transitions. [2024-02-07 14:25:45,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 159 transitions, 1589 flow [2024-02-07 14:25:45,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:25:45,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:25:45,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2024-02-07 14:25:45,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49193548387096775 [2024-02-07 14:25:45,492 INFO L175 Difference]: Start difference. First operand has 149 places, 107 transitions, 1069 flow. Second operand 6 states and 183 transitions. [2024-02-07 14:25:45,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 159 transitions, 1589 flow [2024-02-07 14:25:45,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 159 transitions, 1505 flow, removed 12 selfloop flow, removed 10 redundant places. [2024-02-07 14:25:45,561 INFO L231 Difference]: Finished difference. Result has 145 places, 107 transitions, 1097 flow [2024-02-07 14:25:45,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1001, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1097, PETRI_PLACES=145, PETRI_TRANSITIONS=107} [2024-02-07 14:25:45,562 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 77 predicate places. [2024-02-07 14:25:45,562 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 107 transitions, 1097 flow [2024-02-07 14:25:45,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:45,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:45,563 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] [2024-02-07 14:25:45,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-02-07 14:25:45,563 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:45,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:45,563 INFO L85 PathProgramCache]: Analyzing trace with hash 457857643, now seen corresponding path program 15 times [2024-02-07 14:25:45,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:45,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755432626] [2024-02-07 14:25:45,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:45,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:45,714 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:45,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:45,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755432626] [2024-02-07 14:25:45,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755432626] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:45,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:45,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 14:25:45,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978053295] [2024-02-07 14:25:45,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:45,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:25:45,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:45,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:25:45,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:25:45,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2024-02-07 14:25:45,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 107 transitions, 1097 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:45,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:45,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2024-02-07 14:25:45,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:46,539 INFO L124 PetriNetUnfolderBase]: 4435/8789 cut-off events. [2024-02-07 14:25:46,540 INFO L125 PetriNetUnfolderBase]: For 20410/20410 co-relation queries the response was YES. [2024-02-07 14:25:46,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24560 conditions, 8789 events. 4435/8789 cut-off events. For 20410/20410 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 72128 event pairs, 1361 based on Foata normal form. 8/8458 useless extension candidates. Maximal degree in co-relation 24523. Up to 2293 conditions per place. [2024-02-07 14:25:46,604 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 109 selfloop transitions, 36 changer transitions 0/160 dead transitions. [2024-02-07 14:25:46,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 160 transitions, 1615 flow [2024-02-07 14:25:46,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:25:46,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:25:46,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2024-02-07 14:25:46,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.489247311827957 [2024-02-07 14:25:46,606 INFO L175 Difference]: Start difference. First operand has 145 places, 107 transitions, 1097 flow. Second operand 6 states and 182 transitions. [2024-02-07 14:25:46,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 160 transitions, 1615 flow [2024-02-07 14:25:46,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 160 transitions, 1499 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-02-07 14:25:46,680 INFO L231 Difference]: Finished difference. Result has 142 places, 107 transitions, 1077 flow [2024-02-07 14:25:46,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=997, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1077, PETRI_PLACES=142, PETRI_TRANSITIONS=107} [2024-02-07 14:25:46,680 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 74 predicate places. [2024-02-07 14:25:46,680 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 107 transitions, 1077 flow [2024-02-07 14:25:46,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:46,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:46,681 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] [2024-02-07 14:25:46,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-02-07 14:25:46,681 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:46,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:46,682 INFO L85 PathProgramCache]: Analyzing trace with hash -779091647, now seen corresponding path program 16 times [2024-02-07 14:25:46,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:46,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761269561] [2024-02-07 14:25:46,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:46,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:25:46,695 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 14:25:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:25:46,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 14:25:46,730 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 14:25:46,731 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 39 remaining) [2024-02-07 14:25:46,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 39 remaining) [2024-02-07 14:25:46,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 39 remaining) [2024-02-07 14:25:46,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 39 remaining) [2024-02-07 14:25:46,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 39 remaining) [2024-02-07 14:25:46,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 39 remaining) [2024-02-07 14:25:46,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 39 remaining) [2024-02-07 14:25:46,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 39 remaining) [2024-02-07 14:25:46,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 39 remaining) [2024-02-07 14:25:46,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 39 remaining) [2024-02-07 14:25:46,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 39 remaining) [2024-02-07 14:25:46,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 39 remaining) [2024-02-07 14:25:46,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 39 remaining) [2024-02-07 14:25:46,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 39 remaining) [2024-02-07 14:25:46,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 39 remaining) [2024-02-07 14:25:46,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 39 remaining) [2024-02-07 14:25:46,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 39 remaining) [2024-02-07 14:25:46,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 39 remaining) [2024-02-07 14:25:46,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 39 remaining) [2024-02-07 14:25:46,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 39 remaining) [2024-02-07 14:25:46,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 39 remaining) [2024-02-07 14:25:46,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (17 of 39 remaining) [2024-02-07 14:25:46,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 39 remaining) [2024-02-07 14:25:46,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 39 remaining) [2024-02-07 14:25:46,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 39 remaining) [2024-02-07 14:25:46,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 39 remaining) [2024-02-07 14:25:46,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 39 remaining) [2024-02-07 14:25:46,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 39 remaining) [2024-02-07 14:25:46,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 39 remaining) [2024-02-07 14:25:46,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 39 remaining) [2024-02-07 14:25:46,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 39 remaining) [2024-02-07 14:25:46,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 39 remaining) [2024-02-07 14:25:46,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 39 remaining) [2024-02-07 14:25:46,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 39 remaining) [2024-02-07 14:25:46,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 39 remaining) [2024-02-07 14:25:46,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 39 remaining) [2024-02-07 14:25:46,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 39 remaining) [2024-02-07 14:25:46,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 39 remaining) [2024-02-07 14:25:46,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 39 remaining) [2024-02-07 14:25:46,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-02-07 14:25:46,741 INFO L445 BasicCegarLoop]: Path program histogram: [16, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:46,747 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 14:25:46,747 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 14:25:46,796 INFO L503 ceAbstractionStarter]: Automizer considered 21 witness invariants [2024-02-07 14:25:46,797 INFO L504 ceAbstractionStarter]: WitnessConsidered=21 [2024-02-07 14:25:46,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 02:25:46 BasicIcfg [2024-02-07 14:25:46,797 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 14:25:46,798 INFO L158 Benchmark]: Toolchain (without parser) took 28491.23ms. Allocated memory was 157.3MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 82.6MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2024-02-07 14:25:46,798 INFO L158 Benchmark]: Witness Parser took 0.20ms. Allocated memory is still 113.2MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:25:46,798 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 157.3MB. Free memory is still 129.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:25:46,799 INFO L158 Benchmark]: CACSL2BoogieTranslator took 731.91ms. Allocated memory is still 157.3MB. Free memory was 82.4MB in the beginning and 125.5MB in the end (delta: -43.1MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2024-02-07 14:25:46,799 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.29ms. Allocated memory is still 157.3MB. Free memory was 125.5MB in the beginning and 123.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 14:25:46,799 INFO L158 Benchmark]: Boogie Preprocessor took 48.82ms. Allocated memory is still 157.3MB. Free memory was 123.6MB in the beginning and 121.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 14:25:46,799 INFO L158 Benchmark]: RCFGBuilder took 605.97ms. Allocated memory is still 157.3MB. Free memory was 121.0MB in the beginning and 86.4MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-02-07 14:25:46,800 INFO L158 Benchmark]: TraceAbstraction took 27057.98ms. Allocated memory was 157.3MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 85.8MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2024-02-07 14:25:46,801 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.20ms. Allocated memory is still 113.2MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.17ms. Allocated memory is still 157.3MB. Free memory is still 129.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 731.91ms. Allocated memory is still 157.3MB. Free memory was 82.4MB in the beginning and 125.5MB in the end (delta: -43.1MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.29ms. Allocated memory is still 157.3MB. Free memory was 125.5MB in the beginning and 123.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.82ms. Allocated memory is still 157.3MB. Free memory was 123.6MB in the beginning and 121.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 605.97ms. Allocated memory is still 157.3MB. Free memory was 121.0MB in the beginning and 86.4MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 27057.98ms. Allocated memory was 157.3MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 85.8MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 793]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L780] 0 pthread_t t2555; [L781] FCALL, FORK 0 pthread_create(&t2555, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2555={5:0}, x=0, y=0] [L723] 1 y = 2 [L724] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=2] [L728] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[2]]]]]] [L728] 1 __unbuffered_p0_EAX = x [L729] 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_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=2] [L733] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L733] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L734] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=2] [L782] 0 pthread_t t2556; [L783] FCALL, FORK 0 pthread_create(&t2556, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2555={5:0}, t2556={6:0}, x=0, y=2] [L784] 0 pthread_t t2557; [L785] FCALL, FORK 0 pthread_create(&t2557, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2555={5:0}, t2556={6:0}, t2557={3:0}, x=0, y=2] [L757] 3 x = 2 [L758] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[2]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_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=2, y=2] [L740] 2 x = 1 [L741] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_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, x=1, y=2] [L745] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[2]]]]]] [L745] 2 __unbuffered_p1_EAX = x [L746] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p1_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[2]]]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=2] [L750] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L750] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=2] [L760] 3 y = 1 [L761] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L765] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L765] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L787] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L787] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L788] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2555={5:0}, t2556={6:0}, t2557={3:0}, x=1, y=1] [L789] 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]]]]]] [L789] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L789] RET 0 assume_abort_if_not(main$tmp_guard0) [L793] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p1_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[127]]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[2]]],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]]]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EAX]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],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]]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[2]]]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2555={5:0}, t2556={6:0}, t2557={3:0}, x=1, y=1] - UnprovableResult [Line: 724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 728]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 734]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 745]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 746]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 758]: 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: 765]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 766]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 787]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 788]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 789]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 794]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 795]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 785]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 781]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 783]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 102 locations, 39 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: 26.9s, OverallIterations: 32, TraceHistogramMax: 1, PathProgramHistogramMax: 16, EmptinessCheckTime: 0.0s, AutomataDifference: 22.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1441 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1435 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4661 IncrementalHoareTripleChecker+Invalid, 4711 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 5 mSDtfsCounter, 4661 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1099occurred in iteration=27, InterpolantAutomatonStates: 167, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 684 NumberOfCodeBlocks, 684 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 625 ConstructedInterpolants, 0 QuantifiedInterpolants, 4194 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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:46,825 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