./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.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-mult2.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-mult2.wvr.c ./goblint.2024-05-07_14-17-48.files/mutex-meet/popl20-more-buffer-mult2.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 10:57:00,444 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 10:57:00,507 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 10:57:00,511 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 10:57:00,511 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 10:57:00,544 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 10:57:00,545 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 10:57:00,545 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 10:57:00,546 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 10:57:00,548 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 10:57:00,549 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 10:57:00,549 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 10:57:00,550 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 10:57:00,550 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 10:57:00,551 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 10:57:00,551 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 10:57:00,551 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 10:57:00,551 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 10:57:00,552 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 10:57:00,552 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 10:57:00,552 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 10:57:00,553 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 10:57:00,553 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 10:57:00,553 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 10:57:00,553 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 10:57:00,553 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 10:57:00,553 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 10:57:00,553 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 10:57:00,554 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 10:57:00,554 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 10:57:00,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 10:57:00,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 10:57:00,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 10:57:00,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 10:57:00,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 10:57:00,555 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 10:57:00,555 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 10:57:00,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 10:57:00,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 10:57:00,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 10:57:00,556 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 10:57:00,556 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 10:57:00,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 10:57:00,557 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 10:57:00,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 10:57:00,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 10:57:00,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 10:57:00,784 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 10:57:00,785 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 10:57:00,786 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-mult2.wvr.yml/witness.yml [2024-05-12 10:57:00,894 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 10:57:00,895 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 10:57:00,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c [2024-05-12 10:57:01,875 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 10:57:02,058 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 10:57:02,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c [2024-05-12 10:57:02,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e7a2168c/b8e8c7133dd34c0e8aa97d916e0852b9/FLAG3eae1b863 [2024-05-12 10:57:02,079 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e7a2168c/b8e8c7133dd34c0e8aa97d916e0852b9 [2024-05-12 10:57:02,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 10:57:02,082 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 10:57:02,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 10:57:02,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 10:57:02,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 10:57:02,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 10:57:00" (1/2) ... [2024-05-12 10:57:02,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d063e2c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 10:57:02, skipping insertion in model container [2024-05-12 10:57:02,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 10:57:00" (1/2) ... [2024-05-12 10:57:02,092 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@59a68000 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 10:57:02, skipping insertion in model container [2024-05-12 10:57:02,092 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 10:57:02" (2/2) ... [2024-05-12 10:57:02,092 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d063e2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:57:02, skipping insertion in model container [2024-05-12 10:57:02,092 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 10:57:02" (2/2) ... [2024-05-12 10:57:02,093 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 10:57:02,120 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 10:57:02,121 INFO L97 edCorrectnessWitness]: Location invariant before [L142-L142] (((! 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) && (2147483648LL - (long long )i) + (long long )q1_back >= 0LL) && (2147483648LL - (long long )j) + (long long )q2_back >= 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 )q1_back >= 0LL) && (2147483647LL + (long long )i) - (long long )n1 >= 0LL) && (2147483647LL + (long long )i) - (long long )n2 >= 0LL) && (2147483647LL + (long long )j) - (long long )q2_back >= 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 10:57:02,121 INFO L97 edCorrectnessWitness]: Location invariant before [L141-L141] (((! 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) && (2147483648LL - (long long )i) + (long long )q1_back >= 0LL) && (2147483648LL - (long long )j) + (long long )q2_back >= 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 )q1_back >= 0LL) && (2147483647LL + (long long )i) - (long long )n1 >= 0LL) && (2147483647LL + (long long )i) - (long long )n2 >= 0LL) && (2147483647LL + (long long )j) - (long long )q2_back >= 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 10:57:02,121 INFO L97 edCorrectnessWitness]: Location invariant before [L140-L140] (((! 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) && (2147483648LL - (long long )i) + (long long )q1_back >= 0LL) && (2147483648LL - (long long )j) + (long long )q2_back >= 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 )q1_back >= 0LL) && (2147483647LL + (long long )i) - (long long )n1 >= 0LL) && (2147483647LL + (long long )i) - (long long )n2 >= 0LL) && (2147483647LL + (long long )j) - (long long )q2_back >= 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 10:57:02,121 INFO L97 edCorrectnessWitness]: Location invariant before [L139-L139] (((! 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) && (2147483648LL - (long long )i) + (long long )q1_back >= 0LL) && (2147483648LL - (long long )j) + (long long )q2_back >= 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 )q1_back >= 0LL) && (2147483647LL + (long long )i) - (long long )n1 >= 0LL) && (2147483647LL + (long long )i) - (long long )n2 >= 0LL) && (2147483647LL + (long long )j) - (long long )q2_back >= 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 10:57:02,122 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 10:57:02,122 INFO L106 edCorrectnessWitness]: ghost_update [L138-L138] multithreaded = 1; [2024-05-12 10:57:02,141 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 10:57:02,305 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-mult2.wvr.c[4099,4112] [2024-05-12 10:57:02,314 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 10:57:02,321 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 10:57:02,495 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-mult2.wvr.c[4099,4112] [2024-05-12 10:57:02,508 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 10:57:02,521 INFO L206 MainTranslator]: Completed translation [2024-05-12 10:57:02,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:57:02 WrapperNode [2024-05-12 10:57:02,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 10:57:02,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 10:57:02,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 10:57:02,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 10:57:02,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:57:02" (1/1) ... [2024-05-12 10:57:02,541 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:57:02" (1/1) ... [2024-05-12 10:57:02,591 INFO L138 Inliner]: procedures = 27, calls = 76, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 319 [2024-05-12 10:57:02,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 10:57:02,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 10:57:02,597 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 10:57:02,597 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 10:57:02,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:57:02" (1/1) ... [2024-05-12 10:57:02,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:57:02" (1/1) ... [2024-05-12 10:57:02,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:57:02" (1/1) ... [2024-05-12 10:57:02,639 INFO L175 MemorySlicer]: Split 16 memory accesses to 6 slices as follows [2, 2, 6, 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, 1, 2, 1, 1, 1]. [2024-05-12 10:57:02,640 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:57:02" (1/1) ... [2024-05-12 10:57:02,640 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:57:02" (1/1) ... [2024-05-12 10:57:02,650 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:57:02" (1/1) ... [2024-05-12 10:57:02,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:57:02" (1/1) ... [2024-05-12 10:57:02,656 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:57:02" (1/1) ... [2024-05-12 10:57:02,669 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:57:02" (1/1) ... [2024-05-12 10:57:02,674 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 10:57:02,674 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 10:57:02,674 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 10:57:02,675 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 10:57:02,675 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:57:02" (1/1) ... [2024-05-12 10:57:02,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 10:57:02,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 10:57:02,701 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 10:57:02,717 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 10:57:02,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 10:57:02,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 10:57:02,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 10:57:02,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 10:57:02,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 10:57:02,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-05-12 10:57:02,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-05-12 10:57:02,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-05-12 10:57:02,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-05-12 10:57:02,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-05-12 10:57:02,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-05-12 10:57:02,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-05-12 10:57:02,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-05-12 10:57:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-05-12 10:57:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-12 10:57:02,744 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-12 10:57:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-12 10:57:02,744 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-12 10:57:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-12 10:57:02,744 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-12 10:57:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-05-12 10:57:02,745 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-05-12 10:57:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 10:57:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 10:57:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 10:57:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-05-12 10:57:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-05-12 10:57:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-05-12 10:57:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 10:57:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 10:57:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-12 10:57:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 10:57:02,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 10:57:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 10:57:02,748 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 10:57:02,871 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 10:57:02,873 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 10:57:03,360 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 10:57:03,360 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 10:57:03,685 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 10:57:03,685 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-05-12 10:57:03,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 10:57:03 BoogieIcfgContainer [2024-05-12 10:57:03,686 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 10:57:03,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 10:57:03,687 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 10:57:03,690 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 10:57:03,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 10:57:00" (1/4) ... [2024-05-12 10:57:03,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f7f37b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 10:57:03, skipping insertion in model container [2024-05-12 10:57:03,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 10:57:02" (2/4) ... [2024-05-12 10:57:03,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f7f37b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 10:57:03, skipping insertion in model container [2024-05-12 10:57:03,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:57:02" (3/4) ... [2024-05-12 10:57:03,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f7f37b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 10:57:03, skipping insertion in model container [2024-05-12 10:57:03,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 10:57:03" (4/4) ... [2024-05-12 10:57:03,692 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult2.wvr.c [2024-05-12 10:57:03,705 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 10:57:03,706 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-05-12 10:57:03,706 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 10:57:03,788 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-05-12 10:57:03,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 57 transitions, 142 flow [2024-05-12 10:57:03,835 INFO L124 PetriNetUnfolderBase]: 6/53 cut-off events. [2024-05-12 10:57:03,836 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-05-12 10:57:03,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 53 events. 6/53 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2024-05-12 10:57:03,839 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 57 transitions, 142 flow [2024-05-12 10:57:03,843 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 52 transitions, 128 flow [2024-05-12 10:57:03,853 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 10:57:03,861 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;@6a8ca2ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 10:57:03,861 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-05-12 10:57:03,868 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 10:57:03,868 INFO L124 PetriNetUnfolderBase]: 2/12 cut-off events. [2024-05-12 10:57:03,868 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 10:57:03,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:57:03,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:57:03,870 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 10:57:03,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:57:03,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1984505110, now seen corresponding path program 1 times [2024-05-12 10:57:03,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:57:03,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359128086] [2024-05-12 10:57:03,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:57:03,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:57:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:57:05,669 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 10:57:05,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:57:05,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359128086] [2024-05-12 10:57:05,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359128086] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:57:05,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:57:05,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 10:57:05,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584934186] [2024-05-12 10:57:05,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:57:05,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 10:57:05,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:57:05,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 10:57:05,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 10:57:05,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 57 [2024-05-12 10:57:05,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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 10:57:05,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:57:05,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 57 [2024-05-12 10:57:05,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:57:06,357 INFO L124 PetriNetUnfolderBase]: 2275/3478 cut-off events. [2024-05-12 10:57:06,357 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2024-05-12 10:57:06,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6578 conditions, 3478 events. 2275/3478 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 18842 event pairs, 393 based on Foata normal form. 58/3317 useless extension candidates. Maximal degree in co-relation 5626. Up to 2528 conditions per place. [2024-05-12 10:57:06,383 INFO L140 encePairwiseOnDemand]: 48/57 looper letters, 61 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2024-05-12 10:57:06,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 78 transitions, 331 flow [2024-05-12 10:57:06,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 10:57:06,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 10:57:06,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2024-05-12 10:57:06,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6052631578947368 [2024-05-12 10:57:06,396 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 128 flow. Second operand 4 states and 138 transitions. [2024-05-12 10:57:06,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 78 transitions, 331 flow [2024-05-12 10:57:06,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 78 transitions, 301 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-05-12 10:57:06,408 INFO L231 Difference]: Finished difference. Result has 55 places, 54 transitions, 141 flow [2024-05-12 10:57:06,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=55, PETRI_TRANSITIONS=54} [2024-05-12 10:57:06,413 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2024-05-12 10:57:06,413 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 141 flow [2024-05-12 10:57:06,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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 10:57:06,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:57:06,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:57:06,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 10:57:06,414 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 10:57:06,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:57:06,415 INFO L85 PathProgramCache]: Analyzing trace with hash 168500368, now seen corresponding path program 1 times [2024-05-12 10:57:06,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:57:06,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811608076] [2024-05-12 10:57:06,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:57:06,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:57:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:57:06,543 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 10:57:06,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:57:06,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811608076] [2024-05-12 10:57:06,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811608076] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:57:06,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:57:06,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:57:06,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095889646] [2024-05-12 10:57:06,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:57:06,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 10:57:06,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:57:06,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 10:57:06,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 10:57:06,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 57 [2024-05-12 10:57:06,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 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 10:57:06,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:57:06,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 57 [2024-05-12 10:57:06,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:57:07,048 INFO L124 PetriNetUnfolderBase]: 2224/3407 cut-off events. [2024-05-12 10:57:07,049 INFO L125 PetriNetUnfolderBase]: For 1066/1082 co-relation queries the response was YES. [2024-05-12 10:57:07,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7728 conditions, 3407 events. 2224/3407 cut-off events. For 1066/1082 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 20131 event pairs, 1614 based on Foata normal form. 198/3512 useless extension candidates. Maximal degree in co-relation 2648. Up to 2096 conditions per place. [2024-05-12 10:57:07,069 INFO L140 encePairwiseOnDemand]: 50/57 looper letters, 67 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2024-05-12 10:57:07,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 89 transitions, 374 flow [2024-05-12 10:57:07,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:57:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:57:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2024-05-12 10:57:07,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6175438596491228 [2024-05-12 10:57:07,074 INFO L175 Difference]: Start difference. First operand has 55 places, 54 transitions, 141 flow. Second operand 5 states and 176 transitions. [2024-05-12 10:57:07,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 89 transitions, 374 flow [2024-05-12 10:57:07,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 89 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 10:57:07,077 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 178 flow [2024-05-12 10:57:07,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2024-05-12 10:57:07,078 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 1 predicate places. [2024-05-12 10:57:07,078 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 178 flow [2024-05-12 10:57:07,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 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 10:57:07,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:57:07,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:57:07,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 10:57:07,078 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 10:57:07,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:57:07,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1573733031, now seen corresponding path program 1 times [2024-05-12 10:57:07,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:57:07,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164811707] [2024-05-12 10:57:07,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:57:07,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:57:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:57:08,812 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 10:57:08,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:57:08,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164811707] [2024-05-12 10:57:08,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164811707] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 10:57:08,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313758621] [2024-05-12 10:57:08,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:57:08,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 10:57:08,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 10:57:08,814 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 10:57:08,838 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 10:57:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:57:08,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 32 conjunts are in the unsatisfiable core [2024-05-12 10:57:08,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 10:57:09,466 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 10:57:09,467 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 10:57:13,799 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 10:57:13,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313758621] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 10:57:13,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 10:57:13,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2024-05-12 10:57:13,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834038331] [2024-05-12 10:57:13,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 10:57:13,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-05-12 10:57:13,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:57:13,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-05-12 10:57:13,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-05-12 10:57:14,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 57 [2024-05-12 10:57:14,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 178 flow. Second operand has 17 states, 17 states have (on average 18.764705882352942) internal successors, (319), 17 states have internal predecessors, (319), 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 10:57:14,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:57:14,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 57 [2024-05-12 10:57:14,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:57:16,819 INFO L124 PetriNetUnfolderBase]: 3567/5581 cut-off events. [2024-05-12 10:57:16,820 INFO L125 PetriNetUnfolderBase]: For 2707/2707 co-relation queries the response was YES. [2024-05-12 10:57:16,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12676 conditions, 5581 events. 3567/5581 cut-off events. For 2707/2707 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 35446 event pairs, 1858 based on Foata normal form. 524/5973 useless extension candidates. Maximal degree in co-relation 10559. Up to 3245 conditions per place. [2024-05-12 10:57:16,854 INFO L140 encePairwiseOnDemand]: 45/57 looper letters, 139 selfloop transitions, 14 changer transitions 0/166 dead transitions. [2024-05-12 10:57:16,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 166 transitions, 762 flow [2024-05-12 10:57:16,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 10:57:16,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 10:57:16,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 354 transitions. [2024-05-12 10:57:16,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5645933014354066 [2024-05-12 10:57:16,856 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 178 flow. Second operand 11 states and 354 transitions. [2024-05-12 10:57:16,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 166 transitions, 762 flow [2024-05-12 10:57:16,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 166 transitions, 756 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-05-12 10:57:16,862 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 278 flow [2024-05-12 10:57:16,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=278, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2024-05-12 10:57:16,863 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 12 predicate places. [2024-05-12 10:57:16,864 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 278 flow [2024-05-12 10:57:16,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 18.764705882352942) internal successors, (319), 17 states have internal predecessors, (319), 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 10:57:16,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:57:16,864 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 10:57:16,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-05-12 10:57:17,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 10:57:17,076 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 10:57:17,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:57:17,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1174249186, now seen corresponding path program 1 times [2024-05-12 10:57:17,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:57:17,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830980175] [2024-05-12 10:57:17,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:57:17,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:57:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:57:17,148 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 10:57:17,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:57:17,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830980175] [2024-05-12 10:57:17,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830980175] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:57:17,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:57:17,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 10:57:17,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094971180] [2024-05-12 10:57:17,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:57:17,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 10:57:17,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:57:17,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 10:57:17,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 10:57:17,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 57 [2024-05-12 10:57:17,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 278 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 10:57:17,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:57:17,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 57 [2024-05-12 10:57:17,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:57:17,885 INFO L124 PetriNetUnfolderBase]: 4696/7566 cut-off events. [2024-05-12 10:57:17,886 INFO L125 PetriNetUnfolderBase]: For 11299/11299 co-relation queries the response was YES. [2024-05-12 10:57:17,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20350 conditions, 7566 events. 4696/7566 cut-off events. For 11299/11299 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 50714 event pairs, 1671 based on Foata normal form. 8/7406 useless extension candidates. Maximal degree in co-relation 11579. Up to 3319 conditions per place. [2024-05-12 10:57:17,931 INFO L140 encePairwiseOnDemand]: 53/57 looper letters, 72 selfloop transitions, 3 changer transitions 1/89 dead transitions. [2024-05-12 10:57:17,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 89 transitions, 527 flow [2024-05-12 10:57:17,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 10:57:17,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 10:57:17,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-05-12 10:57:17,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.695906432748538 [2024-05-12 10:57:17,933 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 278 flow. Second operand 3 states and 119 transitions. [2024-05-12 10:57:17,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 89 transitions, 527 flow [2024-05-12 10:57:17,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 89 transitions, 507 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-05-12 10:57:17,938 INFO L231 Difference]: Finished difference. Result has 72 places, 67 transitions, 289 flow [2024-05-12 10:57:17,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=289, PETRI_PLACES=72, PETRI_TRANSITIONS=67} [2024-05-12 10:57:17,940 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 13 predicate places. [2024-05-12 10:57:17,940 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 67 transitions, 289 flow [2024-05-12 10:57:17,940 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 10:57:17,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:57:17,943 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 10:57:17,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 10:57:17,943 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 10:57:17,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:57:17,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1893437201, now seen corresponding path program 1 times [2024-05-12 10:57:17,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:57:17,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309878525] [2024-05-12 10:57:17,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:57:17,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:57:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:57:18,037 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 10:57:18,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:57:18,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309878525] [2024-05-12 10:57:18,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309878525] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:57:18,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:57:18,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 10:57:18,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434437996] [2024-05-12 10:57:18,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:57:18,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 10:57:18,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:57:18,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 10:57:18,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 10:57:18,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 57 [2024-05-12 10:57:18,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 67 transitions, 289 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 10:57:18,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:57:18,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 57 [2024-05-12 10:57:18,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:57:18,777 INFO L124 PetriNetUnfolderBase]: 4480/7088 cut-off events. [2024-05-12 10:57:18,778 INFO L125 PetriNetUnfolderBase]: For 13590/13590 co-relation queries the response was YES. [2024-05-12 10:57:18,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19871 conditions, 7088 events. 4480/7088 cut-off events. For 13590/13590 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 45893 event pairs, 2047 based on Foata normal form. 120/7062 useless extension candidates. Maximal degree in co-relation 13398. Up to 3277 conditions per place. [2024-05-12 10:57:18,812 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 71 selfloop transitions, 7 changer transitions 0/91 dead transitions. [2024-05-12 10:57:18,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 91 transitions, 526 flow [2024-05-12 10:57:18,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 10:57:18,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 10:57:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2024-05-12 10:57:18,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7134502923976608 [2024-05-12 10:57:18,814 INFO L175 Difference]: Start difference. First operand has 72 places, 67 transitions, 289 flow. Second operand 3 states and 122 transitions. [2024-05-12 10:57:18,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 91 transitions, 526 flow [2024-05-12 10:57:18,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 91 transitions, 518 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-05-12 10:57:18,822 INFO L231 Difference]: Finished difference. Result has 74 places, 68 transitions, 315 flow [2024-05-12 10:57:18,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=315, PETRI_PLACES=74, PETRI_TRANSITIONS=68} [2024-05-12 10:57:18,824 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 15 predicate places. [2024-05-12 10:57:18,824 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 68 transitions, 315 flow [2024-05-12 10:57:18,824 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 10:57:18,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:57:18,824 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] [2024-05-12 10:57:18,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 10:57:18,825 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 10:57:18,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:57:18,825 INFO L85 PathProgramCache]: Analyzing trace with hash -298232170, now seen corresponding path program 1 times [2024-05-12 10:57:18,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:57:18,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904145023] [2024-05-12 10:57:18,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:57:18,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:57:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:57:19,048 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 10:57:19,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:57:19,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904145023] [2024-05-12 10:57:19,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904145023] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:57:19,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:57:19,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:57:19,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412853944] [2024-05-12 10:57:19,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:57:19,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 10:57:19,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:57:19,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 10:57:19,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 10:57:19,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 57 [2024-05-12 10:57:19,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 68 transitions, 315 flow. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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 10:57:19,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:57:19,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 57 [2024-05-12 10:57:19,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:57:19,853 INFO L124 PetriNetUnfolderBase]: 5116/7859 cut-off events. [2024-05-12 10:57:19,853 INFO L125 PetriNetUnfolderBase]: For 16607/16607 co-relation queries the response was YES. [2024-05-12 10:57:19,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22470 conditions, 7859 events. 5116/7859 cut-off events. For 16607/16607 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 51434 event pairs, 3708 based on Foata normal form. 318/7939 useless extension candidates. Maximal degree in co-relation 17305. Up to 5010 conditions per place. [2024-05-12 10:57:19,892 INFO L140 encePairwiseOnDemand]: 53/57 looper letters, 76 selfloop transitions, 8 changer transitions 1/98 dead transitions. [2024-05-12 10:57:19,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 98 transitions, 575 flow [2024-05-12 10:57:19,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 10:57:19,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 10:57:19,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2024-05-12 10:57:19,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6578947368421053 [2024-05-12 10:57:19,893 INFO L175 Difference]: Start difference. First operand has 74 places, 68 transitions, 315 flow. Second operand 4 states and 150 transitions. [2024-05-12 10:57:19,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 98 transitions, 575 flow [2024-05-12 10:57:19,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 98 transitions, 561 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-05-12 10:57:19,901 INFO L231 Difference]: Finished difference. Result has 76 places, 67 transitions, 321 flow [2024-05-12 10:57:19,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=321, PETRI_PLACES=76, PETRI_TRANSITIONS=67} [2024-05-12 10:57:19,904 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 17 predicate places. [2024-05-12 10:57:19,904 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 67 transitions, 321 flow [2024-05-12 10:57:19,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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 10:57:19,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:57:19,904 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 10:57:19,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 10:57:19,904 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 10:57:19,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:57:19,905 INFO L85 PathProgramCache]: Analyzing trace with hash 386264433, now seen corresponding path program 1 times [2024-05-12 10:57:19,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:57:19,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619438554] [2024-05-12 10:57:19,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:57:19,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:57:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:57:20,308 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 10:57:20,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:57:20,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619438554] [2024-05-12 10:57:20,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619438554] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:57:20,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:57:20,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:57:20,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118870435] [2024-05-12 10:57:20,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:57:20,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:57:20,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:57:20,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:57:20,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:57:20,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-05-12 10:57:20,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 67 transitions, 321 flow. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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 10:57:20,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:57:20,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-05-12 10:57:20,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:57:22,421 INFO L124 PetriNetUnfolderBase]: 13244/20701 cut-off events. [2024-05-12 10:57:22,421 INFO L125 PetriNetUnfolderBase]: For 25374/25374 co-relation queries the response was YES. [2024-05-12 10:57:22,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53167 conditions, 20701 events. 13244/20701 cut-off events. For 25374/25374 co-relation queries the response was YES. Maximal size of possible extension queue 1148. Compared 154329 event pairs, 1824 based on Foata normal form. 556/20180 useless extension candidates. Maximal degree in co-relation 39463. Up to 7399 conditions per place. [2024-05-12 10:57:22,546 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 125 selfloop transitions, 16 changer transitions 11/160 dead transitions. [2024-05-12 10:57:22,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 160 transitions, 945 flow [2024-05-12 10:57:22,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:57:22,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:57:22,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 221 transitions. [2024-05-12 10:57:22,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6461988304093568 [2024-05-12 10:57:22,548 INFO L175 Difference]: Start difference. First operand has 76 places, 67 transitions, 321 flow. Second operand 6 states and 221 transitions. [2024-05-12 10:57:22,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 160 transitions, 945 flow [2024-05-12 10:57:22,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 160 transitions, 935 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-05-12 10:57:22,578 INFO L231 Difference]: Finished difference. Result has 84 places, 78 transitions, 449 flow [2024-05-12 10:57:22,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=449, PETRI_PLACES=84, PETRI_TRANSITIONS=78} [2024-05-12 10:57:22,579 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 25 predicate places. [2024-05-12 10:57:22,579 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 78 transitions, 449 flow [2024-05-12 10:57:22,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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 10:57:22,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:57:22,579 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 10:57:22,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 10:57:22,580 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 10:57:22,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:57:22,580 INFO L85 PathProgramCache]: Analyzing trace with hash 724192537, now seen corresponding path program 1 times [2024-05-12 10:57:22,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:57:22,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653554126] [2024-05-12 10:57:22,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:57:22,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:57:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:57:23,058 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 10:57:23,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:57:23,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653554126] [2024-05-12 10:57:23,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653554126] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:57:23,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:57:23,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:57:23,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599509497] [2024-05-12 10:57:23,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:57:23,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:57:23,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:57:23,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:57:23,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:57:23,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-05-12 10:57:23,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 78 transitions, 449 flow. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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 10:57:23,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:57:23,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-05-12 10:57:23,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:57:26,042 INFO L124 PetriNetUnfolderBase]: 18090/26946 cut-off events. [2024-05-12 10:57:26,042 INFO L125 PetriNetUnfolderBase]: For 47204/47266 co-relation queries the response was YES. [2024-05-12 10:57:26,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78708 conditions, 26946 events. 18090/26946 cut-off events. For 47204/47266 co-relation queries the response was YES. Maximal size of possible extension queue 1550. Compared 196764 event pairs, 3706 based on Foata normal form. 144/26656 useless extension candidates. Maximal degree in co-relation 60364. Up to 17509 conditions per place. [2024-05-12 10:57:26,207 INFO L140 encePairwiseOnDemand]: 48/57 looper letters, 131 selfloop transitions, 59 changer transitions 19/218 dead transitions. [2024-05-12 10:57:26,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 218 transitions, 1563 flow [2024-05-12 10:57:26,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 10:57:26,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 10:57:26,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 313 transitions. [2024-05-12 10:57:26,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5491228070175439 [2024-05-12 10:57:26,209 INFO L175 Difference]: Start difference. First operand has 84 places, 78 transitions, 449 flow. Second operand 10 states and 313 transitions. [2024-05-12 10:57:26,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 218 transitions, 1563 flow [2024-05-12 10:57:26,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 218 transitions, 1485 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 10:57:26,416 INFO L231 Difference]: Finished difference. Result has 96 places, 126 transitions, 995 flow [2024-05-12 10:57:26,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=995, PETRI_PLACES=96, PETRI_TRANSITIONS=126} [2024-05-12 10:57:26,417 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 37 predicate places. [2024-05-12 10:57:26,417 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 126 transitions, 995 flow [2024-05-12 10:57:26,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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 10:57:26,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:57:26,417 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 10:57:26,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 10:57:26,418 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 10:57:26,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:57:26,418 INFO L85 PathProgramCache]: Analyzing trace with hash 2057035597, now seen corresponding path program 2 times [2024-05-12 10:57:26,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:57:26,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157228948] [2024-05-12 10:57:26,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:57:26,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:57:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:57:26,988 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 10:57:26,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:57:26,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157228948] [2024-05-12 10:57:26,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157228948] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:57:26,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:57:26,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:57:26,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118621850] [2024-05-12 10:57:26,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:57:26,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:57:26,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:57:26,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:57:26,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:57:27,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-05-12 10:57:27,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 126 transitions, 995 flow. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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 10:57:27,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:57:27,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-05-12 10:57:27,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:57:31,635 INFO L124 PetriNetUnfolderBase]: 27029/40831 cut-off events. [2024-05-12 10:57:31,635 INFO L125 PetriNetUnfolderBase]: For 94216/99481 co-relation queries the response was YES. [2024-05-12 10:57:31,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127688 conditions, 40831 events. 27029/40831 cut-off events. For 94216/99481 co-relation queries the response was YES. Maximal size of possible extension queue 2059. Compared 308308 event pairs, 4450 based on Foata normal form. 689/37562 useless extension candidates. Maximal degree in co-relation 96096. Up to 27268 conditions per place. [2024-05-12 10:57:31,915 INFO L140 encePairwiseOnDemand]: 50/57 looper letters, 121 selfloop transitions, 84 changer transitions 24/246 dead transitions. [2024-05-12 10:57:31,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 246 transitions, 2124 flow [2024-05-12 10:57:31,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:57:31,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:57:31,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2024-05-12 10:57:31,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6198830409356725 [2024-05-12 10:57:31,917 INFO L175 Difference]: Start difference. First operand has 96 places, 126 transitions, 995 flow. Second operand 6 states and 212 transitions. [2024-05-12 10:57:31,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 246 transitions, 2124 flow [2024-05-12 10:57:32,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 246 transitions, 2106 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-05-12 10:57:32,748 INFO L231 Difference]: Finished difference. Result has 105 places, 167 transitions, 1651 flow [2024-05-12 10:57:32,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=989, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1651, PETRI_PLACES=105, PETRI_TRANSITIONS=167} [2024-05-12 10:57:32,748 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 46 predicate places. [2024-05-12 10:57:32,748 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 167 transitions, 1651 flow [2024-05-12 10:57:32,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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 10:57:32,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:57:32,749 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 10:57:32,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 10:57:32,749 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 10:57:32,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:57:32,750 INFO L85 PathProgramCache]: Analyzing trace with hash -166518175, now seen corresponding path program 3 times [2024-05-12 10:57:32,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:57:32,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108421637] [2024-05-12 10:57:32,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:57:32,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:57:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:57:33,144 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 10:57:33,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:57:33,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108421637] [2024-05-12 10:57:33,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108421637] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:57:33,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:57:33,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:57:33,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623485251] [2024-05-12 10:57:33,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:57:33,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:57:33,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:57:33,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:57:33,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:57:33,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-05-12 10:57:33,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 167 transitions, 1651 flow. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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 10:57:33,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:57:33,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-05-12 10:57:33,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:57:41,037 INFO L124 PetriNetUnfolderBase]: 43196/64013 cut-off events. [2024-05-12 10:57:41,037 INFO L125 PetriNetUnfolderBase]: For 174884/180878 co-relation queries the response was YES. [2024-05-12 10:57:41,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224079 conditions, 64013 events. 43196/64013 cut-off events. For 174884/180878 co-relation queries the response was YES. Maximal size of possible extension queue 2880. Compared 488809 event pairs, 8096 based on Foata normal form. 2202/64585 useless extension candidates. Maximal degree in co-relation 181460. Up to 31456 conditions per place. [2024-05-12 10:57:41,613 INFO L140 encePairwiseOnDemand]: 47/57 looper letters, 191 selfloop transitions, 304 changer transitions 15/527 dead transitions. [2024-05-12 10:57:41,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 527 transitions, 6272 flow [2024-05-12 10:57:41,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 10:57:41,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 10:57:41,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 318 transitions. [2024-05-12 10:57:41,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6198830409356725 [2024-05-12 10:57:41,615 INFO L175 Difference]: Start difference. First operand has 105 places, 167 transitions, 1651 flow. Second operand 9 states and 318 transitions. [2024-05-12 10:57:41,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 527 transitions, 6272 flow [2024-05-12 10:57:42,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 527 transitions, 6013 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 10:57:42,029 INFO L231 Difference]: Finished difference. Result has 119 places, 389 transitions, 5483 flow [2024-05-12 10:57:42,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1570, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5483, PETRI_PLACES=119, PETRI_TRANSITIONS=389} [2024-05-12 10:57:42,030 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 60 predicate places. [2024-05-12 10:57:42,030 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 389 transitions, 5483 flow [2024-05-12 10:57:42,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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 10:57:42,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:57:42,031 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 10:57:42,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 10:57:42,031 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 10:57:42,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:57:42,032 INFO L85 PathProgramCache]: Analyzing trace with hash -214098283, now seen corresponding path program 4 times [2024-05-12 10:57:42,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:57:42,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728911512] [2024-05-12 10:57:42,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:57:42,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:57:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:57:42,375 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 10:57:42,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:57:42,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728911512] [2024-05-12 10:57:42,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728911512] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:57:42,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:57:42,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 10:57:42,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309789714] [2024-05-12 10:57:42,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:57:42,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 10:57:42,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:57:42,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 10:57:42,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-05-12 10:57:42,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-05-12 10:57:42,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 389 transitions, 5483 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 10:57:42,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:57:42,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-05-12 10:57:42,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand