./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe024_tso.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe024_tso.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7c74aec Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_tso.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe024_tso.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.fix-undeclared-acsl-variable-e7c74ae-m [2024-02-07 19:04:13,886 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 19:04:13,984 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 19:04:13,989 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 19:04:13,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 19:04:14,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 19:04:14,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 19:04:14,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 19:04:14,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 19:04:14,020 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 19:04:14,020 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 19:04:14,020 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 19:04:14,021 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 19:04:14,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 19:04:14,022 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 19:04:14,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 19:04:14,022 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 19:04:14,022 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 19:04:14,023 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 19:04:14,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 19:04:14,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 19:04:14,024 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 19:04:14,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 19:04:14,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 19:04:14,024 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 19:04:14,024 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 19:04:14,025 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 19:04:14,025 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 19:04:14,025 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 19:04:14,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 19:04:14,026 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 19:04:14,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 19:04:14,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:04:14,026 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 19:04:14,026 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 19:04:14,027 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 19:04:14,027 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 19:04:14,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 19:04:14,027 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 19:04:14,027 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 19:04:14,027 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 19:04:14,027 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 19:04:14,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 19:04:14,028 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 19:04:14,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 19:04:14,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 19:04:14,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 19:04:14,289 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 19:04:14,290 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 19:04:14,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_tso.i [2024-02-07 19:04:15,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 19:04:15,612 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 19:04:15,612 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_tso.i [2024-02-07 19:04:15,626 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e90fbf14b/209fa60e2c5641dfa345e045c11d0f27/FLAG4529dafc9 [2024-02-07 19:04:15,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e90fbf14b/209fa60e2c5641dfa345e045c11d0f27 [2024-02-07 19:04:15,639 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 19:04:15,640 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 19:04:15,644 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe024_tso.yml/witness.yml [2024-02-07 19:04:15,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 19:04:15,767 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 19:04:15,768 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 19:04:15,768 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 19:04:15,772 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 19:04:15,773 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:04:15" (1/2) ... [2024-02-07 19:04:15,773 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f248ae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:04:15, skipping insertion in model container [2024-02-07 19:04:15,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:04:15" (1/2) ... [2024-02-07 19:04:15,775 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@15da9ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:04:15, skipping insertion in model container [2024-02-07 19:04:15,776 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:04:15" (2/2) ... [2024-02-07 19:04:15,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f248ae8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:15, skipping insertion in model container [2024-02-07 19:04:15,777 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:04:15" (2/2) ... [2024-02-07 19:04:15,777 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 19:04:15,857 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 19:04:15,859 INFO L76 edCorrectnessWitness]: Location invariant before [L18-L18] ((0 <= expression) && (expression <= 1)) && (expression == 0 || expression == 1) [2024-02-07 19:04:15,859 INFO L76 edCorrectnessWitness]: Location invariant before [L745-L745] x == 1 [2024-02-07 19:04:15,859 INFO L76 edCorrectnessWitness]: Location invariant before [L762-L762] ((0 <= z) && (z <= 1)) && (z == 0 || z == 1) [2024-02-07 19:04:15,859 INFO L76 edCorrectnessWitness]: Location invariant before [L790-L790] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 19:04:15,859 INFO L76 edCorrectnessWitness]: Location invariant before [L748-L748] y == 1 [2024-02-07 19:04:15,860 INFO L76 edCorrectnessWitness]: Location invariant before [L759-L759] ((0 <= y) && (y <= 1)) && (y == 0 || y == 1) [2024-02-07 19:04:15,860 INFO L76 edCorrectnessWitness]: Location invariant before [L763-L763] ((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) [2024-02-07 19:04:15,860 INFO L76 edCorrectnessWitness]: Location invariant before [L791-L791] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 19:04:15,861 INFO L76 edCorrectnessWitness]: Location invariant before [L795-L795] ((((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 1)) && (__unbuffered_p0_EAX == 0)) && (__unbuffered_p2_EAX == 1 || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) [2024-02-07 19:04:15,861 INFO L76 edCorrectnessWitness]: Location invariant before [L767-L767] 0 <= __unbuffered_cnt [2024-02-07 19:04:15,861 INFO L76 edCorrectnessWitness]: Location invariant before [L760-L760] ((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) [2024-02-07 19:04:15,861 INFO L76 edCorrectnessWitness]: Location invariant before [L733-L733] ((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) [2024-02-07 19:04:15,861 INFO L76 edCorrectnessWitness]: Location invariant before [L753-L753] 1 <= __unbuffered_cnt [2024-02-07 19:04:15,861 INFO L76 edCorrectnessWitness]: Location invariant before [L789-L789] 0 <= __unbuffered_cnt [2024-02-07 19:04:15,861 INFO L76 edCorrectnessWitness]: Location invariant before [L732-L732] ((0 <= x) && (x <= 1)) && (x == 0 || x == 1) [2024-02-07 19:04:15,862 INFO L76 edCorrectnessWitness]: Location invariant before [L768-L768] 1 <= __unbuffered_cnt [2024-02-07 19:04:15,862 INFO L76 edCorrectnessWitness]: Location invariant before [L752-L752] 0 <= __unbuffered_cnt [2024-02-07 19:04:15,862 INFO L76 edCorrectnessWitness]: Location invariant before [L728-L728] z == 1 [2024-02-07 19:04:15,862 INFO L76 edCorrectnessWitness]: Location invariant before [L737-L737] 0 <= __unbuffered_cnt [2024-02-07 19:04:15,862 INFO L76 edCorrectnessWitness]: Location invariant before [L738-L738] 1 <= __unbuffered_cnt [2024-02-07 19:04:15,862 INFO L76 edCorrectnessWitness]: Location invariant before [L797-L797] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 19:04:15,863 INFO L76 edCorrectnessWitness]: Location invariant before [L796-L796] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 19:04:15,915 INFO L181 MainTranslator]: Built tables and reachable declarations [2024-02-07 19:04:16,090 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_tso.i[945,958] [2024-02-07 19:04:16,250 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:04:16,259 INFO L206 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 19:04:16,293 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_tso.i[945,958] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 19:04:16,343 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:04:16,374 INFO L211 MainTranslator]: Completed translation [2024-02-07 19:04:16,374 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:16 WrapperNode [2024-02-07 19:04:16,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 19:04:16,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 19:04:16,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 19:04:16,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 19:04:16,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:16" (1/1) ... [2024-02-07 19:04:16,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:16" (1/1) ... [2024-02-07 19:04:16,420 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 78 [2024-02-07 19:04:16,420 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 19:04:16,421 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 19:04:16,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 19:04:16,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 19:04:16,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:16" (1/1) ... [2024-02-07 19:04:16,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:16" (1/1) ... [2024-02-07 19:04:16,441 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:16" (1/1) ... [2024-02-07 19:04:16,451 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 19:04:16,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:16" (1/1) ... [2024-02-07 19:04:16,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:16" (1/1) ... [2024-02-07 19:04:16,465 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:16" (1/1) ... [2024-02-07 19:04:16,466 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:16" (1/1) ... [2024-02-07 19:04:16,468 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:16" (1/1) ... [2024-02-07 19:04:16,469 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:16" (1/1) ... [2024-02-07 19:04:16,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 19:04:16,471 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 19:04:16,472 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 19:04:16,472 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 19:04:16,472 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:16" (1/1) ... [2024-02-07 19:04:16,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:04:16,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:04:16,510 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 19:04:16,518 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 19:04:16,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 19:04:16,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 19:04:16,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 19:04:16,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 19:04:16,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 19:04:16,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 19:04:16,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 19:04:16,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 19:04:16,546 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-02-07 19:04:16,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-02-07 19:04:16,546 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-02-07 19:04:16,547 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-02-07 19:04:16,547 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-02-07 19:04:16,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-02-07 19:04:16,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 19:04:16,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 19:04:16,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 19:04:16,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 19:04:16,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 19:04:16,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 19:04:16,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 19:04:16,553 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 19:04:16,664 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 19:04:16,666 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 19:04:16,865 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 19:04:16,865 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 19:04:17,003 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 19:04:17,003 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-07 19:04:17,004 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:04:17 BoogieIcfgContainer [2024-02-07 19:04:17,004 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 19:04:17,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 19:04:17,005 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 19:04:17,008 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 19:04:17,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 07:04:15" (1/4) ... [2024-02-07 19:04:17,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d48ea88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:04:17, skipping insertion in model container [2024-02-07 19:04:17,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:04:15" (2/4) ... [2024-02-07 19:04:17,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d48ea88 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:04:17, skipping insertion in model container [2024-02-07 19:04:17,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:16" (3/4) ... [2024-02-07 19:04:17,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d48ea88 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:04:17, skipping insertion in model container [2024-02-07 19:04:17,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:04:17" (4/4) ... [2024-02-07 19:04:17,011 INFO L112 eAbstractionObserver]: Analyzing ICFG safe024_tso.i [2024-02-07 19:04:17,025 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 19:04:17,025 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-02-07 19:04:17,025 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 19:04:17,078 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-07 19:04:17,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 62 transitions, 136 flow [2024-02-07 19:04:17,162 INFO L124 PetriNetUnfolderBase]: 1/59 cut-off events. [2024-02-07 19:04:17,163 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:04:17,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 59 events. 1/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 184 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2024-02-07 19:04:17,166 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 62 transitions, 136 flow [2024-02-07 19:04:17,169 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 59 transitions, 127 flow [2024-02-07 19:04:17,176 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 19:04:17,181 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;@5113394d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 19:04:17,182 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-02-07 19:04:17,184 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 19:04:17,184 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-02-07 19:04:17,184 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:04:17,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:17,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-07 19:04:17,186 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:04:17,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:17,190 INFO L85 PathProgramCache]: Analyzing trace with hash 9884516, now seen corresponding path program 1 times [2024-02-07 19:04:17,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:17,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531317583] [2024-02-07 19:04:17,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:17,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:17,432 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 19:04:17,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:17,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531317583] [2024-02-07 19:04:17,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531317583] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:17,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:17,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:04:17,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169233645] [2024-02-07 19:04:17,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:17,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-02-07 19:04:17,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:17,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-02-07 19:04:17,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-02-07 19:04:17,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 19:04:17,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 127 flow. Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:17,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:17,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 19:04:17,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:18,535 INFO L124 PetriNetUnfolderBase]: 7577/13079 cut-off events. [2024-02-07 19:04:18,535 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-02-07 19:04:18,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23884 conditions, 13079 events. 7577/13079 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 106137 event pairs, 7577 based on Foata normal form. 336/9397 useless extension candidates. Maximal degree in co-relation 23873. Up to 10701 conditions per place. [2024-02-07 19:04:18,649 INFO L140 encePairwiseOnDemand]: 50/62 looper letters, 32 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2024-02-07 19:04:18,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 47 transitions, 167 flow [2024-02-07 19:04:18,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-02-07 19:04:18,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-02-07 19:04:18,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 80 transitions. [2024-02-07 19:04:18,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2024-02-07 19:04:18,692 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 127 flow. Second operand 2 states and 80 transitions. [2024-02-07 19:04:18,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 47 transitions, 167 flow [2024-02-07 19:04:18,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-07 19:04:18,701 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 100 flow [2024-02-07 19:04:18,703 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 19:04:18,706 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -13 predicate places. [2024-02-07 19:04:18,706 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 100 flow [2024-02-07 19:04:18,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:18,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:18,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-07 19:04:18,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 19:04:18,708 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:04:18,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:18,708 INFO L85 PathProgramCache]: Analyzing trace with hash 909096582, now seen corresponding path program 1 times [2024-02-07 19:04:18,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:18,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118105779] [2024-02-07 19:04:18,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:18,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:18,817 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 19:04:18,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:18,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118105779] [2024-02-07 19:04:18,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118105779] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:18,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:18,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:04:18,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980781089] [2024-02-07 19:04:18,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:18,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:18,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:18,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:18,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:18,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 19:04:18,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:18,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:18,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 19:04:18,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:19,499 INFO L124 PetriNetUnfolderBase]: 7372/11221 cut-off events. [2024-02-07 19:04:19,499 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:04:19,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21739 conditions, 11221 events. 7372/11221 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 77877 event pairs, 1007 based on Foata normal form. 0/8004 useless extension candidates. Maximal degree in co-relation 21736. Up to 9252 conditions per place. [2024-02-07 19:04:19,603 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 52 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2024-02-07 19:04:19,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 254 flow [2024-02-07 19:04:19,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:19,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:19,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-02-07 19:04:19,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5860215053763441 [2024-02-07 19:04:19,607 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 100 flow. Second operand 3 states and 109 transitions. [2024-02-07 19:04:19,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 254 flow [2024-02-07 19:04:19,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 69 transitions, 254 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-07 19:04:19,610 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 108 flow [2024-02-07 19:04:19,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2024-02-07 19:04:19,611 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2024-02-07 19:04:19,611 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 108 flow [2024-02-07 19:04:19,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:19,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:19,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:19,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 19:04:19,612 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:04:19,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:19,614 INFO L85 PathProgramCache]: Analyzing trace with hash 878735885, now seen corresponding path program 1 times [2024-02-07 19:04:19,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:19,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130272031] [2024-02-07 19:04:19,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:19,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:19,697 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 19:04:19,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:19,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130272031] [2024-02-07 19:04:19,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130272031] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:19,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:19,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:04:19,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683048194] [2024-02-07 19:04:19,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:19,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:19,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:19,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:19,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:19,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 19:04:19,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:19,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:19,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 19:04:19,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:20,395 INFO L124 PetriNetUnfolderBase]: 7052/11106 cut-off events. [2024-02-07 19:04:20,396 INFO L125 PetriNetUnfolderBase]: For 750/750 co-relation queries the response was YES. [2024-02-07 19:04:20,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22331 conditions, 11106 events. 7052/11106 cut-off events. For 750/750 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 81276 event pairs, 1916 based on Foata normal form. 0/8319 useless extension candidates. Maximal degree in co-relation 22326. Up to 7398 conditions per place. [2024-02-07 19:04:20,533 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 52 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2024-02-07 19:04:20,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 264 flow [2024-02-07 19:04:20,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:20,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:20,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-02-07 19:04:20,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5860215053763441 [2024-02-07 19:04:20,539 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 108 flow. Second operand 3 states and 109 transitions. [2024-02-07 19:04:20,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 264 flow [2024-02-07 19:04:20,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 69 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:04:20,542 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 112 flow [2024-02-07 19:04:20,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2024-02-07 19:04:20,543 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -9 predicate places. [2024-02-07 19:04:20,544 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 112 flow [2024-02-07 19:04:20,544 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 19:04:20,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:20,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:20,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 19:04:20,545 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:04:20,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:20,546 INFO L85 PathProgramCache]: Analyzing trace with hash 878734029, now seen corresponding path program 1 times [2024-02-07 19:04:20,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:20,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624480926] [2024-02-07 19:04:20,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:20,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:20,617 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 19:04:20,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:20,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624480926] [2024-02-07 19:04:20,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624480926] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:20,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:20,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:04:20,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091363914] [2024-02-07 19:04:20,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:20,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:20,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:20,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:20,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:20,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 19:04:20,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:20,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:20,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 19:04:20,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:21,106 INFO L124 PetriNetUnfolderBase]: 5392/8152 cut-off events. [2024-02-07 19:04:21,106 INFO L125 PetriNetUnfolderBase]: For 818/818 co-relation queries the response was YES. [2024-02-07 19:04:21,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17468 conditions, 8152 events. 5392/8152 cut-off events. For 818/818 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 51378 event pairs, 1744 based on Foata normal form. 0/6612 useless extension candidates. Maximal degree in co-relation 17462. Up to 6544 conditions per place. [2024-02-07 19:04:21,145 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 51 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2024-02-07 19:04:21,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 70 transitions, 280 flow [2024-02-07 19:04:21,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:21,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-02-07 19:04:21,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6075268817204301 [2024-02-07 19:04:21,147 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 112 flow. Second operand 3 states and 113 transitions. [2024-02-07 19:04:21,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 70 transitions, 280 flow [2024-02-07 19:04:21,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 70 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:04:21,150 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 140 flow [2024-02-07 19:04:21,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2024-02-07 19:04:21,151 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -8 predicate places. [2024-02-07 19:04:21,151 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 140 flow [2024-02-07 19:04:21,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:21,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:21,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:21,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 19:04:21,152 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:04:21,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:21,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1471009067, now seen corresponding path program 1 times [2024-02-07 19:04:21,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:21,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266296273] [2024-02-07 19:04:21,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:21,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:21,239 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 19:04:21,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:21,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266296273] [2024-02-07 19:04:21,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266296273] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:21,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:21,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:04:21,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13449570] [2024-02-07 19:04:21,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:21,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:21,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:21,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:21,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:21,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 19:04:21,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:21,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:21,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 19:04:21,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:21,742 INFO L124 PetriNetUnfolderBase]: 5280/8275 cut-off events. [2024-02-07 19:04:21,742 INFO L125 PetriNetUnfolderBase]: For 1348/1348 co-relation queries the response was YES. [2024-02-07 19:04:21,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19306 conditions, 8275 events. 5280/8275 cut-off events. For 1348/1348 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 55229 event pairs, 1306 based on Foata normal form. 0/7052 useless extension candidates. Maximal degree in co-relation 19299. Up to 6883 conditions per place. [2024-02-07 19:04:21,794 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 58 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2024-02-07 19:04:21,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 75 transitions, 334 flow [2024-02-07 19:04:21,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:21,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2024-02-07 19:04:21,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5913978494623656 [2024-02-07 19:04:21,795 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 140 flow. Second operand 3 states and 110 transitions. [2024-02-07 19:04:21,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 75 transitions, 334 flow [2024-02-07 19:04:21,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 75 transitions, 328 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:04:21,797 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 144 flow [2024-02-07 19:04:21,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2024-02-07 19:04:21,798 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -6 predicate places. [2024-02-07 19:04:21,798 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 144 flow [2024-02-07 19:04:21,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:21,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:21,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:21,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 19:04:21,799 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:04:21,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:21,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1470951487, now seen corresponding path program 1 times [2024-02-07 19:04:21,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:21,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512076267] [2024-02-07 19:04:21,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:21,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:21,847 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 19:04:21,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:21,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512076267] [2024-02-07 19:04:21,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512076267] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:21,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:21,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:04:21,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244830985] [2024-02-07 19:04:21,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:21,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:21,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:21,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:21,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:21,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2024-02-07 19:04:21,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:21,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:21,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2024-02-07 19:04:21,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:22,460 INFO L124 PetriNetUnfolderBase]: 5280/8971 cut-off events. [2024-02-07 19:04:22,460 INFO L125 PetriNetUnfolderBase]: For 1981/1981 co-relation queries the response was YES. [2024-02-07 19:04:22,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20468 conditions, 8971 events. 5280/8971 cut-off events. For 1981/1981 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 67373 event pairs, 4970 based on Foata normal form. 0/7515 useless extension candidates. Maximal degree in co-relation 20460. Up to 7589 conditions per place. [2024-02-07 19:04:22,508 INFO L140 encePairwiseOnDemand]: 60/62 looper letters, 34 selfloop transitions, 1 changer transitions 0/49 dead transitions. [2024-02-07 19:04:22,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 49 transitions, 212 flow [2024-02-07 19:04:22,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:22,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:22,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-02-07 19:04:22,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2024-02-07 19:04:22,510 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 144 flow. Second operand 3 states and 84 transitions. [2024-02-07 19:04:22,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 49 transitions, 212 flow [2024-02-07 19:04:22,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:04:22,512 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 140 flow [2024-02-07 19:04:22,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2024-02-07 19:04:22,512 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -7 predicate places. [2024-02-07 19:04:22,513 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 140 flow [2024-02-07 19:04:22,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:22,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:22,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:22,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 19:04:22,513 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:04:22,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:22,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1501062861, now seen corresponding path program 1 times [2024-02-07 19:04:22,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:22,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644367695] [2024-02-07 19:04:22,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:22,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:22,548 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 19:04:22,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:22,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644367695] [2024-02-07 19:04:22,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644367695] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:22,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:22,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:04:22,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461233439] [2024-02-07 19:04:22,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:22,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:22,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:22,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:22,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:22,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 19:04:22,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:22,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:22,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 19:04:22,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:22,904 INFO L124 PetriNetUnfolderBase]: 4604/7073 cut-off events. [2024-02-07 19:04:22,905 INFO L125 PetriNetUnfolderBase]: For 1308/1308 co-relation queries the response was YES. [2024-02-07 19:04:22,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16776 conditions, 7073 events. 4604/7073 cut-off events. For 1308/1308 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 45008 event pairs, 1232 based on Foata normal form. 278/6426 useless extension candidates. Maximal degree in co-relation 16768. Up to 5889 conditions per place. [2024-02-07 19:04:22,947 INFO L140 encePairwiseOnDemand]: 60/62 looper letters, 56 selfloop transitions, 1 changer transitions 0/71 dead transitions. [2024-02-07 19:04:22,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 71 transitions, 315 flow [2024-02-07 19:04:22,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:22,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:22,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-02-07 19:04:22,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5752688172043011 [2024-02-07 19:04:22,949 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 140 flow. Second operand 3 states and 107 transitions. [2024-02-07 19:04:22,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 71 transitions, 315 flow [2024-02-07 19:04:22,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 71 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:04:22,951 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 135 flow [2024-02-07 19:04:22,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2024-02-07 19:04:22,952 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -8 predicate places. [2024-02-07 19:04:22,952 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 135 flow [2024-02-07 19:04:22,953 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 19:04:22,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:22,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:22,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 19:04:22,953 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:04:22,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:22,954 INFO L85 PathProgramCache]: Analyzing trace with hash -748791895, now seen corresponding path program 1 times [2024-02-07 19:04:22,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:22,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972717610] [2024-02-07 19:04:22,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:22,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:22,984 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 19:04:22,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:22,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972717610] [2024-02-07 19:04:22,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972717610] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:22,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:22,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:04:22,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649189473] [2024-02-07 19:04:22,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:22,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:22,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:22,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:22,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:22,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 19:04:22,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:22,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:22,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 19:04:22,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:23,315 INFO L124 PetriNetUnfolderBase]: 4097/6544 cut-off events. [2024-02-07 19:04:23,316 INFO L125 PetriNetUnfolderBase]: For 1298/1298 co-relation queries the response was YES. [2024-02-07 19:04:23,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15121 conditions, 6544 events. 4097/6544 cut-off events. For 1298/1298 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 42511 event pairs, 1154 based on Foata normal form. 210/5902 useless extension candidates. Maximal degree in co-relation 15114. Up to 5211 conditions per place. [2024-02-07 19:04:23,354 INFO L140 encePairwiseOnDemand]: 60/62 looper letters, 57 selfloop transitions, 1 changer transitions 0/72 dead transitions. [2024-02-07 19:04:23,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 72 transitions, 320 flow [2024-02-07 19:04:23,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:23,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:23,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-02-07 19:04:23,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226 [2024-02-07 19:04:23,356 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 135 flow. Second operand 3 states and 108 transitions. [2024-02-07 19:04:23,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 72 transitions, 320 flow [2024-02-07 19:04:23,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 72 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:04:23,358 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 130 flow [2024-02-07 19:04:23,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2024-02-07 19:04:23,358 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -9 predicate places. [2024-02-07 19:04:23,358 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 130 flow [2024-02-07 19:04:23,359 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 19:04:23,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:23,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:23,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 19:04:23,359 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:04:23,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:23,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1860981199, now seen corresponding path program 1 times [2024-02-07 19:04:23,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:23,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805120945] [2024-02-07 19:04:23,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:23,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:23,388 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 19:04:23,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:23,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805120945] [2024-02-07 19:04:23,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805120945] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:23,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:23,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:04:23,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954343177] [2024-02-07 19:04:23,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:23,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:23,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:23,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:23,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:23,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 19:04:23,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:23,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:23,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 19:04:23,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:23,746 INFO L124 PetriNetUnfolderBase]: 3702/5926 cut-off events. [2024-02-07 19:04:23,747 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2024-02-07 19:04:23,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13625 conditions, 5926 events. 3702/5926 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 38859 event pairs, 1391 based on Foata normal form. 168/5224 useless extension candidates. Maximal degree in co-relation 13619. Up to 3799 conditions per place. [2024-02-07 19:04:23,782 INFO L140 encePairwiseOnDemand]: 60/62 looper letters, 53 selfloop transitions, 1 changer transitions 0/68 dead transitions. [2024-02-07 19:04:23,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 68 transitions, 296 flow [2024-02-07 19:04:23,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:23,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:23,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-02-07 19:04:23,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5591397849462365 [2024-02-07 19:04:23,783 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 130 flow. Second operand 3 states and 104 transitions. [2024-02-07 19:04:23,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 68 transitions, 296 flow [2024-02-07 19:04:23,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 68 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:04:23,785 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 125 flow [2024-02-07 19:04:23,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-02-07 19:04:23,786 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2024-02-07 19:04:23,786 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 125 flow [2024-02-07 19:04:23,786 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 19:04:23,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:23,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:23,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 19:04:23,787 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:04:23,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:23,787 INFO L85 PathProgramCache]: Analyzing trace with hash 540148345, now seen corresponding path program 1 times [2024-02-07 19:04:23,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:23,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549536969] [2024-02-07 19:04:23,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:23,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:23,846 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 19:04:23,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:23,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549536969] [2024-02-07 19:04:23,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549536969] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:23,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:23,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:04:23,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094596000] [2024-02-07 19:04:23,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:23,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:23,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:23,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:23,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:23,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 19:04:23,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:23,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:23,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 19:04:23,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:24,174 INFO L124 PetriNetUnfolderBase]: 3674/5617 cut-off events. [2024-02-07 19:04:24,174 INFO L125 PetriNetUnfolderBase]: For 891/891 co-relation queries the response was YES. [2024-02-07 19:04:24,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13266 conditions, 5617 events. 3674/5617 cut-off events. For 891/891 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 33664 event pairs, 1152 based on Foata normal form. 0/4869 useless extension candidates. Maximal degree in co-relation 13261. Up to 5105 conditions per place. [2024-02-07 19:04:24,199 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 47 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2024-02-07 19:04:24,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 64 transitions, 273 flow [2024-02-07 19:04:24,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:24,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:24,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-02-07 19:04:24,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5483870967741935 [2024-02-07 19:04:24,201 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 125 flow. Second operand 3 states and 102 transitions. [2024-02-07 19:04:24,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 64 transitions, 273 flow [2024-02-07 19:04:24,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 64 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:04:24,203 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 143 flow [2024-02-07 19:04:24,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2024-02-07 19:04:24,205 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -8 predicate places. [2024-02-07 19:04:24,208 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 143 flow [2024-02-07 19:04:24,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:24,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:24,208 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:24,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 19:04:24,211 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:04:24,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:24,211 INFO L85 PathProgramCache]: Analyzing trace with hash -435270165, now seen corresponding path program 1 times [2024-02-07 19:04:24,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:24,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376934857] [2024-02-07 19:04:24,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:24,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:24,241 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 19:04:24,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:24,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376934857] [2024-02-07 19:04:24,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376934857] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:24,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:24,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:04:24,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054233047] [2024-02-07 19:04:24,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:24,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:24,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:24,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:24,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:24,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2024-02-07 19:04:24,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:24,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:24,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2024-02-07 19:04:24,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:24,530 INFO L124 PetriNetUnfolderBase]: 3674/6248 cut-off events. [2024-02-07 19:04:24,530 INFO L125 PetriNetUnfolderBase]: For 1365/1365 co-relation queries the response was YES. [2024-02-07 19:04:24,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14692 conditions, 6248 events. 3674/6248 cut-off events. For 1365/1365 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 43889 event pairs, 3208 based on Foata normal form. 0/5273 useless extension candidates. Maximal degree in co-relation 14686. Up to 5317 conditions per place. [2024-02-07 19:04:24,560 INFO L140 encePairwiseOnDemand]: 60/62 looper letters, 33 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2024-02-07 19:04:24,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 47 transitions, 209 flow [2024-02-07 19:04:24,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:24,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:24,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2024-02-07 19:04:24,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43548387096774194 [2024-02-07 19:04:24,561 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 143 flow. Second operand 3 states and 81 transitions. [2024-02-07 19:04:24,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 47 transitions, 209 flow [2024-02-07 19:04:24,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 47 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:04:24,563 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 140 flow [2024-02-07 19:04:24,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2024-02-07 19:04:24,564 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -8 predicate places. [2024-02-07 19:04:24,564 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 140 flow [2024-02-07 19:04:24,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:24,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:24,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:24,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-07 19:04:24,565 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:04:24,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:24,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1642054454, now seen corresponding path program 1 times [2024-02-07 19:04:24,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:24,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442061111] [2024-02-07 19:04:24,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:24,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:24,585 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 19:04:24,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:24,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442061111] [2024-02-07 19:04:24,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442061111] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:24,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:24,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:04:24,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139975572] [2024-02-07 19:04:24,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:24,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:24,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:24,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:24,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:24,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 19:04:24,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:24,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:24,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 19:04:24,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:24,788 INFO L124 PetriNetUnfolderBase]: 2336/3606 cut-off events. [2024-02-07 19:04:24,788 INFO L125 PetriNetUnfolderBase]: For 974/974 co-relation queries the response was YES. [2024-02-07 19:04:24,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8820 conditions, 3606 events. 2336/3606 cut-off events. For 974/974 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 20346 event pairs, 614 based on Foata normal form. 98/3621 useless extension candidates. Maximal degree in co-relation 8814. Up to 2734 conditions per place. [2024-02-07 19:04:24,805 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 44 selfloop transitions, 3 changer transitions 2/62 dead transitions. [2024-02-07 19:04:24,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 277 flow [2024-02-07 19:04:24,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:24,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:24,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-02-07 19:04:24,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.553763440860215 [2024-02-07 19:04:24,806 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 140 flow. Second operand 3 states and 103 transitions. [2024-02-07 19:04:24,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 277 flow [2024-02-07 19:04:24,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 62 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:04:24,808 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 127 flow [2024-02-07 19:04:24,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2024-02-07 19:04:24,809 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -11 predicate places. [2024-02-07 19:04:24,809 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 127 flow [2024-02-07 19:04:24,809 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 19:04:24,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:24,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:24,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-07 19:04:24,809 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:04:24,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:24,809 INFO L85 PathProgramCache]: Analyzing trace with hash 970497174, now seen corresponding path program 1 times [2024-02-07 19:04:24,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:24,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552163984] [2024-02-07 19:04:24,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:24,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:24,881 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 19:04:24,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:24,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552163984] [2024-02-07 19:04:24,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552163984] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:24,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:24,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:04:24,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055030382] [2024-02-07 19:04:24,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:24,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:04:24,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:24,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:04:24,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:04:24,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 19:04:24,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:24,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:24,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 19:04:24,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:25,083 INFO L124 PetriNetUnfolderBase]: 2114/3348 cut-off events. [2024-02-07 19:04:25,083 INFO L125 PetriNetUnfolderBase]: For 1315/1315 co-relation queries the response was YES. [2024-02-07 19:04:25,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8296 conditions, 3348 events. 2114/3348 cut-off events. For 1315/1315 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 19294 event pairs, 624 based on Foata normal form. 10/3338 useless extension candidates. Maximal degree in co-relation 8290. Up to 2739 conditions per place. [2024-02-07 19:04:25,098 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 48 selfloop transitions, 9 changer transitions 0/70 dead transitions. [2024-02-07 19:04:25,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 70 transitions, 319 flow [2024-02-07 19:04:25,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:04:25,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:04:25,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2024-02-07 19:04:25,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5080645161290323 [2024-02-07 19:04:25,099 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 127 flow. Second operand 4 states and 126 transitions. [2024-02-07 19:04:25,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 70 transitions, 319 flow [2024-02-07 19:04:25,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 70 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:04:25,101 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 187 flow [2024-02-07 19:04:25,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=187, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2024-02-07 19:04:25,101 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -8 predicate places. [2024-02-07 19:04:25,101 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 187 flow [2024-02-07 19:04:25,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:25,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:25,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:25,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-07 19:04:25,102 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:04:25,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:25,102 INFO L85 PathProgramCache]: Analyzing trace with hash -608472886, now seen corresponding path program 1 times [2024-02-07 19:04:25,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:25,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935723495] [2024-02-07 19:04:25,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:25,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:25,176 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 19:04:25,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:25,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935723495] [2024-02-07 19:04:25,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935723495] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:25,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:25,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:04:25,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011058298] [2024-02-07 19:04:25,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:25,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:04:25,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:25,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:04:25,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:04:25,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2024-02-07 19:04:25,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 187 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:25,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:25,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2024-02-07 19:04:25,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:25,447 INFO L124 PetriNetUnfolderBase]: 2746/4461 cut-off events. [2024-02-07 19:04:25,447 INFO L125 PetriNetUnfolderBase]: For 2770/2770 co-relation queries the response was YES. [2024-02-07 19:04:25,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12092 conditions, 4461 events. 2746/4461 cut-off events. For 2770/2770 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 27762 event pairs, 1436 based on Foata normal form. 0/4438 useless extension candidates. Maximal degree in co-relation 12084. Up to 2625 conditions per place. [2024-02-07 19:04:25,470 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 60 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2024-02-07 19:04:25,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 72 transitions, 425 flow [2024-02-07 19:04:25,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:04:25,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:04:25,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2024-02-07 19:04:25,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38306451612903225 [2024-02-07 19:04:25,471 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 187 flow. Second operand 4 states and 95 transitions. [2024-02-07 19:04:25,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 72 transitions, 425 flow [2024-02-07 19:04:25,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 425 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-07 19:04:25,474 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 189 flow [2024-02-07 19:04:25,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2024-02-07 19:04:25,474 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -6 predicate places. [2024-02-07 19:04:25,474 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 189 flow [2024-02-07 19:04:25,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:25,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:25,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:25,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-07 19:04:25,475 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:04:25,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:25,475 INFO L85 PathProgramCache]: Analyzing trace with hash 22010270, now seen corresponding path program 1 times [2024-02-07 19:04:25,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:25,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831612642] [2024-02-07 19:04:25,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:25,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:25,552 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 19:04:25,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:25,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831612642] [2024-02-07 19:04:25,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831612642] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:25,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:25,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:04:25,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509315153] [2024-02-07 19:04:25,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:25,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:04:25,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:25,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:04:25,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-07 19:04:25,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 19:04:25,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:25,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:25,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 19:04:25,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:25,855 INFO L124 PetriNetUnfolderBase]: 2501/4001 cut-off events. [2024-02-07 19:04:25,855 INFO L125 PetriNetUnfolderBase]: For 2765/2767 co-relation queries the response was YES. [2024-02-07 19:04:25,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11290 conditions, 4001 events. 2501/4001 cut-off events. For 2765/2767 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 23988 event pairs, 655 based on Foata normal form. 32/4019 useless extension candidates. Maximal degree in co-relation 11281. Up to 2772 conditions per place. [2024-02-07 19:04:25,873 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 77 selfloop transitions, 15 changer transitions 0/104 dead transitions. [2024-02-07 19:04:25,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 104 transitions, 579 flow [2024-02-07 19:04:25,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:04:25,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:04:25,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2024-02-07 19:04:25,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532258064516129 [2024-02-07 19:04:25,875 INFO L175 Difference]: Start difference. First operand has 62 places, 48 transitions, 189 flow. Second operand 5 states and 165 transitions. [2024-02-07 19:04:25,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 104 transitions, 579 flow [2024-02-07 19:04:25,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 104 transitions, 573 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:04:25,878 INFO L231 Difference]: Finished difference. Result has 67 places, 59 transitions, 320 flow [2024-02-07 19:04:25,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=320, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2024-02-07 19:04:25,879 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2024-02-07 19:04:25,879 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 320 flow [2024-02-07 19:04:25,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:25,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:25,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:25,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-07 19:04:25,879 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:04:25,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:25,879 INFO L85 PathProgramCache]: Analyzing trace with hash 907936824, now seen corresponding path program 1 times [2024-02-07 19:04:25,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:25,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111783627] [2024-02-07 19:04:25,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:25,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:25,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 19:04:25,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:25,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111783627] [2024-02-07 19:04:25,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111783627] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:25,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:25,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:04:25,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535112958] [2024-02-07 19:04:25,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:25,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:04:25,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:25,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:04:25,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:04:25,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 19:04:25,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 320 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:25,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:25,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 19:04:25,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:26,229 INFO L124 PetriNetUnfolderBase]: 2689/4235 cut-off events. [2024-02-07 19:04:26,230 INFO L125 PetriNetUnfolderBase]: For 5954/5954 co-relation queries the response was YES. [2024-02-07 19:04:26,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13707 conditions, 4235 events. 2689/4235 cut-off events. For 5954/5954 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 25101 event pairs, 222 based on Foata normal form. 14/4236 useless extension candidates. Maximal degree in co-relation 13695. Up to 3426 conditions per place. [2024-02-07 19:04:26,257 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 69 selfloop transitions, 12 changer transitions 0/93 dead transitions. [2024-02-07 19:04:26,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 93 transitions, 631 flow [2024-02-07 19:04:26,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:04:26,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:04:26,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2024-02-07 19:04:26,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5080645161290323 [2024-02-07 19:04:26,258 INFO L175 Difference]: Start difference. First operand has 67 places, 59 transitions, 320 flow. Second operand 4 states and 126 transitions. [2024-02-07 19:04:26,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 93 transitions, 631 flow [2024-02-07 19:04:26,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 93 transitions, 631 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-07 19:04:26,264 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 405 flow [2024-02-07 19:04:26,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=405, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2024-02-07 19:04:26,264 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 4 predicate places. [2024-02-07 19:04:26,264 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 405 flow [2024-02-07 19:04:26,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:26,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:26,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:26,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-02-07 19:04:26,265 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:04:26,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:26,265 INFO L85 PathProgramCache]: Analyzing trace with hash -626880498, now seen corresponding path program 1 times [2024-02-07 19:04:26,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:26,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171620644] [2024-02-07 19:04:26,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:26,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:26,342 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 19:04:26,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:26,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171620644] [2024-02-07 19:04:26,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171620644] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:26,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:26,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:04:26,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842297150] [2024-02-07 19:04:26,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:26,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:04:26,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:26,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:04:26,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:04:26,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2024-02-07 19:04:26,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 405 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:26,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:26,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2024-02-07 19:04:26,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:26,651 INFO L124 PetriNetUnfolderBase]: 2474/4457 cut-off events. [2024-02-07 19:04:26,651 INFO L125 PetriNetUnfolderBase]: For 8077/8077 co-relation queries the response was YES. [2024-02-07 19:04:26,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13859 conditions, 4457 events. 2474/4457 cut-off events. For 8077/8077 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 30376 event pairs, 225 based on Foata normal form. 172/4487 useless extension candidates. Maximal degree in co-relation 13844. Up to 2031 conditions per place. [2024-02-07 19:04:26,680 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 99 selfloop transitions, 5 changer transitions 1/117 dead transitions. [2024-02-07 19:04:26,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 117 transitions, 971 flow [2024-02-07 19:04:26,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:04:26,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:04:26,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2024-02-07 19:04:26,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4879032258064516 [2024-02-07 19:04:26,682 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 405 flow. Second operand 4 states and 121 transitions. [2024-02-07 19:04:26,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 117 transitions, 971 flow [2024-02-07 19:04:26,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 117 transitions, 967 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-02-07 19:04:26,692 INFO L231 Difference]: Finished difference. Result has 77 places, 65 transitions, 423 flow [2024-02-07 19:04:26,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=423, PETRI_PLACES=77, PETRI_TRANSITIONS=65} [2024-02-07 19:04:26,692 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 9 predicate places. [2024-02-07 19:04:26,692 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 65 transitions, 423 flow [2024-02-07 19:04:26,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:26,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:26,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:26,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-02-07 19:04:26,693 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:04:26,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:26,694 INFO L85 PathProgramCache]: Analyzing trace with hash -844669953, now seen corresponding path program 1 times [2024-02-07 19:04:26,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:26,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163242502] [2024-02-07 19:04:26,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:26,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:26,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:04:26,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:26,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163242502] [2024-02-07 19:04:26,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163242502] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:26,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:26,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:04:26,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155081820] [2024-02-07 19:04:26,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:26,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 19:04:26,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:26,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 19:04:26,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-07 19:04:26,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 19:04:26,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 65 transitions, 423 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:26,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:26,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 19:04:26,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:27,225 INFO L124 PetriNetUnfolderBase]: 2286/4144 cut-off events. [2024-02-07 19:04:27,225 INFO L125 PetriNetUnfolderBase]: For 8396/8398 co-relation queries the response was YES. [2024-02-07 19:04:27,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13337 conditions, 4144 events. 2286/4144 cut-off events. For 8396/8398 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 27811 event pairs, 803 based on Foata normal form. 14/4001 useless extension candidates. Maximal degree in co-relation 13319. Up to 2518 conditions per place. [2024-02-07 19:04:27,253 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 106 selfloop transitions, 25 changer transitions 0/143 dead transitions. [2024-02-07 19:04:27,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 143 transitions, 1034 flow [2024-02-07 19:04:27,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-07 19:04:27,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-07 19:04:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 250 transitions. [2024-02-07 19:04:27,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5040322580645161 [2024-02-07 19:04:27,256 INFO L175 Difference]: Start difference. First operand has 77 places, 65 transitions, 423 flow. Second operand 8 states and 250 transitions. [2024-02-07 19:04:27,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 143 transitions, 1034 flow [2024-02-07 19:04:27,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 143 transitions, 953 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-02-07 19:04:27,266 INFO L231 Difference]: Finished difference. Result has 84 places, 72 transitions, 548 flow [2024-02-07 19:04:27,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=548, PETRI_PLACES=84, PETRI_TRANSITIONS=72} [2024-02-07 19:04:27,267 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 16 predicate places. [2024-02-07 19:04:27,267 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 72 transitions, 548 flow [2024-02-07 19:04:27,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:27,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:27,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:27,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-02-07 19:04:27,268 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:04:27,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:27,268 INFO L85 PathProgramCache]: Analyzing trace with hash -572885567, now seen corresponding path program 1 times [2024-02-07 19:04:27,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:27,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747994966] [2024-02-07 19:04:27,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:27,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:27,337 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 19:04:27,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:27,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747994966] [2024-02-07 19:04:27,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747994966] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:27,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:27,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:04:27,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575290110] [2024-02-07 19:04:27,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:27,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:04:27,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:27,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:04:27,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-02-07 19:04:27,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 19:04:27,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 72 transitions, 548 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:27,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:27,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 19:04:27,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:27,685 INFO L124 PetriNetUnfolderBase]: 2276/4071 cut-off events. [2024-02-07 19:04:27,686 INFO L125 PetriNetUnfolderBase]: For 11376/11380 co-relation queries the response was YES. [2024-02-07 19:04:27,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13678 conditions, 4071 events. 2276/4071 cut-off events. For 11376/11380 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 27077 event pairs, 768 based on Foata normal form. 8/3977 useless extension candidates. Maximal degree in co-relation 13658. Up to 3069 conditions per place. [2024-02-07 19:04:27,716 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 68 selfloop transitions, 20 changer transitions 0/100 dead transitions. [2024-02-07 19:04:27,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 100 transitions, 835 flow [2024-02-07 19:04:27,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:04:27,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:04:27,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2024-02-07 19:04:27,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4806451612903226 [2024-02-07 19:04:27,717 INFO L175 Difference]: Start difference. First operand has 84 places, 72 transitions, 548 flow. Second operand 5 states and 149 transitions. [2024-02-07 19:04:27,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 100 transitions, 835 flow [2024-02-07 19:04:27,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 100 transitions, 805 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-02-07 19:04:27,784 INFO L231 Difference]: Finished difference. Result has 87 places, 74 transitions, 584 flow [2024-02-07 19:04:27,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=584, PETRI_PLACES=87, PETRI_TRANSITIONS=74} [2024-02-07 19:04:27,785 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 19 predicate places. [2024-02-07 19:04:27,785 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 74 transitions, 584 flow [2024-02-07 19:04:27,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:27,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:27,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:27,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-02-07 19:04:27,786 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:04:27,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:27,786 INFO L85 PathProgramCache]: Analyzing trace with hash 261093435, now seen corresponding path program 1 times [2024-02-07 19:04:27,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:27,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698877734] [2024-02-07 19:04:27,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:27,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:27,875 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 19:04:27,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:27,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698877734] [2024-02-07 19:04:27,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698877734] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:27,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:27,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:04:27,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245594692] [2024-02-07 19:04:27,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:27,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:04:27,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:27,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:04:27,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 19:04:27,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2024-02-07 19:04:27,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 74 transitions, 584 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:27,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:27,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2024-02-07 19:04:27,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:28,162 INFO L124 PetriNetUnfolderBase]: 1627/2870 cut-off events. [2024-02-07 19:04:28,162 INFO L125 PetriNetUnfolderBase]: For 8094/8094 co-relation queries the response was YES. [2024-02-07 19:04:28,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9840 conditions, 2870 events. 1627/2870 cut-off events. For 8094/8094 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 16872 event pairs, 123 based on Foata normal form. 142/2946 useless extension candidates. Maximal degree in co-relation 9818. Up to 833 conditions per place. [2024-02-07 19:04:28,179 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 122 selfloop transitions, 8 changer transitions 1/143 dead transitions. [2024-02-07 19:04:28,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 143 transitions, 1341 flow [2024-02-07 19:04:28,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:04:28,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:04:28,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2024-02-07 19:04:28,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4935483870967742 [2024-02-07 19:04:28,181 INFO L175 Difference]: Start difference. First operand has 87 places, 74 transitions, 584 flow. Second operand 5 states and 153 transitions. [2024-02-07 19:04:28,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 143 transitions, 1341 flow [2024-02-07 19:04:28,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 143 transitions, 1259 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-02-07 19:04:28,192 INFO L231 Difference]: Finished difference. Result has 89 places, 77 transitions, 578 flow [2024-02-07 19:04:28,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=578, PETRI_PLACES=89, PETRI_TRANSITIONS=77} [2024-02-07 19:04:28,193 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 21 predicate places. [2024-02-07 19:04:28,193 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 77 transitions, 578 flow [2024-02-07 19:04:28,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:28,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:28,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:28,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-02-07 19:04:28,194 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:04:28,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:28,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1233392512, now seen corresponding path program 1 times [2024-02-07 19:04:28,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:28,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029441214] [2024-02-07 19:04:28,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:28,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:28,278 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 19:04:28,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:28,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029441214] [2024-02-07 19:04:28,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029441214] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:28,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:28,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:04:28,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997144534] [2024-02-07 19:04:28,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:28,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 19:04:28,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:28,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 19:04:28,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-07 19:04:28,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 19:04:28,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 77 transitions, 578 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:28,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:28,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 19:04:28,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:28,588 INFO L124 PetriNetUnfolderBase]: 1423/2644 cut-off events. [2024-02-07 19:04:28,589 INFO L125 PetriNetUnfolderBase]: For 7433/7433 co-relation queries the response was YES. [2024-02-07 19:04:28,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9277 conditions, 2644 events. 1423/2644 cut-off events. For 7433/7433 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 15926 event pairs, 519 based on Foata normal form. 8/2590 useless extension candidates. Maximal degree in co-relation 9254. Up to 1849 conditions per place. [2024-02-07 19:04:28,622 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 105 selfloop transitions, 10 changer transitions 0/127 dead transitions. [2024-02-07 19:04:28,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 127 transitions, 1056 flow [2024-02-07 19:04:28,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-07 19:04:28,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-07 19:04:28,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 202 transitions. [2024-02-07 19:04:28,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46543778801843316 [2024-02-07 19:04:28,624 INFO L175 Difference]: Start difference. First operand has 89 places, 77 transitions, 578 flow. Second operand 7 states and 202 transitions. [2024-02-07 19:04:28,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 127 transitions, 1056 flow [2024-02-07 19:04:28,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 127 transitions, 985 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-02-07 19:04:28,636 INFO L231 Difference]: Finished difference. Result has 94 places, 80 transitions, 612 flow [2024-02-07 19:04:28,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=612, PETRI_PLACES=94, PETRI_TRANSITIONS=80} [2024-02-07 19:04:28,636 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 26 predicate places. [2024-02-07 19:04:28,636 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 80 transitions, 612 flow [2024-02-07 19:04:28,637 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 19:04:28,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:28,637 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 19:04:28,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-02-07 19:04:28,637 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:04:28,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:28,638 INFO L85 PathProgramCache]: Analyzing trace with hash 7739208, now seen corresponding path program 1 times [2024-02-07 19:04:28,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:28,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670660296] [2024-02-07 19:04:28,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:28,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:28,711 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 19:04:28,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:28,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670660296] [2024-02-07 19:04:28,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670660296] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:28,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:28,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 19:04:28,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311857319] [2024-02-07 19:04:28,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:28,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 19:04:28,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:28,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 19:04:28,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-07 19:04:28,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2024-02-07 19:04:28,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 80 transitions, 612 flow. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:28,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:28,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2024-02-07 19:04:28,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:28,926 INFO L124 PetriNetUnfolderBase]: 1027/1708 cut-off events. [2024-02-07 19:04:28,926 INFO L125 PetriNetUnfolderBase]: For 4883/4883 co-relation queries the response was YES. [2024-02-07 19:04:28,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6569 conditions, 1708 events. 1027/1708 cut-off events. For 4883/4883 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8439 event pairs, 99 based on Foata normal form. 64/1758 useless extension candidates. Maximal degree in co-relation 6544. Up to 590 conditions per place. [2024-02-07 19:04:28,937 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 117 selfloop transitions, 11 changer transitions 1/141 dead transitions. [2024-02-07 19:04:28,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 141 transitions, 1316 flow [2024-02-07 19:04:28,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 19:04:28,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 19:04:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2024-02-07 19:04:28,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4435483870967742 [2024-02-07 19:04:28,948 INFO L175 Difference]: Start difference. First operand has 94 places, 80 transitions, 612 flow. Second operand 6 states and 165 transitions. [2024-02-07 19:04:28,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 141 transitions, 1316 flow [2024-02-07 19:04:28,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 141 transitions, 1185 flow, removed 31 selfloop flow, removed 7 redundant places. [2024-02-07 19:04:28,956 INFO L231 Difference]: Finished difference. Result has 94 places, 80 transitions, 575 flow [2024-02-07 19:04:28,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=575, PETRI_PLACES=94, PETRI_TRANSITIONS=80} [2024-02-07 19:04:28,956 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 26 predicate places. [2024-02-07 19:04:28,957 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 80 transitions, 575 flow [2024-02-07 19:04:28,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:28,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:28,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:28,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-02-07 19:04:28,957 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:04:28,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:28,958 INFO L85 PathProgramCache]: Analyzing trace with hash -398352636, now seen corresponding path program 1 times [2024-02-07 19:04:28,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:28,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824022714] [2024-02-07 19:04:28,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:28,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:29,107 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 19:04:29,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:29,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824022714] [2024-02-07 19:04:29,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824022714] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:29,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:29,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 19:04:29,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696269278] [2024-02-07 19:04:29,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:29,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-07 19:04:29,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:29,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-07 19:04:29,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-02-07 19:04:29,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 19:04:29,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 80 transitions, 575 flow. Second operand has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:29,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:29,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 19:04:29,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:29,433 INFO L124 PetriNetUnfolderBase]: 1211/2151 cut-off events. [2024-02-07 19:04:29,433 INFO L125 PetriNetUnfolderBase]: For 4853/4853 co-relation queries the response was YES. [2024-02-07 19:04:29,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7694 conditions, 2151 events. 1211/2151 cut-off events. For 4853/4853 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12015 event pairs, 192 based on Foata normal form. 0/2125 useless extension candidates. Maximal degree in co-relation 7671. Up to 1221 conditions per place. [2024-02-07 19:04:29,447 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 144 selfloop transitions, 23 changer transitions 0/179 dead transitions. [2024-02-07 19:04:29,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 179 transitions, 1480 flow [2024-02-07 19:04:29,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-07 19:04:29,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-07 19:04:29,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 321 transitions. [2024-02-07 19:04:29,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4314516129032258 [2024-02-07 19:04:29,449 INFO L175 Difference]: Start difference. First operand has 94 places, 80 transitions, 575 flow. Second operand 12 states and 321 transitions. [2024-02-07 19:04:29,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 179 transitions, 1480 flow [2024-02-07 19:04:29,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 179 transitions, 1256 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-02-07 19:04:29,464 INFO L231 Difference]: Finished difference. Result has 103 places, 98 transitions, 727 flow [2024-02-07 19:04:29,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=727, PETRI_PLACES=103, PETRI_TRANSITIONS=98} [2024-02-07 19:04:29,465 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 35 predicate places. [2024-02-07 19:04:29,465 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 98 transitions, 727 flow [2024-02-07 19:04:29,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:29,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:29,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:29,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-02-07 19:04:29,465 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:04:29,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:29,466 INFO L85 PathProgramCache]: Analyzing trace with hash 957240524, now seen corresponding path program 2 times [2024-02-07 19:04:29,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:29,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958231267] [2024-02-07 19:04:29,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:29,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:29,583 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 19:04:29,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:29,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958231267] [2024-02-07 19:04:29,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958231267] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:29,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:29,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-07 19:04:29,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924090280] [2024-02-07 19:04:29,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:29,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-07 19:04:29,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:29,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-07 19:04:29,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-02-07 19:04:29,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 19:04:29,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 98 transitions, 727 flow. Second operand has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:29,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:29,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 19:04:29,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:29,975 INFO L124 PetriNetUnfolderBase]: 1547/2825 cut-off events. [2024-02-07 19:04:29,975 INFO L125 PetriNetUnfolderBase]: For 4350/4350 co-relation queries the response was YES. [2024-02-07 19:04:29,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8750 conditions, 2825 events. 1547/2825 cut-off events. For 4350/4350 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 16932 event pairs, 368 based on Foata normal form. 8/2799 useless extension candidates. Maximal degree in co-relation 8725. Up to 1092 conditions per place. [2024-02-07 19:04:29,993 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 149 selfloop transitions, 20 changer transitions 0/181 dead transitions. [2024-02-07 19:04:29,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 181 transitions, 1392 flow [2024-02-07 19:04:29,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-07 19:04:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-07 19:04:29,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 261 transitions. [2024-02-07 19:04:29,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46774193548387094 [2024-02-07 19:04:29,995 INFO L175 Difference]: Start difference. First operand has 103 places, 98 transitions, 727 flow. Second operand 9 states and 261 transitions. [2024-02-07 19:04:29,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 181 transitions, 1392 flow [2024-02-07 19:04:30,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 181 transitions, 1353 flow, removed 14 selfloop flow, removed 1 redundant places. [2024-02-07 19:04:30,009 INFO L231 Difference]: Finished difference. Result has 112 places, 99 transitions, 747 flow [2024-02-07 19:04:30,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=747, PETRI_PLACES=112, PETRI_TRANSITIONS=99} [2024-02-07 19:04:30,010 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 44 predicate places. [2024-02-07 19:04:30,010 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 99 transitions, 747 flow [2024-02-07 19:04:30,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:30,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:30,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] [2024-02-07 19:04:30,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-02-07 19:04:30,011 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:04:30,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:30,012 INFO L85 PathProgramCache]: Analyzing trace with hash 789829056, now seen corresponding path program 3 times [2024-02-07 19:04:30,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:30,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304384613] [2024-02-07 19:04:30,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:30,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:04:30,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 19:04:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:04:30,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 19:04:30,058 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 19:04:30,059 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 41 remaining) [2024-02-07 19:04:30,060 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 41 remaining) [2024-02-07 19:04:30,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 41 remaining) [2024-02-07 19:04:30,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 41 remaining) [2024-02-07 19:04:30,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 41 remaining) [2024-02-07 19:04:30,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 41 remaining) [2024-02-07 19:04:30,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 41 remaining) [2024-02-07 19:04:30,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 41 remaining) [2024-02-07 19:04:30,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 41 remaining) [2024-02-07 19:04:30,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 41 remaining) [2024-02-07 19:04:30,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 41 remaining) [2024-02-07 19:04:30,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 41 remaining) [2024-02-07 19:04:30,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 41 remaining) [2024-02-07 19:04:30,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 41 remaining) [2024-02-07 19:04:30,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 41 remaining) [2024-02-07 19:04:30,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 41 remaining) [2024-02-07 19:04:30,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 41 remaining) [2024-02-07 19:04:30,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 41 remaining) [2024-02-07 19:04:30,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 41 remaining) [2024-02-07 19:04:30,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 41 remaining) [2024-02-07 19:04:30,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 41 remaining) [2024-02-07 19:04:30,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 41 remaining) [2024-02-07 19:04:30,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (18 of 41 remaining) [2024-02-07 19:04:30,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 41 remaining) [2024-02-07 19:04:30,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 41 remaining) [2024-02-07 19:04:30,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 41 remaining) [2024-02-07 19:04:30,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 41 remaining) [2024-02-07 19:04:30,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 41 remaining) [2024-02-07 19:04:30,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 41 remaining) [2024-02-07 19:04:30,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 41 remaining) [2024-02-07 19:04:30,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 41 remaining) [2024-02-07 19:04:30,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 41 remaining) [2024-02-07 19:04:30,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 41 remaining) [2024-02-07 19:04:30,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 41 remaining) [2024-02-07 19:04:30,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 41 remaining) [2024-02-07 19:04:30,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 41 remaining) [2024-02-07 19:04:30,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 41 remaining) [2024-02-07 19:04:30,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 41 remaining) [2024-02-07 19:04:30,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 41 remaining) [2024-02-07 19:04:30,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 41 remaining) [2024-02-07 19:04:30,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 41 remaining) [2024-02-07 19:04:30,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-02-07 19:04:30,068 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:30,073 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 19:04:30,073 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 19:04:30,103 INFO L503 ceAbstractionStarter]: Automizer considered 22 witness invariants [2024-02-07 19:04:30,103 INFO L504 ceAbstractionStarter]: WitnessConsidered=22 [2024-02-07 19:04:30,104 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 07:04:30 BasicIcfg [2024-02-07 19:04:30,104 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 19:04:30,104 INFO L158 Benchmark]: Toolchain (without parser) took 14337.56ms. Allocated memory was 167.8MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 132.0MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 994.6MB. Max. memory is 16.1GB. [2024-02-07 19:04:30,104 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 117.4MB. Free memory was 80.4MB in the beginning and 80.3MB in the end (delta: 82.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:04:30,105 INFO L158 Benchmark]: Witness Parser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 135.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:04:30,105 INFO L158 Benchmark]: CACSL2BoogieTranslator took 606.88ms. Allocated memory is still 167.8MB. Free memory was 131.5MB in the beginning and 101.2MB in the end (delta: 30.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-02-07 19:04:30,105 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.72ms. Allocated memory is still 167.8MB. Free memory was 101.2MB in the beginning and 99.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:04:30,105 INFO L158 Benchmark]: Boogie Preprocessor took 50.09ms. Allocated memory is still 167.8MB. Free memory was 99.1MB in the beginning and 96.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-07 19:04:30,105 INFO L158 Benchmark]: RCFGBuilder took 532.23ms. Allocated memory is still 167.8MB. Free memory was 96.4MB in the beginning and 115.5MB in the end (delta: -19.1MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2024-02-07 19:04:30,106 INFO L158 Benchmark]: TraceAbstraction took 13098.43ms. Allocated memory was 167.8MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 114.5MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 977.5MB. Max. memory is 16.1GB. [2024-02-07 19:04:30,107 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 117.4MB. Free memory was 80.4MB in the beginning and 80.3MB in the end (delta: 82.6kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 135.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 606.88ms. Allocated memory is still 167.8MB. Free memory was 131.5MB in the beginning and 101.2MB in the end (delta: 30.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.72ms. Allocated memory is still 167.8MB. Free memory was 101.2MB in the beginning and 99.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.09ms. Allocated memory is still 167.8MB. Free memory was 99.1MB in the beginning and 96.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 532.23ms. Allocated memory is still 167.8MB. Free memory was 96.4MB in the beginning and 115.5MB in the end (delta: -19.1MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * TraceAbstraction took 13098.43ms. Allocated memory was 167.8MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 114.5MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 977.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 795]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L723] 0 int z = 0; [L782] 0 pthread_t t2363; [L783] FCALL, FORK 0 pthread_create(&t2363, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2363={5:0}, x=0, y=0, z=0] [L784] 0 pthread_t t2364; [L785] FCALL, FORK 0 pthread_create(&t2364, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2363={5:0}, t2364={6:0}, x=0, y=0, z=0] [L786] 0 pthread_t t2365; [L787] FCALL, FORK 0 pthread_create(&t2365, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2363={5:0}, t2364={6:0}, t2365={3:0}, x=0, y=0, z=0] [L727] 1 z = 1 [L728] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[z],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=1] [L744] 2 x = 1 [L745] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=0, z=1] [L732] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]]]] [L732] 1 __unbuffered_p0_EAX = x [L733] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=0, z=1] [L747] 2 y = 1 [L748] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1, z=1] [L752] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L752] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1, z=1] [L759] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]]]] [L759] 3 __unbuffered_p2_EAX = y [L760] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1, z=1] [L737] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L737] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L738] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1, z=1] [L762] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[z]],BinaryExpression[COMPLEQ,IdentifierExpression[z],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[z],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[z],IntegerLiteral[1]]]]]] [L762] 3 __unbuffered_p2_EBX = z [L763] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EBX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1, z=1] [L767] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L767] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1, z=1] [L789] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L789] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L790] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2363={5:0}, t2364={6:0}, t2365={3:0}, x=1, y=1, z=1] [L791] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [L791] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L791] RET 0 assume_abort_if_not(main$tmp_guard0) [L795] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EBX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2363={5:0}, t2364={6:0}, t2365={3:0}, x=1, y=1, z=1] - UnprovableResult [Line: 728]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 732]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 737]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 738]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 745]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 748]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 753]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 759]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 760]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 763]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 768]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 789]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 790]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 791]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 796]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 797]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 785]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 783]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 787]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 102 locations, 41 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.0s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 893 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 886 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2260 IncrementalHoareTripleChecker+Invalid, 2302 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 7 mSDtfsCounter, 2260 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=747occurred in iteration=24, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 361 NumberOfCodeBlocks, 361 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 310 ConstructedInterpolants, 0 QuantifiedInterpolants, 1767 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-02-07 19:04:30,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE