./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/36-apron_17-traces-rpb-litmus_unknown_1_neg.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/36-apron_17-traces-rpb-litmus_unknown_1_neg.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cb09d658 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/goblint-regression/36-apron_17-traces-rpb-litmus_unknown_1_neg.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/36-apron_17-traces-rpb-litmus_unknown_1_neg.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-cb09d65-m [2024-01-27 23:29:32,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 23:29:32,791 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 23:29:32,797 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 23:29:32,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 23:29:32,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 23:29:32,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 23:29:32,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 23:29:32,829 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 23:29:32,833 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 23:29:32,833 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 23:29:32,833 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 23:29:32,834 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 23:29:32,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 23:29:32,835 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 23:29:32,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 23:29:32,836 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 23:29:32,836 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 23:29:32,837 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 23:29:32,837 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 23:29:32,837 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 23:29:32,837 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 23:29:32,838 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 23:29:32,838 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 23:29:32,838 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 23:29:32,838 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 23:29:32,839 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 23:29:32,839 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 23:29:32,840 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 23:29:32,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 23:29:32,841 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 23:29:32,841 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 23:29:32,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 23:29:32,841 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 23:29:32,842 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 23:29:32,842 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 23:29:32,842 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 23:29:32,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 23:29:32,842 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 23:29:32,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 23:29:32,843 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 23:29:32,843 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 23:29:32,843 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 23:29:32,843 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-01-27 23:29:33,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 23:29:33,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 23:29:33,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 23:29:33,159 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-27 23:29:33,160 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-27 23:29:33,161 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/36-apron_17-traces-rpb-litmus_unknown_1_neg.yml/witness.yml [2024-01-27 23:29:33,339 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 23:29:33,340 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 23:29:33,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/36-apron_17-traces-rpb-litmus_unknown_1_neg.i [2024-01-27 23:29:34,446 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 23:29:34,705 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 23:29:34,706 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_17-traces-rpb-litmus_unknown_1_neg.i [2024-01-27 23:29:34,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bc8a988a/452c59c0559049c6852f1b01af470e1e/FLAGb7c6cbc31 [2024-01-27 23:29:34,738 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bc8a988a/452c59c0559049c6852f1b01af470e1e [2024-01-27 23:29:34,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 23:29:34,740 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-27 23:29:34,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 23:29:34,743 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 23:29:34,748 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 23:29:34,748 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:29:33" (1/2) ... [2024-01-27 23:29:34,749 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fffe322 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:29:34, skipping insertion in model container [2024-01-27 23:29:34,749 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:29:33" (1/2) ... [2024-01-27 23:29:34,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@250610a9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:29:34, skipping insertion in model container [2024-01-27 23:29:34,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:29:34" (2/2) ... [2024-01-27 23:29:34,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fffe322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:29:34, skipping insertion in model container [2024-01-27 23:29:34,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:29:34" (2/2) ... [2024-01-27 23:29:34,753 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-27 23:29:34,860 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-27 23:29:34,861 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] (unsigned long )arg == 0UL [2024-01-27 23:29:34,862 INFO L98 nessWitnessExtractor]: Location invariant before [L705-L705] 17 <= g [2024-01-27 23:29:34,862 INFO L98 nessWitnessExtractor]: Location invariant before [L705-L705] g <= 42 [2024-01-27 23:29:34,862 INFO L98 nessWitnessExtractor]: Location invariant before [L705-L705] g <= 127 [2024-01-27 23:29:34,863 INFO L98 nessWitnessExtractor]: Location invariant before [L705-L705] g % 25 == 17 [2024-01-27 23:29:34,863 INFO L98 nessWitnessExtractor]: Location invariant before [L705-L705] 0 <= g [2024-01-27 23:29:34,863 INFO L98 nessWitnessExtractor]: Location invariant before [L705-L705] g != 0 [2024-01-27 23:29:34,863 INFO L98 nessWitnessExtractor]: Location invariant before [L705-L705] g == 17 || g == 42 [2024-01-27 23:29:34,863 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] g == 17 || g == 42 [2024-01-27 23:29:34,863 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] g <= 42 [2024-01-27 23:29:34,864 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] g != 0 [2024-01-27 23:29:34,864 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] 17 <= g [2024-01-27 23:29:34,864 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] g <= 127 [2024-01-27 23:29:34,864 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] g % 25 == 17 [2024-01-27 23:29:34,864 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] 0 <= g [2024-01-27 23:29:34,864 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] 0 <= g [2024-01-27 23:29:34,865 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g <= 42 [2024-01-27 23:29:34,865 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g <= 127 [2024-01-27 23:29:34,865 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g % 25 == 17 [2024-01-27 23:29:34,865 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] 17 <= g [2024-01-27 23:29:34,865 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g % 25 == 17 [2024-01-27 23:29:34,866 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g <= 127 [2024-01-27 23:29:34,866 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g <= 42 [2024-01-27 23:29:34,866 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g != 0 [2024-01-27 23:29:34,867 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g <= 127 [2024-01-27 23:29:34,867 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g == 17 || g == 42 [2024-01-27 23:29:34,867 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] 17 <= g [2024-01-27 23:29:34,867 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g == 17 || g == 42 [2024-01-27 23:29:34,867 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] 0 <= g [2024-01-27 23:29:34,867 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g != 0 [2024-01-27 23:29:34,868 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] 17 <= g [2024-01-27 23:29:34,868 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g != 0 [2024-01-27 23:29:34,868 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] 0 <= g [2024-01-27 23:29:34,868 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g == 17 || g == 42 [2024-01-27 23:29:34,868 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g % 25 == 17 [2024-01-27 23:29:34,869 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g <= 42 [2024-01-27 23:29:34,869 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L704] 0 <= g [2024-01-27 23:29:34,869 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L704] g <= 127 [2024-01-27 23:29:34,870 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L704] g != 0 [2024-01-27 23:29:34,871 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L704] g <= 42 [2024-01-27 23:29:34,871 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L704] g == 17 || g == 42 [2024-01-27 23:29:34,871 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L704] 17 <= g [2024-01-27 23:29:34,871 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L704] g % 25 == 17 [2024-01-27 23:29:34,871 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] g != 0 [2024-01-27 23:29:34,871 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] 0 <= g [2024-01-27 23:29:34,872 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] g <= 42 [2024-01-27 23:29:34,872 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] t == 17 || t == 42 [2024-01-27 23:29:34,872 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] 0 <= t [2024-01-27 23:29:34,873 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] t <= 127 [2024-01-27 23:29:34,873 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] g == 17 || g == 42 [2024-01-27 23:29:34,873 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] g % 25 == 17 [2024-01-27 23:29:34,873 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] t != 0 [2024-01-27 23:29:34,873 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] 17 <= t [2024-01-27 23:29:34,874 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] 17 <= g [2024-01-27 23:29:34,874 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] t <= 42 [2024-01-27 23:29:34,875 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] g <= 127 [2024-01-27 23:29:34,875 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] t % 25 == 17 [2024-01-27 23:29:34,875 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] g <= 127 [2024-01-27 23:29:34,876 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] (unsigned long )arg == 0UL [2024-01-27 23:29:34,876 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] 0 <= g [2024-01-27 23:29:34,876 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] g <= 42 [2024-01-27 23:29:34,876 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] g != 0 [2024-01-27 23:29:34,876 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] g == 17 || g == 42 [2024-01-27 23:29:34,876 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] g % 25 == 17 [2024-01-27 23:29:34,877 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] 17 <= g [2024-01-27 23:29:34,877 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] (unsigned long )arg == 0UL [2024-01-27 23:29:34,877 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] g == 42 [2024-01-27 23:29:34,877 INFO L98 nessWitnessExtractor]: Location invariant before [L703-L703] g == 17 [2024-01-27 23:29:34,877 INFO L98 nessWitnessExtractor]: Location invariant before [L703-L703] r != 0 [2024-01-27 23:29:34,877 INFO L98 nessWitnessExtractor]: Location invariant before [L694-L694] g == 42 [2024-01-27 23:29:34,877 INFO L98 nessWitnessExtractor]: Location invariant before [L689-L689] g == 42 [2024-01-27 23:29:34,878 INFO L98 nessWitnessExtractor]: Location invariant before [L689-L689] (unsigned long )arg == 0UL [2024-01-27 23:29:34,878 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] g != 0 [2024-01-27 23:29:34,878 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] g <= 42 [2024-01-27 23:29:34,878 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] g == 17 || g == 42 [2024-01-27 23:29:34,878 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] t % 25 == 17 [2024-01-27 23:29:34,878 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] t <= 127 [2024-01-27 23:29:34,879 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] 0 <= g [2024-01-27 23:29:34,879 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] 17 <= g [2024-01-27 23:29:34,879 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] t == 17 || t == 42 [2024-01-27 23:29:34,879 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] g <= 127 [2024-01-27 23:29:34,879 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] 17 <= t [2024-01-27 23:29:34,879 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] 0 <= t [2024-01-27 23:29:34,879 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] t <= 42 [2024-01-27 23:29:34,880 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] g % 25 == 17 [2024-01-27 23:29:34,880 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] t != 0 [2024-01-27 23:29:34,880 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] 17 <= g [2024-01-27 23:29:34,880 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] g % 25 == 17 [2024-01-27 23:29:34,880 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] g <= 42 [2024-01-27 23:29:34,880 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] (unsigned long )arg == 0UL [2024-01-27 23:29:34,881 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] g <= 127 [2024-01-27 23:29:34,881 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] 0 <= g [2024-01-27 23:29:34,881 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] g != 0 [2024-01-27 23:29:34,881 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] g == 17 || g == 42 [2024-01-27 23:29:34,881 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] t != 0 [2024-01-27 23:29:34,881 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] t <= 42 [2024-01-27 23:29:34,881 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] t % 25 == 17 [2024-01-27 23:29:34,882 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] t == 17 || t == 42 [2024-01-27 23:29:34,882 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] 0 <= t [2024-01-27 23:29:34,883 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] 17 <= t [2024-01-27 23:29:34,883 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] t <= 127 [2024-01-27 23:29:34,883 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L22] g == 42 [2024-01-27 23:29:34,883 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] g == 42 [2024-01-27 23:29:34,883 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] (unsigned long )arg == 0UL [2024-01-27 23:29:34,884 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] t != 0 [2024-01-27 23:29:34,884 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] t == 17 || t == 42 [2024-01-27 23:29:34,884 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] t <= 127 [2024-01-27 23:29:34,884 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] t % 25 == 17 [2024-01-27 23:29:34,885 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] g <= 127 [2024-01-27 23:29:34,886 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] g != 0 [2024-01-27 23:29:34,886 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] 17 <= t [2024-01-27 23:29:34,886 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] 0 <= t [2024-01-27 23:29:34,886 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] t <= 42 [2024-01-27 23:29:34,887 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] g % 25 == 17 [2024-01-27 23:29:34,887 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] 0 <= g [2024-01-27 23:29:34,887 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] 17 <= g [2024-01-27 23:29:34,888 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] g == 17 || g == 42 [2024-01-27 23:29:34,888 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] g <= 42 [2024-01-27 23:29:34,888 INFO L98 nessWitnessExtractor]: Location invariant before [L702-L702] r != 0 [2024-01-27 23:29:34,888 INFO L98 nessWitnessExtractor]: Location invariant before [L702-L702] g == 17 [2024-01-27 23:29:34,888 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] 0 <= g [2024-01-27 23:29:34,888 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] g != 0 [2024-01-27 23:29:34,888 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] 17 <= g [2024-01-27 23:29:34,889 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] g <= 42 [2024-01-27 23:29:34,889 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] r != 0 [2024-01-27 23:29:34,889 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] g == 17 || g == 42 [2024-01-27 23:29:34,889 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] g <= 127 [2024-01-27 23:29:34,889 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] g % 25 == 17 [2024-01-27 23:29:34,933 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 23:29:35,108 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_17-traces-rpb-litmus_unknown_1_neg.i[1098,1111] [2024-01-27 23:29:35,222 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 23:29:35,234 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 23:29:35,244 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_17-traces-rpb-litmus_unknown_1_neg.i[1098,1111] [2024-01-27 23:29:35,245 WARN L424 MainDispatcher]: Unable to annotate void __VERIFIER_assert(int cond) { if(!(cond)) { ERROR: {reach_error();abort();} } } with a witness entry [2024-01-27 23:29:35,245 WARN L424 MainDispatcher]: Unable to annotate typedef unsigned short int __u_short; with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-27 23:29:35,374 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 23:29:35,427 INFO L206 MainTranslator]: Completed translation [2024-01-27 23:29:35,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:29:35 WrapperNode [2024-01-27 23:29:35,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 23:29:35,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 23:29:35,429 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 23:29:35,429 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 23:29:35,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:29:35" (1/1) ... [2024-01-27 23:29:35,461 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:29:35" (1/1) ... [2024-01-27 23:29:35,508 INFO L138 Inliner]: procedures = 164, calls = 34, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 152 [2024-01-27 23:29:35,518 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 23:29:35,519 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 23:29:35,519 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 23:29:35,519 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 23:29:35,529 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:29:35" (1/1) ... [2024-01-27 23:29:35,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:29:35" (1/1) ... [2024-01-27 23:29:35,550 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:29:35" (1/1) ... [2024-01-27 23:29:35,563 INFO L175 MemorySlicer]: Split 13 memory accesses to 4 slices as follows [2, 5, 5, 1]. 38 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 1]. [2024-01-27 23:29:35,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:29:35" (1/1) ... [2024-01-27 23:29:35,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:29:35" (1/1) ... [2024-01-27 23:29:35,579 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:29:35" (1/1) ... [2024-01-27 23:29:35,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:29:35" (1/1) ... [2024-01-27 23:29:35,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:29:35" (1/1) ... [2024-01-27 23:29:35,596 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:29:35" (1/1) ... [2024-01-27 23:29:35,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 23:29:35,605 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 23:29:35,605 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 23:29:35,606 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 23:29:35,606 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:29:35" (1/1) ... [2024-01-27 23:29:35,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 23:29:35,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 23:29:35,666 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-01-27 23:29:35,727 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-01-27 23:29:35,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 23:29:35,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 23:29:35,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 23:29:35,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 23:29:35,765 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-27 23:29:35,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 23:29:35,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 23:29:35,765 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-01-27 23:29:35,765 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-01-27 23:29:35,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 23:29:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 23:29:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 23:29:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 23:29:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 23:29:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-27 23:29:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 23:29:35,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 23:29:35,778 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 23:29:35,904 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 23:29:35,905 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 23:29:36,225 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 23:29:36,225 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 23:29:36,299 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 23:29:36,300 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 23:29:36,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:29:36 BoogieIcfgContainer [2024-01-27 23:29:36,300 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 23:29:36,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 23:29:36,302 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 23:29:36,305 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 23:29:36,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:29:33" (1/4) ... [2024-01-27 23:29:36,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b2b59e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 11:29:36, skipping insertion in model container [2024-01-27 23:29:36,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 11:29:34" (2/4) ... [2024-01-27 23:29:36,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b2b59e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:29:36, skipping insertion in model container [2024-01-27 23:29:36,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:29:35" (3/4) ... [2024-01-27 23:29:36,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b2b59e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:29:36, skipping insertion in model container [2024-01-27 23:29:36,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:29:36" (4/4) ... [2024-01-27 23:29:36,307 INFO L112 eAbstractionObserver]: Analyzing ICFG 36-apron_17-traces-rpb-litmus_unknown_1_neg.i [2024-01-27 23:29:36,323 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 23:29:36,323 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 107 error locations. [2024-01-27 23:29:36,323 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 23:29:36,386 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-27 23:29:36,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 246 places, 244 transitions, 492 flow [2024-01-27 23:29:36,511 INFO L124 PetriNetUnfolderBase]: 2/243 cut-off events. [2024-01-27 23:29:36,511 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 23:29:36,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 243 events. 2/243 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 461 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 237. Up to 2 conditions per place. [2024-01-27 23:29:36,517 INFO L82 GeneralOperation]: Start removeDead. Operand has 246 places, 244 transitions, 492 flow [2024-01-27 23:29:36,526 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 245 places, 243 transitions, 489 flow [2024-01-27 23:29:36,541 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 23:29:36,548 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;@dff8591, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 23:29:36,548 INFO L358 AbstractCegarLoop]: Starting to check reachability of 130 error locations. [2024-01-27 23:29:36,551 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 23:29:36,551 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-27 23:29:36,551 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 23:29:36,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:29:36,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-27 23:29:36,552 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-27 23:29:36,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:29:36,558 INFO L85 PathProgramCache]: Analyzing trace with hash 18327, now seen corresponding path program 1 times [2024-01-27 23:29:36,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:29:36,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646551354] [2024-01-27 23:29:36,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:29:36,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:29:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:29:36,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:29:36,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:29:36,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646551354] [2024-01-27 23:29:36,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646551354] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:29:36,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:29:36,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:29:36,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839123925] [2024-01-27 23:29:36,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:29:36,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:29:36,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:29:36,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:29:36,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:29:37,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 244 [2024-01-27 23:29:37,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 243 transitions, 489 flow. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 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-01-27 23:29:37,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:29:37,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 244 [2024-01-27 23:29:37,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:29:37,725 INFO L124 PetriNetUnfolderBase]: 977/4563 cut-off events. [2024-01-27 23:29:37,725 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 23:29:37,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6811 conditions, 4563 events. 977/4563 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 43622 event pairs, 680 based on Foata normal form. 475/3988 useless extension candidates. Maximal degree in co-relation 6798. Up to 1779 conditions per place. [2024-01-27 23:29:37,753 INFO L140 encePairwiseOnDemand]: 169/244 looper letters, 81 selfloop transitions, 5 changer transitions 0/235 dead transitions. [2024-01-27 23:29:37,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 235 transitions, 645 flow [2024-01-27 23:29:37,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:29:37,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:29:37,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 607 transitions. [2024-01-27 23:29:37,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8292349726775956 [2024-01-27 23:29:37,774 INFO L175 Difference]: Start difference. First operand has 245 places, 243 transitions, 489 flow. Second operand 3 states and 607 transitions. [2024-01-27 23:29:37,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 235 transitions, 645 flow [2024-01-27 23:29:37,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 235 transitions, 644 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 23:29:37,783 INFO L231 Difference]: Finished difference. Result has 225 places, 222 transitions, 564 flow [2024-01-27 23:29:37,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=225, PETRI_TRANSITIONS=222} [2024-01-27 23:29:37,788 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -20 predicate places. [2024-01-27 23:29:37,789 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 222 transitions, 564 flow [2024-01-27 23:29:37,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 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-01-27 23:29:37,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:29:37,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-27 23:29:37,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 23:29:37,790 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-27 23:29:37,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:29:37,791 INFO L85 PathProgramCache]: Analyzing trace with hash -238179078, now seen corresponding path program 1 times [2024-01-27 23:29:37,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:29:37,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286593628] [2024-01-27 23:29:37,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:29:37,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:29:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:29:38,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:29:38,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:29:38,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286593628] [2024-01-27 23:29:38,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286593628] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:29:38,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:29:38,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 23:29:38,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991118878] [2024-01-27 23:29:38,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:29:38,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 23:29:38,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:29:38,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 23:29:38,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 23:29:38,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 244 [2024-01-27 23:29:38,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 222 transitions, 564 flow. Second operand has 4 states, 4 states have (on average 215.5) internal successors, (862), 4 states have internal predecessors, (862), 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-01-27 23:29:38,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:29:38,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 244 [2024-01-27 23:29:38,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:29:38,672 INFO L124 PetriNetUnfolderBase]: 803/4697 cut-off events. [2024-01-27 23:29:38,673 INFO L125 PetriNetUnfolderBase]: For 215/215 co-relation queries the response was YES. [2024-01-27 23:29:38,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6863 conditions, 4697 events. 803/4697 cut-off events. For 215/215 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 46837 event pairs, 687 based on Foata normal form. 161/3790 useless extension candidates. Maximal degree in co-relation 6847. Up to 1279 conditions per place. [2024-01-27 23:29:38,694 INFO L140 encePairwiseOnDemand]: 236/244 looper letters, 34 selfloop transitions, 2 changer transitions 0/228 dead transitions. [2024-01-27 23:29:38,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 228 transitions, 652 flow [2024-01-27 23:29:38,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 23:29:38,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 23:29:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 897 transitions. [2024-01-27 23:29:38,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9190573770491803 [2024-01-27 23:29:38,697 INFO L175 Difference]: Start difference. First operand has 225 places, 222 transitions, 564 flow. Second operand 4 states and 897 transitions. [2024-01-27 23:29:38,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 228 transitions, 652 flow [2024-01-27 23:29:38,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 228 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:29:38,728 INFO L231 Difference]: Finished difference. Result has 220 places, 216 transitions, 546 flow [2024-01-27 23:29:38,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=546, PETRI_PLACES=220, PETRI_TRANSITIONS=216} [2024-01-27 23:29:38,729 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -25 predicate places. [2024-01-27 23:29:38,729 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 216 transitions, 546 flow [2024-01-27 23:29:38,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 215.5) internal successors, (862), 4 states have internal predecessors, (862), 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-01-27 23:29:38,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:29:38,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:29:38,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 23:29:38,736 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-27 23:29:38,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:29:38,737 INFO L85 PathProgramCache]: Analyzing trace with hash -567970188, now seen corresponding path program 1 times [2024-01-27 23:29:38,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:29:38,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376217347] [2024-01-27 23:29:38,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:29:38,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:29:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:29:38,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:29:38,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:29:38,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376217347] [2024-01-27 23:29:38,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376217347] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:29:38,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:29:38,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 23:29:38,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633225336] [2024-01-27 23:29:38,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:29:38,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:29:38,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:29:38,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:29:38,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:29:38,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 244 [2024-01-27 23:29:38,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 216 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 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-01-27 23:29:38,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:29:38,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 244 [2024-01-27 23:29:38,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:29:39,266 INFO L124 PetriNetUnfolderBase]: 721/3902 cut-off events. [2024-01-27 23:29:39,267 INFO L125 PetriNetUnfolderBase]: For 62/108 co-relation queries the response was YES. [2024-01-27 23:29:39,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5887 conditions, 3902 events. 721/3902 cut-off events. For 62/108 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 36782 event pairs, 581 based on Foata normal form. 0/2892 useless extension candidates. Maximal degree in co-relation 5871. Up to 1256 conditions per place. [2024-01-27 23:29:39,290 INFO L140 encePairwiseOnDemand]: 239/244 looper letters, 37 selfloop transitions, 2 changer transitions 2/226 dead transitions. [2024-01-27 23:29:39,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 226 transitions, 652 flow [2024-01-27 23:29:39,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:29:39,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:29:39,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 681 transitions. [2024-01-27 23:29:39,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.930327868852459 [2024-01-27 23:29:39,294 INFO L175 Difference]: Start difference. First operand has 220 places, 216 transitions, 546 flow. Second operand 3 states and 681 transitions. [2024-01-27 23:29:39,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 226 transitions, 652 flow [2024-01-27 23:29:39,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 226 transitions, 649 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:29:39,299 INFO L231 Difference]: Finished difference. Result has 217 places, 213 transitions, 541 flow [2024-01-27 23:29:39,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=541, PETRI_PLACES=217, PETRI_TRANSITIONS=213} [2024-01-27 23:29:39,300 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -28 predicate places. [2024-01-27 23:29:39,300 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 213 transitions, 541 flow [2024-01-27 23:29:39,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 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-01-27 23:29:39,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:29:39,301 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] [2024-01-27 23:29:39,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 23:29:39,302 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-27 23:29:39,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:29:39,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1877158657, now seen corresponding path program 1 times [2024-01-27 23:29:39,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:29:39,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705450739] [2024-01-27 23:29:39,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:29:39,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:29:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:29:39,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:29:39,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:29:39,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705450739] [2024-01-27 23:29:39,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705450739] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:29:39,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:29:39,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 23:29:39,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551802953] [2024-01-27 23:29:39,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:29:39,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:29:39,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:29:39,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:29:39,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:29:39,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 244 [2024-01-27 23:29:39,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 213 transitions, 541 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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-01-27 23:29:39,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:29:39,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 244 [2024-01-27 23:29:39,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:29:39,760 INFO L124 PetriNetUnfolderBase]: 181/1978 cut-off events. [2024-01-27 23:29:39,760 INFO L125 PetriNetUnfolderBase]: For 515/535 co-relation queries the response was YES. [2024-01-27 23:29:39,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2549 conditions, 1978 events. 181/1978 cut-off events. For 515/535 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 14816 event pairs, 108 based on Foata normal form. 437/1957 useless extension candidates. Maximal degree in co-relation 2534. Up to 285 conditions per place. [2024-01-27 23:29:39,768 INFO L140 encePairwiseOnDemand]: 196/244 looper letters, 39 selfloop transitions, 2 changer transitions 1/182 dead transitions. [2024-01-27 23:29:39,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 182 transitions, 477 flow [2024-01-27 23:29:39,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:29:39,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:29:39,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 544 transitions. [2024-01-27 23:29:39,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7431693989071039 [2024-01-27 23:29:39,770 INFO L175 Difference]: Start difference. First operand has 217 places, 213 transitions, 541 flow. Second operand 3 states and 544 transitions. [2024-01-27 23:29:39,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 182 transitions, 477 flow [2024-01-27 23:29:39,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 182 transitions, 474 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 23:29:39,773 INFO L231 Difference]: Finished difference. Result has 177 places, 169 transitions, 373 flow [2024-01-27 23:29:39,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=373, PETRI_PLACES=177, PETRI_TRANSITIONS=169} [2024-01-27 23:29:39,775 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -68 predicate places. [2024-01-27 23:29:39,776 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 169 transitions, 373 flow [2024-01-27 23:29:39,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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-01-27 23:29:39,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:29:39,776 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-01-27 23:29:39,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 23:29:39,777 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-27 23:29:39,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:29:39,777 INFO L85 PathProgramCache]: Analyzing trace with hash 487059321, now seen corresponding path program 1 times [2024-01-27 23:29:39,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:29:39,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261938753] [2024-01-27 23:29:39,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:29:39,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:29:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:29:39,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:29:39,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:29:39,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261938753] [2024-01-27 23:29:39,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261938753] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:29:39,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:29:39,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 23:29:39,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838195055] [2024-01-27 23:29:39,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:29:39,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 23:29:39,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:29:39,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 23:29:39,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 23:29:40,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 244 [2024-01-27 23:29:40,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 169 transitions, 373 flow. Second operand has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 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-01-27 23:29:40,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:29:40,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 244 [2024-01-27 23:29:40,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:29:40,688 INFO L124 PetriNetUnfolderBase]: 1075/4346 cut-off events. [2024-01-27 23:29:40,689 INFO L125 PetriNetUnfolderBase]: For 412/412 co-relation queries the response was YES. [2024-01-27 23:29:40,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7166 conditions, 4346 events. 1075/4346 cut-off events. For 412/412 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 36022 event pairs, 238 based on Foata normal form. 132/4245 useless extension candidates. Maximal degree in co-relation 7150. Up to 1860 conditions per place. [2024-01-27 23:29:40,708 INFO L140 encePairwiseOnDemand]: 233/244 looper letters, 75 selfloop transitions, 3 changer transitions 0/174 dead transitions. [2024-01-27 23:29:40,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 174 transitions, 550 flow [2024-01-27 23:29:40,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 23:29:40,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 23:29:40,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 588 transitions. [2024-01-27 23:29:40,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6024590163934426 [2024-01-27 23:29:40,710 INFO L175 Difference]: Start difference. First operand has 177 places, 169 transitions, 373 flow. Second operand 4 states and 588 transitions. [2024-01-27 23:29:40,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 174 transitions, 550 flow [2024-01-27 23:29:40,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 174 transitions, 547 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 23:29:40,714 INFO L231 Difference]: Finished difference. Result has 171 places, 161 transitions, 361 flow [2024-01-27 23:29:40,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=361, PETRI_PLACES=171, PETRI_TRANSITIONS=161} [2024-01-27 23:29:40,715 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -74 predicate places. [2024-01-27 23:29:40,715 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 161 transitions, 361 flow [2024-01-27 23:29:40,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 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-01-27 23:29:40,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:29:40,716 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] [2024-01-27 23:29:40,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 23:29:40,716 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-27 23:29:40,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:29:40,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2081029810, now seen corresponding path program 1 times [2024-01-27 23:29:40,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:29:40,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502761979] [2024-01-27 23:29:40,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:29:40,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:29:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:29:40,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:29:40,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:29:40,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502761979] [2024-01-27 23:29:40,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502761979] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:29:40,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:29:40,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 23:29:40,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753177864] [2024-01-27 23:29:40,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:29:40,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 23:29:40,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:29:40,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 23:29:40,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 23:29:41,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 244 [2024-01-27 23:29:41,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 161 transitions, 361 flow. Second operand has 4 states, 4 states have (on average 154.25) internal successors, (617), 4 states have internal predecessors, (617), 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-01-27 23:29:41,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:29:41,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 244 [2024-01-27 23:29:41,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:29:41,398 INFO L124 PetriNetUnfolderBase]: 328/2603 cut-off events. [2024-01-27 23:29:41,399 INFO L125 PetriNetUnfolderBase]: For 272/277 co-relation queries the response was YES. [2024-01-27 23:29:41,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3627 conditions, 2603 events. 328/2603 cut-off events. For 272/277 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 21882 event pairs, 33 based on Foata normal form. 165/2505 useless extension candidates. Maximal degree in co-relation 3610. Up to 327 conditions per place. [2024-01-27 23:29:41,407 INFO L140 encePairwiseOnDemand]: 227/244 looper letters, 71 selfloop transitions, 4 changer transitions 2/199 dead transitions. [2024-01-27 23:29:41,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 199 transitions, 605 flow [2024-01-27 23:29:41,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 23:29:41,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 23:29:41,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 697 transitions. [2024-01-27 23:29:41,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7141393442622951 [2024-01-27 23:29:41,410 INFO L175 Difference]: Start difference. First operand has 171 places, 161 transitions, 361 flow. Second operand 4 states and 697 transitions. [2024-01-27 23:29:41,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 199 transitions, 605 flow [2024-01-27 23:29:41,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 199 transitions, 593 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 23:29:41,414 INFO L231 Difference]: Finished difference. Result has 173 places, 162 transitions, 398 flow [2024-01-27 23:29:41,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=398, PETRI_PLACES=173, PETRI_TRANSITIONS=162} [2024-01-27 23:29:41,415 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -72 predicate places. [2024-01-27 23:29:41,415 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 162 transitions, 398 flow [2024-01-27 23:29:41,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 154.25) internal successors, (617), 4 states have internal predecessors, (617), 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-01-27 23:29:41,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:29:41,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:29:41,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 23:29:41,417 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-27 23:29:41,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:29:41,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1402729063, now seen corresponding path program 1 times [2024-01-27 23:29:41,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:29:41,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6148791] [2024-01-27 23:29:41,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:29:41,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:29:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:29:41,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:29:41,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:29:41,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6148791] [2024-01-27 23:29:41,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6148791] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:29:41,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:29:41,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 23:29:41,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366532341] [2024-01-27 23:29:41,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:29:41,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 23:29:41,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:29:41,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 23:29:41,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 23:29:42,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 244 [2024-01-27 23:29:42,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 162 transitions, 398 flow. Second operand has 5 states, 5 states have (on average 124.0) internal successors, (620), 5 states have internal predecessors, (620), 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-01-27 23:29:42,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:29:42,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 244 [2024-01-27 23:29:42,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:29:42,624 INFO L124 PetriNetUnfolderBase]: 726/3240 cut-off events. [2024-01-27 23:29:42,627 INFO L125 PetriNetUnfolderBase]: For 915/922 co-relation queries the response was YES. [2024-01-27 23:29:42,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5632 conditions, 3240 events. 726/3240 cut-off events. For 915/922 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 26620 event pairs, 100 based on Foata normal form. 0/3116 useless extension candidates. Maximal degree in co-relation 5613. Up to 701 conditions per place. [2024-01-27 23:29:42,641 INFO L140 encePairwiseOnDemand]: 236/244 looper letters, 114 selfloop transitions, 4 changer transitions 4/226 dead transitions. [2024-01-27 23:29:42,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 226 transitions, 803 flow [2024-01-27 23:29:42,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 23:29:42,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 23:29:42,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 614 transitions. [2024-01-27 23:29:42,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6290983606557377 [2024-01-27 23:29:42,644 INFO L175 Difference]: Start difference. First operand has 173 places, 162 transitions, 398 flow. Second operand 4 states and 614 transitions. [2024-01-27 23:29:42,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 226 transitions, 803 flow [2024-01-27 23:29:42,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 226 transitions, 800 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 23:29:42,650 INFO L231 Difference]: Finished difference. Result has 176 places, 162 transitions, 412 flow [2024-01-27 23:29:42,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=412, PETRI_PLACES=176, PETRI_TRANSITIONS=162} [2024-01-27 23:29:42,652 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -69 predicate places. [2024-01-27 23:29:42,652 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 162 transitions, 412 flow [2024-01-27 23:29:42,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.0) internal successors, (620), 5 states have internal predecessors, (620), 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-01-27 23:29:42,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:29:42,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:29:42,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 23:29:42,653 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-27 23:29:42,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:29:42,653 INFO L85 PathProgramCache]: Analyzing trace with hash 597122083, now seen corresponding path program 1 times [2024-01-27 23:29:42,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:29:42,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24518927] [2024-01-27 23:29:42,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:29:42,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:29:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:29:42,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:29:42,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:29:42,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24518927] [2024-01-27 23:29:42,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24518927] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:29:42,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:29:42,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 23:29:42,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212190916] [2024-01-27 23:29:42,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:29:42,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 23:29:42,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:29:42,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 23:29:42,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 23:29:43,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 244 [2024-01-27 23:29:43,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 162 transitions, 412 flow. Second operand has 5 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 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-01-27 23:29:43,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:29:43,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 244 [2024-01-27 23:29:43,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:29:43,482 INFO L124 PetriNetUnfolderBase]: 602/2918 cut-off events. [2024-01-27 23:29:43,482 INFO L125 PetriNetUnfolderBase]: For 991/996 co-relation queries the response was YES. [2024-01-27 23:29:43,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5044 conditions, 2918 events. 602/2918 cut-off events. For 991/996 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 23740 event pairs, 28 based on Foata normal form. 0/2809 useless extension candidates. Maximal degree in co-relation 5023. Up to 551 conditions per place. [2024-01-27 23:29:43,493 INFO L140 encePairwiseOnDemand]: 235/244 looper letters, 109 selfloop transitions, 5 changer transitions 10/230 dead transitions. [2024-01-27 23:29:43,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 230 transitions, 843 flow [2024-01-27 23:29:43,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 23:29:43,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 23:29:43,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 808 transitions. [2024-01-27 23:29:43,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6622950819672131 [2024-01-27 23:29:43,496 INFO L175 Difference]: Start difference. First operand has 176 places, 162 transitions, 412 flow. Second operand 5 states and 808 transitions. [2024-01-27 23:29:43,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 230 transitions, 843 flow [2024-01-27 23:29:43,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 230 transitions, 836 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:29:43,503 INFO L231 Difference]: Finished difference. Result has 180 places, 163 transitions, 430 flow [2024-01-27 23:29:43,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=430, PETRI_PLACES=180, PETRI_TRANSITIONS=163} [2024-01-27 23:29:43,506 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -65 predicate places. [2024-01-27 23:29:43,506 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 163 transitions, 430 flow [2024-01-27 23:29:43,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 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-01-27 23:29:43,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:29:43,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:29:43,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 23:29:43,508 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-27 23:29:43,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:29:43,508 INFO L85 PathProgramCache]: Analyzing trace with hash -889958347, now seen corresponding path program 1 times [2024-01-27 23:29:43,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:29:43,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599684504] [2024-01-27 23:29:43,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:29:43,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:29:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:29:43,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:29:43,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:29:43,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599684504] [2024-01-27 23:29:43,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599684504] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:29:43,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:29:43,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 23:29:43,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927087197] [2024-01-27 23:29:43,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:29:43,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 23:29:43,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:29:43,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 23:29:43,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 23:29:43,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 244 [2024-01-27 23:29:43,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 163 transitions, 430 flow. Second operand has 5 states, 5 states have (on average 152.0) internal successors, (760), 5 states have internal predecessors, (760), 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-01-27 23:29:43,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:29:43,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 244 [2024-01-27 23:29:43,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:29:44,354 INFO L124 PetriNetUnfolderBase]: 357/2499 cut-off events. [2024-01-27 23:29:44,355 INFO L125 PetriNetUnfolderBase]: For 879/884 co-relation queries the response was YES. [2024-01-27 23:29:44,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4014 conditions, 2499 events. 357/2499 cut-off events. For 879/884 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 20535 event pairs, 28 based on Foata normal form. 0/2450 useless extension candidates. Maximal degree in co-relation 3991. Up to 341 conditions per place. [2024-01-27 23:29:44,363 INFO L140 encePairwiseOnDemand]: 236/244 looper letters, 68 selfloop transitions, 8 changer transitions 25/221 dead transitions. [2024-01-27 23:29:44,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 221 transitions, 797 flow [2024-01-27 23:29:44,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 23:29:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 23:29:44,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1151 transitions. [2024-01-27 23:29:44,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6738875878220141 [2024-01-27 23:29:44,367 INFO L175 Difference]: Start difference. First operand has 180 places, 163 transitions, 430 flow. Second operand 7 states and 1151 transitions. [2024-01-27 23:29:44,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 221 transitions, 797 flow [2024-01-27 23:29:44,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 221 transitions, 788 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:29:44,372 INFO L231 Difference]: Finished difference. Result has 186 places, 164 transitions, 439 flow [2024-01-27 23:29:44,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=439, PETRI_PLACES=186, PETRI_TRANSITIONS=164} [2024-01-27 23:29:44,373 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -59 predicate places. [2024-01-27 23:29:44,373 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 164 transitions, 439 flow [2024-01-27 23:29:44,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 152.0) internal successors, (760), 5 states have internal predecessors, (760), 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-01-27 23:29:44,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:29:44,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:29:44,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 23:29:44,375 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-27 23:29:44,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:29:44,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1123674416, now seen corresponding path program 1 times [2024-01-27 23:29:44,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:29:44,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404387221] [2024-01-27 23:29:44,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:29:44,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:29:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:29:44,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:29:44,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:29:44,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404387221] [2024-01-27 23:29:44,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404387221] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:29:44,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:29:44,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 23:29:44,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717783663] [2024-01-27 23:29:44,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:29:44,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 23:29:44,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:29:44,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 23:29:44,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 23:29:44,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 244 [2024-01-27 23:29:44,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 164 transitions, 439 flow. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 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-01-27 23:29:44,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:29:44,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 244 [2024-01-27 23:29:44,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:29:45,081 INFO L124 PetriNetUnfolderBase]: 755/2972 cut-off events. [2024-01-27 23:29:45,081 INFO L125 PetriNetUnfolderBase]: For 875/878 co-relation queries the response was YES. [2024-01-27 23:29:45,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5375 conditions, 2972 events. 755/2972 cut-off events. For 875/878 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 20649 event pairs, 456 based on Foata normal form. 264/3202 useless extension candidates. Maximal degree in co-relation 5350. Up to 1014 conditions per place. [2024-01-27 23:29:45,096 INFO L140 encePairwiseOnDemand]: 229/244 looper letters, 78 selfloop transitions, 3 changer transitions 0/166 dead transitions. [2024-01-27 23:29:45,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 166 transitions, 593 flow [2024-01-27 23:29:45,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 23:29:45,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 23:29:45,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 546 transitions. [2024-01-27 23:29:45,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5594262295081968 [2024-01-27 23:29:45,099 INFO L175 Difference]: Start difference. First operand has 186 places, 164 transitions, 439 flow. Second operand 4 states and 546 transitions. [2024-01-27 23:29:45,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 166 transitions, 593 flow [2024-01-27 23:29:45,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 166 transitions, 558 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-01-27 23:29:45,106 INFO L231 Difference]: Finished difference. Result has 162 places, 152 transitions, 363 flow [2024-01-27 23:29:45,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=363, PETRI_PLACES=162, PETRI_TRANSITIONS=152} [2024-01-27 23:29:45,107 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -83 predicate places. [2024-01-27 23:29:45,108 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 152 transitions, 363 flow [2024-01-27 23:29:45,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 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-01-27 23:29:45,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:29:45,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:29:45,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 23:29:45,109 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-27 23:29:45,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:29:45,109 INFO L85 PathProgramCache]: Analyzing trace with hash -281992421, now seen corresponding path program 1 times [2024-01-27 23:29:45,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:29:45,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872561027] [2024-01-27 23:29:45,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:29:45,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:29:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:29:45,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:29:45,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:29:45,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872561027] [2024-01-27 23:29:45,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872561027] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:29:45,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:29:45,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 23:29:45,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808828498] [2024-01-27 23:29:45,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:29:45,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:29:45,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:29:45,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:29:45,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:29:45,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 244 [2024-01-27 23:29:45,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 152 transitions, 363 flow. Second operand has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 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-01-27 23:29:45,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:29:45,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 244 [2024-01-27 23:29:45,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:29:45,315 INFO L124 PetriNetUnfolderBase]: 78/1019 cut-off events. [2024-01-27 23:29:45,315 INFO L125 PetriNetUnfolderBase]: For 209/211 co-relation queries the response was YES. [2024-01-27 23:29:45,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 1019 events. 78/1019 cut-off events. For 209/211 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5725 event pairs, 36 based on Foata normal form. 6/958 useless extension candidates. Maximal degree in co-relation 1370. Up to 149 conditions per place. [2024-01-27 23:29:45,319 INFO L140 encePairwiseOnDemand]: 237/244 looper letters, 34 selfloop transitions, 7 changer transitions 1/167 dead transitions. [2024-01-27 23:29:45,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 167 transitions, 495 flow [2024-01-27 23:29:45,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:29:45,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:29:45,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 703 transitions. [2024-01-27 23:29:45,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9603825136612022 [2024-01-27 23:29:45,322 INFO L175 Difference]: Start difference. First operand has 162 places, 152 transitions, 363 flow. Second operand 3 states and 703 transitions. [2024-01-27 23:29:45,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 167 transitions, 495 flow [2024-01-27 23:29:45,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 167 transitions, 483 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-01-27 23:29:45,325 INFO L231 Difference]: Finished difference. Result has 160 places, 155 transitions, 388 flow [2024-01-27 23:29:45,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=388, PETRI_PLACES=160, PETRI_TRANSITIONS=155} [2024-01-27 23:29:45,326 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -85 predicate places. [2024-01-27 23:29:45,326 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 155 transitions, 388 flow [2024-01-27 23:29:45,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 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-01-27 23:29:45,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:29:45,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:29:45,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-27 23:29:45,327 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-27 23:29:45,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:29:45,328 INFO L85 PathProgramCache]: Analyzing trace with hash 210342427, now seen corresponding path program 1 times [2024-01-27 23:29:45,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:29:45,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683402573] [2024-01-27 23:29:45,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:29:45,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:29:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:29:45,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:29:45,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:29:45,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683402573] [2024-01-27 23:29:45,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683402573] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:29:45,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:29:45,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 23:29:45,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661834340] [2024-01-27 23:29:45,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:29:45,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 23:29:45,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:29:45,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 23:29:45,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 23:29:45,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 244 [2024-01-27 23:29:45,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 155 transitions, 388 flow. Second operand has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 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-01-27 23:29:45,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:29:45,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 244 [2024-01-27 23:29:45,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:29:46,055 INFO L124 PetriNetUnfolderBase]: 108/1051 cut-off events. [2024-01-27 23:29:46,055 INFO L125 PetriNetUnfolderBase]: For 283/294 co-relation queries the response was YES. [2024-01-27 23:29:46,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1606 conditions, 1051 events. 108/1051 cut-off events. For 283/294 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5988 event pairs, 32 based on Foata normal form. 108/1129 useless extension candidates. Maximal degree in co-relation 1586. Up to 102 conditions per place. [2024-01-27 23:29:46,058 INFO L140 encePairwiseOnDemand]: 232/244 looper letters, 41 selfloop transitions, 5 changer transitions 13/170 dead transitions. [2024-01-27 23:29:46,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 170 transitions, 573 flow [2024-01-27 23:29:46,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 23:29:46,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 23:29:46,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 684 transitions. [2024-01-27 23:29:46,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5606557377049181 [2024-01-27 23:29:46,061 INFO L175 Difference]: Start difference. First operand has 160 places, 155 transitions, 388 flow. Second operand 5 states and 684 transitions. [2024-01-27 23:29:46,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 170 transitions, 573 flow [2024-01-27 23:29:46,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 170 transitions, 560 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 23:29:46,064 INFO L231 Difference]: Finished difference. Result has 155 places, 142 transitions, 357 flow [2024-01-27 23:29:46,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=357, PETRI_PLACES=155, PETRI_TRANSITIONS=142} [2024-01-27 23:29:46,065 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -90 predicate places. [2024-01-27 23:29:46,065 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 142 transitions, 357 flow [2024-01-27 23:29:46,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 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-01-27 23:29:46,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:29:46,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:29:46,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 23:29:46,067 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr20ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-27 23:29:46,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:29:46,067 INFO L85 PathProgramCache]: Analyzing trace with hash 507295103, now seen corresponding path program 1 times [2024-01-27 23:29:46,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:29:46,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999365189] [2024-01-27 23:29:46,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:29:46,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:29:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:29:46,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:29:46,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:29:46,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999365189] [2024-01-27 23:29:46,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999365189] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:29:46,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:29:46,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 23:29:46,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538290979] [2024-01-27 23:29:46,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:29:46,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 23:29:46,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:29:46,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 23:29:46,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-27 23:29:46,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 244 [2024-01-27 23:29:46,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 142 transitions, 357 flow. Second operand has 5 states, 5 states have (on average 223.4) internal successors, (1117), 5 states have internal predecessors, (1117), 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-01-27 23:29:46,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:29:46,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 244 [2024-01-27 23:29:46,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:29:46,282 INFO L124 PetriNetUnfolderBase]: 19/442 cut-off events. [2024-01-27 23:29:46,282 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2024-01-27 23:29:46,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 442 events. 19/442 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1115 event pairs, 5 based on Foata normal form. 7/443 useless extension candidates. Maximal degree in co-relation 589. Up to 58 conditions per place. [2024-01-27 23:29:46,284 INFO L140 encePairwiseOnDemand]: 239/244 looper letters, 16 selfloop transitions, 4 changer transitions 43/141 dead transitions. [2024-01-27 23:29:46,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 141 transitions, 403 flow [2024-01-27 23:29:46,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 23:29:46,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 23:29:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 911 transitions. [2024-01-27 23:29:46,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9334016393442623 [2024-01-27 23:29:46,286 INFO L175 Difference]: Start difference. First operand has 155 places, 142 transitions, 357 flow. Second operand 4 states and 911 transitions. [2024-01-27 23:29:46,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 141 transitions, 403 flow [2024-01-27 23:29:46,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 141 transitions, 369 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-01-27 23:29:46,289 INFO L231 Difference]: Finished difference. Result has 149 places, 96 transitions, 219 flow [2024-01-27 23:29:46,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=149, PETRI_TRANSITIONS=96} [2024-01-27 23:29:46,290 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -96 predicate places. [2024-01-27 23:29:46,290 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 96 transitions, 219 flow [2024-01-27 23:29:46,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 223.4) internal successors, (1117), 5 states have internal predecessors, (1117), 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-01-27 23:29:46,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:29:46,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:29:46,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-27 23:29:46,291 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-27 23:29:46,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:29:46,292 INFO L85 PathProgramCache]: Analyzing trace with hash -680047373, now seen corresponding path program 1 times [2024-01-27 23:29:46,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:29:46,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848789461] [2024-01-27 23:29:46,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:29:46,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:29:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 23:29:46,304 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 23:29:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 23:29:46,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 23:29:46,333 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 23:29:46,334 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION (129 of 130 remaining) [2024-01-27 23:29:46,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 130 remaining) [2024-01-27 23:29:46,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 130 remaining) [2024-01-27 23:29:46,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 130 remaining) [2024-01-27 23:29:46,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 130 remaining) [2024-01-27 23:29:46,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 130 remaining) [2024-01-27 23:29:46,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 130 remaining) [2024-01-27 23:29:46,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 130 remaining) [2024-01-27 23:29:46,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 130 remaining) [2024-01-27 23:29:46,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 130 remaining) [2024-01-27 23:29:46,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 130 remaining) [2024-01-27 23:29:46,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 130 remaining) [2024-01-27 23:29:46,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 130 remaining) [2024-01-27 23:29:46,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 130 remaining) [2024-01-27 23:29:46,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 130 remaining) [2024-01-27 23:29:46,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 130 remaining) [2024-01-27 23:29:46,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 130 remaining) [2024-01-27 23:29:46,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 130 remaining) [2024-01-27 23:29:46,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 130 remaining) [2024-01-27 23:29:46,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 130 remaining) [2024-01-27 23:29:46,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 130 remaining) [2024-01-27 23:29:46,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 130 remaining) [2024-01-27 23:29:46,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 130 remaining) [2024-01-27 23:29:46,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 130 remaining) [2024-01-27 23:29:46,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 130 remaining) [2024-01-27 23:29:46,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 130 remaining) [2024-01-27 23:29:46,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 130 remaining) [2024-01-27 23:29:46,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 130 remaining) [2024-01-27 23:29:46,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 130 remaining) [2024-01-27 23:29:46,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 130 remaining) [2024-01-27 23:29:46,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 130 remaining) [2024-01-27 23:29:46,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 130 remaining) [2024-01-27 23:29:46,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 130 remaining) [2024-01-27 23:29:46,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 130 remaining) [2024-01-27 23:29:46,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 130 remaining) [2024-01-27 23:29:46,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 130 remaining) [2024-01-27 23:29:46,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 130 remaining) [2024-01-27 23:29:46,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 130 remaining) [2024-01-27 23:29:46,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 130 remaining) [2024-01-27 23:29:46,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 130 remaining) [2024-01-27 23:29:46,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 130 remaining) [2024-01-27 23:29:46,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 130 remaining) [2024-01-27 23:29:46,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 130 remaining) [2024-01-27 23:29:46,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 130 remaining) [2024-01-27 23:29:46,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 130 remaining) [2024-01-27 23:29:46,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 130 remaining) [2024-01-27 23:29:46,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 130 remaining) [2024-01-27 23:29:46,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 130 remaining) [2024-01-27 23:29:46,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 130 remaining) [2024-01-27 23:29:46,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 130 remaining) [2024-01-27 23:29:46,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 130 remaining) [2024-01-27 23:29:46,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 130 remaining) [2024-01-27 23:29:46,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 130 remaining) [2024-01-27 23:29:46,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 130 remaining) [2024-01-27 23:29:46,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 130 remaining) [2024-01-27 23:29:46,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 130 remaining) [2024-01-27 23:29:46,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 130 remaining) [2024-01-27 23:29:46,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 130 remaining) [2024-01-27 23:29:46,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 130 remaining) [2024-01-27 23:29:46,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 130 remaining) [2024-01-27 23:29:46,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 130 remaining) [2024-01-27 23:29:46,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 130 remaining) [2024-01-27 23:29:46,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 130 remaining) [2024-01-27 23:29:46,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 130 remaining) [2024-01-27 23:29:46,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 130 remaining) [2024-01-27 23:29:46,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 130 remaining) [2024-01-27 23:29:46,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 130 remaining) [2024-01-27 23:29:46,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 130 remaining) [2024-01-27 23:29:46,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 130 remaining) [2024-01-27 23:29:46,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 130 remaining) [2024-01-27 23:29:46,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 130 remaining) [2024-01-27 23:29:46,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 130 remaining) [2024-01-27 23:29:46,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 130 remaining) [2024-01-27 23:29:46,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 130 remaining) [2024-01-27 23:29:46,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 130 remaining) [2024-01-27 23:29:46,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 130 remaining) [2024-01-27 23:29:46,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 130 remaining) [2024-01-27 23:29:46,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 130 remaining) [2024-01-27 23:29:46,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 130 remaining) [2024-01-27 23:29:46,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 130 remaining) [2024-01-27 23:29:46,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 130 remaining) [2024-01-27 23:29:46,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 130 remaining) [2024-01-27 23:29:46,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 130 remaining) [2024-01-27 23:29:46,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 130 remaining) [2024-01-27 23:29:46,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 130 remaining) [2024-01-27 23:29:46,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 130 remaining) [2024-01-27 23:29:46,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 130 remaining) [2024-01-27 23:29:46,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 130 remaining) [2024-01-27 23:29:46,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 130 remaining) [2024-01-27 23:29:46,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 130 remaining) [2024-01-27 23:29:46,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 130 remaining) [2024-01-27 23:29:46,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 130 remaining) [2024-01-27 23:29:46,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 130 remaining) [2024-01-27 23:29:46,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 130 remaining) [2024-01-27 23:29:46,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 130 remaining) [2024-01-27 23:29:46,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 130 remaining) [2024-01-27 23:29:46,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 130 remaining) [2024-01-27 23:29:46,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 130 remaining) [2024-01-27 23:29:46,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr12ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 130 remaining) [2024-01-27 23:29:46,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr13ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 130 remaining) [2024-01-27 23:29:46,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr14ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 130 remaining) [2024-01-27 23:29:46,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr15ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 130 remaining) [2024-01-27 23:29:46,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr16ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 130 remaining) [2024-01-27 23:29:46,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr17ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 130 remaining) [2024-01-27 23:29:46,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr18ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 130 remaining) [2024-01-27 23:29:46,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr19ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 130 remaining) [2024-01-27 23:29:46,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr20ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 130 remaining) [2024-01-27 23:29:46,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr21ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 130 remaining) [2024-01-27 23:29:46,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 130 remaining) [2024-01-27 23:29:46,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 130 remaining) [2024-01-27 23:29:46,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 130 remaining) [2024-01-27 23:29:46,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 130 remaining) [2024-01-27 23:29:46,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 130 remaining) [2024-01-27 23:29:46,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 130 remaining) [2024-01-27 23:29:46,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 130 remaining) [2024-01-27 23:29:46,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 130 remaining) [2024-01-27 23:29:46,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 130 remaining) [2024-01-27 23:29:46,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 130 remaining) [2024-01-27 23:29:46,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 130 remaining) [2024-01-27 23:29:46,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 130 remaining) [2024-01-27 23:29:46,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr12ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 130 remaining) [2024-01-27 23:29:46,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr13ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 130 remaining) [2024-01-27 23:29:46,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr14ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 130 remaining) [2024-01-27 23:29:46,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr15ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 130 remaining) [2024-01-27 23:29:46,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr16ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 130 remaining) [2024-01-27 23:29:46,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr17ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 130 remaining) [2024-01-27 23:29:46,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr18ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 130 remaining) [2024-01-27 23:29:46,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr19ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 130 remaining) [2024-01-27 23:29:46,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr20ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 130 remaining) [2024-01-27 23:29:46,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr21ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 130 remaining) [2024-01-27 23:29:46,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-27 23:29:46,356 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:29:46,363 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 23:29:46,363 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 23:29:46,406 INFO L503 ceAbstractionStarter]: Automizer considered 106 witness invariants [2024-01-27 23:29:46,412 INFO L504 ceAbstractionStarter]: WitnessConsidered=106 [2024-01-27 23:29:46,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 11:29:46 BasicIcfg [2024-01-27 23:29:46,414 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 23:29:46,414 INFO L158 Benchmark]: Toolchain (without parser) took 11674.28ms. Allocated memory was 161.5MB in the beginning and 518.0MB in the end (delta: 356.5MB). Free memory was 111.6MB in the beginning and 188.5MB in the end (delta: -76.9MB). Peak memory consumption was 279.2MB. Max. memory is 16.1GB. [2024-01-27 23:29:46,414 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 23:29:46,415 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 23:29:46,415 INFO L158 Benchmark]: CACSL2BoogieTranslator took 684.65ms. Allocated memory is still 161.5MB. Free memory was 111.6MB in the beginning and 130.0MB in the end (delta: -18.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-01-27 23:29:46,415 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.20ms. Allocated memory is still 161.5MB. Free memory was 130.0MB in the beginning and 127.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 23:29:46,415 INFO L158 Benchmark]: Boogie Preprocessor took 85.50ms. Allocated memory is still 161.5MB. Free memory was 127.4MB in the beginning and 125.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 23:29:46,416 INFO L158 Benchmark]: RCFGBuilder took 695.18ms. Allocated memory is still 161.5MB. Free memory was 125.3MB in the beginning and 93.3MB in the end (delta: 32.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-01-27 23:29:46,418 INFO L158 Benchmark]: TraceAbstraction took 10112.02ms. Allocated memory was 161.5MB in the beginning and 518.0MB in the end (delta: 356.5MB). Free memory was 92.3MB in the beginning and 188.5MB in the end (delta: -96.3MB). Peak memory consumption was 263.4MB. Max. memory is 16.1GB. [2024-01-27 23:29:46,419 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 684.65ms. Allocated memory is still 161.5MB. Free memory was 111.6MB in the beginning and 130.0MB in the end (delta: -18.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.20ms. Allocated memory is still 161.5MB. Free memory was 130.0MB in the beginning and 127.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.50ms. Allocated memory is still 161.5MB. Free memory was 127.4MB in the beginning and 125.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 695.18ms. Allocated memory is still 161.5MB. Free memory was 125.3MB in the beginning and 93.3MB in the end (delta: 32.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10112.02ms. Allocated memory was 161.5MB in the beginning and 518.0MB in the end (delta: 356.5MB). Free memory was 92.3MB in the beginning and 188.5MB in the end (delta: -96.3MB). Peak memory consumption was 263.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L682] 0 int g = 42; [L683] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L694] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[42]]]] [L694] 0 int r = __VERIFIER_nondet_int(); [L695] 0 int t; [L696] 0 pthread_t id; VAL [A={3:0}, B={4:0}, g=42, id={5:0}, r=1] [L697] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[42]]]] [L697] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L699] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L699] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[25]],IntegerLiteral[17]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L699] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L699] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[17],IdentifierExpression[g]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L699] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPNEQ,IdentifierExpression[g],IntegerLiteral[0]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L699] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[42]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L699] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[42]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L700] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[25]],IntegerLiteral[17]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L700] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[17],IdentifierExpression[g]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L700] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[42]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L700] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[42]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L700] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPNEQ,IdentifierExpression[g],IntegerLiteral[0]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L700] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L700] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L700] COND TRUE 0 \read(r) VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L701] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[25]],IntegerLiteral[17]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L701] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L701] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[42]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L701] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPNEQ,IdentifierExpression[r],IntegerLiteral[0]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L701] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[42]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L701] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[17],IdentifierExpression[g]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L701] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPNEQ,IdentifierExpression[g],IntegerLiteral[0]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L701] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]]]] [L701] 0 g = 17 VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1] [L702] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1] [L702] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPNEQ,IdentifierExpression[r],IntegerLiteral[0]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1] [L703] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPNEQ,IdentifierExpression[r],IntegerLiteral[0]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1] [L703] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1] [L705] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[42]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1] [L705] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPNEQ,IdentifierExpression[g],IntegerLiteral[0]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1] [L705] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1] [L705] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[25]],IntegerLiteral[17]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1] [L705] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1] [L705] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[42]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1] [L705] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[17],IdentifierExpression[g]]]] [L705] 0 t = g VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[42]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[42]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[17],IdentifierExpression[g]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[25]],IntegerLiteral[17]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[t],IntegerLiteral[42]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[17],IdentifierExpression[t]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPNEQ,IdentifierExpression[g],IntegerLiteral[0]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[t],IntegerLiteral[25]],IntegerLiteral[17]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[t],IntegerLiteral[127]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[t],IntegerLiteral[17]],BinaryExpression[COMPEQ,IdentifierExpression[t],IntegerLiteral[42]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPNEQ,IdentifierExpression[t],IntegerLiteral[0]]]] [L706] CALL 0 __VERIFIER_assert(!(t == 17)) [L19] COND TRUE 0 !(cond) VAL [A={3:0}, B={4:0}, \old(cond)=0, arg={0:0}, cond=0, g=17] [L19] 0 reach_error() VAL [A={3:0}, B={4:0}, \old(cond)=0, arg={0:0}, cond=0, g=17] - UnprovableResult [Line: 694]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 689]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 689]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 298 locations, 130 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5287 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3035 mSDsluCounter, 1704 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 985 mSDsCounter, 797 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4383 IncrementalHoareTripleChecker+Invalid, 5180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 797 mSolverCounterUnsat, 719 mSDtfsCounter, 4383 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=564occurred in iteration=1, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 567 NumberOfCodeBlocks, 567 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 491 ConstructedInterpolants, 0 QuantifiedInterpolants, 1692 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-27 23:29:46,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE