./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe027_pso.oepc_pso.opt_tso.oepc_tso.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe027_pso.oepc_pso.opt_tso.oepc_tso.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 958ec4d9 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe027_pso.oepc_pso.opt_tso.oepc_tso.opt.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe027_pso.oepc_pso.opt_tso.oepc_tso.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-958ec4d-m [2024-02-07 14:24:54,443 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 14:24:54,517 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 14:24:54,523 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 14:24:54,524 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 14:24:54,552 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 14:24:54,559 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 14:24:54,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 14:24:54,560 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 14:24:54,566 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 14:24:54,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 14:24:54,566 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 14:24:54,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 14:24:54,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 14:24:54,569 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 14:24:54,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 14:24:54,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 14:24:54,570 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 14:24:54,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 14:24:54,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 14:24:54,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 14:24:54,580 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 14:24:54,580 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 14:24:54,581 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 14:24:54,581 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 14:24:54,581 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 14:24:54,581 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 14:24:54,582 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 14:24:54,583 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 14:24:54,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 14:24:54,584 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 14:24:54,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 14:24:54,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:24:54,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 14:24:54,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 14:24:54,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 14:24:54,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 14:24:54,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 14:24:54,585 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 14:24:54,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 14:24:54,586 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 14:24:54,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 14:24:54,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 14:24:54,587 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-02-07 14:24:54,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 14:24:54,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 14:24:54,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 14:24:54,859 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 14:24:54,859 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 14:24:54,861 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/safe027_pso.oepc_pso.opt_tso.oepc_tso.opt.yml/witness.yml [2024-02-07 14:24:55,008 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 14:24:55,009 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 14:24:55,009 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe027_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-02-07 14:24:56,113 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 14:24:56,392 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 14:24:56,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe027_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-02-07 14:24:56,411 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9707dc24f/701ab4c051ee42d4a912926d199656e1/FLAGe056442ee [2024-02-07 14:24:56,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9707dc24f/701ab4c051ee42d4a912926d199656e1 [2024-02-07 14:24:56,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 14:24:56,425 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 14:24:56,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 14:24:56,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 14:24:56,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 14:24:56,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:24:55" (1/2) ... [2024-02-07 14:24:56,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e42d5df and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:56, skipping insertion in model container [2024-02-07 14:24:56,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:24:55" (1/2) ... [2024-02-07 14:24:56,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5560222f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:56, skipping insertion in model container [2024-02-07 14:24:56,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:24:56" (2/2) ... [2024-02-07 14:24:56,441 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e42d5df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:56, skipping insertion in model container [2024-02-07 14:24:56,441 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:24:56" (2/2) ... [2024-02-07 14:24:56,442 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 14:24:56,528 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 14:24:56,529 INFO L76 edCorrectnessWitness]: Location invariant before [L731-L731] ((0 <= x) && (x <= 1)) && (x == 0 || x == 1) [2024-02-07 14:24:56,530 INFO L76 edCorrectnessWitness]: Location invariant before [L749-L749] 1 <= __unbuffered_cnt [2024-02-07 14:24:56,530 INFO L76 edCorrectnessWitness]: Location invariant before [L756-L756] ((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) [2024-02-07 14:24:56,530 INFO L76 edCorrectnessWitness]: Location invariant before [L763-L763] 0 <= __unbuffered_cnt [2024-02-07 14:24:56,531 INFO L76 edCorrectnessWitness]: Location invariant before [L764-L764] 1 <= __unbuffered_cnt [2024-02-07 14:24:56,531 INFO L76 edCorrectnessWitness]: Location invariant before [L732-L732] ((0 <= __unbuffered_p0_EBX) && (__unbuffered_p0_EBX <= 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1) [2024-02-07 14:24:56,531 INFO L76 edCorrectnessWitness]: Location invariant before [L775-L775] 0 <= __unbuffered_cnt [2024-02-07 14:24:56,531 INFO L76 edCorrectnessWitness]: Location invariant before [L776-L776] 1 <= __unbuffered_cnt [2024-02-07 14:24:56,531 INFO L76 edCorrectnessWitness]: Location invariant before [L744-L744] x == 1 [2024-02-07 14:24:56,532 INFO L76 edCorrectnessWitness]: Location invariant before [L758-L758] ((0 <= y) && (y <= 1)) && (y == 0 || y == 1) [2024-02-07 14:24:56,532 INFO L76 edCorrectnessWitness]: Location invariant before [L801-L801] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 14:24:56,532 INFO L76 edCorrectnessWitness]: Location invariant before [L729-L729] ((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) [2024-02-07 14:24:56,532 INFO L76 edCorrectnessWitness]: Location invariant before [L18-L18] ((0 <= expression) && (expression <= 1)) && (expression == 0 || expression == 1) [2024-02-07 14:24:56,532 INFO L76 edCorrectnessWitness]: Location invariant before [L805-L805] ((((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 1)) && (__unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && ((__unbuffered_p0_EBX == 0 && (__unbuffered_p2_EAX == 1 || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) || (((((0 <= __unbuffered_p0_EBX && 0 <= __unbuffered_p2_EAX) && __unbuffered_p0_EBX <= 1) && __unbuffered_p2_EAX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) [2024-02-07 14:24:56,532 INFO L76 edCorrectnessWitness]: Location invariant before [L748-L748] 0 <= __unbuffered_cnt [2024-02-07 14:24:56,533 INFO L76 edCorrectnessWitness]: Location invariant before [L806-L806] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 14:24:56,533 INFO L76 edCorrectnessWitness]: Location invariant before [L800-L800] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 14:24:56,533 INFO L76 edCorrectnessWitness]: Location invariant before [L759-L759] ((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) [2024-02-07 14:24:56,533 INFO L76 edCorrectnessWitness]: Location invariant before [L799-L799] 0 <= __unbuffered_cnt [2024-02-07 14:24:56,533 INFO L76 edCorrectnessWitness]: Location invariant before [L807-L807] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 14:24:56,533 INFO L76 edCorrectnessWitness]: Location invariant before [L755-L755] ((0 <= x) && (x <= 1)) && (x == 0 || x == 1) [2024-02-07 14:24:56,534 INFO L76 edCorrectnessWitness]: Location invariant before [L771-L771] y == 1 [2024-02-07 14:24:56,534 INFO L76 edCorrectnessWitness]: Location invariant before [L728-L728] ((0 <= y) && (y <= 1)) && (y == 0 || y == 1) [2024-02-07 14:24:56,534 INFO L76 edCorrectnessWitness]: Location invariant before [L736-L736] 0 <= __unbuffered_cnt [2024-02-07 14:24:56,535 INFO L76 edCorrectnessWitness]: Location invariant before [L737-L737] 1 <= __unbuffered_cnt [2024-02-07 14:24:56,595 INFO L178 MainTranslator]: Built tables and reachable declarations [2024-02-07 14:24:56,757 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/safe027_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2024-02-07 14:24:56,912 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:24:56,924 INFO L203 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 14:24:56,964 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/safe027_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 14:24:57,010 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:24:57,058 INFO L207 MainTranslator]: Completed translation [2024-02-07 14:24:57,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:57 WrapperNode [2024-02-07 14:24:57,059 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 14:24:57,061 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 14:24:57,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 14:24:57,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 14:24:57,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:57" (1/1) ... [2024-02-07 14:24:57,109 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:57" (1/1) ... [2024-02-07 14:24:57,139 INFO L138 Inliner]: procedures = 177, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2024-02-07 14:24:57,143 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 14:24:57,144 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 14:24:57,144 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 14:24:57,144 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 14:24:57,154 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:57" (1/1) ... [2024-02-07 14:24:57,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:57" (1/1) ... [2024-02-07 14:24:57,167 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:57" (1/1) ... [2024-02-07 14:24:57,198 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-02-07 14:24:57,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:57" (1/1) ... [2024-02-07 14:24:57,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:57" (1/1) ... [2024-02-07 14:24:57,205 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:57" (1/1) ... [2024-02-07 14:24:57,221 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:57" (1/1) ... [2024-02-07 14:24:57,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:57" (1/1) ... [2024-02-07 14:24:57,224 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:57" (1/1) ... [2024-02-07 14:24:57,227 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 14:24:57,228 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 14:24:57,228 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 14:24:57,228 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 14:24:57,229 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:57" (1/1) ... [2024-02-07 14:24:57,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:24:57,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:24:57,259 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-07 14:24:57,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-07 14:24:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 14:24:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 14:24:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 14:24:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 14:24:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-07 14:24:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 14:24:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 14:24:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 14:24:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 14:24:57,299 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-02-07 14:24:57,299 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-02-07 14:24:57,299 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-02-07 14:24:57,299 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-02-07 14:24:57,299 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-02-07 14:24:57,299 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-02-07 14:24:57,300 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-02-07 14:24:57,300 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-02-07 14:24:57,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 14:24:57,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 14:24:57,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 14:24:57,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 14:24:57,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-07 14:24:57,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 14:24:57,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 14:24:57,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 14:24:57,302 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-07 14:24:57,440 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 14:24:57,442 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 14:24:57,721 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 14:24:57,721 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 14:24:57,914 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 14:24:57,914 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-07 14:24:57,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:24:57 BoogieIcfgContainer [2024-02-07 14:24:57,916 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 14:24:57,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 14:24:57,920 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 14:24:57,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 14:24:57,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:24:55" (1/4) ... [2024-02-07 14:24:57,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b11a6b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:24:57, skipping insertion in model container [2024-02-07 14:24:57,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 02:24:56" (2/4) ... [2024-02-07 14:24:57,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b11a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:24:57, skipping insertion in model container [2024-02-07 14:24:57,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:57" (3/4) ... [2024-02-07 14:24:57,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b11a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:24:57, skipping insertion in model container [2024-02-07 14:24:57,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:24:57" (4/4) ... [2024-02-07 14:24:57,927 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-02-07 14:24:57,940 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 14:24:57,940 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-02-07 14:24:57,940 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 14:24:57,988 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-07 14:24:58,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 71 transitions, 158 flow [2024-02-07 14:24:58,080 INFO L124 PetriNetUnfolderBase]: 1/67 cut-off events. [2024-02-07 14:24:58,080 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:24:58,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 67 events. 1/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 214 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2024-02-07 14:24:58,085 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 71 transitions, 158 flow [2024-02-07 14:24:58,090 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 67 transitions, 146 flow [2024-02-07 14:24:58,108 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 14:24:58,113 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;@4ac04241, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 14:24:58,114 INFO L358 AbstractCegarLoop]: Starting to check reachability of 48 error locations. [2024-02-07 14:24:58,118 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 14:24:58,118 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-02-07 14:24:58,118 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:24:58,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:58,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-07 14:24:58,119 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 45 more)] === [2024-02-07 14:24:58,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:58,125 INFO L85 PathProgramCache]: Analyzing trace with hash 11101589, now seen corresponding path program 1 times [2024-02-07 14:24:58,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:58,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535536393] [2024-02-07 14:24:58,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:58,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:58,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:58,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:58,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535536393] [2024-02-07 14:24:58,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535536393] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:58,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:58,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:24:58,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409520801] [2024-02-07 14:24:58,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:58,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:58,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:58,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:58,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:58,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-02-07 14:24:58,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 67 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:58,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:58,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-02-07 14:24:58,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:03,740 INFO L124 PetriNetUnfolderBase]: 45601/64192 cut-off events. [2024-02-07 14:25:03,740 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2024-02-07 14:25:03,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124675 conditions, 64192 events. 45601/64192 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 2905. Compared 467021 event pairs, 8865 based on Foata normal form. 1525/46032 useless extension candidates. Maximal degree in co-relation 124663. Up to 50462 conditions per place. [2024-02-07 14:25:04,339 INFO L140 encePairwiseOnDemand]: 54/71 looper letters, 60 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2024-02-07 14:25:04,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 78 transitions, 292 flow [2024-02-07 14:25:04,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:04,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:04,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2024-02-07 14:25:04,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6948356807511737 [2024-02-07 14:25:04,353 INFO L175 Difference]: Start difference. First operand has 79 places, 67 transitions, 146 flow. Second operand 3 states and 148 transitions. [2024-02-07 14:25:04,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 78 transitions, 292 flow [2024-02-07 14:25:04,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 78 transitions, 288 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-07 14:25:04,373 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 126 flow [2024-02-07 14:25:04,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2024-02-07 14:25:04,378 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -13 predicate places. [2024-02-07 14:25:04,378 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 126 flow [2024-02-07 14:25:04,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:04,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:04,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-07 14:25:04,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 14:25:04,380 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 45 more)] === [2024-02-07 14:25:04,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:04,380 INFO L85 PathProgramCache]: Analyzing trace with hash 344149689, now seen corresponding path program 1 times [2024-02-07 14:25:04,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:04,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160806465] [2024-02-07 14:25:04,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:04,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:04,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:04,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:04,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160806465] [2024-02-07 14:25:04,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160806465] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:04,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:04,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:25:04,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890290378] [2024-02-07 14:25:04,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:04,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:04,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:04,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:04,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:04,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-02-07 14:25:04,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:04,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:04,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-02-07 14:25:04,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:07,927 INFO L124 PetriNetUnfolderBase]: 43191/60359 cut-off events. [2024-02-07 14:25:07,928 INFO L125 PetriNetUnfolderBase]: For 4846/4846 co-relation queries the response was YES. [2024-02-07 14:25:08,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124698 conditions, 60359 events. 43191/60359 cut-off events. For 4846/4846 co-relation queries the response was YES. Maximal size of possible extension queue 2754. Compared 435183 event pairs, 8351 based on Foata normal form. 0/44806 useless extension candidates. Maximal degree in co-relation 124687. Up to 49500 conditions per place. [2024-02-07 14:25:08,308 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 64 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2024-02-07 14:25:08,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 82 transitions, 325 flow [2024-02-07 14:25:08,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:08,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:08,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2024-02-07 14:25:08,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6009389671361502 [2024-02-07 14:25:08,310 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 126 flow. Second operand 3 states and 128 transitions. [2024-02-07 14:25:08,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 82 transitions, 325 flow [2024-02-07 14:25:08,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 82 transitions, 319 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:25:08,322 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 132 flow [2024-02-07 14:25:08,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2024-02-07 14:25:08,323 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -12 predicate places. [2024-02-07 14:25:08,323 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 132 flow [2024-02-07 14:25:08,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:08,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:08,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:08,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 14:25:08,324 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 45 more)] === [2024-02-07 14:25:08,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:08,325 INFO L85 PathProgramCache]: Analyzing trace with hash 15383132, now seen corresponding path program 1 times [2024-02-07 14:25:08,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:08,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822124964] [2024-02-07 14:25:08,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:08,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:08,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:08,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:08,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822124964] [2024-02-07 14:25:08,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822124964] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:08,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:08,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:25:08,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178676656] [2024-02-07 14:25:08,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:08,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:08,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:08,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:08,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:08,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-02-07 14:25:08,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:08,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:08,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-02-07 14:25:08,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:10,967 INFO L124 PetriNetUnfolderBase]: 35861/48131 cut-off events. [2024-02-07 14:25:10,967 INFO L125 PetriNetUnfolderBase]: For 6495/6495 co-relation queries the response was YES. [2024-02-07 14:25:11,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106141 conditions, 48131 events. 35861/48131 cut-off events. For 6495/6495 co-relation queries the response was YES. Maximal size of possible extension queue 2212. Compared 299335 event pairs, 11543 based on Foata normal form. 0/38988 useless extension candidates. Maximal degree in co-relation 106129. Up to 45721 conditions per place. [2024-02-07 14:25:11,284 INFO L140 encePairwiseOnDemand]: 61/71 looper letters, 60 selfloop transitions, 5 changer transitions 0/81 dead transitions. [2024-02-07 14:25:11,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 81 transitions, 334 flow [2024-02-07 14:25:11,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:11,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2024-02-07 14:25:11,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6103286384976526 [2024-02-07 14:25:11,292 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 132 flow. Second operand 3 states and 130 transitions. [2024-02-07 14:25:11,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 81 transitions, 334 flow [2024-02-07 14:25:11,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 81 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:25:11,297 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 169 flow [2024-02-07 14:25:11,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2024-02-07 14:25:11,298 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -11 predicate places. [2024-02-07 14:25:11,299 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 169 flow [2024-02-07 14:25:11,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:11,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:11,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:11,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 14:25:11,300 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 45 more)] === [2024-02-07 14:25:11,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:11,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1891064681, now seen corresponding path program 1 times [2024-02-07 14:25:11,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:11,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206615236] [2024-02-07 14:25:11,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:11,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:11,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:11,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:11,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206615236] [2024-02-07 14:25:11,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206615236] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:11,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:11,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:25:11,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738995812] [2024-02-07 14:25:11,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:11,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:11,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:11,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:11,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:11,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-02-07 14:25:11,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:11,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:11,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-02-07 14:25:11,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:13,737 INFO L124 PetriNetUnfolderBase]: 28658/39917 cut-off events. [2024-02-07 14:25:13,737 INFO L125 PetriNetUnfolderBase]: For 7387/7387 co-relation queries the response was YES. [2024-02-07 14:25:13,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96887 conditions, 39917 events. 28658/39917 cut-off events. For 7387/7387 co-relation queries the response was YES. Maximal size of possible extension queue 1837. Compared 259954 event pairs, 9567 based on Foata normal form. 2138/35221 useless extension candidates. Maximal degree in co-relation 96874. Up to 32355 conditions per place. [2024-02-07 14:25:14,005 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 70 selfloop transitions, 1 changer transitions 0/87 dead transitions. [2024-02-07 14:25:14,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 87 transitions, 397 flow [2024-02-07 14:25:14,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:14,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2024-02-07 14:25:14,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5915492957746479 [2024-02-07 14:25:14,008 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 169 flow. Second operand 3 states and 126 transitions. [2024-02-07 14:25:14,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 87 transitions, 397 flow [2024-02-07 14:25:14,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 87 transitions, 387 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:25:14,012 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 156 flow [2024-02-07 14:25:14,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2024-02-07 14:25:14,013 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -13 predicate places. [2024-02-07 14:25:14,013 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 156 flow [2024-02-07 14:25:14,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:14,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:14,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:14,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 14:25:14,014 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 45 more)] === [2024-02-07 14:25:14,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:14,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1222011390, now seen corresponding path program 1 times [2024-02-07 14:25:14,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:14,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805031491] [2024-02-07 14:25:14,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:14,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:14,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:14,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:14,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805031491] [2024-02-07 14:25:14,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805031491] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:14,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:14,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:25:14,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043609408] [2024-02-07 14:25:14,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:14,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:14,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:14,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:14,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:14,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 71 [2024-02-07 14:25:14,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:14,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:14,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 71 [2024-02-07 14:25:14,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:16,574 INFO L124 PetriNetUnfolderBase]: 28658/43515 cut-off events. [2024-02-07 14:25:16,574 INFO L125 PetriNetUnfolderBase]: For 9108/9108 co-relation queries the response was YES. [2024-02-07 14:25:16,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99750 conditions, 43515 events. 28658/43515 cut-off events. For 9108/9108 co-relation queries the response was YES. Maximal size of possible extension queue 1969. Compared 343272 event pairs, 26298 based on Foata normal form. 0/34962 useless extension candidates. Maximal degree in co-relation 99738. Up to 38075 conditions per place. [2024-02-07 14:25:16,848 INFO L140 encePairwiseOnDemand]: 69/71 looper letters, 39 selfloop transitions, 1 changer transitions 0/55 dead transitions. [2024-02-07 14:25:16,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 55 transitions, 234 flow [2024-02-07 14:25:16,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:16,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:16,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-02-07 14:25:16,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4413145539906103 [2024-02-07 14:25:16,849 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 156 flow. Second operand 3 states and 94 transitions. [2024-02-07 14:25:16,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 55 transitions, 234 flow [2024-02-07 14:25:16,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 55 transitions, 233 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:16,852 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 155 flow [2024-02-07 14:25:16,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2024-02-07 14:25:16,853 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -13 predicate places. [2024-02-07 14:25:16,853 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 155 flow [2024-02-07 14:25:16,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:16,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:16,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:16,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 14:25:16,854 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 45 more)] === [2024-02-07 14:25:16,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:16,854 INFO L85 PathProgramCache]: Analyzing trace with hash -770094541, now seen corresponding path program 1 times [2024-02-07 14:25:16,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:16,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57126808] [2024-02-07 14:25:16,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:16,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:16,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:16,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:16,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57126808] [2024-02-07 14:25:16,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57126808] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:16,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:16,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:25:16,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319631099] [2024-02-07 14:25:16,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:16,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:16,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:16,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:16,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:16,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-02-07 14:25:16,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:16,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:16,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-02-07 14:25:16,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:18,902 INFO L124 PetriNetUnfolderBase]: 22427/32084 cut-off events. [2024-02-07 14:25:18,903 INFO L125 PetriNetUnfolderBase]: For 5335/5335 co-relation queries the response was YES. [2024-02-07 14:25:18,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75447 conditions, 32084 events. 22427/32084 cut-off events. For 5335/5335 co-relation queries the response was YES. Maximal size of possible extension queue 1471. Compared 217329 event pairs, 4503 based on Foata normal form. 1824/28189 useless extension candidates. Maximal degree in co-relation 75438. Up to 24414 conditions per place. [2024-02-07 14:25:19,069 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 62 selfloop transitions, 1 changer transitions 0/78 dead transitions. [2024-02-07 14:25:19,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 78 transitions, 344 flow [2024-02-07 14:25:19,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:19,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:19,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2024-02-07 14:25:19,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5539906103286385 [2024-02-07 14:25:19,070 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 155 flow. Second operand 3 states and 118 transitions. [2024-02-07 14:25:19,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 78 transitions, 344 flow [2024-02-07 14:25:19,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 78 transitions, 341 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:25:19,072 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 146 flow [2024-02-07 14:25:19,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2024-02-07 14:25:19,073 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -15 predicate places. [2024-02-07 14:25:19,073 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 146 flow [2024-02-07 14:25:19,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:19,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:19,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:19,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 14:25:19,074 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 45 more)] === [2024-02-07 14:25:19,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:19,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1176764143, now seen corresponding path program 1 times [2024-02-07 14:25:19,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:19,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846612995] [2024-02-07 14:25:19,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:19,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:19,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 14:25:19,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:19,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846612995] [2024-02-07 14:25:19,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846612995] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:19,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:19,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:25:19,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976273344] [2024-02-07 14:25:19,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:19,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:19,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:19,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:19,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:19,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-02-07 14:25:19,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:19,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:19,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-02-07 14:25:19,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:20,043 INFO L124 PetriNetUnfolderBase]: 10061/13839 cut-off events. [2024-02-07 14:25:20,044 INFO L125 PetriNetUnfolderBase]: For 2764/2764 co-relation queries the response was YES. [2024-02-07 14:25:20,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32299 conditions, 13839 events. 10061/13839 cut-off events. For 2764/2764 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 76422 event pairs, 2653 based on Foata normal form. 364/13647 useless extension candidates. Maximal degree in co-relation 32291. Up to 12448 conditions per place. [2024-02-07 14:25:20,101 INFO L140 encePairwiseOnDemand]: 62/71 looper letters, 46 selfloop transitions, 4 changer transitions 2/67 dead transitions. [2024-02-07 14:25:20,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 67 transitions, 277 flow [2024-02-07 14:25:20,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:20,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:20,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2024-02-07 14:25:20,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5492957746478874 [2024-02-07 14:25:20,103 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 146 flow. Second operand 3 states and 117 transitions. [2024-02-07 14:25:20,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 67 transitions, 277 flow [2024-02-07 14:25:20,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 67 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:20,108 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 131 flow [2024-02-07 14:25:20,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2024-02-07 14:25:20,108 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -19 predicate places. [2024-02-07 14:25:20,108 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 131 flow [2024-02-07 14:25:20,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:20,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:20,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:20,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 14:25:20,109 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 45 more)] === [2024-02-07 14:25:20,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:20,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1826886388, now seen corresponding path program 1 times [2024-02-07 14:25:20,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:20,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571753572] [2024-02-07 14:25:20,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:20,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:20,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:20,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:20,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571753572] [2024-02-07 14:25:20,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571753572] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:20,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:20,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:25:20,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439737355] [2024-02-07 14:25:20,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:20,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:25:20,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:20,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:25:20,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:25:20,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 71 [2024-02-07 14:25:20,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:20,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:20,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 71 [2024-02-07 14:25:20,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:21,123 INFO L124 PetriNetUnfolderBase]: 8977/14871 cut-off events. [2024-02-07 14:25:21,123 INFO L125 PetriNetUnfolderBase]: For 2700/2700 co-relation queries the response was YES. [2024-02-07 14:25:21,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31821 conditions, 14871 events. 8977/14871 cut-off events. For 2700/2700 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 111375 event pairs, 1063 based on Foata normal form. 400/14123 useless extension candidates. Maximal degree in co-relation 31813. Up to 7301 conditions per place. [2024-02-07 14:25:21,195 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 53 selfloop transitions, 6 changer transitions 1/75 dead transitions. [2024-02-07 14:25:21,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 75 transitions, 325 flow [2024-02-07 14:25:21,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:25:21,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:25:21,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2024-02-07 14:25:21,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4859154929577465 [2024-02-07 14:25:21,196 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 131 flow. Second operand 4 states and 138 transitions. [2024-02-07 14:25:21,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 75 transitions, 325 flow [2024-02-07 14:25:21,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 75 transitions, 321 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:21,198 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 153 flow [2024-02-07 14:25:21,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2024-02-07 14:25:21,199 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -16 predicate places. [2024-02-07 14:25:21,199 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 153 flow [2024-02-07 14:25:21,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:21,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:21,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:21,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 14:25:21,200 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 45 more)] === [2024-02-07 14:25:21,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:21,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1925949291, now seen corresponding path program 1 times [2024-02-07 14:25:21,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:21,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260254041] [2024-02-07 14:25:21,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:21,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:21,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:21,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:21,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260254041] [2024-02-07 14:25:21,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260254041] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:21,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:21,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:25:21,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476082893] [2024-02-07 14:25:21,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:21,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:25:21,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:21,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:25:21,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:25:21,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 71 [2024-02-07 14:25:21,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 153 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:21,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:21,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 71 [2024-02-07 14:25:21,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:22,103 INFO L124 PetriNetUnfolderBase]: 6853/11271 cut-off events. [2024-02-07 14:25:22,104 INFO L125 PetriNetUnfolderBase]: For 3412/3412 co-relation queries the response was YES. [2024-02-07 14:25:22,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25712 conditions, 11271 events. 6853/11271 cut-off events. For 3412/3412 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 78995 event pairs, 477 based on Foata normal form. 364/10859 useless extension candidates. Maximal degree in co-relation 25701. Up to 4601 conditions per place. [2024-02-07 14:25:22,162 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 68 selfloop transitions, 10 changer transitions 1/94 dead transitions. [2024-02-07 14:25:22,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 94 transitions, 440 flow [2024-02-07 14:25:22,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:25:22,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:25:22,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2024-02-07 14:25:22,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49577464788732395 [2024-02-07 14:25:22,164 INFO L175 Difference]: Start difference. First operand has 63 places, 47 transitions, 153 flow. Second operand 5 states and 176 transitions. [2024-02-07 14:25:22,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 94 transitions, 440 flow [2024-02-07 14:25:22,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 94 transitions, 417 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-02-07 14:25:22,170 INFO L231 Difference]: Finished difference. Result has 65 places, 51 transitions, 193 flow [2024-02-07 14:25:22,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2024-02-07 14:25:22,171 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -14 predicate places. [2024-02-07 14:25:22,172 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 193 flow [2024-02-07 14:25:22,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:22,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:22,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:22,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 14:25:22,173 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 45 more)] === [2024-02-07 14:25:22,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:22,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1672246646, now seen corresponding path program 1 times [2024-02-07 14:25:22,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:22,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23687057] [2024-02-07 14:25:22,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:22,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:22,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:22,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:22,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23687057] [2024-02-07 14:25:22,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23687057] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:22,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:22,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 14:25:22,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712268163] [2024-02-07 14:25:22,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:22,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:25:22,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:22,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:25:22,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:25:22,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 71 [2024-02-07 14:25:22,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 51 transitions, 193 flow. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:22,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:22,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 71 [2024-02-07 14:25:22,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:22,884 INFO L124 PetriNetUnfolderBase]: 4361/6883 cut-off events. [2024-02-07 14:25:22,884 INFO L125 PetriNetUnfolderBase]: For 4424/4424 co-relation queries the response was YES. [2024-02-07 14:25:22,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17660 conditions, 6883 events. 4361/6883 cut-off events. For 4424/4424 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 40436 event pairs, 315 based on Foata normal form. 244/6795 useless extension candidates. Maximal degree in co-relation 17649. Up to 1820 conditions per place. [2024-02-07 14:25:22,915 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 81 selfloop transitions, 14 changer transitions 1/111 dead transitions. [2024-02-07 14:25:22,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 111 transitions, 561 flow [2024-02-07 14:25:22,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:25:22,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:25:22,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2024-02-07 14:25:22,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49765258215962443 [2024-02-07 14:25:22,917 INFO L175 Difference]: Start difference. First operand has 65 places, 51 transitions, 193 flow. Second operand 6 states and 212 transitions. [2024-02-07 14:25:22,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 111 transitions, 561 flow [2024-02-07 14:25:22,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 111 transitions, 531 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-02-07 14:25:22,935 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 243 flow [2024-02-07 14:25:22,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2024-02-07 14:25:22,936 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -11 predicate places. [2024-02-07 14:25:22,937 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 243 flow [2024-02-07 14:25:22,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:22,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:22,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:22,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 14:25:22,938 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 45 more)] === [2024-02-07 14:25:22,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:22,938 INFO L85 PathProgramCache]: Analyzing trace with hash -451908430, now seen corresponding path program 1 times [2024-02-07 14:25:22,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:22,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567211892] [2024-02-07 14:25:22,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:22,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:23,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:23,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:23,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567211892] [2024-02-07 14:25:23,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567211892] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:23,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:23,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-07 14:25:23,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742849398] [2024-02-07 14:25:23,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:23,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-07 14:25:23,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:23,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-07 14:25:23,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-02-07 14:25:23,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 71 [2024-02-07 14:25:23,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 243 flow. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:23,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:23,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 71 [2024-02-07 14:25:23,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:23,461 INFO L124 PetriNetUnfolderBase]: 2997/4411 cut-off events. [2024-02-07 14:25:23,461 INFO L125 PetriNetUnfolderBase]: For 4792/4792 co-relation queries the response was YES. [2024-02-07 14:25:23,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12757 conditions, 4411 events. 2997/4411 cut-off events. For 4792/4792 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 21398 event pairs, 257 based on Foata normal form. 96/4415 useless extension candidates. Maximal degree in co-relation 12745. Up to 1348 conditions per place. [2024-02-07 14:25:23,482 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 72 selfloop transitions, 18 changer transitions 1/106 dead transitions. [2024-02-07 14:25:23,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 106 transitions, 549 flow [2024-02-07 14:25:23,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-07 14:25:23,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-07 14:25:23,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 226 transitions. [2024-02-07 14:25:23,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45472837022132795 [2024-02-07 14:25:23,489 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 243 flow. Second operand 7 states and 226 transitions. [2024-02-07 14:25:23,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 106 transitions, 549 flow [2024-02-07 14:25:23,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 106 transitions, 503 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-02-07 14:25:23,521 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 253 flow [2024-02-07 14:25:23,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=253, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2024-02-07 14:25:23,523 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -8 predicate places. [2024-02-07 14:25:23,523 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 253 flow [2024-02-07 14:25:23,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:23,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:23,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:23,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-07 14:25:23,524 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 45 more)] === [2024-02-07 14:25:23,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:23,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1579528030, now seen corresponding path program 1 times [2024-02-07 14:25:23,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:23,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311586747] [2024-02-07 14:25:23,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:23,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:25:23,556 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 14:25:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:25:23,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 14:25:23,602 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 14:25:23,603 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 48 remaining) [2024-02-07 14:25:23,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 48 remaining) [2024-02-07 14:25:23,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 48 remaining) [2024-02-07 14:25:23,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 48 remaining) [2024-02-07 14:25:23,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 48 remaining) [2024-02-07 14:25:23,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 48 remaining) [2024-02-07 14:25:23,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 48 remaining) [2024-02-07 14:25:23,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 48 remaining) [2024-02-07 14:25:23,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 48 remaining) [2024-02-07 14:25:23,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 48 remaining) [2024-02-07 14:25:23,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 48 remaining) [2024-02-07 14:25:23,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 48 remaining) [2024-02-07 14:25:23,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 48 remaining) [2024-02-07 14:25:23,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 48 remaining) [2024-02-07 14:25:23,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 48 remaining) [2024-02-07 14:25:23,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 48 remaining) [2024-02-07 14:25:23,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 48 remaining) [2024-02-07 14:25:23,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 48 remaining) [2024-02-07 14:25:23,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 48 remaining) [2024-02-07 14:25:23,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 48 remaining) [2024-02-07 14:25:23,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 48 remaining) [2024-02-07 14:25:23,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 48 remaining) [2024-02-07 14:25:23,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 48 remaining) [2024-02-07 14:25:23,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 48 remaining) [2024-02-07 14:25:23,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 48 remaining) [2024-02-07 14:25:23,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (22 of 48 remaining) [2024-02-07 14:25:23,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 48 remaining) [2024-02-07 14:25:23,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 48 remaining) [2024-02-07 14:25:23,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 48 remaining) [2024-02-07 14:25:23,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 48 remaining) [2024-02-07 14:25:23,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 48 remaining) [2024-02-07 14:25:23,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 48 remaining) [2024-02-07 14:25:23,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 48 remaining) [2024-02-07 14:25:23,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 48 remaining) [2024-02-07 14:25:23,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 48 remaining) [2024-02-07 14:25:23,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 48 remaining) [2024-02-07 14:25:23,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 48 remaining) [2024-02-07 14:25:23,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 48 remaining) [2024-02-07 14:25:23,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 48 remaining) [2024-02-07 14:25:23,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 48 remaining) [2024-02-07 14:25:23,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 48 remaining) [2024-02-07 14:25:23,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 48 remaining) [2024-02-07 14:25:23,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 48 remaining) [2024-02-07 14:25:23,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 48 remaining) [2024-02-07 14:25:23,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 48 remaining) [2024-02-07 14:25:23,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 48 remaining) [2024-02-07 14:25:23,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 48 remaining) [2024-02-07 14:25:23,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 48 remaining) [2024-02-07 14:25:23,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-07 14:25:23,614 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:23,621 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 14:25:23,621 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 14:25:23,694 INFO L503 ceAbstractionStarter]: Automizer considered 25 witness invariants [2024-02-07 14:25:23,696 INFO L504 ceAbstractionStarter]: WitnessConsidered=25 [2024-02-07 14:25:23,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 02:25:23 BasicIcfg [2024-02-07 14:25:23,698 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 14:25:23,698 INFO L158 Benchmark]: Toolchain (without parser) took 27273.68ms. Allocated memory was 155.2MB in the beginning and 14.2GB in the end (delta: 14.0GB). Free memory was 125.0MB in the beginning and 12.1GB in the end (delta: -11.9GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2024-02-07 14:25:23,699 INFO L158 Benchmark]: Witness Parser took 0.20ms. Allocated memory is still 155.2MB. Free memory is still 132.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:25:23,699 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:25:23,699 INFO L158 Benchmark]: CACSL2BoogieTranslator took 633.96ms. Allocated memory is still 155.2MB. Free memory was 125.0MB in the beginning and 92.4MB in the end (delta: 32.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-02-07 14:25:23,699 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.86ms. Allocated memory is still 155.2MB. Free memory was 92.0MB in the beginning and 89.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 14:25:23,700 INFO L158 Benchmark]: Boogie Preprocessor took 83.48ms. Allocated memory is still 155.2MB. Free memory was 89.9MB in the beginning and 87.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 14:25:23,700 INFO L158 Benchmark]: RCFGBuilder took 687.73ms. Allocated memory is still 155.2MB. Free memory was 87.3MB in the beginning and 99.3MB in the end (delta: -11.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-02-07 14:25:23,700 INFO L158 Benchmark]: TraceAbstraction took 25778.26ms. Allocated memory was 155.2MB in the beginning and 14.2GB in the end (delta: 14.0GB). Free memory was 98.6MB in the beginning and 12.1GB in the end (delta: -12.0GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2024-02-07 14:25:23,702 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.20ms. Allocated memory is still 155.2MB. Free memory is still 132.0MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 633.96ms. Allocated memory is still 155.2MB. Free memory was 125.0MB in the beginning and 92.4MB in the end (delta: 32.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.86ms. Allocated memory is still 155.2MB. Free memory was 92.0MB in the beginning and 89.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.48ms. Allocated memory is still 155.2MB. Free memory was 89.9MB in the beginning and 87.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 687.73ms. Allocated memory is still 155.2MB. Free memory was 87.3MB in the beginning and 99.3MB in the end (delta: -11.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 25778.26ms. Allocated memory was 155.2MB in the beginning and 14.2GB in the end (delta: 14.0GB). Free memory was 98.6MB in the beginning and 12.1GB in the end (delta: -12.0GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 805]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L790] 0 pthread_t t2425; [L791] FCALL, FORK 0 pthread_create(&t2425, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2425={5:0}, x=0, y=0] [L728] 1 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]]]]]] [L728] 1 __unbuffered_p0_EAX = y [L729] 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=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L792] 0 pthread_t t2426; [L793] FCALL, FORK 0 pthread_create(&t2426, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, t2425={5:0}, t2426={6:0}, x=0, y=0] [L743] 2 x = 1 [L744] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, y=0] [L731] 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]]]]]] [L731] 1 __unbuffered_p0_EBX = x [L732] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EBX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=1, __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=1, y=0] [L794] 0 pthread_t t2427; [L795] FCALL, FORK 0 pthread_create(&t2427, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, t2425={5:0}, t2426={6:0}, t2427={7:0}, x=1, y=0] [L755] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]]]] [L755] 3 __unbuffered_p2_EAX = x [L756] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=0] [L796] 0 pthread_t t2428; [L797] FCALL, FORK 0 pthread_create(&t2428, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2425={5:0}, t2426={6:0}, t2427={7:0}, t2428={3:0}, x=1, y=0] [L770] 4 y = 1 [L771] 4 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L758] 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]]]]]] [L758] 3 __unbuffered_p2_EBX = y [L759] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L736] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L736] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L737] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L748] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L748] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L763] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L763] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L775] 4 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L775] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 4 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L799] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L799] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L800] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2425={5:0}, t2426={6:0}, t2427={7:0}, t2428={3:0}, x=1, y=1] [L801] 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]]]]]] [L801] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L801] RET 0 assume_abort_if_not(main$tmp_guard0) [L805] 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[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[1]]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EBX],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[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EBX]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EAX]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[1]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[1]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]]]]]]] VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2425={5:0}, t2426={6:0}, t2427={7:0}, t2428={3:0}, x=1, y=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: 729]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 731]: 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: 736]: 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: 744]: 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: 749]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 755]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 756]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 758]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 759]: 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: 764]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 776]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 799]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 800]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 801]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 806]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 807]: 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: 795]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 797]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 791]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 119 locations, 48 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: 25.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 23.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 581 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 578 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 908 IncrementalHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 3 mSDtfsCounter, 908 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=253occurred in iteration=11, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 127 ConstructedInterpolants, 0 QuantifiedInterpolants, 325 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-02-07 14:25:23,739 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