./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/mutex-meet/popl20-more-buffer-mult.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 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/weaver/popl20-more-buffer-mult.wvr.c ./goblint.2024-05-07_14-17-48.files/mutex-meet/popl20-more-buffer-mult.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 12:27:19,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 12:27:19,695 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 12:27:19,702 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 12:27:19,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 12:27:19,723 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 12:27:19,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 12:27:19,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 12:27:19,724 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 12:27:19,727 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 12:27:19,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 12:27:19,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 12:27:19,729 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 12:27:19,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 12:27:19,730 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 12:27:19,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 12:27:19,730 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 12:27:19,731 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 12:27:19,731 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 12:27:19,731 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 12:27:19,731 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 12:27:19,732 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 12:27:19,732 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 12:27:19,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 12:27:19,732 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 12:27:19,732 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 12:27:19,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 12:27:19,733 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 12:27:19,733 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 12:27:19,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 12:27:19,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 12:27:19,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 12:27:19,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:27:19,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 12:27:19,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 12:27:19,735 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 12:27:19,735 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 12:27:19,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 12:27:19,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 12:27:19,736 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 12:27:19,736 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 12:27:19,736 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 12:27:19,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 12:27:19,737 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-05-12 12:27:19,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 12:27:19,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 12:27:19,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 12:27:19,945 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 12:27:19,946 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 12:27:19,947 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/mutex-meet/popl20-more-buffer-mult.wvr.yml/witness.yml [2024-05-12 12:27:20,098 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 12:27:20,099 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 12:27:20,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult.wvr.c [2024-05-12 12:27:21,200 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 12:27:21,427 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 12:27:21,428 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult.wvr.c [2024-05-12 12:27:21,436 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2ffe250c/a8df00e38f5c468096848b29fb8f8c0e/FLAGc0efe13ae [2024-05-12 12:27:21,446 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2ffe250c/a8df00e38f5c468096848b29fb8f8c0e [2024-05-12 12:27:21,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 12:27:21,448 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 12:27:21,449 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 12:27:21,449 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 12:27:21,453 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 12:27:21,453 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:27:20" (1/2) ... [2024-05-12 12:27:21,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@999a1ec and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:27:21, skipping insertion in model container [2024-05-12 12:27:21,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:27:20" (1/2) ... [2024-05-12 12:27:21,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3ac1884d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:27:21, skipping insertion in model container [2024-05-12 12:27:21,455 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:27:21" (2/2) ... [2024-05-12 12:27:21,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@999a1ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:27:21, skipping insertion in model container [2024-05-12 12:27:21,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:27:21" (2/2) ... [2024-05-12 12:27:21,456 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 12:27:21,475 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 12:27:21,477 INFO L97 edCorrectnessWitness]: Location invariant before [L145-L145] (((! multithreaded || 0 <= j) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((2147483648LL + (long long )i) + (long long )q1_front >= 0LL && (2147483648LL + (long long )i) + (long long )q1_back >= 0LL) && (2147483648LL + (long long )i) + (long long )q2_front >= 0LL) && (2147483648LL + (long long )i) + (long long )q2_back >= 0LL) && (2147483648LL + (long long )i) + (long long )n1 >= 0LL) && (2147483648LL + (long long )i) + (long long )n2 >= 0LL) && (2147483648LL + (long long )j) + (long long )q1_front >= 0LL) && (2147483648LL + (long long )j) + (long long )q1_back >= 0LL) && (2147483648LL + (long long )j) + (long long )q2_front >= 0LL) && (2147483648LL + (long long )j) + (long long )q2_back >= 0LL) && (2147483648LL + (long long )j) + (long long )n1 >= 0LL) && (2147483648LL + (long long )j) + (long long )n2 >= 0LL) && (2147483648LL + (long long )N) + (long long )i >= 0LL) && (2147483648LL + (long long )N) + (long long )j >= 0LL) && (2147483648LL + (long long )C) + (long long )i >= 0LL) && (2147483648LL + (long long )C) + (long long )j >= 0LL) && (4294967296LL + (long long )q1_front) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )q1_front) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )q1_back) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )q1_back) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )q1_back) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )q2_back) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )n1) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )n1) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )n1) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )n1) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )n1) + (long long )n2 >= 0LL) && (4294967296LL + (long long )n2) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )n2) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )n2) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )n2) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )N) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )N) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )N) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )N) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )N) + (long long )n1 >= 0LL) && (4294967296LL + (long long )N) + (long long )n2 >= 0LL) && (4294967296LL + (long long )C) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )C) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )C) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )C) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )C) + (long long )n1 >= 0LL) && (4294967296LL + (long long )C) + (long long )n2 >= 0LL) && (4294967296LL + (long long )C) + (long long )N >= 0LL) && (2147483647LL - (long long )N) + (long long )i >= 0LL) && (2147483647LL - (long long )N) + (long long )j >= 0LL) && (2147483647LL - (long long )C) + (long long )i >= 0LL) && (2147483647LL - (long long )C) + (long long )j >= 0LL) && (4294967295LL - (long long )n1) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )n1) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )n1) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )n1) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )n1) + (long long )n2 >= 0LL) && (4294967295LL - (long long )n2) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )n2) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )n2) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )n2) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )N) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )N) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )N) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )N) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )N) + (long long )n1 >= 0LL) && (4294967295LL - (long long )N) + (long long )n2 >= 0LL) && (4294967295LL - (long long )C) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )C) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )C) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )C) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )C) + (long long )n1 >= 0LL) && (4294967295LL - (long long )C) + (long long )n2 >= 0LL) && (4294967295LL - (long long )C) + (long long )N >= 0LL) && (long long )i + (long long )j >= 0LL) && (2147483647LL + (long long )i) - (long long )n1 >= 0LL) && (2147483647LL + (long long )i) - (long long )n2 >= 0LL) && (2147483647LL + (long long )j) - (long long )n1 >= 0LL) && (2147483647LL + (long long )j) - (long long )n2 >= 0LL) && (4294967295LL + (long long )n1) - (long long )n2 >= 0LL) && (4294967295LL + (long long )N) - (long long )n1 >= 0LL) && (4294967295LL + (long long )N) - (long long )n2 >= 0LL) && (4294967295LL + (long long )C) - (long long )n1 >= 0LL) && (4294967295LL + (long long )C) - (long long )n2 >= 0LL) && (4294967295LL + (long long )C) - (long long )N >= 0LL) && (4294967294LL - (long long )n1) - (long long )n2 >= 0LL) && (4294967294LL - (long long )N) - (long long )n1 >= 0LL) && (4294967294LL - (long long )N) - (long long )n2 >= 0LL) && (4294967294LL - (long long )C) - (long long )n1 >= 0LL) && (4294967294LL - (long long )C) - (long long )n2 >= 0LL) && (4294967294LL - (long long )C) - (long long )N >= 0LL))) && (! multithreaded || (0 <= i && 0 <= j))) && (! multithreaded || 0 <= i) [2024-05-12 12:27:21,478 INFO L97 edCorrectnessWitness]: Location invariant before [L144-L144] (((! multithreaded || 0 <= j) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((2147483648LL + (long long )i) + (long long )q1_front >= 0LL && (2147483648LL + (long long )i) + (long long )q1_back >= 0LL) && (2147483648LL + (long long )i) + (long long )q2_front >= 0LL) && (2147483648LL + (long long )i) + (long long )q2_back >= 0LL) && (2147483648LL + (long long )i) + (long long )n1 >= 0LL) && (2147483648LL + (long long )i) + (long long )n2 >= 0LL) && (2147483648LL + (long long )j) + (long long )q1_front >= 0LL) && (2147483648LL + (long long )j) + (long long )q1_back >= 0LL) && (2147483648LL + (long long )j) + (long long )q2_front >= 0LL) && (2147483648LL + (long long )j) + (long long )q2_back >= 0LL) && (2147483648LL + (long long )j) + (long long )n1 >= 0LL) && (2147483648LL + (long long )j) + (long long )n2 >= 0LL) && (2147483648LL + (long long )N) + (long long )i >= 0LL) && (2147483648LL + (long long )N) + (long long )j >= 0LL) && (2147483648LL + (long long )C) + (long long )i >= 0LL) && (2147483648LL + (long long )C) + (long long )j >= 0LL) && (4294967296LL + (long long )q1_front) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )q1_front) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )q1_back) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )q1_back) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )q1_back) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )q2_back) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )n1) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )n1) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )n1) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )n1) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )n1) + (long long )n2 >= 0LL) && (4294967296LL + (long long )n2) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )n2) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )n2) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )n2) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )N) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )N) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )N) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )N) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )N) + (long long )n1 >= 0LL) && (4294967296LL + (long long )N) + (long long )n2 >= 0LL) && (4294967296LL + (long long )C) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )C) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )C) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )C) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )C) + (long long )n1 >= 0LL) && (4294967296LL + (long long )C) + (long long )n2 >= 0LL) && (4294967296LL + (long long )C) + (long long )N >= 0LL) && (2147483647LL - (long long )N) + (long long )i >= 0LL) && (2147483647LL - (long long )N) + (long long )j >= 0LL) && (2147483647LL - (long long )C) + (long long )i >= 0LL) && (2147483647LL - (long long )C) + (long long )j >= 0LL) && (4294967295LL - (long long )n1) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )n1) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )n1) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )n1) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )n1) + (long long )n2 >= 0LL) && (4294967295LL - (long long )n2) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )n2) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )n2) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )n2) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )N) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )N) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )N) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )N) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )N) + (long long )n1 >= 0LL) && (4294967295LL - (long long )N) + (long long )n2 >= 0LL) && (4294967295LL - (long long )C) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )C) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )C) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )C) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )C) + (long long )n1 >= 0LL) && (4294967295LL - (long long )C) + (long long )n2 >= 0LL) && (4294967295LL - (long long )C) + (long long )N >= 0LL) && (long long )i + (long long )j >= 0LL) && (2147483647LL + (long long )i) - (long long )n1 >= 0LL) && (2147483647LL + (long long )i) - (long long )n2 >= 0LL) && (2147483647LL + (long long )j) - (long long )n1 >= 0LL) && (2147483647LL + (long long )j) - (long long )n2 >= 0LL) && (4294967295LL + (long long )n1) - (long long )n2 >= 0LL) && (4294967295LL + (long long )N) - (long long )n1 >= 0LL) && (4294967295LL + (long long )N) - (long long )n2 >= 0LL) && (4294967295LL + (long long )C) - (long long )n1 >= 0LL) && (4294967295LL + (long long )C) - (long long )n2 >= 0LL) && (4294967295LL + (long long )C) - (long long )N >= 0LL) && (4294967294LL - (long long )n1) - (long long )n2 >= 0LL) && (4294967294LL - (long long )N) - (long long )n1 >= 0LL) && (4294967294LL - (long long )N) - (long long )n2 >= 0LL) && (4294967294LL - (long long )C) - (long long )n1 >= 0LL) && (4294967294LL - (long long )C) - (long long )n2 >= 0LL) && (4294967294LL - (long long )C) - (long long )N >= 0LL))) && (! multithreaded || (0 <= i && 0 <= j))) && (! multithreaded || 0 <= i) [2024-05-12 12:27:21,478 INFO L97 edCorrectnessWitness]: Location invariant before [L143-L143] (((! multithreaded || 0 <= j) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((2147483648LL + (long long )i) + (long long )q1_front >= 0LL && (2147483648LL + (long long )i) + (long long )q1_back >= 0LL) && (2147483648LL + (long long )i) + (long long )q2_front >= 0LL) && (2147483648LL + (long long )i) + (long long )q2_back >= 0LL) && (2147483648LL + (long long )i) + (long long )n1 >= 0LL) && (2147483648LL + (long long )i) + (long long )n2 >= 0LL) && (2147483648LL + (long long )j) + (long long )q1_front >= 0LL) && (2147483648LL + (long long )j) + (long long )q1_back >= 0LL) && (2147483648LL + (long long )j) + (long long )q2_front >= 0LL) && (2147483648LL + (long long )j) + (long long )q2_back >= 0LL) && (2147483648LL + (long long )j) + (long long )n1 >= 0LL) && (2147483648LL + (long long )j) + (long long )n2 >= 0LL) && (2147483648LL + (long long )N) + (long long )i >= 0LL) && (2147483648LL + (long long )N) + (long long )j >= 0LL) && (2147483648LL + (long long )C) + (long long )i >= 0LL) && (2147483648LL + (long long )C) + (long long )j >= 0LL) && (4294967296LL + (long long )q1_front) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )q1_front) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )q1_back) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )q1_back) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )q1_back) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )q2_back) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )n1) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )n1) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )n1) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )n1) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )n1) + (long long )n2 >= 0LL) && (4294967296LL + (long long )n2) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )n2) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )n2) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )n2) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )N) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )N) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )N) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )N) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )N) + (long long )n1 >= 0LL) && (4294967296LL + (long long )N) + (long long )n2 >= 0LL) && (4294967296LL + (long long )C) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )C) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )C) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )C) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )C) + (long long )n1 >= 0LL) && (4294967296LL + (long long )C) + (long long )n2 >= 0LL) && (4294967296LL + (long long )C) + (long long )N >= 0LL) && (2147483647LL - (long long )N) + (long long )i >= 0LL) && (2147483647LL - (long long )N) + (long long )j >= 0LL) && (2147483647LL - (long long )C) + (long long )i >= 0LL) && (2147483647LL - (long long )C) + (long long )j >= 0LL) && (4294967295LL - (long long )n1) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )n1) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )n1) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )n1) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )n1) + (long long )n2 >= 0LL) && (4294967295LL - (long long )n2) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )n2) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )n2) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )n2) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )N) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )N) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )N) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )N) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )N) + (long long )n1 >= 0LL) && (4294967295LL - (long long )N) + (long long )n2 >= 0LL) && (4294967295LL - (long long )C) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )C) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )C) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )C) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )C) + (long long )n1 >= 0LL) && (4294967295LL - (long long )C) + (long long )n2 >= 0LL) && (4294967295LL - (long long )C) + (long long )N >= 0LL) && (long long )i + (long long )j >= 0LL) && (2147483647LL + (long long )i) - (long long )n1 >= 0LL) && (2147483647LL + (long long )i) - (long long )n2 >= 0LL) && (2147483647LL + (long long )j) - (long long )n1 >= 0LL) && (2147483647LL + (long long )j) - (long long )n2 >= 0LL) && (4294967295LL + (long long )n1) - (long long )n2 >= 0LL) && (4294967295LL + (long long )N) - (long long )n1 >= 0LL) && (4294967295LL + (long long )N) - (long long )n2 >= 0LL) && (4294967295LL + (long long )C) - (long long )n1 >= 0LL) && (4294967295LL + (long long )C) - (long long )n2 >= 0LL) && (4294967295LL + (long long )C) - (long long )N >= 0LL) && (4294967294LL - (long long )n1) - (long long )n2 >= 0LL) && (4294967294LL - (long long )N) - (long long )n1 >= 0LL) && (4294967294LL - (long long )N) - (long long )n2 >= 0LL) && (4294967294LL - (long long )C) - (long long )n1 >= 0LL) && (4294967294LL - (long long )C) - (long long )n2 >= 0LL) && (4294967294LL - (long long )C) - (long long )N >= 0LL))) && (! multithreaded || (0 <= i && 0 <= j))) && (! multithreaded || 0 <= i) [2024-05-12 12:27:21,478 INFO L97 edCorrectnessWitness]: Location invariant before [L146-L146] (((! multithreaded || 0 <= j) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((2147483648LL + (long long )i) + (long long )q1_front >= 0LL && (2147483648LL + (long long )i) + (long long )q1_back >= 0LL) && (2147483648LL + (long long )i) + (long long )q2_front >= 0LL) && (2147483648LL + (long long )i) + (long long )q2_back >= 0LL) && (2147483648LL + (long long )i) + (long long )n1 >= 0LL) && (2147483648LL + (long long )i) + (long long )n2 >= 0LL) && (2147483648LL + (long long )j) + (long long )q1_front >= 0LL) && (2147483648LL + (long long )j) + (long long )q1_back >= 0LL) && (2147483648LL + (long long )j) + (long long )q2_front >= 0LL) && (2147483648LL + (long long )j) + (long long )q2_back >= 0LL) && (2147483648LL + (long long )j) + (long long )n1 >= 0LL) && (2147483648LL + (long long )j) + (long long )n2 >= 0LL) && (2147483648LL + (long long )N) + (long long )i >= 0LL) && (2147483648LL + (long long )N) + (long long )j >= 0LL) && (2147483648LL + (long long )C) + (long long )i >= 0LL) && (2147483648LL + (long long )C) + (long long )j >= 0LL) && (4294967296LL + (long long )q1_front) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )q1_front) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )q1_back) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )q1_back) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )q1_back) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )q2_back) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )n1) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )n1) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )n1) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )n1) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )n1) + (long long )n2 >= 0LL) && (4294967296LL + (long long )n2) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )n2) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )n2) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )n2) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )N) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )N) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )N) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )N) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )N) + (long long )n1 >= 0LL) && (4294967296LL + (long long )N) + (long long )n2 >= 0LL) && (4294967296LL + (long long )C) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )C) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )C) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )C) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )C) + (long long )n1 >= 0LL) && (4294967296LL + (long long )C) + (long long )n2 >= 0LL) && (4294967296LL + (long long )C) + (long long )N >= 0LL) && (2147483647LL - (long long )N) + (long long )i >= 0LL) && (2147483647LL - (long long )N) + (long long )j >= 0LL) && (2147483647LL - (long long )C) + (long long )i >= 0LL) && (2147483647LL - (long long )C) + (long long )j >= 0LL) && (4294967295LL - (long long )n1) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )n1) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )n1) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )n1) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )n1) + (long long )n2 >= 0LL) && (4294967295LL - (long long )n2) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )n2) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )n2) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )n2) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )N) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )N) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )N) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )N) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )N) + (long long )n1 >= 0LL) && (4294967295LL - (long long )N) + (long long )n2 >= 0LL) && (4294967295LL - (long long )C) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )C) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )C) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )C) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )C) + (long long )n1 >= 0LL) && (4294967295LL - (long long )C) + (long long )n2 >= 0LL) && (4294967295LL - (long long )C) + (long long )N >= 0LL) && (long long )i + (long long )j >= 0LL) && (2147483647LL + (long long )i) - (long long )n1 >= 0LL) && (2147483647LL + (long long )i) - (long long )n2 >= 0LL) && (2147483647LL + (long long )j) - (long long )n1 >= 0LL) && (2147483647LL + (long long )j) - (long long )n2 >= 0LL) && (4294967295LL + (long long )n1) - (long long )n2 >= 0LL) && (4294967295LL + (long long )N) - (long long )n1 >= 0LL) && (4294967295LL + (long long )N) - (long long )n2 >= 0LL) && (4294967295LL + (long long )C) - (long long )n1 >= 0LL) && (4294967295LL + (long long )C) - (long long )n2 >= 0LL) && (4294967295LL + (long long )C) - (long long )N >= 0LL) && (4294967294LL - (long long )n1) - (long long )n2 >= 0LL) && (4294967294LL - (long long )N) - (long long )n1 >= 0LL) && (4294967294LL - (long long )N) - (long long )n2 >= 0LL) && (4294967294LL - (long long )C) - (long long )n1 >= 0LL) && (4294967294LL - (long long )C) - (long long )n2 >= 0LL) && (4294967294LL - (long long )C) - (long long )N >= 0LL))) && (! multithreaded || (0 <= i && 0 <= j))) && (! multithreaded || 0 <= i) [2024-05-12 12:27:21,479 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 12:27:21,480 INFO L106 edCorrectnessWitness]: ghost_update [L142-L142] multithreaded = 1; [2024-05-12 12:27:21,502 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 12:27:21,702 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult.wvr.c[4218,4231] [2024-05-12 12:27:21,710 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:27:21,720 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 12:27:22,021 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult.wvr.c[4218,4231] [2024-05-12 12:27:22,037 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:27:22,067 INFO L206 MainTranslator]: Completed translation [2024-05-12 12:27:22,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:27:22 WrapperNode [2024-05-12 12:27:22,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 12:27:22,070 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 12:27:22,070 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 12:27:22,070 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 12:27:22,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:27:22" (1/1) ... [2024-05-12 12:27:22,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:27:22" (1/1) ... [2024-05-12 12:27:22,142 INFO L138 Inliner]: procedures = 27, calls = 80, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 323 [2024-05-12 12:27:22,143 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 12:27:22,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 12:27:22,144 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 12:27:22,144 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 12:27:22,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:27:22" (1/1) ... [2024-05-12 12:27:22,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:27:22" (1/1) ... [2024-05-12 12:27:22,162 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:27:22" (1/1) ... [2024-05-12 12:27:22,178 INFO L175 MemorySlicer]: Split 16 memory accesses to 6 slices as follows [2, 6, 2, 2, 2, 2]. 38 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 6 writes are split as follows [0, 2, 1, 1, 1, 1]. [2024-05-12 12:27:22,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:27:22" (1/1) ... [2024-05-12 12:27:22,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:27:22" (1/1) ... [2024-05-12 12:27:22,201 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:27:22" (1/1) ... [2024-05-12 12:27:22,216 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:27:22" (1/1) ... [2024-05-12 12:27:22,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:27:22" (1/1) ... [2024-05-12 12:27:22,223 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:27:22" (1/1) ... [2024-05-12 12:27:22,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 12:27:22,231 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 12:27:22,232 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 12:27:22,232 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 12:27:22,233 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:27:22" (1/1) ... [2024-05-12 12:27:22,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:27:22,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:27:22,281 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-05-12 12:27:22,336 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-05-12 12:27:22,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 12:27:22,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 12:27:22,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 12:27:22,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 12:27:22,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 12:27:22,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-05-12 12:27:22,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-05-12 12:27:22,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-05-12 12:27:22,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-05-12 12:27:22,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-05-12 12:27:22,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-05-12 12:27:22,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-05-12 12:27:22,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-05-12 12:27:22,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-05-12 12:27:22,365 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-12 12:27:22,365 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-12 12:27:22,365 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-12 12:27:22,366 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-12 12:27:22,366 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-12 12:27:22,366 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-12 12:27:22,366 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-05-12 12:27:22,366 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-05-12 12:27:22,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 12:27:22,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 12:27:22,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 12:27:22,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-05-12 12:27:22,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-05-12 12:27:22,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-05-12 12:27:22,367 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 12:27:22,367 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 12:27:22,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-12 12:27:22,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 12:27:22,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 12:27:22,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 12:27:22,370 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 12:27:22,498 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 12:27:22,500 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 12:27:22,951 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 12:27:22,951 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 12:27:23,254 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 12:27:23,254 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-05-12 12:27:23,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:27:23 BoogieIcfgContainer [2024-05-12 12:27:23,255 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 12:27:23,258 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 12:27:23,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 12:27:23,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 12:27:23,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:27:20" (1/4) ... [2024-05-12 12:27:23,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e0407ef and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 12:27:23, skipping insertion in model container [2024-05-12 12:27:23,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 12:27:21" (2/4) ... [2024-05-12 12:27:23,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e0407ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 12:27:23, skipping insertion in model container [2024-05-12 12:27:23,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:27:22" (3/4) ... [2024-05-12 12:27:23,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e0407ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 12:27:23, skipping insertion in model container [2024-05-12 12:27:23,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:27:23" (4/4) ... [2024-05-12 12:27:23,263 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult.wvr.c [2024-05-12 12:27:23,277 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 12:27:23,277 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-05-12 12:27:23,278 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 12:27:23,339 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-05-12 12:27:23,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 59 transitions, 146 flow [2024-05-12 12:27:23,402 INFO L124 PetriNetUnfolderBase]: 6/55 cut-off events. [2024-05-12 12:27:23,402 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-05-12 12:27:23,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 55 events. 6/55 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2024-05-12 12:27:23,405 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 59 transitions, 146 flow [2024-05-12 12:27:23,409 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 54 transitions, 132 flow [2024-05-12 12:27:23,419 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 12:27:23,429 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;@f2a32c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 12:27:23,430 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-05-12 12:27:23,436 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 12:27:23,436 INFO L124 PetriNetUnfolderBase]: 2/12 cut-off events. [2024-05-12 12:27:23,437 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 12:27:23,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:27:23,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:27:23,438 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:27:23,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:27:23,444 INFO L85 PathProgramCache]: Analyzing trace with hash -2065440923, now seen corresponding path program 1 times [2024-05-12 12:27:23,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:27:23,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008541591] [2024-05-12 12:27:23,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:27:23,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:27:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:27:25,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:27:25,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:27:25,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008541591] [2024-05-12 12:27:25,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008541591] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:27:25,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:27:25,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:27:25,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455527138] [2024-05-12 12:27:25,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:27:25,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:27:25,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:27:25,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:27:25,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:27:25,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-05-12 12:27:25,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-05-12 12:27:25,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:27:25,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-05-12 12:27:25,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:27:26,712 INFO L124 PetriNetUnfolderBase]: 5566/8218 cut-off events. [2024-05-12 12:27:26,712 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2024-05-12 12:27:26,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16032 conditions, 8218 events. 5566/8218 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 53417 event pairs, 2219 based on Foata normal form. 0/7627 useless extension candidates. Maximal degree in co-relation 10372. Up to 4283 conditions per place. [2024-05-12 12:27:26,774 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 100 selfloop transitions, 8 changer transitions 0/121 dead transitions. [2024-05-12 12:27:26,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 121 transitions, 527 flow [2024-05-12 12:27:26,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:27:26,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:27:26,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 197 transitions. [2024-05-12 12:27:26,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6677966101694915 [2024-05-12 12:27:26,788 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 132 flow. Second operand 5 states and 197 transitions. [2024-05-12 12:27:26,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 121 transitions, 527 flow [2024-05-12 12:27:26,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 121 transitions, 481 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-05-12 12:27:26,806 INFO L231 Difference]: Finished difference. Result has 59 places, 60 transitions, 166 flow [2024-05-12 12:27:26,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=59, PETRI_TRANSITIONS=60} [2024-05-12 12:27:26,811 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -2 predicate places. [2024-05-12 12:27:26,812 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 60 transitions, 166 flow [2024-05-12 12:27:26,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-05-12 12:27:26,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:27:26,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:27:26,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 12:27:26,813 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:27:26,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:27:26,813 INFO L85 PathProgramCache]: Analyzing trace with hash -115542529, now seen corresponding path program 1 times [2024-05-12 12:27:26,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:27:26,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686079748] [2024-05-12 12:27:26,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:27:26,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:27:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:27:28,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:27:28,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:27:28,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686079748] [2024-05-12 12:27:28,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686079748] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 12:27:28,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829436684] [2024-05-12 12:27:28,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:27:28,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:27:28,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:27:28,394 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 12:27:28,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-05-12 12:27:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:27:28,595 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjunts are in the unsatisfiable core [2024-05-12 12:27:28,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 12:27:28,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:27:28,978 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 12:27:34,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:27:34,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829436684] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 12:27:34,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 12:27:34,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2024-05-12 12:27:34,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076239703] [2024-05-12 12:27:34,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 12:27:34,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-05-12 12:27:34,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:27:34,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-05-12 12:27:34,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-05-12 12:27:34,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-05-12 12:27:34,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 60 transitions, 166 flow. Second operand has 14 states, 14 states have (on average 18.928571428571427) internal successors, (265), 14 states have internal predecessors, (265), 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-05-12 12:27:34,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:27:34,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-05-12 12:27:34,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:27:38,596 INFO L124 PetriNetUnfolderBase]: 6633/10114 cut-off events. [2024-05-12 12:27:38,597 INFO L125 PetriNetUnfolderBase]: For 1114/1114 co-relation queries the response was YES. [2024-05-12 12:27:38,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20829 conditions, 10114 events. 6633/10114 cut-off events. For 1114/1114 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 71297 event pairs, 3109 based on Foata normal form. 898/10748 useless extension candidates. Maximal degree in co-relation 10490. Up to 3579 conditions per place. [2024-05-12 12:27:38,650 INFO L140 encePairwiseOnDemand]: 46/59 looper letters, 143 selfloop transitions, 19 changer transitions 0/175 dead transitions. [2024-05-12 12:27:38,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 175 transitions, 767 flow [2024-05-12 12:27:38,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 12:27:38,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 12:27:38,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 387 transitions. [2024-05-12 12:27:38,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5466101694915254 [2024-05-12 12:27:38,656 INFO L175 Difference]: Start difference. First operand has 59 places, 60 transitions, 166 flow. Second operand 12 states and 387 transitions. [2024-05-12 12:27:38,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 175 transitions, 767 flow [2024-05-12 12:27:38,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 175 transitions, 759 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-05-12 12:27:38,660 INFO L231 Difference]: Finished difference. Result has 68 places, 67 transitions, 246 flow [2024-05-12 12:27:38,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=246, PETRI_PLACES=68, PETRI_TRANSITIONS=67} [2024-05-12 12:27:38,661 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2024-05-12 12:27:38,661 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 67 transitions, 246 flow [2024-05-12 12:27:38,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.928571428571427) internal successors, (265), 14 states have internal predecessors, (265), 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-05-12 12:27:38,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:27:38,662 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, 1, 1, 1] [2024-05-12 12:27:38,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-05-12 12:27:38,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:27:38,876 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:27:38,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:27:38,877 INFO L85 PathProgramCache]: Analyzing trace with hash 855158234, now seen corresponding path program 1 times [2024-05-12 12:27:38,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:27:38,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949058421] [2024-05-12 12:27:38,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:27:38,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:27:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:27:38,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:27:38,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:27:38,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949058421] [2024-05-12 12:27:38,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949058421] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:27:38,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:27:38,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 12:27:38,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554310881] [2024-05-12 12:27:38,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:27:38,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:27:38,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:27:38,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:27:38,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:27:38,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 59 [2024-05-12 12:27:38,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-05-12 12:27:38,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:27:38,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 59 [2024-05-12 12:27:38,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:27:40,319 INFO L124 PetriNetUnfolderBase]: 10771/16512 cut-off events. [2024-05-12 12:27:40,320 INFO L125 PetriNetUnfolderBase]: For 10293/10309 co-relation queries the response was YES. [2024-05-12 12:27:40,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37957 conditions, 16512 events. 10771/16512 cut-off events. For 10293/10309 co-relation queries the response was YES. Maximal size of possible extension queue 982. Compared 115921 event pairs, 2527 based on Foata normal form. 8/16218 useless extension candidates. Maximal degree in co-relation 30674. Up to 9275 conditions per place. [2024-05-12 12:27:40,394 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 79 selfloop transitions, 3 changer transitions 1/96 dead transitions. [2024-05-12 12:27:40,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 96 transitions, 517 flow [2024-05-12 12:27:40,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:27:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:27:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2024-05-12 12:27:40,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6949152542372882 [2024-05-12 12:27:40,395 INFO L175 Difference]: Start difference. First operand has 68 places, 67 transitions, 246 flow. Second operand 3 states and 123 transitions. [2024-05-12 12:27:40,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 96 transitions, 517 flow [2024-05-12 12:27:40,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 96 transitions, 486 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-05-12 12:27:40,399 INFO L231 Difference]: Finished difference. Result has 68 places, 69 transitions, 238 flow [2024-05-12 12:27:40,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=68, PETRI_TRANSITIONS=69} [2024-05-12 12:27:40,400 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2024-05-12 12:27:40,400 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 69 transitions, 238 flow [2024-05-12 12:27:40,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-05-12 12:27:40,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:27:40,400 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, 1, 1, 1, 1, 1, 1] [2024-05-12 12:27:40,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 12:27:40,400 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:27:40,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:27:40,401 INFO L85 PathProgramCache]: Analyzing trace with hash 514398058, now seen corresponding path program 1 times [2024-05-12 12:27:40,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:27:40,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169124431] [2024-05-12 12:27:40,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:27:40,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:27:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:27:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:27:40,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:27:40,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169124431] [2024-05-12 12:27:40,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169124431] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:27:40,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:27:40,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 12:27:40,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695572951] [2024-05-12 12:27:40,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:27:40,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:27:40,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:27:40,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:27:40,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:27:40,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 59 [2024-05-12 12:27:40,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 69 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-05-12 12:27:40,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:27:40,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 59 [2024-05-12 12:27:40,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:27:41,630 INFO L124 PetriNetUnfolderBase]: 8724/12890 cut-off events. [2024-05-12 12:27:41,631 INFO L125 PetriNetUnfolderBase]: For 11282/11298 co-relation queries the response was YES. [2024-05-12 12:27:41,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32290 conditions, 12890 events. 8724/12890 cut-off events. For 11282/11298 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 84363 event pairs, 3530 based on Foata normal form. 450/12892 useless extension candidates. Maximal degree in co-relation 27302. Up to 6117 conditions per place. [2024-05-12 12:27:41,698 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 85 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2024-05-12 12:27:41,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 100 transitions, 506 flow [2024-05-12 12:27:41,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:27:41,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:27:41,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2024-05-12 12:27:41,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7231638418079096 [2024-05-12 12:27:41,700 INFO L175 Difference]: Start difference. First operand has 68 places, 69 transitions, 238 flow. Second operand 3 states and 128 transitions. [2024-05-12 12:27:41,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 100 transitions, 506 flow [2024-05-12 12:27:41,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 100 transitions, 502 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 12:27:41,705 INFO L231 Difference]: Finished difference. Result has 70 places, 70 transitions, 253 flow [2024-05-12 12:27:41,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=253, PETRI_PLACES=70, PETRI_TRANSITIONS=70} [2024-05-12 12:27:41,706 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 9 predicate places. [2024-05-12 12:27:41,706 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 70 transitions, 253 flow [2024-05-12 12:27:41,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-05-12 12:27:41,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:27:41,707 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, 1, 1, 1, 1, 1, 1] [2024-05-12 12:27:41,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 12:27:41,709 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:27:41,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:27:41,710 INFO L85 PathProgramCache]: Analyzing trace with hash -82575015, now seen corresponding path program 1 times [2024-05-12 12:27:41,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:27:41,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949902813] [2024-05-12 12:27:41,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:27:41,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:27:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:27:41,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:27:41,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:27:41,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949902813] [2024-05-12 12:27:41,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949902813] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:27:41,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:27:41,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 12:27:41,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128403093] [2024-05-12 12:27:41,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:27:41,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:27:41,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:27:41,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:27:41,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:27:41,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 59 [2024-05-12 12:27:41,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 70 transitions, 253 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-05-12 12:27:41,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:27:41,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 59 [2024-05-12 12:27:41,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:27:42,733 INFO L124 PetriNetUnfolderBase]: 7357/11286 cut-off events. [2024-05-12 12:27:42,734 INFO L125 PetriNetUnfolderBase]: For 12879/12879 co-relation queries the response was YES. [2024-05-12 12:27:42,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29139 conditions, 11286 events. 7357/11286 cut-off events. For 12879/12879 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 74609 event pairs, 2042 based on Foata normal form. 244/11357 useless extension candidates. Maximal degree in co-relation 25299. Up to 6858 conditions per place. [2024-05-12 12:27:42,778 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 84 selfloop transitions, 2 changer transitions 0/99 dead transitions. [2024-05-12 12:27:42,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 99 transitions, 534 flow [2024-05-12 12:27:42,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:27:42,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:27:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2024-05-12 12:27:42,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7062146892655368 [2024-05-12 12:27:42,779 INFO L175 Difference]: Start difference. First operand has 70 places, 70 transitions, 253 flow. Second operand 3 states and 125 transitions. [2024-05-12 12:27:42,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 99 transitions, 534 flow [2024-05-12 12:27:42,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 99 transitions, 507 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-05-12 12:27:42,782 INFO L231 Difference]: Finished difference. Result has 72 places, 71 transitions, 253 flow [2024-05-12 12:27:42,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=253, PETRI_PLACES=72, PETRI_TRANSITIONS=71} [2024-05-12 12:27:42,783 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 11 predicate places. [2024-05-12 12:27:42,783 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 71 transitions, 253 flow [2024-05-12 12:27:42,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-05-12 12:27:42,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:27:42,784 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:27:42,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 12:27:42,784 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:27:42,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:27:42,784 INFO L85 PathProgramCache]: Analyzing trace with hash 553516001, now seen corresponding path program 1 times [2024-05-12 12:27:42,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:27:42,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347583540] [2024-05-12 12:27:42,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:27:42,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:27:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:27:42,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 12:27:42,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:27:42,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347583540] [2024-05-12 12:27:42,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347583540] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:27:42,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:27:42,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:27:42,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882597089] [2024-05-12 12:27:42,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:27:42,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:27:42,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:27:42,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:27:42,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:27:42,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 59 [2024-05-12 12:27:42,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 71 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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-05-12 12:27:42,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:27:42,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 59 [2024-05-12 12:27:42,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:27:43,967 INFO L124 PetriNetUnfolderBase]: 8661/12939 cut-off events. [2024-05-12 12:27:43,967 INFO L125 PetriNetUnfolderBase]: For 12703/12703 co-relation queries the response was YES. [2024-05-12 12:27:43,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33541 conditions, 12939 events. 8661/12939 cut-off events. For 12703/12703 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 88394 event pairs, 6360 based on Foata normal form. 253/12684 useless extension candidates. Maximal degree in co-relation 23913. Up to 8279 conditions per place. [2024-05-12 12:27:44,021 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 90 selfloop transitions, 3 changer transitions 0/106 dead transitions. [2024-05-12 12:27:44,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 106 transitions, 546 flow [2024-05-12 12:27:44,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:27:44,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:27:44,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2024-05-12 12:27:44,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6567796610169492 [2024-05-12 12:27:44,023 INFO L175 Difference]: Start difference. First operand has 72 places, 71 transitions, 253 flow. Second operand 4 states and 155 transitions. [2024-05-12 12:27:44,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 106 transitions, 546 flow [2024-05-12 12:27:44,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 106 transitions, 543 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 12:27:44,027 INFO L231 Difference]: Finished difference. Result has 75 places, 71 transitions, 260 flow [2024-05-12 12:27:44,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=260, PETRI_PLACES=75, PETRI_TRANSITIONS=71} [2024-05-12 12:27:44,028 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 14 predicate places. [2024-05-12 12:27:44,028 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 71 transitions, 260 flow [2024-05-12 12:27:44,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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-05-12 12:27:44,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:27:44,028 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:27:44,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 12:27:44,029 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:27:44,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:27:44,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1475903542, now seen corresponding path program 1 times [2024-05-12 12:27:44,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:27:44,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784979195] [2024-05-12 12:27:44,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:27:44,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:27:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:27:44,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 12:27:44,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:27:44,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784979195] [2024-05-12 12:27:44,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784979195] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:27:44,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:27:44,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:27:44,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314998915] [2024-05-12 12:27:44,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:27:44,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:27:44,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:27:44,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:27:44,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:27:44,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 59 [2024-05-12 12:27:44,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 260 flow. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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-05-12 12:27:44,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:27:44,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 59 [2024-05-12 12:27:44,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:27:45,227 INFO L124 PetriNetUnfolderBase]: 8603/13023 cut-off events. [2024-05-12 12:27:45,227 INFO L125 PetriNetUnfolderBase]: For 11743/11743 co-relation queries the response was YES. [2024-05-12 12:27:45,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32871 conditions, 13023 events. 8603/13023 cut-off events. For 11743/11743 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 90678 event pairs, 6569 based on Foata normal form. 260/12810 useless extension candidates. Maximal degree in co-relation 24362. Up to 10096 conditions per place. [2024-05-12 12:27:45,291 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 82 selfloop transitions, 5 changer transitions 1/101 dead transitions. [2024-05-12 12:27:45,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 101 transitions, 522 flow [2024-05-12 12:27:45,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:27:45,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:27:45,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2024-05-12 12:27:45,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6483050847457628 [2024-05-12 12:27:45,293 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 260 flow. Second operand 4 states and 153 transitions. [2024-05-12 12:27:45,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 101 transitions, 522 flow [2024-05-12 12:27:45,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 101 transitions, 506 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-05-12 12:27:45,298 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 250 flow [2024-05-12 12:27:45,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=250, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2024-05-12 12:27:45,299 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 14 predicate places. [2024-05-12 12:27:45,299 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 250 flow [2024-05-12 12:27:45,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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-05-12 12:27:45,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:27:45,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:27:45,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 12:27:45,300 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:27:45,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:27:45,300 INFO L85 PathProgramCache]: Analyzing trace with hash 386634703, now seen corresponding path program 1 times [2024-05-12 12:27:45,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:27:45,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248880635] [2024-05-12 12:27:45,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:27:45,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:27:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:27:45,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-12 12:27:45,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:27:45,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248880635] [2024-05-12 12:27:45,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248880635] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:27:45,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:27:45,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:27:45,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651600512] [2024-05-12 12:27:45,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:27:45,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:27:45,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:27:45,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:27:45,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:27:45,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-05-12 12:27:45,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 250 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:27:45,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:27:45,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-05-12 12:27:45,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:27:48,797 INFO L124 PetriNetUnfolderBase]: 23375/34934 cut-off events. [2024-05-12 12:27:48,797 INFO L125 PetriNetUnfolderBase]: For 20462/20462 co-relation queries the response was YES. [2024-05-12 12:27:48,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84836 conditions, 34934 events. 23375/34934 cut-off events. For 20462/20462 co-relation queries the response was YES. Maximal size of possible extension queue 1579. Compared 258658 event pairs, 1608 based on Foata normal form. 644/33914 useless extension candidates. Maximal degree in co-relation 65324. Up to 13573 conditions per place. [2024-05-12 12:27:49,044 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 174 selfloop transitions, 28 changer transitions 8/218 dead transitions. [2024-05-12 12:27:49,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 218 transitions, 1166 flow [2024-05-12 12:27:49,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:27:49,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:27:49,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 300 transitions. [2024-05-12 12:27:49,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.635593220338983 [2024-05-12 12:27:49,048 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 250 flow. Second operand 8 states and 300 transitions. [2024-05-12 12:27:49,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 218 transitions, 1166 flow [2024-05-12 12:27:49,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 218 transitions, 1157 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 12:27:49,056 INFO L231 Difference]: Finished difference. Result has 86 places, 90 transitions, 446 flow [2024-05-12 12:27:49,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=446, PETRI_PLACES=86, PETRI_TRANSITIONS=90} [2024-05-12 12:27:49,058 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 25 predicate places. [2024-05-12 12:27:49,058 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 90 transitions, 446 flow [2024-05-12 12:27:49,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:27:49,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:27:49,059 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:27:49,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 12:27:49,059 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:27:49,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:27:49,059 INFO L85 PathProgramCache]: Analyzing trace with hash -23201326, now seen corresponding path program 1 times [2024-05-12 12:27:49,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:27:49,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424110777] [2024-05-12 12:27:49,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:27:49,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:27:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:27:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 12:27:49,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:27:49,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424110777] [2024-05-12 12:27:49,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424110777] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 12:27:49,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953086631] [2024-05-12 12:27:49,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:27:49,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:27:49,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:27:49,361 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 12:27:49,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-12 12:27:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:27:49,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 10 conjunts are in the unsatisfiable core [2024-05-12 12:27:49,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 12:27:49,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 12:27:49,582 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 12:27:49,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 12:27:49,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953086631] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 12:27:49,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 12:27:49,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-05-12 12:27:49,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739084002] [2024-05-12 12:27:49,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 12:27:49,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-12 12:27:49,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:27:49,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-12 12:27:49,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-05-12 12:27:49,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-05-12 12:27:49,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 90 transitions, 446 flow. Second operand has 13 states, 13 states have (on average 18.923076923076923) internal successors, (246), 13 states have internal predecessors, (246), 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-05-12 12:27:49,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:27:49,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-05-12 12:27:49,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:27:57,355 INFO L124 PetriNetUnfolderBase]: 53858/74317 cut-off events. [2024-05-12 12:27:57,356 INFO L125 PetriNetUnfolderBase]: For 77322/77442 co-relation queries the response was YES. [2024-05-12 12:27:57,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208191 conditions, 74317 events. 53858/74317 cut-off events. For 77322/77442 co-relation queries the response was YES. Maximal size of possible extension queue 3350. Compared 523290 event pairs, 2654 based on Foata normal form. 120/71637 useless extension candidates. Maximal degree in co-relation 159630. Up to 9560 conditions per place. [2024-05-12 12:27:57,895 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 363 selfloop transitions, 88 changer transitions 11/473 dead transitions. [2024-05-12 12:27:57,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 473 transitions, 3161 flow [2024-05-12 12:27:57,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-12 12:27:57,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-05-12 12:27:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 592 transitions. [2024-05-12 12:27:57,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.528099910793934 [2024-05-12 12:27:57,898 INFO L175 Difference]: Start difference. First operand has 86 places, 90 transitions, 446 flow. Second operand 19 states and 592 transitions. [2024-05-12 12:27:57,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 473 transitions, 3161 flow [2024-05-12 12:27:58,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 473 transitions, 3115 flow, removed 23 selfloop flow, removed 0 redundant places. [2024-05-12 12:27:58,270 INFO L231 Difference]: Finished difference. Result has 113 places, 161 transitions, 1125 flow [2024-05-12 12:27:58,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1125, PETRI_PLACES=113, PETRI_TRANSITIONS=161} [2024-05-12 12:27:58,271 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 52 predicate places. [2024-05-12 12:27:58,271 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 161 transitions, 1125 flow [2024-05-12 12:27:58,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.923076923076923) internal successors, (246), 13 states have internal predecessors, (246), 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-05-12 12:27:58,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:27:58,271 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:27:58,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-12 12:27:58,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-05-12 12:27:58,486 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:27:58,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:27:58,486 INFO L85 PathProgramCache]: Analyzing trace with hash 180760376, now seen corresponding path program 2 times [2024-05-12 12:27:58,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:27:58,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36702254] [2024-05-12 12:27:58,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:27:58,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:27:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:27:58,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 12:27:58,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:27:58,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36702254] [2024-05-12 12:27:58,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36702254] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:27:58,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:27:58,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:27:58,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974739299] [2024-05-12 12:27:58,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:27:58,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:27:58,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:27:58,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:27:58,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:27:59,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-05-12 12:27:59,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 161 transitions, 1125 flow. Second operand has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:27:59,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:27:59,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-05-12 12:27:59,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:28:12,161 INFO L124 PetriNetUnfolderBase]: 79657/114655 cut-off events. [2024-05-12 12:28:12,161 INFO L125 PetriNetUnfolderBase]: For 271223/273215 co-relation queries the response was YES. [2024-05-12 12:28:13,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403431 conditions, 114655 events. 79657/114655 cut-off events. For 271223/273215 co-relation queries the response was YES. Maximal size of possible extension queue 4594. Compared 869010 event pairs, 8356 based on Foata normal form. 2739/115215 useless extension candidates. Maximal degree in co-relation 306682. Up to 73626 conditions per place. [2024-05-12 12:28:13,382 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 317 selfloop transitions, 55 changer transitions 17/414 dead transitions. [2024-05-12 12:28:13,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 414 transitions, 3519 flow [2024-05-12 12:28:13,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:28:13,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:28:13,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 329 transitions. [2024-05-12 12:28:13,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6195856873822976 [2024-05-12 12:28:13,384 INFO L175 Difference]: Start difference. First operand has 113 places, 161 transitions, 1125 flow. Second operand 9 states and 329 transitions. [2024-05-12 12:28:13,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 414 transitions, 3519 flow [2024-05-12 12:28:28,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 414 transitions, 3519 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-05-12 12:28:28,046 INFO L231 Difference]: Finished difference. Result has 128 places, 218 transitions, 1895 flow [2024-05-12 12:28:28,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1895, PETRI_PLACES=128, PETRI_TRANSITIONS=218} [2024-05-12 12:28:28,047 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 67 predicate places. [2024-05-12 12:28:28,047 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 218 transitions, 1895 flow [2024-05-12 12:28:28,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:28:28,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:28:28,047 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:28:28,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 12:28:28,048 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:28:28,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:28:28,048 INFO L85 PathProgramCache]: Analyzing trace with hash 86059918, now seen corresponding path program 3 times [2024-05-12 12:28:28,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:28:28,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342591614] [2024-05-12 12:28:28,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:28:28,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:28:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:28:28,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-12 12:28:28,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:28:28,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342591614] [2024-05-12 12:28:28,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342591614] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:28:28,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:28:28,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:28:28,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405453425] [2024-05-12 12:28:28,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:28:28,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:28:28,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:28:28,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:28:28,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:28:28,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-05-12 12:28:28,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 218 transitions, 1895 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:28:28,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:28:28,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-05-12 12:28:28,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand