./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_24-multiple-protecting_true.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/13-privatized_24-multiple-protecting_true.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8857f20b 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/13-privatized_24-multiple-protecting_true.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/13-privatized_24-multiple-protecting_true.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-8857f20-m [2024-01-29 22:55:13,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 22:55:13,106 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 22:55:13,112 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 22:55:13,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 22:55:13,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 22:55:13,138 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 22:55:13,139 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 22:55:13,139 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 22:55:13,140 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 22:55:13,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 22:55:13,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 22:55:13,141 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 22:55:13,143 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 22:55:13,143 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 22:55:13,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 22:55:13,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 22:55:13,144 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 22:55:13,146 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 22:55:13,147 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 22:55:13,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 22:55:13,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 22:55:13,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 22:55:13,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 22:55:13,148 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 22:55:13,148 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 22:55:13,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 22:55:13,148 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 22:55:13,149 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 22:55:13,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 22:55:13,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 22:55:13,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 22:55:13,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:55:13,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 22:55:13,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 22:55:13,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 22:55:13,151 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 22:55:13,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 22:55:13,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 22:55:13,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 22:55:13,152 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 22:55:13,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 22:55:13,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 22:55:13,152 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-29 22:55:13,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 22:55:13,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 22:55:13,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 22:55:13,396 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 22:55:13,396 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 22:55:13,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_24-multiple-protecting_true.i [2024-01-29 22:55:14,331 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 22:55:14,483 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 22:55:14,484 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_24-multiple-protecting_true.i [2024-01-29 22:55:14,497 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7572e1379/6874ade268bd427f9c3e57d200e7e183/FLAG15788c2bb [2024-01-29 22:55:14,506 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7572e1379/6874ade268bd427f9c3e57d200e7e183 [2024-01-29 22:55:14,508 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 22:55:14,508 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 22:55:14,509 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/13-privatized_24-multiple-protecting_true.yml/witness.yml [2024-01-29 22:55:14,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 22:55:14,592 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 22:55:14,592 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 22:55:14,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 22:55:14,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 22:55:14,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:55:14" (1/2) ... [2024-01-29 22:55:14,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2aed7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:55:14, skipping insertion in model container [2024-01-29 22:55:14,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:55:14" (1/2) ... [2024-01-29 22:55:14,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5e1f949e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:55:14, skipping insertion in model container [2024-01-29 22:55:14,599 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:55:14" (2/2) ... [2024-01-29 22:55:14,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2aed7a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:55:14, skipping insertion in model container [2024-01-29 22:55:14,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:55:14" (2/2) ... [2024-01-29 22:55:14,600 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 22:55:14,654 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 22:55:14,655 INFO L98 nessWitnessExtractor]: Location invariant before [L720-L720] (g1 == 0) && (g2 == 0) [2024-01-29 22:55:14,656 INFO L98 nessWitnessExtractor]: Location invariant before [L720-L720] g1 == 0 [2024-01-29 22:55:14,656 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] g1 == 0 [2024-01-29 22:55:14,656 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] (g1 == 0) && (g2 == 0) [2024-01-29 22:55:14,656 INFO L98 nessWitnessExtractor]: Location invariant before [L712-L712] g1 == 0 [2024-01-29 22:55:14,657 INFO L98 nessWitnessExtractor]: Location invariant before [L712-L712] (g1 == 0) && (g2 == 0) [2024-01-29 22:55:14,657 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] g2 == 0 [2024-01-29 22:55:14,657 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] (g2 == 0) && ((unsigned long )arg == 0UL) [2024-01-29 22:55:14,657 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] (g1 == 0) && ((unsigned long )arg == 0UL) [2024-01-29 22:55:14,657 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] g1 == 0 [2024-01-29 22:55:14,657 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] (g1 == 0) && (g2 == 0) [2024-01-29 22:55:14,657 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] g1 == 0 [2024-01-29 22:55:14,658 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] (g1 == 0) && ((unsigned long )arg == 0UL) [2024-01-29 22:55:14,658 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] (g1 == 0) && (g2 == 1) [2024-01-29 22:55:14,658 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] ((g1 == 0) && (g2 == 1)) && ((unsigned long )arg == 0UL) [2024-01-29 22:55:14,658 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] g1 == 0 [2024-01-29 22:55:14,658 INFO L98 nessWitnessExtractor]: Location invariant before [L718-L718] (g1 == 0) && (g2 == 0) [2024-01-29 22:55:14,658 INFO L98 nessWitnessExtractor]: Location invariant before [L718-L718] g1 == 0 [2024-01-29 22:55:14,658 INFO L98 nessWitnessExtractor]: Location invariant before [L696-L696] (g1 == 0) && (g2 == 0) [2024-01-29 22:55:14,659 INFO L98 nessWitnessExtractor]: Location invariant before [L696-L696] g1 == 0 [2024-01-29 22:55:14,659 INFO L98 nessWitnessExtractor]: Location invariant before [L696-L696] ((g1 == 0) && (g2 == 0)) && ((unsigned long )arg == 0UL) [2024-01-29 22:55:14,659 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] g1 == 0 [2024-01-29 22:55:14,659 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] (g1 == 0) && (g2 == 0) [2024-01-29 22:55:14,659 INFO L98 nessWitnessExtractor]: Location invariant before [L695-L695] g2 == 0 [2024-01-29 22:55:14,659 INFO L98 nessWitnessExtractor]: Location invariant before [L695-L695] (g2 == 0) && ((unsigned long )arg == 0UL) [2024-01-29 22:55:14,660 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g1 == 0 [2024-01-29 22:55:14,660 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (g1 == 0) && (g1 == 0) [2024-01-29 22:55:14,660 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (g1 == 0) && (g2 == 0) [2024-01-29 22:55:14,660 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (g1 == 0) && (g2 == 0) [2024-01-29 22:55:14,660 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] g2 == 1 [2024-01-29 22:55:14,660 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] (g2 == 1) && ((unsigned long )arg == 0UL) [2024-01-29 22:55:14,661 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] (unsigned long )arg == 0UL [2024-01-29 22:55:14,661 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] g1 == 0 [2024-01-29 22:55:14,661 INFO L98 nessWitnessExtractor]: Location invariant before [L713-L713] (g1 == 0) && (g2 == 0) [2024-01-29 22:55:14,661 INFO L98 nessWitnessExtractor]: Location invariant before [L713-L713] g1 == 0 [2024-01-29 22:55:14,661 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] (g1 == 1) && ((unsigned long )arg == 0UL) [2024-01-29 22:55:14,661 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] g1 == 1 [2024-01-29 22:55:14,661 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L700] g1 == 0 [2024-01-29 22:55:14,662 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L700] (g1 == 0) && (g2 == 0) [2024-01-29 22:55:14,662 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L700] (g1 == 0) && ((unsigned long )arg == 0UL) [2024-01-29 22:55:14,663 INFO L98 nessWitnessExtractor]: Location invariant before [L716-L716] g1 == 0 [2024-01-29 22:55:14,663 INFO L98 nessWitnessExtractor]: Location invariant before [L716-L716] (g1 == 0) && (g2 == 0) [2024-01-29 22:55:14,663 INFO L98 nessWitnessExtractor]: Location invariant before [L714-L714] g1 == 0 [2024-01-29 22:55:14,663 INFO L98 nessWitnessExtractor]: Location invariant before [L714-L714] (g1 == 0) && (g2 == 0) [2024-01-29 22:55:14,663 INFO L98 nessWitnessExtractor]: Location invariant before [L702-L702] (unsigned long )arg == 0UL [2024-01-29 22:55:14,663 INFO L98 nessWitnessExtractor]: Location invariant before [L694-L694] (unsigned long )arg == 0UL [2024-01-29 22:55:14,664 INFO L98 nessWitnessExtractor]: Location invariant before [L717-L717] (g1 == 0) && (g2 == 0) [2024-01-29 22:55:14,664 INFO L98 nessWitnessExtractor]: Location invariant before [L717-L717] g1 == 0 [2024-01-29 22:55:14,664 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] (g1 == 0) && ((unsigned long )arg == 0UL) [2024-01-29 22:55:14,664 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] g1 == 0 [2024-01-29 22:55:14,664 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] (g1 == 0) && (g2 == 1) [2024-01-29 22:55:14,664 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L693] (g1 == 0) && ((unsigned long )arg == 0UL) [2024-01-29 22:55:14,665 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L693] g1 == 0 [2024-01-29 22:55:14,665 INFO L98 nessWitnessExtractor]: Location invariant before [L715-L715] (g1 == 0) && (g2 == 0) [2024-01-29 22:55:14,665 INFO L98 nessWitnessExtractor]: Location invariant before [L715-L715] g1 == 0 [2024-01-29 22:55:14,666 INFO L98 nessWitnessExtractor]: Location invariant before [L719-L719] g1 == 0 [2024-01-29 22:55:14,666 INFO L98 nessWitnessExtractor]: Location invariant before [L710-L710] (g1 == 0) && (g2 == 0) [2024-01-29 22:55:14,666 INFO L98 nessWitnessExtractor]: Location invariant before [L710-L710] g1 == 0 [2024-01-29 22:55:14,666 INFO L98 nessWitnessExtractor]: Location invariant before [L721-L721] g1 == 0 [2024-01-29 22:55:14,666 INFO L98 nessWitnessExtractor]: Location invariant before [L721-L721] (g1 == 0) && (g2 == 0) [2024-01-29 22:55:14,667 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] g1 == 0 [2024-01-29 22:55:14,667 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] (g1 == 0) && (g2 == 0) [2024-01-29 22:55:14,667 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] (g1 == 0) && ((unsigned long )arg == 0UL) [2024-01-29 22:55:14,667 INFO L98 nessWitnessExtractor]: Location invariant before [L722-L722] g1 == 0 [2024-01-29 22:55:14,667 INFO L98 nessWitnessExtractor]: Location invariant before [L711-L711] g1 == 0 [2024-01-29 22:55:14,667 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] (g1 == 1) && (g2 == 0) [2024-01-29 22:55:14,667 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] g1 == 1 [2024-01-29 22:55:14,667 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] ((g1 == 1) && (g2 == 0)) && ((unsigned long )arg == 0UL) [2024-01-29 22:55:14,668 INFO L98 nessWitnessExtractor]: Location invariant before [L689-L689] ((g1 == 1) && (g2 == 0)) && ((unsigned long )arg == 0UL) [2024-01-29 22:55:14,668 INFO L98 nessWitnessExtractor]: Location invariant before [L689-L689] (g1 == 1) && (g2 == 0) [2024-01-29 22:55:14,668 INFO L98 nessWitnessExtractor]: Location invariant before [L689-L689] g1 == 1 [2024-01-29 22:55:14,706 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 22:55:14,841 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/13-privatized_24-multiple-protecting_true.i[1096,1109] [2024-01-29 22:55:14,926 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:55:14,934 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 22:55:14,943 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/13-privatized_24-multiple-protecting_true.i[1096,1109] [2024-01-29 22:55:14,944 WARN L424 MainDispatcher]: Unable to annotate void __VERIFIER_assert(int cond) { if(!(cond)) { ERROR: {reach_error();abort();} } } 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 [2024-01-29 22:55:15,011 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:55:15,047 INFO L206 MainTranslator]: Completed translation [2024-01-29 22:55:15,047 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:55:15 WrapperNode [2024-01-29 22:55:15,047 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 22:55:15,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 22:55:15,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 22:55:15,048 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 22:55:15,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:55:15" (1/1) ... [2024-01-29 22:55:15,068 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:55:15" (1/1) ... [2024-01-29 22:55:15,112 INFO L138 Inliner]: procedures = 163, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 135 [2024-01-29 22:55:15,113 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 22:55:15,114 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 22:55:15,114 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 22:55:15,114 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 22:55:15,127 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:55:15" (1/1) ... [2024-01-29 22:55:15,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:55:15" (1/1) ... [2024-01-29 22:55:15,131 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:55:15" (1/1) ... [2024-01-29 22:55:15,153 INFO L175 MemorySlicer]: Split 19 memory accesses to 5 slices as follows [2, 5, 5, 5, 2]. 26 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 0, 1]. [2024-01-29 22:55:15,153 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:55:15" (1/1) ... [2024-01-29 22:55:15,153 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:55:15" (1/1) ... [2024-01-29 22:55:15,159 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:55:15" (1/1) ... [2024-01-29 22:55:15,167 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:55:15" (1/1) ... [2024-01-29 22:55:15,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:55:15" (1/1) ... [2024-01-29 22:55:15,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:55:15" (1/1) ... [2024-01-29 22:55:15,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 22:55:15,172 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 22:55:15,172 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 22:55:15,172 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 22:55:15,173 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:55:15" (1/1) ... [2024-01-29 22:55:15,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:55:15,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 22:55:15,198 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-29 22:55:15,200 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-29 22:55:15,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 22:55:15,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 22:55:15,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 22:55:15,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-29 22:55:15,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-29 22:55:15,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 22:55:15,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 22:55:15,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 22:55:15,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 22:55:15,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-29 22:55:15,246 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-29 22:55:15,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 22:55:15,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 22:55:15,246 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-01-29 22:55:15,246 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-01-29 22:55:15,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 22:55:15,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 22:55:15,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 22:55:15,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 22:55:15,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 22:55:15,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-29 22:55:15,247 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-29 22:55:15,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 22:55:15,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 22:55:15,248 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 22:55:15,349 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 22:55:15,351 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 22:55:15,668 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 22:55:15,668 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 22:55:15,799 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 22:55:15,800 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-29 22:55:15,801 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:55:15 BoogieIcfgContainer [2024-01-29 22:55:15,802 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 22:55:15,805 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 22:55:15,805 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 22:55:15,807 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 22:55:15,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:55:14" (1/4) ... [2024-01-29 22:55:15,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ea3151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:55:15, skipping insertion in model container [2024-01-29 22:55:15,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:55:14" (2/4) ... [2024-01-29 22:55:15,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ea3151 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:55:15, skipping insertion in model container [2024-01-29 22:55:15,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:55:15" (3/4) ... [2024-01-29 22:55:15,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ea3151 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:55:15, skipping insertion in model container [2024-01-29 22:55:15,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:55:15" (4/4) ... [2024-01-29 22:55:15,812 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_24-multiple-protecting_true.i [2024-01-29 22:55:15,825 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 22:55:15,825 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 71 error locations. [2024-01-29 22:55:15,825 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 22:55:15,905 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-01-29 22:55:15,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 209 transitions, 425 flow [2024-01-29 22:55:16,009 INFO L124 PetriNetUnfolderBase]: 4/208 cut-off events. [2024-01-29 22:55:16,010 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:55:16,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 208 events. 4/208 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 379 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 200. Up to 2 conditions per place. [2024-01-29 22:55:16,015 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 209 transitions, 425 flow [2024-01-29 22:55:16,024 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 206 places, 206 transitions, 415 flow [2024-01-29 22:55:16,038 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 22:55:16,044 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;@ddc9deb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 22:55:16,044 INFO L358 AbstractCegarLoop]: Starting to check reachability of 111 error locations. [2024-01-29 22:55:16,047 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 22:55:16,047 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 22:55:16,047 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:55:16,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:55:16,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 22:55:16,048 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 108 more)] === [2024-01-29 22:55:16,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:55:16,053 INFO L85 PathProgramCache]: Analyzing trace with hash 19924, now seen corresponding path program 1 times [2024-01-29 22:55:16,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:55:16,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148446912] [2024-01-29 22:55:16,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:55:16,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:55:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:55:16,267 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-29 22:55:16,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:55:16,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148446912] [2024-01-29 22:55:16,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148446912] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:55:16,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:55:16,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:55:16,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959588270] [2024-01-29 22:55:16,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:55:16,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:55:16,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:55:16,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:55:16,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:55:16,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 209 [2024-01-29 22:55:16,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 206 transitions, 415 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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-29 22:55:16,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:55:16,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 209 [2024-01-29 22:55:16,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:55:17,212 INFO L124 PetriNetUnfolderBase]: 1808/7308 cut-off events. [2024-01-29 22:55:17,212 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:55:17,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11782 conditions, 7308 events. 1808/7308 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 68076 event pairs, 980 based on Foata normal form. 1520/8125 useless extension candidates. Maximal degree in co-relation 11769. Up to 2291 conditions per place. [2024-01-29 22:55:17,239 INFO L140 encePairwiseOnDemand]: 134/209 looper letters, 117 selfloop transitions, 17 changer transitions 0/226 dead transitions. [2024-01-29 22:55:17,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 226 transitions, 723 flow [2024-01-29 22:55:17,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:55:17,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:55:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 476 transitions. [2024-01-29 22:55:17,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.759170653907496 [2024-01-29 22:55:17,251 INFO L175 Difference]: Start difference. First operand has 206 places, 206 transitions, 415 flow. Second operand 3 states and 476 transitions. [2024-01-29 22:55:17,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 226 transitions, 723 flow [2024-01-29 22:55:17,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 226 transitions, 722 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:55:17,258 INFO L231 Difference]: Finished difference. Result has 196 places, 202 transitions, 582 flow [2024-01-29 22:55:17,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=196, PETRI_TRANSITIONS=202} [2024-01-29 22:55:17,262 INFO L281 CegarLoopForPetriNet]: 206 programPoint places, -10 predicate places. [2024-01-29 22:55:17,263 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 202 transitions, 582 flow [2024-01-29 22:55:17,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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-29 22:55:17,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:55:17,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-29 22:55:17,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 22:55:17,264 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 108 more)] === [2024-01-29 22:55:17,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:55:17,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1241908690, now seen corresponding path program 1 times [2024-01-29 22:55:17,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:55:17,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672092236] [2024-01-29 22:55:17,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:55:17,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:55:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:55:17,367 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-29 22:55:17,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:55:17,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672092236] [2024-01-29 22:55:17,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672092236] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:55:17,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:55:17,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:55:17,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615888648] [2024-01-29 22:55:17,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:55:17,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:55:17,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:55:17,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:55:17,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:55:17,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 209 [2024-01-29 22:55:17,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 202 transitions, 582 flow. Second operand has 4 states, 4 states have (on average 158.25) internal successors, (633), 4 states have internal predecessors, (633), 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-29 22:55:17,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:55:17,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 209 [2024-01-29 22:55:17,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:55:18,008 INFO L124 PetriNetUnfolderBase]: 1205/6376 cut-off events. [2024-01-29 22:55:18,009 INFO L125 PetriNetUnfolderBase]: For 865/873 co-relation queries the response was YES. [2024-01-29 22:55:18,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10774 conditions, 6376 events. 1205/6376 cut-off events. For 865/873 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 61311 event pairs, 908 based on Foata normal form. 72/5863 useless extension candidates. Maximal degree in co-relation 10759. Up to 1789 conditions per place. [2024-01-29 22:55:18,042 INFO L140 encePairwiseOnDemand]: 204/209 looper letters, 66 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2024-01-29 22:55:18,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 221 transitions, 760 flow [2024-01-29 22:55:18,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:55:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:55:18,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 696 transitions. [2024-01-29 22:55:18,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8325358851674641 [2024-01-29 22:55:18,046 INFO L175 Difference]: Start difference. First operand has 196 places, 202 transitions, 582 flow. Second operand 4 states and 696 transitions. [2024-01-29 22:55:18,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 221 transitions, 760 flow [2024-01-29 22:55:18,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 221 transitions, 726 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:55:18,069 INFO L231 Difference]: Finished difference. Result has 194 places, 199 transitions, 546 flow [2024-01-29 22:55:18,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=546, PETRI_PLACES=194, PETRI_TRANSITIONS=199} [2024-01-29 22:55:18,070 INFO L281 CegarLoopForPetriNet]: 206 programPoint places, -12 predicate places. [2024-01-29 22:55:18,070 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 199 transitions, 546 flow [2024-01-29 22:55:18,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 158.25) internal successors, (633), 4 states have internal predecessors, (633), 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-29 22:55:18,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:55:18,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:55:18,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 22:55:18,072 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 108 more)] === [2024-01-29 22:55:18,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:55:18,072 INFO L85 PathProgramCache]: Analyzing trace with hash 854210047, now seen corresponding path program 1 times [2024-01-29 22:55:18,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:55:18,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654661884] [2024-01-29 22:55:18,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:55:18,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:55:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:55:18,147 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-29 22:55:18,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:55:18,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654661884] [2024-01-29 22:55:18,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654661884] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:55:18,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:55:18,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:55:18,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669736378] [2024-01-29 22:55:18,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:55:18,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:55:18,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:55:18,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:55:18,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:55:18,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 209 [2024-01-29 22:55:18,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 199 transitions, 546 flow. Second operand has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 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-29 22:55:18,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:55:18,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 209 [2024-01-29 22:55:18,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:55:19,203 INFO L124 PetriNetUnfolderBase]: 2899/10106 cut-off events. [2024-01-29 22:55:19,204 INFO L125 PetriNetUnfolderBase]: For 1349/1382 co-relation queries the response was YES. [2024-01-29 22:55:19,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20025 conditions, 10106 events. 2899/10106 cut-off events. For 1349/1382 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 91079 event pairs, 632 based on Foata normal form. 813/10689 useless extension candidates. Maximal degree in co-relation 20009. Up to 4855 conditions per place. [2024-01-29 22:55:19,241 INFO L140 encePairwiseOnDemand]: 149/209 looper letters, 193 selfloop transitions, 31 changer transitions 0/290 dead transitions. [2024-01-29 22:55:19,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 290 transitions, 1232 flow [2024-01-29 22:55:19,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:55:19,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:55:19,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 531 transitions. [2024-01-29 22:55:19,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6351674641148325 [2024-01-29 22:55:19,244 INFO L175 Difference]: Start difference. First operand has 194 places, 199 transitions, 546 flow. Second operand 4 states and 531 transitions. [2024-01-29 22:55:19,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 290 transitions, 1232 flow [2024-01-29 22:55:19,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 290 transitions, 1229 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:55:19,250 INFO L231 Difference]: Finished difference. Result has 191 places, 218 transitions, 831 flow [2024-01-29 22:55:19,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=831, PETRI_PLACES=191, PETRI_TRANSITIONS=218} [2024-01-29 22:55:19,252 INFO L281 CegarLoopForPetriNet]: 206 programPoint places, -15 predicate places. [2024-01-29 22:55:19,252 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 218 transitions, 831 flow [2024-01-29 22:55:19,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 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-29 22:55:19,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:55:19,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:55:19,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 22:55:19,254 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 108 more)] === [2024-01-29 22:55:19,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:55:19,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1198194680, now seen corresponding path program 1 times [2024-01-29 22:55:19,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:55:19,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535313497] [2024-01-29 22:55:19,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:55:19,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:55:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:55:19,331 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-29 22:55:19,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:55:19,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535313497] [2024-01-29 22:55:19,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535313497] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:55:19,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:55:19,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:55:19,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937157770] [2024-01-29 22:55:19,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:55:19,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:55:19,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:55:19,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:55:19,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:55:19,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 209 [2024-01-29 22:55:19,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 218 transitions, 831 flow. Second operand has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 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-29 22:55:19,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:55:19,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 209 [2024-01-29 22:55:19,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:55:20,442 INFO L124 PetriNetUnfolderBase]: 2869/9855 cut-off events. [2024-01-29 22:55:20,442 INFO L125 PetriNetUnfolderBase]: For 3158/3217 co-relation queries the response was YES. [2024-01-29 22:55:20,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22420 conditions, 9855 events. 2869/9855 cut-off events. For 3158/3217 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 87528 event pairs, 1787 based on Foata normal form. 31/9634 useless extension candidates. Maximal degree in co-relation 22401. Up to 5259 conditions per place. [2024-01-29 22:55:20,477 INFO L140 encePairwiseOnDemand]: 172/209 looper letters, 176 selfloop transitions, 46 changer transitions 0/284 dead transitions. [2024-01-29 22:55:20,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 284 transitions, 1467 flow [2024-01-29 22:55:20,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:55:20,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:55:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 613 transitions. [2024-01-29 22:55:20,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5866028708133971 [2024-01-29 22:55:20,479 INFO L175 Difference]: Start difference. First operand has 191 places, 218 transitions, 831 flow. Second operand 5 states and 613 transitions. [2024-01-29 22:55:20,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 284 transitions, 1467 flow [2024-01-29 22:55:20,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 284 transitions, 1430 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:55:20,485 INFO L231 Difference]: Finished difference. Result has 187 places, 219 transitions, 902 flow [2024-01-29 22:55:20,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=902, PETRI_PLACES=187, PETRI_TRANSITIONS=219} [2024-01-29 22:55:20,486 INFO L281 CegarLoopForPetriNet]: 206 programPoint places, -19 predicate places. [2024-01-29 22:55:20,486 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 219 transitions, 902 flow [2024-01-29 22:55:20,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 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-29 22:55:20,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:55:20,487 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:55:20,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 22:55:20,487 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 108 more)] === [2024-01-29 22:55:20,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:55:20,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1124176154, now seen corresponding path program 1 times [2024-01-29 22:55:20,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:55:20,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624322312] [2024-01-29 22:55:20,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:55:20,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:55:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:55:20,565 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-29 22:55:20,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:55:20,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624322312] [2024-01-29 22:55:20,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624322312] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:55:20,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:55:20,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:55:20,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928431198] [2024-01-29 22:55:20,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:55:20,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:55:20,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:55:20,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:55:20,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:55:20,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 209 [2024-01-29 22:55:20,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 219 transitions, 902 flow. Second operand has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 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-29 22:55:20,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:55:20,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 209 [2024-01-29 22:55:20,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:55:21,419 INFO L124 PetriNetUnfolderBase]: 2235/7875 cut-off events. [2024-01-29 22:55:21,420 INFO L125 PetriNetUnfolderBase]: For 3861/3921 co-relation queries the response was YES. [2024-01-29 22:55:21,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17853 conditions, 7875 events. 2235/7875 cut-off events. For 3861/3921 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 67697 event pairs, 1840 based on Foata normal form. 474/8175 useless extension candidates. Maximal degree in co-relation 17833. Up to 4484 conditions per place. [2024-01-29 22:55:21,537 INFO L140 encePairwiseOnDemand]: 177/209 looper letters, 134 selfloop transitions, 5 changer transitions 0/204 dead transitions. [2024-01-29 22:55:21,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 204 transitions, 998 flow [2024-01-29 22:55:21,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:55:21,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:55:21,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2024-01-29 22:55:21,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5897129186602871 [2024-01-29 22:55:21,539 INFO L175 Difference]: Start difference. First operand has 187 places, 219 transitions, 902 flow. Second operand 4 states and 493 transitions. [2024-01-29 22:55:21,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 204 transitions, 998 flow [2024-01-29 22:55:21,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 204 transitions, 962 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-01-29 22:55:21,549 INFO L231 Difference]: Finished difference. Result has 185 places, 190 transitions, 666 flow [2024-01-29 22:55:21,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=666, PETRI_PLACES=185, PETRI_TRANSITIONS=190} [2024-01-29 22:55:21,550 INFO L281 CegarLoopForPetriNet]: 206 programPoint places, -21 predicate places. [2024-01-29 22:55:21,550 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 190 transitions, 666 flow [2024-01-29 22:55:21,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 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-29 22:55:21,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:55:21,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:55:21,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 22:55:21,551 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 108 more)] === [2024-01-29 22:55:21,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:55:21,551 INFO L85 PathProgramCache]: Analyzing trace with hash 489723142, now seen corresponding path program 1 times [2024-01-29 22:55:21,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:55:21,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802053064] [2024-01-29 22:55:21,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:55:21,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:55:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:55:21,590 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-29 22:55:21,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:55:21,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802053064] [2024-01-29 22:55:21,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802053064] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:55:21,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:55:21,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:55:21,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655122132] [2024-01-29 22:55:21,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:55:21,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:55:21,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:55:21,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:55:21,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:55:21,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 209 [2024-01-29 22:55:21,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 190 transitions, 666 flow. Second operand has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 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-29 22:55:21,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:55:21,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 209 [2024-01-29 22:55:21,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:55:22,548 INFO L124 PetriNetUnfolderBase]: 2446/8065 cut-off events. [2024-01-29 22:55:22,548 INFO L125 PetriNetUnfolderBase]: For 2709/2759 co-relation queries the response was YES. [2024-01-29 22:55:22,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18099 conditions, 8065 events. 2446/8065 cut-off events. For 2709/2759 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 67884 event pairs, 1455 based on Foata normal form. 111/8116 useless extension candidates. Maximal degree in co-relation 18079. Up to 3888 conditions per place. [2024-01-29 22:55:22,572 INFO L140 encePairwiseOnDemand]: 190/209 looper letters, 149 selfloop transitions, 19 changer transitions 0/240 dead transitions. [2024-01-29 22:55:22,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 240 transitions, 1142 flow [2024-01-29 22:55:22,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:55:22,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:55:22,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 564 transitions. [2024-01-29 22:55:22,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6746411483253588 [2024-01-29 22:55:22,574 INFO L175 Difference]: Start difference. First operand has 185 places, 190 transitions, 666 flow. Second operand 4 states and 564 transitions. [2024-01-29 22:55:22,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 240 transitions, 1142 flow [2024-01-29 22:55:22,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 240 transitions, 1132 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:55:22,581 INFO L231 Difference]: Finished difference. Result has 183 places, 188 transitions, 690 flow [2024-01-29 22:55:22,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=690, PETRI_PLACES=183, PETRI_TRANSITIONS=188} [2024-01-29 22:55:22,582 INFO L281 CegarLoopForPetriNet]: 206 programPoint places, -23 predicate places. [2024-01-29 22:55:22,582 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 188 transitions, 690 flow [2024-01-29 22:55:22,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 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-29 22:55:22,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:55:22,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:55:22,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 22:55:22,583 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 108 more)] === [2024-01-29 22:55:22,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:55:22,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1998451044, now seen corresponding path program 1 times [2024-01-29 22:55:22,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:55:22,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891284358] [2024-01-29 22:55:22,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:55:22,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:55:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:55:22,632 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-29 22:55:22,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:55:22,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891284358] [2024-01-29 22:55:22,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891284358] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:55:22,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:55:22,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:55:22,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647814559] [2024-01-29 22:55:22,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:55:22,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:55:22,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:55:22,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:55:22,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:55:22,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 209 [2024-01-29 22:55:22,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 188 transitions, 690 flow. Second operand has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 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-29 22:55:22,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:55:22,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 209 [2024-01-29 22:55:22,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:55:23,658 INFO L124 PetriNetUnfolderBase]: 2778/8564 cut-off events. [2024-01-29 22:55:23,659 INFO L125 PetriNetUnfolderBase]: For 3655/3688 co-relation queries the response was YES. [2024-01-29 22:55:23,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19974 conditions, 8564 events. 2778/8564 cut-off events. For 3655/3688 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 71240 event pairs, 515 based on Foata normal form. 138/8578 useless extension candidates. Maximal degree in co-relation 19954. Up to 3165 conditions per place. [2024-01-29 22:55:23,684 INFO L140 encePairwiseOnDemand]: 184/209 looper letters, 198 selfloop transitions, 22 changer transitions 0/284 dead transitions. [2024-01-29 22:55:23,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 284 transitions, 1430 flow [2024-01-29 22:55:23,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:55:23,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:55:23,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 663 transitions. [2024-01-29 22:55:23,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6344497607655503 [2024-01-29 22:55:23,686 INFO L175 Difference]: Start difference. First operand has 183 places, 188 transitions, 690 flow. Second operand 5 states and 663 transitions. [2024-01-29 22:55:23,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 284 transitions, 1430 flow [2024-01-29 22:55:23,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 284 transitions, 1407 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:55:23,693 INFO L231 Difference]: Finished difference. Result has 183 places, 186 transitions, 738 flow [2024-01-29 22:55:23,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=738, PETRI_PLACES=183, PETRI_TRANSITIONS=186} [2024-01-29 22:55:23,694 INFO L281 CegarLoopForPetriNet]: 206 programPoint places, -23 predicate places. [2024-01-29 22:55:23,694 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 186 transitions, 738 flow [2024-01-29 22:55:23,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 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-29 22:55:23,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:55:23,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:55:23,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 22:55:23,695 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 108 more)] === [2024-01-29 22:55:23,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:55:23,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2146196389, now seen corresponding path program 1 times [2024-01-29 22:55:23,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:55:23,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761749304] [2024-01-29 22:55:23,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:55:23,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:55:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:55:23,729 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-29 22:55:23,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:55:23,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761749304] [2024-01-29 22:55:23,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761749304] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:55:23,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:55:23,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:55:23,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765493894] [2024-01-29 22:55:23,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:55:23,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:55:23,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:55:23,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:55:23,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:55:23,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 209 [2024-01-29 22:55:23,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 186 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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-29 22:55:23,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:55:23,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 209 [2024-01-29 22:55:23,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:55:24,138 INFO L124 PetriNetUnfolderBase]: 1030/5417 cut-off events. [2024-01-29 22:55:24,138 INFO L125 PetriNetUnfolderBase]: For 3632/3706 co-relation queries the response was YES. [2024-01-29 22:55:24,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10981 conditions, 5417 events. 1030/5417 cut-off events. For 3632/3706 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 50712 event pairs, 573 based on Foata normal form. 7/5197 useless extension candidates. Maximal degree in co-relation 10959. Up to 1533 conditions per place. [2024-01-29 22:55:24,156 INFO L140 encePairwiseOnDemand]: 195/209 looper letters, 78 selfloop transitions, 14 changer transitions 0/225 dead transitions. [2024-01-29 22:55:24,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 225 transitions, 1058 flow [2024-01-29 22:55:24,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:55:24,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:55:24,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 564 transitions. [2024-01-29 22:55:24,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8995215311004785 [2024-01-29 22:55:24,159 INFO L175 Difference]: Start difference. First operand has 183 places, 186 transitions, 738 flow. Second operand 3 states and 564 transitions. [2024-01-29 22:55:24,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 225 transitions, 1058 flow [2024-01-29 22:55:24,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 225 transitions, 1012 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-01-29 22:55:24,170 INFO L231 Difference]: Finished difference. Result has 181 places, 195 transitions, 777 flow [2024-01-29 22:55:24,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=777, PETRI_PLACES=181, PETRI_TRANSITIONS=195} [2024-01-29 22:55:24,171 INFO L281 CegarLoopForPetriNet]: 206 programPoint places, -25 predicate places. [2024-01-29 22:55:24,171 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 195 transitions, 777 flow [2024-01-29 22:55:24,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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-29 22:55:24,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:55:24,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:55:24,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 22:55:24,172 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 108 more)] === [2024-01-29 22:55:24,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:55:24,173 INFO L85 PathProgramCache]: Analyzing trace with hash -870143302, now seen corresponding path program 1 times [2024-01-29 22:55:24,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:55:24,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302681504] [2024-01-29 22:55:24,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:55:24,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:55:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:55:24,323 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-29 22:55:24,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:55:24,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302681504] [2024-01-29 22:55:24,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302681504] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:55:24,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:55:24,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:55:24,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408828392] [2024-01-29 22:55:24,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:55:24,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:55:24,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:55:24,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:55:24,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:55:24,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 209 [2024-01-29 22:55:24,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 195 transitions, 777 flow. Second operand has 5 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 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-29 22:55:24,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:55:24,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 209 [2024-01-29 22:55:24,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:55:24,670 INFO L124 PetriNetUnfolderBase]: 720/3596 cut-off events. [2024-01-29 22:55:24,670 INFO L125 PetriNetUnfolderBase]: For 2154/2263 co-relation queries the response was YES. [2024-01-29 22:55:24,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7688 conditions, 3596 events. 720/3596 cut-off events. For 2154/2263 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 30999 event pairs, 316 based on Foata normal form. 23/3497 useless extension candidates. Maximal degree in co-relation 7665. Up to 747 conditions per place. [2024-01-29 22:55:24,683 INFO L140 encePairwiseOnDemand]: 202/209 looper letters, 81 selfloop transitions, 9 changer transitions 3/216 dead transitions. [2024-01-29 22:55:24,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 216 transitions, 1016 flow [2024-01-29 22:55:24,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:55:24,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:55:24,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 725 transitions. [2024-01-29 22:55:24,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8672248803827751 [2024-01-29 22:55:24,686 INFO L175 Difference]: Start difference. First operand has 181 places, 195 transitions, 777 flow. Second operand 4 states and 725 transitions. [2024-01-29 22:55:24,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 216 transitions, 1016 flow [2024-01-29 22:55:24,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 216 transitions, 973 flow, removed 17 selfloop flow, removed 1 redundant places. [2024-01-29 22:55:24,695 INFO L231 Difference]: Finished difference. Result has 175 places, 181 transitions, 689 flow [2024-01-29 22:55:24,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=689, PETRI_PLACES=175, PETRI_TRANSITIONS=181} [2024-01-29 22:55:24,696 INFO L281 CegarLoopForPetriNet]: 206 programPoint places, -31 predicate places. [2024-01-29 22:55:24,696 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 181 transitions, 689 flow [2024-01-29 22:55:24,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 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-29 22:55:24,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:55:24,697 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-29 22:55:24,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 22:55:24,697 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr14ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 108 more)] === [2024-01-29 22:55:24,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:55:24,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1322676708, now seen corresponding path program 1 times [2024-01-29 22:55:24,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:55:24,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888571305] [2024-01-29 22:55:24,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:55:24,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:55:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:55:24,778 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-29 22:55:24,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:55:24,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888571305] [2024-01-29 22:55:24,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888571305] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:55:24,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:55:24,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:55:24,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983618218] [2024-01-29 22:55:24,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:55:24,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:55:24,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:55:24,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:55:24,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:55:24,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 209 [2024-01-29 22:55:24,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 181 transitions, 689 flow. Second operand has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 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-29 22:55:24,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:55:24,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 209 [2024-01-29 22:55:24,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:55:25,682 INFO L124 PetriNetUnfolderBase]: 2114/6404 cut-off events. [2024-01-29 22:55:25,682 INFO L125 PetriNetUnfolderBase]: For 3766/3818 co-relation queries the response was YES. [2024-01-29 22:55:25,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15722 conditions, 6404 events. 2114/6404 cut-off events. For 3766/3818 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 50709 event pairs, 1192 based on Foata normal form. 23/6387 useless extension candidates. Maximal degree in co-relation 15696. Up to 4325 conditions per place. [2024-01-29 22:55:25,697 INFO L140 encePairwiseOnDemand]: 178/209 looper letters, 196 selfloop transitions, 32 changer transitions 0/279 dead transitions. [2024-01-29 22:55:25,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 279 transitions, 1499 flow [2024-01-29 22:55:25,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:55:25,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:55:25,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2024-01-29 22:55:25,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5196172248803828 [2024-01-29 22:55:25,699 INFO L175 Difference]: Start difference. First operand has 175 places, 181 transitions, 689 flow. Second operand 5 states and 543 transitions. [2024-01-29 22:55:25,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 279 transitions, 1499 flow [2024-01-29 22:55:25,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 279 transitions, 1498 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:55:25,707 INFO L231 Difference]: Finished difference. Result has 178 places, 207 transitions, 922 flow [2024-01-29 22:55:25,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=922, PETRI_PLACES=178, PETRI_TRANSITIONS=207} [2024-01-29 22:55:25,707 INFO L281 CegarLoopForPetriNet]: 206 programPoint places, -28 predicate places. [2024-01-29 22:55:25,707 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 207 transitions, 922 flow [2024-01-29 22:55:25,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 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-29 22:55:25,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:55:25,708 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:55:25,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 22:55:25,708 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 108 more)] === [2024-01-29 22:55:25,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:55:25,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1147788601, now seen corresponding path program 1 times [2024-01-29 22:55:25,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:55:25,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481181754] [2024-01-29 22:55:25,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:55:25,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:55:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:55:25,789 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-29 22:55:25,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:55:25,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481181754] [2024-01-29 22:55:25,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481181754] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:55:25,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:55:25,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:55:25,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392328354] [2024-01-29 22:55:25,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:55:25,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:55:25,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:55:25,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:55:25,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:55:25,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 209 [2024-01-29 22:55:25,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 207 transitions, 922 flow. Second operand has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 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-29 22:55:25,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:55:25,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 209 [2024-01-29 22:55:25,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:55:26,344 INFO L124 PetriNetUnfolderBase]: 1378/4862 cut-off events. [2024-01-29 22:55:26,344 INFO L125 PetriNetUnfolderBase]: For 4266/4393 co-relation queries the response was YES. [2024-01-29 22:55:26,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12487 conditions, 4862 events. 1378/4862 cut-off events. For 4266/4393 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 40000 event pairs, 616 based on Foata normal form. 41/4819 useless extension candidates. Maximal degree in co-relation 12460. Up to 1885 conditions per place. [2024-01-29 22:55:26,359 INFO L140 encePairwiseOnDemand]: 186/209 looper letters, 138 selfloop transitions, 38 changer transitions 10/279 dead transitions. [2024-01-29 22:55:26,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 279 transitions, 1563 flow [2024-01-29 22:55:26,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:55:26,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:55:26,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 779 transitions. [2024-01-29 22:55:26,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7454545454545455 [2024-01-29 22:55:26,361 INFO L175 Difference]: Start difference. First operand has 178 places, 207 transitions, 922 flow. Second operand 5 states and 779 transitions. [2024-01-29 22:55:26,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 279 transitions, 1563 flow [2024-01-29 22:55:26,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 279 transitions, 1497 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-01-29 22:55:26,371 INFO L231 Difference]: Finished difference. Result has 183 places, 215 transitions, 1056 flow [2024-01-29 22:55:26,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1056, PETRI_PLACES=183, PETRI_TRANSITIONS=215} [2024-01-29 22:55:26,372 INFO L281 CegarLoopForPetriNet]: 206 programPoint places, -23 predicate places. [2024-01-29 22:55:26,372 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 215 transitions, 1056 flow [2024-01-29 22:55:26,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 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-29 22:55:26,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:55:26,373 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-29 22:55:26,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 22:55:26,373 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr22ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 108 more)] === [2024-01-29 22:55:26,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:55:26,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1671271856, now seen corresponding path program 1 times [2024-01-29 22:55:26,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:55:26,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823528114] [2024-01-29 22:55:26,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:55:26,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:55:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:55:26,437 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-29 22:55:26,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:55:26,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823528114] [2024-01-29 22:55:26,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823528114] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:55:26,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:55:26,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:55:26,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275367494] [2024-01-29 22:55:26,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:55:26,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:55:26,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:55:26,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:55:26,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:55:26,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 209 [2024-01-29 22:55:26,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 215 transitions, 1056 flow. Second operand has 5 states, 5 states have (on average 56.2) internal successors, (281), 5 states have internal predecessors, (281), 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-29 22:55:26,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:55:26,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 209 [2024-01-29 22:55:26,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:55:27,312 INFO L124 PetriNetUnfolderBase]: 2315/6751 cut-off events. [2024-01-29 22:55:27,312 INFO L125 PetriNetUnfolderBase]: For 9457/9506 co-relation queries the response was YES. [2024-01-29 22:55:27,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20088 conditions, 6751 events. 2315/6751 cut-off events. For 9457/9506 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 53099 event pairs, 700 based on Foata normal form. 24/6768 useless extension candidates. Maximal degree in co-relation 20056. Up to 1771 conditions per place. [2024-01-29 22:55:27,337 INFO L140 encePairwiseOnDemand]: 173/209 looper letters, 228 selfloop transitions, 51 changer transitions 32/347 dead transitions. [2024-01-29 22:55:27,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 347 transitions, 2338 flow [2024-01-29 22:55:27,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:55:27,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:55:27,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2024-01-29 22:55:27,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861244019138756 [2024-01-29 22:55:27,341 INFO L175 Difference]: Start difference. First operand has 183 places, 215 transitions, 1056 flow. Second operand 5 states and 508 transitions. [2024-01-29 22:55:27,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 347 transitions, 2338 flow [2024-01-29 22:55:27,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 347 transitions, 2310 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-29 22:55:27,362 INFO L231 Difference]: Finished difference. Result has 185 places, 214 transitions, 1213 flow [2024-01-29 22:55:27,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=1026, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1213, PETRI_PLACES=185, PETRI_TRANSITIONS=214} [2024-01-29 22:55:27,363 INFO L281 CegarLoopForPetriNet]: 206 programPoint places, -21 predicate places. [2024-01-29 22:55:27,363 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 214 transitions, 1213 flow [2024-01-29 22:55:27,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.2) internal successors, (281), 5 states have internal predecessors, (281), 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-29 22:55:27,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:55:27,364 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] [2024-01-29 22:55:27,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 22:55:27,364 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr26ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 108 more)] === [2024-01-29 22:55:27,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:55:27,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1947621196, now seen corresponding path program 1 times [2024-01-29 22:55:27,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:55:27,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922428860] [2024-01-29 22:55:27,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:55:27,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:55:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:55:27,458 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-29 22:55:27,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:55:27,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922428860] [2024-01-29 22:55:27,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922428860] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:55:27,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:55:27,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:55:27,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207091209] [2024-01-29 22:55:27,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:55:27,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 22:55:27,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:55:27,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 22:55:27,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-29 22:55:27,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 209 [2024-01-29 22:55:27,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 214 transitions, 1213 flow. Second operand has 6 states, 6 states have (on average 50.666666666666664) internal successors, (304), 6 states have internal predecessors, (304), 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-29 22:55:27,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:55:27,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 209 [2024-01-29 22:55:27,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:55:28,381 INFO L124 PetriNetUnfolderBase]: 1568/4580 cut-off events. [2024-01-29 22:55:28,382 INFO L125 PetriNetUnfolderBase]: For 9173/9221 co-relation queries the response was YES. [2024-01-29 22:55:28,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14404 conditions, 4580 events. 1568/4580 cut-off events. For 9173/9221 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 32264 event pairs, 659 based on Foata normal form. 613/5189 useless extension candidates. Maximal degree in co-relation 14371. Up to 2314 conditions per place. [2024-01-29 22:55:28,396 INFO L140 encePairwiseOnDemand]: 158/209 looper letters, 203 selfloop transitions, 35 changer transitions 39/307 dead transitions. [2024-01-29 22:55:28,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 307 transitions, 2318 flow [2024-01-29 22:55:28,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-29 22:55:28,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-29 22:55:28,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 533 transitions. [2024-01-29 22:55:28,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42503987240829344 [2024-01-29 22:55:28,402 INFO L175 Difference]: Start difference. First operand has 185 places, 214 transitions, 1213 flow. Second operand 6 states and 533 transitions. [2024-01-29 22:55:28,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 307 transitions, 2318 flow [2024-01-29 22:55:28,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 307 transitions, 2204 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-01-29 22:55:28,414 INFO L231 Difference]: Finished difference. Result has 179 places, 184 transitions, 1015 flow [2024-01-29 22:55:28,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1015, PETRI_PLACES=179, PETRI_TRANSITIONS=184} [2024-01-29 22:55:28,415 INFO L281 CegarLoopForPetriNet]: 206 programPoint places, -27 predicate places. [2024-01-29 22:55:28,415 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 184 transitions, 1015 flow [2024-01-29 22:55:28,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 50.666666666666664) internal successors, (304), 6 states have internal predecessors, (304), 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-29 22:55:28,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:55:28,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:55:28,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 22:55:28,416 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 108 more)] === [2024-01-29 22:55:28,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:55:28,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1458061455, now seen corresponding path program 1 times [2024-01-29 22:55:28,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:55:28,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896711734] [2024-01-29 22:55:28,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:55:28,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:55:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:55:28,551 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-29 22:55:28,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:55:28,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896711734] [2024-01-29 22:55:28,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896711734] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:55:28,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:55:28,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:55:28,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541897478] [2024-01-29 22:55:28,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:55:28,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:55:28,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:55:28,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:55:28,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:55:28,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 209 [2024-01-29 22:55:28,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 184 transitions, 1015 flow. Second operand has 5 states, 5 states have (on average 164.4) internal successors, (822), 5 states have internal predecessors, (822), 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-29 22:55:28,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:55:28,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 209 [2024-01-29 22:55:28,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:55:28,735 INFO L124 PetriNetUnfolderBase]: 218/1516 cut-off events. [2024-01-29 22:55:28,736 INFO L125 PetriNetUnfolderBase]: For 2050/2092 co-relation queries the response was YES. [2024-01-29 22:55:28,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3927 conditions, 1516 events. 218/1516 cut-off events. For 2050/2092 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 9717 event pairs, 102 based on Foata normal form. 53/1527 useless extension candidates. Maximal degree in co-relation 3895. Up to 298 conditions per place. [2024-01-29 22:55:28,740 INFO L140 encePairwiseOnDemand]: 191/209 looper letters, 39 selfloop transitions, 21 changer transitions 10/187 dead transitions. [2024-01-29 22:55:28,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 187 transitions, 1153 flow [2024-01-29 22:55:28,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:55:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:55:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 708 transitions. [2024-01-29 22:55:28,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.84688995215311 [2024-01-29 22:55:28,742 INFO L175 Difference]: Start difference. First operand has 179 places, 184 transitions, 1015 flow. Second operand 4 states and 708 transitions. [2024-01-29 22:55:28,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 187 transitions, 1153 flow [2024-01-29 22:55:28,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 187 transitions, 985 flow, removed 8 selfloop flow, removed 13 redundant places. [2024-01-29 22:55:28,748 INFO L231 Difference]: Finished difference. Result has 160 places, 168 transitions, 817 flow [2024-01-29 22:55:28,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=817, PETRI_PLACES=160, PETRI_TRANSITIONS=168} [2024-01-29 22:55:28,749 INFO L281 CegarLoopForPetriNet]: 206 programPoint places, -46 predicate places. [2024-01-29 22:55:28,749 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 168 transitions, 817 flow [2024-01-29 22:55:28,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 164.4) internal successors, (822), 5 states have internal predecessors, (822), 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-29 22:55:28,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:55:28,750 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] [2024-01-29 22:55:28,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-29 22:55:28,750 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 108 more)] === [2024-01-29 22:55:28,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:55:28,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1146177112, now seen corresponding path program 1 times [2024-01-29 22:55:28,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:55:28,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668666705] [2024-01-29 22:55:28,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:55:28,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:55:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:55:28,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 22:55:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:55:28,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 22:55:28,806 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 22:55:28,807 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 111 remaining) [2024-01-29 22:55:28,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 111 remaining) [2024-01-29 22:55:28,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 111 remaining) [2024-01-29 22:55:28,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 111 remaining) [2024-01-29 22:55:28,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 111 remaining) [2024-01-29 22:55:28,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (105 of 111 remaining) [2024-01-29 22:55:28,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 111 remaining) [2024-01-29 22:55:28,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 111 remaining) [2024-01-29 22:55:28,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 111 remaining) [2024-01-29 22:55:28,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 111 remaining) [2024-01-29 22:55:28,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 111 remaining) [2024-01-29 22:55:28,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 111 remaining) [2024-01-29 22:55:28,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 111 remaining) [2024-01-29 22:55:28,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (97 of 111 remaining) [2024-01-29 22:55:28,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 111 remaining) [2024-01-29 22:55:28,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 111 remaining) [2024-01-29 22:55:28,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 111 remaining) [2024-01-29 22:55:28,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 111 remaining) [2024-01-29 22:55:28,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 111 remaining) [2024-01-29 22:55:28,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 111 remaining) [2024-01-29 22:55:28,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (90 of 111 remaining) [2024-01-29 22:55:28,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 111 remaining) [2024-01-29 22:55:28,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 111 remaining) [2024-01-29 22:55:28,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 111 remaining) [2024-01-29 22:55:28,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 111 remaining) [2024-01-29 22:55:28,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 111 remaining) [2024-01-29 22:55:28,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 111 remaining) [2024-01-29 22:55:28,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 111 remaining) [2024-01-29 22:55:28,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION (82 of 111 remaining) [2024-01-29 22:55:28,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 111 remaining) [2024-01-29 22:55:28,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 111 remaining) [2024-01-29 22:55:28,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 111 remaining) [2024-01-29 22:55:28,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (78 of 111 remaining) [2024-01-29 22:55:28,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 111 remaining) [2024-01-29 22:55:28,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 111 remaining) [2024-01-29 22:55:28,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 111 remaining) [2024-01-29 22:55:28,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 111 remaining) [2024-01-29 22:55:28,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 111 remaining) [2024-01-29 22:55:28,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 111 remaining) [2024-01-29 22:55:28,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 111 remaining) [2024-01-29 22:55:28,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 111 remaining) [2024-01-29 22:55:28,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 111 remaining) [2024-01-29 22:55:28,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 111 remaining) [2024-01-29 22:55:28,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 111 remaining) [2024-01-29 22:55:28,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 111 remaining) [2024-01-29 22:55:28,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr12ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 111 remaining) [2024-01-29 22:55:28,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr13ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 111 remaining) [2024-01-29 22:55:28,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr14ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 111 remaining) [2024-01-29 22:55:28,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr15ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 111 remaining) [2024-01-29 22:55:28,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr16ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 111 remaining) [2024-01-29 22:55:28,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr17ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 111 remaining) [2024-01-29 22:55:28,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr18ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 111 remaining) [2024-01-29 22:55:28,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr19ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 111 remaining) [2024-01-29 22:55:28,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr20ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 111 remaining) [2024-01-29 22:55:28,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr21ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 111 remaining) [2024-01-29 22:55:28,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr22ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 111 remaining) [2024-01-29 22:55:28,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr23ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 111 remaining) [2024-01-29 22:55:28,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr24ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 111 remaining) [2024-01-29 22:55:28,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr25ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 111 remaining) [2024-01-29 22:55:28,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr26ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 111 remaining) [2024-01-29 22:55:28,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr27ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 111 remaining) [2024-01-29 22:55:28,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr28ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 111 remaining) [2024-01-29 22:55:28,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr29ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 111 remaining) [2024-01-29 22:55:28,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr30ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 111 remaining) [2024-01-29 22:55:28,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr31ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 111 remaining) [2024-01-29 22:55:28,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr32ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 111 remaining) [2024-01-29 22:55:28,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr33ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 111 remaining) [2024-01-29 22:55:28,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr34ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 111 remaining) [2024-01-29 22:55:28,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr35ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 111 remaining) [2024-01-29 22:55:28,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr36ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 111 remaining) [2024-01-29 22:55:28,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr37ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 111 remaining) [2024-01-29 22:55:28,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr38ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 111 remaining) [2024-01-29 22:55:28,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 111 remaining) [2024-01-29 22:55:28,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 111 remaining) [2024-01-29 22:55:28,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 111 remaining) [2024-01-29 22:55:28,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 111 remaining) [2024-01-29 22:55:28,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 111 remaining) [2024-01-29 22:55:28,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 111 remaining) [2024-01-29 22:55:28,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 111 remaining) [2024-01-29 22:55:28,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 111 remaining) [2024-01-29 22:55:28,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 111 remaining) [2024-01-29 22:55:28,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 111 remaining) [2024-01-29 22:55:28,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 111 remaining) [2024-01-29 22:55:28,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 111 remaining) [2024-01-29 22:55:28,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr12ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 111 remaining) [2024-01-29 22:55:28,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr13ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 111 remaining) [2024-01-29 22:55:28,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr14ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 111 remaining) [2024-01-29 22:55:28,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr15ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 111 remaining) [2024-01-29 22:55:28,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr16ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 111 remaining) [2024-01-29 22:55:28,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr17ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 111 remaining) [2024-01-29 22:55:28,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr18ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 111 remaining) [2024-01-29 22:55:28,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr19ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 111 remaining) [2024-01-29 22:55:28,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr20ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 111 remaining) [2024-01-29 22:55:28,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr21ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 111 remaining) [2024-01-29 22:55:28,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr22ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 111 remaining) [2024-01-29 22:55:28,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr23ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 111 remaining) [2024-01-29 22:55:28,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr24ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 111 remaining) [2024-01-29 22:55:28,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr25ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 111 remaining) [2024-01-29 22:55:28,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr26ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 111 remaining) [2024-01-29 22:55:28,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr27ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 111 remaining) [2024-01-29 22:55:28,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr28ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 111 remaining) [2024-01-29 22:55:28,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr29ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 111 remaining) [2024-01-29 22:55:28,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr30ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 111 remaining) [2024-01-29 22:55:28,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr31ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 111 remaining) [2024-01-29 22:55:28,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr32ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 111 remaining) [2024-01-29 22:55:28,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr33ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 111 remaining) [2024-01-29 22:55:28,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr34ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 111 remaining) [2024-01-29 22:55:28,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr35ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 111 remaining) [2024-01-29 22:55:28,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr36ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 111 remaining) [2024-01-29 22:55:28,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr37ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 111 remaining) [2024-01-29 22:55:28,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr38ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 111 remaining) [2024-01-29 22:55:28,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-29 22:55:28,827 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:55:28,833 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 22:55:28,834 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 22:55:28,881 INFO L503 ceAbstractionStarter]: Automizer considered 67 witness invariants [2024-01-29 22:55:28,881 INFO L504 ceAbstractionStarter]: WitnessConsidered=67 [2024-01-29 22:55:28,882 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:55:28 BasicIcfg [2024-01-29 22:55:28,882 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 22:55:28,883 INFO L158 Benchmark]: Toolchain (without parser) took 14291.21ms. Allocated memory was 117.4MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 64.9MB in the beginning and 2.3GB in the end (delta: -2.3GB). Peak memory consumption was 588.0MB. Max. memory is 16.1GB. [2024-01-29 22:55:28,883 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory is still 52.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:55:28,883 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 117.4MB. Free memory was 70.0MB in the beginning and 69.5MB in the end (delta: 490.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:55:28,883 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.89ms. Allocated memory is still 117.4MB. Free memory was 64.9MB in the beginning and 74.0MB in the end (delta: -9.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-01-29 22:55:28,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.79ms. Allocated memory is still 117.4MB. Free memory was 74.0MB in the beginning and 87.9MB in the end (delta: -13.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 22:55:28,884 INFO L158 Benchmark]: Boogie Preprocessor took 57.84ms. Allocated memory is still 117.4MB. Free memory was 87.9MB in the beginning and 85.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 22:55:28,884 INFO L158 Benchmark]: RCFGBuilder took 629.87ms. Allocated memory is still 117.4MB. Free memory was 85.8MB in the beginning and 34.7MB in the end (delta: 51.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-01-29 22:55:28,884 INFO L158 Benchmark]: TraceAbstraction took 13077.69ms. Allocated memory was 117.4MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 34.1MB in the beginning and 2.3GB in the end (delta: -2.3GB). Peak memory consumption was 559.5MB. Max. memory is 16.1GB. [2024-01-29 22:55:28,885 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory is still 52.2MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.15ms. Allocated memory is still 117.4MB. Free memory was 70.0MB in the beginning and 69.5MB in the end (delta: 490.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 454.89ms. Allocated memory is still 117.4MB. Free memory was 64.9MB in the beginning and 74.0MB in the end (delta: -9.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.79ms. Allocated memory is still 117.4MB. Free memory was 74.0MB in the beginning and 87.9MB in the end (delta: -13.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.84ms. Allocated memory is still 117.4MB. Free memory was 87.9MB in the beginning and 85.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 629.87ms. Allocated memory is still 117.4MB. Free memory was 85.8MB in the beginning and 34.7MB in the end (delta: 51.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13077.69ms. Allocated memory was 117.4MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 34.1MB in the beginning and 2.3GB in the end (delta: -2.3GB). Peak memory consumption was 559.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 709]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L681] 0 int g1,g2; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L705] 0 pthread_t id; VAL [__global_lock={5:0}, g1=0, g2=0, id={6:0}, mutex1={3:0}, mutex2={4:0}] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g2],IntegerLiteral[0]]]]] VAL [__global_lock={5:0}, g1=0, g2=0, id={6:0}, mutex1={3:0}, mutex2={4:0}] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]]]] [L706] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [__global_lock={5:0}, arg={0:0}, g1=0, g2=0, id={6:0}, mutex1={3:0}, mutex2={4:0}] [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=0, mutex1={3:0}, mutex2={4:0}] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=0, mutex1={3:0}, mutex2={4:0}] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=0, mutex1={3:0}, mutex2={4:0}] [L688] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g2],IntegerLiteral[0]]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=0, mutex1={3:0}, mutex2={4:0}] [L688] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=0, mutex1={3:0}, mutex2={4:0}] [L688] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L688] 1 g1++ VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=1, g2=0, mutex1={3:0}, mutex2={4:0}] [L689] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[1]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=1, g2=0, mutex1={3:0}, mutex2={4:0}] [L689] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[1]],BinaryExpression[COMPEQ,IdentifierExpression[g2],IntegerLiteral[0]]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=1, g2=0, mutex1={3:0}, mutex2={4:0}] [L689] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[1]],BinaryExpression[COMPEQ,IdentifierExpression[g2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=1, g2=0, mutex1={3:0}, mutex2={4:0}] [L690] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[1]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=1, g2=0, mutex1={3:0}, mutex2={4:0}] [L690] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=1, g2=0, mutex1={3:0}, mutex2={4:0}] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[1]],BinaryExpression[COMPEQ,IdentifierExpression[g2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=1, g2=0, mutex1={3:0}, mutex2={4:0}] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[1]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=1, g2=0, mutex1={3:0}, mutex2={4:0}] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[1]],BinaryExpression[COMPEQ,IdentifierExpression[g2],IntegerLiteral[0]]]]] [L691] 1 g1-- VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=0, mutex1={3:0}, mutex2={4:0}] [L692] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=0, mutex1={3:0}, mutex2={4:0}] [L692] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g2],IntegerLiteral[0]]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=0, mutex1={3:0}, mutex2={4:0}] [L692] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=0, mutex1={3:0}, mutex2={4:0}] [L693] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=0, mutex1={3:0}, mutex2={4:0}] [L693] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=0, mutex1={3:0}, mutex2={4:0}] [L694] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=0, mutex1={3:0}, mutex2={4:0}] [L695] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g2],IntegerLiteral[0]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=0, mutex1={3:0}, mutex2={4:0}] [L695] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g2],IntegerLiteral[0]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=0, mutex1={3:0}, mutex2={4:0}] [L696] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=0, mutex1={3:0}, mutex2={4:0}] [L696] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=0, mutex1={3:0}, mutex2={4:0}] [L696] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g2],IntegerLiteral[0]]]]] [L696] 1 g2++ VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=1, mutex1={3:0}, mutex2={4:0}] [L697] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=1, mutex1={3:0}, mutex2={4:0}] [L697] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g2],IntegerLiteral[1]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=1, mutex1={3:0}, mutex2={4:0}] [L697] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g2],IntegerLiteral[1]]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=1, mutex1={3:0}, mutex2={4:0}] [L708] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=1, id={6:0}, mutex1={3:0}, mutex2={4:0}] [L709] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g2],IntegerLiteral[0]]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=1, id={6:0}, mutex1={3:0}, mutex2={4:0}] - 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: 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: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 716]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 716]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 720]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 720]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 722]: 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 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: 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: 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. - UnprovableResult [Line: 691]: 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. - UnprovableResult [Line: 692]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - 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: 695]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 696]: 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: 697]: 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: 698]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 698]: 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: 701]: 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: 702]: 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, 311 locations, 111 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: 12.9s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4210 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2803 mSDsluCounter, 837 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 388 mSDsCounter, 1027 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4967 IncrementalHoareTripleChecker+Invalid, 5994 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1027 mSolverCounterUnsat, 449 mSDtfsCounter, 4967 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1213occurred in iteration=12, InterpolantAutomatonStates: 61, 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.0s InterpolantComputationTime, 395 NumberOfCodeBlocks, 395 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 324 ConstructedInterpolants, 0 QuantifiedInterpolants, 2695 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-29 22:55:28,920 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