./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-races/race-1_3-join.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/race-1_3-join.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/ldv-races/race-1_3-join.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/race-1_3-join.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 23:20:22,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 23:20:22,307 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 23:20:22,317 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 23:20:22,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 23:20:22,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 23:20:22,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 23:20:22,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 23:20:22,343 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 23:20:22,346 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 23:20:22,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 23:20:22,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 23:20:22,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 23:20:22,348 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 23:20:22,349 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 23:20:22,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 23:20:22,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 23:20:22,349 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 23:20:22,350 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 23:20:22,350 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 23:20:22,350 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 23:20:22,350 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 23:20:22,350 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 23:20:22,351 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 23:20:22,351 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 23:20:22,351 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 23:20:22,351 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 23:20:22,351 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 23:20:22,352 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 23:20:22,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 23:20:22,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 23:20:22,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 23:20:22,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 23:20:22,353 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 23:20:22,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 23:20:22,353 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 23:20:22,354 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 23:20:22,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 23:20:22,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 23:20:22,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 23:20:22,354 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 23:20:22,355 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 23:20:22,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 23:20:22,355 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 23:20:22,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 23:20:22,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 23:20:22,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 23:20:22,617 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 23:20:22,618 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 23:20:22,619 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/race-1_3-join.yml/witness.yml [2024-01-29 23:20:22,745 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 23:20:22,745 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 23:20:22,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-1_3-join.i [2024-01-29 23:20:23,924 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 23:20:24,170 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 23:20:24,171 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-1_3-join.i [2024-01-29 23:20:24,189 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/392d332af/c7b8ca6742e74c378c059bcf0da9c4e4/FLAG29d273e65 [2024-01-29 23:20:24,202 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/392d332af/c7b8ca6742e74c378c059bcf0da9c4e4 [2024-01-29 23:20:24,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 23:20:24,203 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 23:20:24,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 23:20:24,205 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 23:20:24,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 23:20:24,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 11:20:22" (1/2) ... [2024-01-29 23:20:24,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59cf1246 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:20:24, skipping insertion in model container [2024-01-29 23:20:24,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 11:20:22" (1/2) ... [2024-01-29 23:20:24,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5c058403 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:20:24, skipping insertion in model container [2024-01-29 23:20:24,215 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:20:24" (2/2) ... [2024-01-29 23:20:24,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59cf1246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:24, skipping insertion in model container [2024-01-29 23:20:24,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:20:24" (2/2) ... [2024-01-29 23:20:24,216 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 23:20:24,324 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 23:20:24,325 INFO L98 nessWitnessExtractor]: Location invariant before [L1715-L1715] pdev == 1 [2024-01-29 23:20:24,325 INFO L98 nessWitnessExtractor]: Location invariant before [L1701-L1701] (unsigned long )arg == 0UL [2024-01-29 23:20:24,325 INFO L98 nessWitnessExtractor]: Location invariant before [L1712-L1712] pdev == 1 [2024-01-29 23:20:24,325 INFO L98 nessWitnessExtractor]: Location invariant before [L1718-L1718] pdev == 3 [2024-01-29 23:20:24,325 INFO L98 nessWitnessExtractor]: Location invariant after [L1720-L1732] (unsigned long )status == 0UL [2024-01-29 23:20:24,326 INFO L98 nessWitnessExtractor]: Location invariant before [L1704-L1704] (unsigned long )arg == 0UL [2024-01-29 23:20:24,326 INFO L98 nessWitnessExtractor]: Location invariant before [L1700-L1700] (unsigned long )arg == 0UL [2024-01-29 23:20:24,326 INFO L98 nessWitnessExtractor]: Location invariant before [L1705-L1705] (unsigned long )arg == 0UL [2024-01-29 23:20:24,326 INFO L98 nessWitnessExtractor]: Location invariant before [L1724-L1724] ((0 <= pdev) && (1 <= pdev)) && (pdev <= 127) [2024-01-29 23:20:24,326 INFO L98 nessWitnessExtractor]: Location invariant before [L1724-L1724] (0 <= pdev) && (1 <= pdev) [2024-01-29 23:20:24,326 INFO L98 nessWitnessExtractor]: Location invariant before [L1724-L1724] ((0 <= pdev) && (1 <= pdev)) && (pdev <= 6) [2024-01-29 23:20:24,326 INFO L98 nessWitnessExtractor]: Location invariant before [L1724-L1724] (((0 <= pdev) && (1 <= pdev)) && (pdev <= 127)) && (pdev != 0) [2024-01-29 23:20:24,326 INFO L98 nessWitnessExtractor]: Location invariant before [L1724-L1724] 0 <= pdev [2024-01-29 23:20:24,327 INFO L98 nessWitnessExtractor]: Location invariant before [L1724-L1724] (((0 <= pdev) && (1 <= pdev)) && (pdev <= 127)) && (((pdev == 1 || pdev == 4) || pdev == 5) || pdev == 6) [2024-01-29 23:20:24,327 INFO L98 nessWitnessExtractor]: Location invariant before [L1708-L1708] pdev == 0 [2024-01-29 23:20:24,327 INFO L98 nessWitnessExtractor]: Location invariant before [L1730-L1730] (unsigned long )status == 0UL [2024-01-29 23:20:24,327 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L22] pdev == 1 [2024-01-29 23:20:24,327 INFO L98 nessWitnessExtractor]: Location invariant before [L1710-L1710] pdev == 1 [2024-01-29 23:20:24,327 INFO L98 nessWitnessExtractor]: Location invariant before [L1723-L1723] 0 <= pdev [2024-01-29 23:20:24,327 INFO L98 nessWitnessExtractor]: Location invariant before [L1723-L1723] (0 <= pdev) && (pdev <= 127) [2024-01-29 23:20:24,327 INFO L98 nessWitnessExtractor]: Location invariant before [L1723-L1723] (0 <= pdev) && (((pdev == 1 || pdev == 4) || pdev == 5) || pdev == 6) [2024-01-29 23:20:24,328 INFO L98 nessWitnessExtractor]: Location invariant before [L1723-L1723] (0 <= pdev) && (1 <= pdev) [2024-01-29 23:20:24,328 INFO L98 nessWitnessExtractor]: Location invariant before [L1723-L1723] (0 <= pdev) && (pdev != 0) [2024-01-29 23:20:24,328 INFO L98 nessWitnessExtractor]: Location invariant before [L1723-L1723] (0 <= pdev) && (pdev <= 6) [2024-01-29 23:20:24,328 INFO L98 nessWitnessExtractor]: Location invariant before [L1695-L1695] expression == 1 [2024-01-29 23:20:24,328 INFO L98 nessWitnessExtractor]: Location invariant before [L1695-L1695] (expression == 1) && (expression == 0) [2024-01-29 23:20:24,329 INFO L98 nessWitnessExtractor]: Location invariant before [L1695-L1695] (expression == 1) && (((((((((0 <= pdev && 1 <= pdev) && pdev <= 3) && pdev <= 127) && expression == 1) && pdev % 2 == 1) && pdev != 0) && (pdev == 1 || pdev == 3)) || ((0 <= expression && expression <= 1) && (expression == 0 || expression == 1))) || ((((((((0 <= expression && 0 <= pdev) && 1 <= pdev) && expression <= 1) && pdev <= 6) && pdev <= 127) && pdev != 0) && (expression == 0 || expression == 1)) && (((pdev == 1 || pdev == 4) || pdev == 5) || pdev == 6))) [2024-01-29 23:20:24,329 INFO L98 nessWitnessExtractor]: Location invariant before [L1731-L1731] (unsigned long )status == 0UL [2024-01-29 23:20:24,329 INFO L98 nessWitnessExtractor]: Location invariant before [L1703-L1703] ((((0 <= pdev) && (1 <= pdev)) && (pdev <= 6)) && (pdev <= 127)) && (((pdev == 1 || pdev == 4) || pdev == 5) || pdev == 6) [2024-01-29 23:20:24,329 INFO L98 nessWitnessExtractor]: Location invariant before [L1703-L1703] (((0 <= pdev) && (1 <= pdev)) && (pdev <= 6)) && (pdev <= 127) [2024-01-29 23:20:24,329 INFO L98 nessWitnessExtractor]: Location invariant before [L1703-L1703] ((0 <= pdev) && (1 <= pdev)) && (pdev <= 6) [2024-01-29 23:20:24,330 INFO L98 nessWitnessExtractor]: Location invariant before [L1703-L1703] (0 <= pdev) && (1 <= pdev) [2024-01-29 23:20:24,330 INFO L98 nessWitnessExtractor]: Location invariant before [L1703-L1703] ((((0 <= pdev) && (1 <= pdev)) && (pdev <= 6)) && (pdev <= 127)) && ((unsigned long )arg == 0UL) [2024-01-29 23:20:24,330 INFO L98 nessWitnessExtractor]: Location invariant before [L1703-L1703] 0 <= pdev [2024-01-29 23:20:24,330 INFO L98 nessWitnessExtractor]: Location invariant before [L1703-L1703] ((((0 <= pdev) && (1 <= pdev)) && (pdev <= 6)) && (pdev <= 127)) && (pdev != 0) [2024-01-29 23:20:24,330 INFO L98 nessWitnessExtractor]: Location invariant before [L1727-L1727] (0 <= pdev) && (1 <= pdev) [2024-01-29 23:20:24,331 INFO L98 nessWitnessExtractor]: Location invariant before [L1727-L1727] ((0 <= pdev) && (1 <= pdev)) && (pdev <= 6) [2024-01-29 23:20:24,331 INFO L98 nessWitnessExtractor]: Location invariant before [L1727-L1727] ((0 <= pdev) && (1 <= pdev)) && (pdev != 0) [2024-01-29 23:20:24,332 INFO L98 nessWitnessExtractor]: Location invariant before [L1727-L1727] 0 <= pdev [2024-01-29 23:20:24,332 INFO L98 nessWitnessExtractor]: Location invariant before [L1727-L1727] ((0 <= pdev) && (1 <= pdev)) && (pdev <= 127) [2024-01-29 23:20:24,332 INFO L98 nessWitnessExtractor]: Location invariant before [L1727-L1727] ((0 <= pdev) && (1 <= pdev)) && (((pdev == 1 || pdev == 4) || pdev == 5) || pdev == 6) [2024-01-29 23:20:24,332 INFO L98 nessWitnessExtractor]: Location invariant before [L1717-L1717] pdev == 3 [2024-01-29 23:20:24,332 INFO L98 nessWitnessExtractor]: Location invariant before [L1711-L1714] pdev == 1 [2024-01-29 23:20:24,332 INFO L98 nessWitnessExtractor]: Location invariant before [L1716-L1716] pdev == 3 [2024-01-29 23:20:24,332 INFO L98 nessWitnessExtractor]: Location invariant before [L1726-L1726] (0 <= pdev) && (1 <= pdev) [2024-01-29 23:20:24,333 INFO L98 nessWitnessExtractor]: Location invariant before [L1726-L1726] ((0 <= pdev) && (1 <= pdev)) && (pdev != 0) [2024-01-29 23:20:24,333 INFO L98 nessWitnessExtractor]: Location invariant before [L1726-L1726] ((0 <= pdev) && (1 <= pdev)) && (((pdev == 1 || pdev == 4) || pdev == 5) || pdev == 6) [2024-01-29 23:20:24,333 INFO L98 nessWitnessExtractor]: Location invariant before [L1726-L1726] ((0 <= pdev) && (1 <= pdev)) && (pdev <= 6) [2024-01-29 23:20:24,333 INFO L98 nessWitnessExtractor]: Location invariant before [L1726-L1726] ((0 <= pdev) && (1 <= pdev)) && (pdev <= 127) [2024-01-29 23:20:24,333 INFO L98 nessWitnessExtractor]: Location invariant before [L1726-L1726] 0 <= pdev [2024-01-29 23:20:24,333 INFO L98 nessWitnessExtractor]: Location invariant before [L1709-L1709] pdev == 0 [2024-01-29 23:20:24,334 INFO L98 nessWitnessExtractor]: Location invariant before [L1702-L1702] 0 <= pdev [2024-01-29 23:20:24,334 INFO L98 nessWitnessExtractor]: Location invariant before [L1702-L1702] (0 <= pdev) && (1 <= pdev) [2024-01-29 23:20:24,334 INFO L98 nessWitnessExtractor]: Location invariant before [L1702-L1702] (0 <= pdev) && (pdev <= 6) [2024-01-29 23:20:24,334 INFO L98 nessWitnessExtractor]: Location invariant before [L1702-L1702] (0 <= pdev) && (pdev != 0) [2024-01-29 23:20:24,335 INFO L98 nessWitnessExtractor]: Location invariant before [L1702-L1702] (0 <= pdev) && (pdev <= 127) [2024-01-29 23:20:24,335 INFO L98 nessWitnessExtractor]: Location invariant before [L1702-L1702] (0 <= pdev) && (((pdev == 1 || pdev == 4) || pdev == 5) || pdev == 6) [2024-01-29 23:20:24,335 INFO L98 nessWitnessExtractor]: Location invariant before [L1702-L1702] (0 <= pdev) && ((unsigned long )arg == 0UL) [2024-01-29 23:20:24,336 INFO L98 nessWitnessExtractor]: Location invariant before [L1729-L1729] (unsigned long )status == 0UL [2024-01-29 23:20:24,381 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 23:20:24,949 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-1_3-join.i[76153,76166] [2024-01-29 23:20:24,974 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 23:20:24,984 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 23:20:24,992 WARN L424 MainDispatcher]: Unable to annotate typedef unsigned int __mode_t; with a witness entry [2024-01-29 23:20:25,014 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-1_3-join.i[76153,76166] [2024-01-29 23:20:25,016 WARN L424 MainDispatcher]: Unable to annotate void ldv_assert(int expression) { if (!expression) { ERROR: {reach_error();abort();}}; return; } 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 [2024-01-29 23:20:25,083 WARN L424 MainDispatcher]: Unable to annotate void module_exit() { void *status; __VERIFIER_atomic_begin(); pdev = 4; __VERIFIER_atomic_end(); __VERIFIER_atomic_begin(); ldv_assert(pdev==4); __VERIFIER_atomic_end(); pthread_join(t1, &status); pthread_mutex_destroy(&mutex); pdev = 5; ldv_assert(pdev==5); } with a witness entry [2024-01-29 23:20:25,084 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 23:20:25,250 INFO L206 MainTranslator]: Completed translation [2024-01-29 23:20:25,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:25 WrapperNode [2024-01-29 23:20:25,251 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 23:20:25,252 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 23:20:25,252 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 23:20:25,252 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 23:20:25,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:25" (1/1) ... [2024-01-29 23:20:25,285 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:25" (1/1) ... [2024-01-29 23:20:25,307 INFO L138 Inliner]: procedures = 483, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2024-01-29 23:20:25,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 23:20:25,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 23:20:25,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 23:20:25,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 23:20:25,317 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:25" (1/1) ... [2024-01-29 23:20:25,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:25" (1/1) ... [2024-01-29 23:20:25,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:25" (1/1) ... [2024-01-29 23:20:25,333 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 3, 5]. 36 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 0, 1, 5]. The 2 writes are split as follows [0, 1, 1, 0]. [2024-01-29 23:20:25,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:25" (1/1) ... [2024-01-29 23:20:25,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:25" (1/1) ... [2024-01-29 23:20:25,344 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:25" (1/1) ... [2024-01-29 23:20:25,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:25" (1/1) ... [2024-01-29 23:20:25,349 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:25" (1/1) ... [2024-01-29 23:20:25,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:25" (1/1) ... [2024-01-29 23:20:25,355 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 23:20:25,356 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 23:20:25,356 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 23:20:25,357 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 23:20:25,357 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:25" (1/1) ... [2024-01-29 23:20:25,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 23:20:25,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 23:20:25,418 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 23:20:25,479 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 23:20:25,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-29 23:20:25,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 23:20:25,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-29 23:20:25,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 23:20:25,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 23:20:25,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 23:20:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-29 23:20:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-29 23:20:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 23:20:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-01-29 23:20:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-01-29 23:20:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-01-29 23:20:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-01-29 23:20:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 23:20:25,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 23:20:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 23:20:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-01-29 23:20:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-01-29 23:20:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-01-29 23:20:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-01-29 23:20:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-29 23:20:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 23:20:25,496 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 23:20:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 23:20:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 23:20:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 23:20:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 23:20:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 23:20:25,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 23:20:25,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 23:20:25,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 23:20:25,498 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 23:20:25,778 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 23:20:25,780 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 23:20:26,119 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 23:20:26,119 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 23:20:26,585 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 23:20:26,586 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-29 23:20:26,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:20:26 BoogieIcfgContainer [2024-01-29 23:20:26,586 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 23:20:26,588 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 23:20:26,588 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 23:20:26,590 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 23:20:26,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 11:20:22" (1/4) ... [2024-01-29 23:20:26,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@317d13e9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 11:20:26, skipping insertion in model container [2024-01-29 23:20:26,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:20:24" (2/4) ... [2024-01-29 23:20:26,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@317d13e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:20:26, skipping insertion in model container [2024-01-29 23:20:26,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:25" (3/4) ... [2024-01-29 23:20:26,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@317d13e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:20:26, skipping insertion in model container [2024-01-29 23:20:26,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:20:26" (4/4) ... [2024-01-29 23:20:26,593 INFO L112 eAbstractionObserver]: Analyzing ICFG race-1_3-join.i [2024-01-29 23:20:26,609 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 23:20:26,609 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2024-01-29 23:20:26,610 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 23:20:26,651 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-01-29 23:20:26,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 107 transitions, 221 flow [2024-01-29 23:20:26,706 INFO L124 PetriNetUnfolderBase]: 4/138 cut-off events. [2024-01-29 23:20:26,707 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 23:20:26,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 138 events. 4/138 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 586 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 63. Up to 3 conditions per place. [2024-01-29 23:20:26,709 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 107 transitions, 221 flow [2024-01-29 23:20:26,712 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 103 transitions, 212 flow [2024-01-29 23:20:26,719 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 23:20:26,724 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;@3b560825, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 23:20:26,724 INFO L358 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2024-01-29 23:20:26,725 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 23:20:26,725 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 23:20:26,725 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 23:20:26,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:20:26,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 23:20:26,726 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 74 more)] === [2024-01-29 23:20:26,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:20:26,730 INFO L85 PathProgramCache]: Analyzing trace with hash 22491, now seen corresponding path program 1 times [2024-01-29 23:20:26,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:20:26,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852709724] [2024-01-29 23:20:26,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:20:26,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:20:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:20:26,985 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 23:20:26,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:20:26,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852709724] [2024-01-29 23:20:26,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852709724] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:20:26,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:20:26,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 23:20:26,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188165283] [2024-01-29 23:20:26,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:20:26,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:20:26,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:20:27,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:20:27,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:20:27,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 107 [2024-01-29 23:20:27,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 103 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 23:20:27,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:20:27,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 107 [2024-01-29 23:20:27,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:20:27,161 INFO L124 PetriNetUnfolderBase]: 89/270 cut-off events. [2024-01-29 23:20:27,161 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 23:20:27,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 270 events. 89/270 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1600 event pairs, 84 based on Foata normal form. 2/158 useless extension candidates. Maximal degree in co-relation 417. Up to 220 conditions per place. [2024-01-29 23:20:27,165 INFO L140 encePairwiseOnDemand]: 70/107 looper letters, 43 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2024-01-29 23:20:27,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 75 transitions, 248 flow [2024-01-29 23:20:27,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:20:27,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:20:27,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2024-01-29 23:20:27,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5763239875389408 [2024-01-29 23:20:27,177 INFO L175 Difference]: Start difference. First operand has 104 places, 103 transitions, 212 flow. Second operand 3 states and 185 transitions. [2024-01-29 23:20:27,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 75 transitions, 248 flow [2024-01-29 23:20:27,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 75 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:20:27,182 INFO L231 Difference]: Finished difference. Result has 74 places, 70 transitions, 153 flow [2024-01-29 23:20:27,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=74, PETRI_TRANSITIONS=70} [2024-01-29 23:20:27,186 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -30 predicate places. [2024-01-29 23:20:27,186 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 70 transitions, 153 flow [2024-01-29 23:20:27,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 23:20:27,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:20:27,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-29 23:20:27,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 23:20:27,187 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 74 more)] === [2024-01-29 23:20:27,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:20:27,188 INFO L85 PathProgramCache]: Analyzing trace with hash 21637643, now seen corresponding path program 1 times [2024-01-29 23:20:27,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:20:27,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680874016] [2024-01-29 23:20:27,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:20:27,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:20:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:20:27,290 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 23:20:27,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:20:27,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680874016] [2024-01-29 23:20:27,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680874016] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:20:27,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:20:27,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:20:27,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224464904] [2024-01-29 23:20:27,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:20:27,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:20:27,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:20:27,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:20:27,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:20:27,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 107 [2024-01-29 23:20:27,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 70 transitions, 153 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 23:20:27,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:20:27,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 107 [2024-01-29 23:20:27,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:20:27,404 INFO L124 PetriNetUnfolderBase]: 72/275 cut-off events. [2024-01-29 23:20:27,405 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-01-29 23:20:27,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 275 events. 72/275 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1494 event pairs, 40 based on Foata normal form. 3/190 useless extension candidates. Maximal degree in co-relation 470. Up to 165 conditions per place. [2024-01-29 23:20:27,407 INFO L140 encePairwiseOnDemand]: 95/107 looper letters, 46 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2024-01-29 23:20:27,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 75 transitions, 265 flow [2024-01-29 23:20:27,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:20:27,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:20:27,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2024-01-29 23:20:27,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4517133956386293 [2024-01-29 23:20:27,409 INFO L175 Difference]: Start difference. First operand has 74 places, 70 transitions, 153 flow. Second operand 3 states and 145 transitions. [2024-01-29 23:20:27,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 75 transitions, 265 flow [2024-01-29 23:20:27,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 75 transitions, 255 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-01-29 23:20:27,411 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 165 flow [2024-01-29 23:20:27,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2024-01-29 23:20:27,411 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -33 predicate places. [2024-01-29 23:20:27,412 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 165 flow [2024-01-29 23:20:27,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 23:20:27,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:20:27,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-29 23:20:27,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 23:20:27,412 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 74 more)] === [2024-01-29 23:20:27,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:20:27,413 INFO L85 PathProgramCache]: Analyzing trace with hash -681039762, now seen corresponding path program 1 times [2024-01-29 23:20:27,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:20:27,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009377085] [2024-01-29 23:20:27,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:20:27,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:20:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:20:27,500 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 23:20:27,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:20:27,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009377085] [2024-01-29 23:20:27,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009377085] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:20:27,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:20:27,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 23:20:27,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919368102] [2024-01-29 23:20:27,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:20:27,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:20:27,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:20:27,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:20:27,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:20:27,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 107 [2024-01-29 23:20:27,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 165 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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 23:20:27,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:20:27,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 107 [2024-01-29 23:20:27,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:20:27,615 INFO L124 PetriNetUnfolderBase]: 72/271 cut-off events. [2024-01-29 23:20:27,616 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-01-29 23:20:27,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 271 events. 72/271 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1497 event pairs, 40 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 502. Up to 165 conditions per place. [2024-01-29 23:20:27,618 INFO L140 encePairwiseOnDemand]: 97/107 looper letters, 45 selfloop transitions, 8 changer transitions 0/71 dead transitions. [2024-01-29 23:20:27,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 71 transitions, 277 flow [2024-01-29 23:20:27,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 23:20:27,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 23:20:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2024-01-29 23:20:27,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3177570093457944 [2024-01-29 23:20:27,620 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 165 flow. Second operand 5 states and 170 transitions. [2024-01-29 23:20:27,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 71 transitions, 277 flow [2024-01-29 23:20:27,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 71 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:20:27,622 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 166 flow [2024-01-29 23:20:27,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2024-01-29 23:20:27,623 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -35 predicate places. [2024-01-29 23:20:27,623 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 166 flow [2024-01-29 23:20:27,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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 23:20:27,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:20:27,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:20:27,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 23:20:27,624 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 74 more)] === [2024-01-29 23:20:27,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:20:27,624 INFO L85 PathProgramCache]: Analyzing trace with hash 561425657, now seen corresponding path program 1 times [2024-01-29 23:20:27,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:20:27,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900409094] [2024-01-29 23:20:27,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:20:27,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:20:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:20:27,657 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 23:20:27,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:20:27,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900409094] [2024-01-29 23:20:27,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900409094] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:20:27,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:20:27,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:20:27,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493832129] [2024-01-29 23:20:27,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:20:27,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:20:27,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:20:27,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:20:27,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:20:27,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 107 [2024-01-29 23:20:27,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 23:20:27,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:20:27,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 107 [2024-01-29 23:20:27,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:20:27,736 INFO L124 PetriNetUnfolderBase]: 72/238 cut-off events. [2024-01-29 23:20:27,737 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-01-29 23:20:27,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 238 events. 72/238 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1249 event pairs, 69 based on Foata normal form. 1/163 useless extension candidates. Maximal degree in co-relation 191. Up to 181 conditions per place. [2024-01-29 23:20:27,739 INFO L140 encePairwiseOnDemand]: 100/107 looper letters, 45 selfloop transitions, 1 changer transitions 2/66 dead transitions. [2024-01-29 23:20:27,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 66 transitions, 268 flow [2024-01-29 23:20:27,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:20:27,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:20:27,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2024-01-29 23:20:27,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4423676012461059 [2024-01-29 23:20:27,740 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 166 flow. Second operand 3 states and 142 transitions. [2024-01-29 23:20:27,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 66 transitions, 268 flow [2024-01-29 23:20:27,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 66 transitions, 254 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 23:20:27,742 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 155 flow [2024-01-29 23:20:27,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2024-01-29 23:20:27,743 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -39 predicate places. [2024-01-29 23:20:27,743 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 155 flow [2024-01-29 23:20:27,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 23:20:27,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:20:27,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:20:27,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 23:20:27,744 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 74 more)] === [2024-01-29 23:20:27,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:20:27,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1636967270, now seen corresponding path program 1 times [2024-01-29 23:20:27,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:20:27,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625328451] [2024-01-29 23:20:27,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:20:27,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:20:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:20:27,866 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 23:20:27,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:20:27,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625328451] [2024-01-29 23:20:27,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625328451] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:20:27,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:20:27,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:20:27,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10310178] [2024-01-29 23:20:27,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:20:27,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:20:27,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:20:27,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:20:27,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:20:27,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 107 [2024-01-29 23:20:27,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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 23:20:27,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:20:27,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 107 [2024-01-29 23:20:27,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:20:27,960 INFO L124 PetriNetUnfolderBase]: 84/288 cut-off events. [2024-01-29 23:20:27,960 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-01-29 23:20:27,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 558 conditions, 288 events. 84/288 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1371 event pairs, 6 based on Foata normal form. 42/268 useless extension candidates. Maximal degree in co-relation 530. Up to 183 conditions per place. [2024-01-29 23:20:27,962 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 56 selfloop transitions, 2 changer transitions 2/74 dead transitions. [2024-01-29 23:20:27,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 74 transitions, 305 flow [2024-01-29 23:20:27,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:20:27,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:20:27,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2024-01-29 23:20:27,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4158878504672897 [2024-01-29 23:20:27,964 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 155 flow. Second operand 4 states and 178 transitions. [2024-01-29 23:20:27,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 74 transitions, 305 flow [2024-01-29 23:20:27,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 74 transitions, 304 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 23:20:27,966 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 150 flow [2024-01-29 23:20:27,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2024-01-29 23:20:27,967 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -41 predicate places. [2024-01-29 23:20:27,967 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 150 flow [2024-01-29 23:20:27,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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 23:20:27,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:20:27,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:20:27,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 23:20:27,968 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 74 more)] === [2024-01-29 23:20:27,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:20:27,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1918501456, now seen corresponding path program 1 times [2024-01-29 23:20:27,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:20:27,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009310501] [2024-01-29 23:20:27,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:20:27,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:20:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:20:28,041 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 23:20:28,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:20:28,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009310501] [2024-01-29 23:20:28,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009310501] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:20:28,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:20:28,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:20:28,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204720305] [2024-01-29 23:20:28,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:20:28,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:20:28,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:20:28,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:20:28,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:20:28,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 107 [2024-01-29 23:20:28,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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 23:20:28,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:20:28,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 107 [2024-01-29 23:20:28,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:20:28,122 INFO L124 PetriNetUnfolderBase]: 53/183 cut-off events. [2024-01-29 23:20:28,122 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-01-29 23:20:28,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 183 events. 53/183 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 852 event pairs, 41 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 330. Up to 133 conditions per place. [2024-01-29 23:20:28,123 INFO L140 encePairwiseOnDemand]: 97/107 looper letters, 46 selfloop transitions, 5 changer transitions 0/65 dead transitions. [2024-01-29 23:20:28,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 65 transitions, 267 flow [2024-01-29 23:20:28,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:20:28,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:20:28,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2024-01-29 23:20:28,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48286604361370716 [2024-01-29 23:20:28,125 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 150 flow. Second operand 3 states and 155 transitions. [2024-01-29 23:20:28,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 65 transitions, 267 flow [2024-01-29 23:20:28,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 65 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:20:28,127 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 181 flow [2024-01-29 23:20:28,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2024-01-29 23:20:28,127 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -40 predicate places. [2024-01-29 23:20:28,128 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 181 flow [2024-01-29 23:20:28,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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 23:20:28,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:20:28,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:20:28,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 23:20:28,129 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 74 more)] === [2024-01-29 23:20:28,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:20:28,129 INFO L85 PathProgramCache]: Analyzing trace with hash -972220099, now seen corresponding path program 1 times [2024-01-29 23:20:28,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:20:28,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378029011] [2024-01-29 23:20:28,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:20:28,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:20:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:20:28,201 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 23:20:28,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:20:28,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378029011] [2024-01-29 23:20:28,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378029011] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:20:28,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:20:28,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:20:28,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738203462] [2024-01-29 23:20:28,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:20:28,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:20:28,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:20:28,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:20:28,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:20:28,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 107 [2024-01-29 23:20:28,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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 23:20:28,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:20:28,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 107 [2024-01-29 23:20:28,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:20:28,299 INFO L124 PetriNetUnfolderBase]: 84/258 cut-off events. [2024-01-29 23:20:28,299 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-01-29 23:20:28,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 258 events. 84/258 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1063 event pairs, 36 based on Foata normal form. 6/233 useless extension candidates. Maximal degree in co-relation 477. Up to 169 conditions per place. [2024-01-29 23:20:28,301 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 51 selfloop transitions, 6 changer transitions 6/73 dead transitions. [2024-01-29 23:20:28,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 73 transitions, 344 flow [2024-01-29 23:20:28,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:20:28,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:20:28,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2024-01-29 23:20:28,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3411214953271028 [2024-01-29 23:20:28,303 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 181 flow. Second operand 4 states and 146 transitions. [2024-01-29 23:20:28,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 73 transitions, 344 flow [2024-01-29 23:20:28,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 73 transitions, 330 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-29 23:20:28,305 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 196 flow [2024-01-29 23:20:28,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2024-01-29 23:20:28,306 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -37 predicate places. [2024-01-29 23:20:28,306 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 196 flow [2024-01-29 23:20:28,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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 23:20:28,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:20:28,306 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 23:20:28,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 23:20:28,307 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 74 more)] === [2024-01-29 23:20:28,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:20:28,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1796182146, now seen corresponding path program 1 times [2024-01-29 23:20:28,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:20:28,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955023697] [2024-01-29 23:20:28,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:20:28,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:20:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:20:28,390 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 23:20:28,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:20:28,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955023697] [2024-01-29 23:20:28,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955023697] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:20:28,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:20:28,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 23:20:28,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858364499] [2024-01-29 23:20:28,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:20:28,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:20:28,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:20:28,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:20:28,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:20:28,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 107 [2024-01-29 23:20:28,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 196 flow. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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 23:20:28,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:20:28,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 107 [2024-01-29 23:20:28,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:20:28,471 INFO L124 PetriNetUnfolderBase]: 40/152 cut-off events. [2024-01-29 23:20:28,471 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2024-01-29 23:20:28,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 152 events. 40/152 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 621 event pairs, 35 based on Foata normal form. 1/128 useless extension candidates. Maximal degree in co-relation 325. Up to 124 conditions per place. [2024-01-29 23:20:28,472 INFO L140 encePairwiseOnDemand]: 104/107 looper letters, 37 selfloop transitions, 0 changer transitions 8/59 dead transitions. [2024-01-29 23:20:28,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 59 transitions, 284 flow [2024-01-29 23:20:28,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:20:28,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:20:28,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2024-01-29 23:20:28,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4088785046728972 [2024-01-29 23:20:28,474 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 196 flow. Second operand 4 states and 175 transitions. [2024-01-29 23:20:28,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 59 transitions, 284 flow [2024-01-29 23:20:28,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 59 transitions, 272 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-01-29 23:20:28,477 INFO L231 Difference]: Finished difference. Result has 68 places, 51 transitions, 169 flow [2024-01-29 23:20:28,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=68, PETRI_TRANSITIONS=51} [2024-01-29 23:20:28,480 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -36 predicate places. [2024-01-29 23:20:28,480 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 51 transitions, 169 flow [2024-01-29 23:20:28,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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 23:20:28,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:20:28,480 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] [2024-01-29 23:20:28,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 23:20:28,481 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 74 more)] === [2024-01-29 23:20:28,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:20:28,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1115503862, now seen corresponding path program 1 times [2024-01-29 23:20:28,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:20:28,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755460343] [2024-01-29 23:20:28,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:20:28,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:20:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:20:28,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:20:28,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:20:28,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755460343] [2024-01-29 23:20:28,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755460343] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:20:28,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:20:28,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:20:28,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385288587] [2024-01-29 23:20:28,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:20:28,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:20:28,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:20:28,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:20:28,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:20:28,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 107 [2024-01-29 23:20:28,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 51 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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 23:20:28,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:20:28,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 107 [2024-01-29 23:20:28,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:20:28,657 INFO L124 PetriNetUnfolderBase]: 67/212 cut-off events. [2024-01-29 23:20:28,658 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-01-29 23:20:28,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 212 events. 67/212 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 829 event pairs, 32 based on Foata normal form. 2/190 useless extension candidates. Maximal degree in co-relation 516. Up to 128 conditions per place. [2024-01-29 23:20:28,659 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 46 selfloop transitions, 6 changer transitions 0/61 dead transitions. [2024-01-29 23:20:28,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 61 transitions, 305 flow [2024-01-29 23:20:28,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:20:28,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:20:28,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2024-01-29 23:20:28,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35046728971962615 [2024-01-29 23:20:28,661 INFO L175 Difference]: Start difference. First operand has 68 places, 51 transitions, 169 flow. Second operand 4 states and 150 transitions. [2024-01-29 23:20:28,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 61 transitions, 305 flow [2024-01-29 23:20:28,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 61 transitions, 293 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-01-29 23:20:28,664 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 197 flow [2024-01-29 23:20:28,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2024-01-29 23:20:28,665 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -43 predicate places. [2024-01-29 23:20:28,667 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 197 flow [2024-01-29 23:20:28,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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 23:20:28,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:20:28,667 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] [2024-01-29 23:20:28,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 23:20:28,668 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 74 more)] === [2024-01-29 23:20:28,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:20:28,672 INFO L85 PathProgramCache]: Analyzing trace with hash 971291077, now seen corresponding path program 1 times [2024-01-29 23:20:28,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:20:28,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064918137] [2024-01-29 23:20:28,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:20:28,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:20:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:20:28,721 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 23:20:28,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:20:28,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064918137] [2024-01-29 23:20:28,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064918137] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:20:28,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:20:28,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:20:28,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518533455] [2024-01-29 23:20:28,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:20:28,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:20:28,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:20:28,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:20:28,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:20:28,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 107 [2024-01-29 23:20:28,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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 23:20:28,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:20:28,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 107 [2024-01-29 23:20:28,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:20:28,772 INFO L124 PetriNetUnfolderBase]: 38/146 cut-off events. [2024-01-29 23:20:28,772 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2024-01-29 23:20:28,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 146 events. 38/146 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 597 event pairs, 30 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 366. Up to 113 conditions per place. [2024-01-29 23:20:28,773 INFO L140 encePairwiseOnDemand]: 105/107 looper letters, 36 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2024-01-29 23:20:28,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 51 transitions, 267 flow [2024-01-29 23:20:28,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:20:28,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:20:28,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2024-01-29 23:20:28,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40498442367601245 [2024-01-29 23:20:28,775 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 197 flow. Second operand 3 states and 130 transitions. [2024-01-29 23:20:28,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 51 transitions, 267 flow [2024-01-29 23:20:28,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 51 transitions, 265 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 23:20:28,776 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 193 flow [2024-01-29 23:20:28,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2024-01-29 23:20:28,777 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -43 predicate places. [2024-01-29 23:20:28,777 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 193 flow [2024-01-29 23:20:28,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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 23:20:28,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:20:28,778 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] [2024-01-29 23:20:28,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 23:20:28,778 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 74 more)] === [2024-01-29 23:20:28,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:20:28,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1563607337, now seen corresponding path program 1 times [2024-01-29 23:20:28,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:20:28,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68828084] [2024-01-29 23:20:28,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:20:28,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:20:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:20:28,828 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 23:20:28,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:20:28,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68828084] [2024-01-29 23:20:28,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68828084] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:20:28,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:20:28,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:20:28,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439590066] [2024-01-29 23:20:28,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:20:28,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:20:28,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:20:28,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:20:28,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:20:28,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 107 [2024-01-29 23:20:28,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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 23:20:28,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:20:28,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 107 [2024-01-29 23:20:28,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:20:28,884 INFO L124 PetriNetUnfolderBase]: 25/124 cut-off events. [2024-01-29 23:20:28,884 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2024-01-29 23:20:28,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 124 events. 25/124 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 424 event pairs, 7 based on Foata normal form. 3/123 useless extension candidates. Maximal degree in co-relation 299. Up to 51 conditions per place. [2024-01-29 23:20:28,885 INFO L140 encePairwiseOnDemand]: 98/107 looper letters, 34 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2024-01-29 23:20:28,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 53 transitions, 264 flow [2024-01-29 23:20:28,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:20:28,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:20:28,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2024-01-29 23:20:28,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43613707165109034 [2024-01-29 23:20:28,887 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 193 flow. Second operand 3 states and 140 transitions. [2024-01-29 23:20:28,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 53 transitions, 264 flow [2024-01-29 23:20:28,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 53 transitions, 263 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 23:20:28,888 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 178 flow [2024-01-29 23:20:28,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2024-01-29 23:20:28,889 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -47 predicate places. [2024-01-29 23:20:28,889 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 178 flow [2024-01-29 23:20:28,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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 23:20:28,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:20:28,889 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] [2024-01-29 23:20:28,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 23:20:28,890 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 74 more)] === [2024-01-29 23:20:28,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:20:28,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2110451484, now seen corresponding path program 2 times [2024-01-29 23:20:28,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:20:28,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716693393] [2024-01-29 23:20:28,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:20:28,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:20:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:20:28,939 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 23:20:28,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:20:28,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716693393] [2024-01-29 23:20:28,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716693393] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:20:28,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:20:28,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:20:28,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602184179] [2024-01-29 23:20:28,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:20:28,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:20:28,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:20:28,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:20:28,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:20:28,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 107 [2024-01-29 23:20:28,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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 23:20:28,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:20:28,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 107 [2024-01-29 23:20:28,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:20:29,020 INFO L124 PetriNetUnfolderBase]: 45/162 cut-off events. [2024-01-29 23:20:29,020 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2024-01-29 23:20:29,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 162 events. 45/162 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 513 event pairs, 18 based on Foata normal form. 2/164 useless extension candidates. Maximal degree in co-relation 423. Up to 108 conditions per place. [2024-01-29 23:20:29,022 INFO L140 encePairwiseOnDemand]: 104/107 looper letters, 36 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2024-01-29 23:20:29,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 48 transitions, 262 flow [2024-01-29 23:20:29,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:20:29,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:20:29,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2024-01-29 23:20:29,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3130841121495327 [2024-01-29 23:20:29,023 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 178 flow. Second operand 4 states and 134 transitions. [2024-01-29 23:20:29,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 48 transitions, 262 flow [2024-01-29 23:20:29,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 48 transitions, 244 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-01-29 23:20:29,024 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 160 flow [2024-01-29 23:20:29,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2024-01-29 23:20:29,025 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -49 predicate places. [2024-01-29 23:20:29,025 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 160 flow [2024-01-29 23:20:29,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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 23:20:29,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:20:29,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:20:29,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 23:20:29,026 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 74 more)] === [2024-01-29 23:20:29,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:20:29,026 INFO L85 PathProgramCache]: Analyzing trace with hash 45231056, now seen corresponding path program 1 times [2024-01-29 23:20:29,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:20:29,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670838024] [2024-01-29 23:20:29,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:20:29,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:20:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 23:20:29,045 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 23:20:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 23:20:29,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 23:20:29,087 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 23:20:29,088 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION (76 of 77 remaining) [2024-01-29 23:20:29,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 77 remaining) [2024-01-29 23:20:29,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 77 remaining) [2024-01-29 23:20:29,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 77 remaining) [2024-01-29 23:20:29,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 77 remaining) [2024-01-29 23:20:29,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 77 remaining) [2024-01-29 23:20:29,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 77 remaining) [2024-01-29 23:20:29,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 77 remaining) [2024-01-29 23:20:29,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 77 remaining) [2024-01-29 23:20:29,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 77 remaining) [2024-01-29 23:20:29,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 77 remaining) [2024-01-29 23:20:29,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 77 remaining) [2024-01-29 23:20:29,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 77 remaining) [2024-01-29 23:20:29,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 77 remaining) [2024-01-29 23:20:29,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 77 remaining) [2024-01-29 23:20:29,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 77 remaining) [2024-01-29 23:20:29,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 77 remaining) [2024-01-29 23:20:29,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 77 remaining) [2024-01-29 23:20:29,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 77 remaining) [2024-01-29 23:20:29,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 77 remaining) [2024-01-29 23:20:29,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 77 remaining) [2024-01-29 23:20:29,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 77 remaining) [2024-01-29 23:20:29,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (54 of 77 remaining) [2024-01-29 23:20:29,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 77 remaining) [2024-01-29 23:20:29,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 77 remaining) [2024-01-29 23:20:29,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 77 remaining) [2024-01-29 23:20:29,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 77 remaining) [2024-01-29 23:20:29,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (49 of 77 remaining) [2024-01-29 23:20:29,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 77 remaining) [2024-01-29 23:20:29,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 77 remaining) [2024-01-29 23:20:29,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 77 remaining) [2024-01-29 23:20:29,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 77 remaining) [2024-01-29 23:20:29,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 77 remaining) [2024-01-29 23:20:29,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 77 remaining) [2024-01-29 23:20:29,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 77 remaining) [2024-01-29 23:20:29,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 77 remaining) [2024-01-29 23:20:29,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 77 remaining) [2024-01-29 23:20:29,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 77 remaining) [2024-01-29 23:20:29,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 77 remaining) [2024-01-29 23:20:29,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 77 remaining) [2024-01-29 23:20:29,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 77 remaining) [2024-01-29 23:20:29,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 77 remaining) [2024-01-29 23:20:29,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 77 remaining) [2024-01-29 23:20:29,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 77 remaining) [2024-01-29 23:20:29,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 77 remaining) [2024-01-29 23:20:29,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 77 remaining) [2024-01-29 23:20:29,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 77 remaining) [2024-01-29 23:20:29,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 77 remaining) [2024-01-29 23:20:29,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 77 remaining) [2024-01-29 23:20:29,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 77 remaining) [2024-01-29 23:20:29,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 77 remaining) [2024-01-29 23:20:29,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 77 remaining) [2024-01-29 23:20:29,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 77 remaining) [2024-01-29 23:20:29,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 77 remaining) [2024-01-29 23:20:29,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 77 remaining) [2024-01-29 23:20:29,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 77 remaining) [2024-01-29 23:20:29,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 77 remaining) [2024-01-29 23:20:29,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION (19 of 77 remaining) [2024-01-29 23:20:29,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 77 remaining) [2024-01-29 23:20:29,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 77 remaining) [2024-01-29 23:20:29,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 77 remaining) [2024-01-29 23:20:29,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 77 remaining) [2024-01-29 23:20:29,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 77 remaining) [2024-01-29 23:20:29,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 77 remaining) [2024-01-29 23:20:29,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 77 remaining) [2024-01-29 23:20:29,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 77 remaining) [2024-01-29 23:20:29,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 77 remaining) [2024-01-29 23:20:29,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 77 remaining) [2024-01-29 23:20:29,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 77 remaining) [2024-01-29 23:20:29,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 77 remaining) [2024-01-29 23:20:29,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 77 remaining) [2024-01-29 23:20:29,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 77 remaining) [2024-01-29 23:20:29,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 77 remaining) [2024-01-29 23:20:29,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 77 remaining) [2024-01-29 23:20:29,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 77 remaining) [2024-01-29 23:20:29,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 77 remaining) [2024-01-29 23:20:29,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 77 remaining) [2024-01-29 23:20:29,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 23:20:29,125 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:20:29,130 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 23:20:29,130 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 23:20:29,150 INFO L503 ceAbstractionStarter]: Automizer considered 54 witness invariants [2024-01-29 23:20:29,150 INFO L504 ceAbstractionStarter]: WitnessConsidered=54 [2024-01-29 23:20:29,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:20:29 BasicIcfg [2024-01-29 23:20:29,151 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 23:20:29,151 INFO L158 Benchmark]: Toolchain (without parser) took 4948.42ms. Allocated memory was 172.0MB in the beginning and 331.4MB in the end (delta: 159.4MB). Free memory was 106.5MB in the beginning and 280.5MB in the end (delta: -174.0MB). Peak memory consumption was 169.3MB. Max. memory is 16.1GB. [2024-01-29 23:20:29,152 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 172.0MB. Free memory is still 134.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 23:20:29,152 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 172.0MB. Free memory is still 129.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 23:20:29,152 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1046.54ms. Allocated memory was 172.0MB in the beginning and 228.6MB in the end (delta: 56.6MB). Free memory was 106.5MB in the beginning and 168.3MB in the end (delta: -61.8MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. [2024-01-29 23:20:29,152 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.57ms. Allocated memory is still 228.6MB. Free memory was 168.3MB in the beginning and 164.3MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 23:20:29,152 INFO L158 Benchmark]: Boogie Preprocessor took 47.70ms. Allocated memory is still 228.6MB. Free memory was 164.3MB in the beginning and 161.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 23:20:29,153 INFO L158 Benchmark]: RCFGBuilder took 1230.05ms. Allocated memory is still 228.6MB. Free memory was 160.1MB in the beginning and 127.3MB in the end (delta: 32.8MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-01-29 23:20:29,153 INFO L158 Benchmark]: TraceAbstraction took 2563.32ms. Allocated memory was 228.6MB in the beginning and 331.4MB in the end (delta: 102.8MB). Free memory was 127.3MB in the beginning and 280.5MB in the end (delta: -153.2MB). Peak memory consumption was 133.3MB. Max. memory is 16.1GB. [2024-01-29 23:20:29,154 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.16ms. Allocated memory is still 172.0MB. Free memory is still 134.2MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.15ms. Allocated memory is still 172.0MB. Free memory is still 129.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1046.54ms. Allocated memory was 172.0MB in the beginning and 228.6MB in the end (delta: 56.6MB). Free memory was 106.5MB in the beginning and 168.3MB in the end (delta: -61.8MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.57ms. Allocated memory is still 228.6MB. Free memory was 168.3MB in the beginning and 164.3MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.70ms. Allocated memory is still 228.6MB. Free memory was 164.3MB in the beginning and 161.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1230.05ms. Allocated memory is still 228.6MB. Free memory was 160.1MB in the beginning and 127.3MB in the end (delta: 32.8MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2563.32ms. Allocated memory was 228.6MB in the beginning and 331.4MB in the end (delta: 102.8MB). Free memory was 127.3MB in the beginning and 280.5MB in the end (delta: -153.2MB). Peak memory consumption was 133.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1695]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1696] 0 pthread_t t1; [L1696] 0 pthread_t t1; [L1697] 0 pthread_mutex_t mutex; [L1697] 0 pthread_mutex_t mutex; [L1697] 0 pthread_mutex_t mutex; [L1697] 0 pthread_mutex_t mutex; [L1697] 0 pthread_mutex_t mutex; [L1697] 0 pthread_mutex_t mutex; [L1698] 0 int pdev; [L1734] CALL, EXPR 0 module_init() [L1708] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[0]]]] [L1709] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[0]]]] [L1709] 0 pdev = 1 VAL [mutex={4:0}, pdev=1, t1={3:0}] [L1710] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[1]]]] [L1710] CALL 0 ldv_assert(pdev==1) [L1695] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, mutex={4:0}, pdev=1, t1={3:0}] [L1710] RET 0 ldv_assert(pdev==1) [L1711] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[1]]]] [L1711] COND TRUE 0 __VERIFIER_nondet_int() [L1712] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[1]]]] [L1712] FCALL, FORK 0 pthread_create(&t1, ((void *)0), thread1, ((void *)0)) VAL [arg={0:0}, mutex={4:0}, pdev=1, t1={3:0}] [L1713] 0 return 0; VAL [\result=0, arg={0:0}, mutex={4:0}, pdev=1, t1={3:0}] [L1734] RET, EXPR 0 module_init() [L1734] COND FALSE 0 !(module_init()!=0) [L1735] CALL 0 module_exit() [L1721] 0 void *status; VAL [arg={0:0}, arg={0:0}, mutex={4:0}, pdev=1, status={7:0}, t1={3:0}] [L1700] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, mutex={4:0}, pdev=1, t1={3:0}] [L1701] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, mutex={4:0}, pdev=1, t1={3:0}] [L1723] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]] [L1723] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPNEQ,IdentifierExpression[pdev],IntegerLiteral[0]]]]] [L1723] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]]]] [L1723] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[1]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]]] [L1723] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[127]]]]] [L1723] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]]]] [L1723] 0 pdev = 4 [L1724] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[1]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]]] [L1724] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]]]] [L1724] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[pdev],IntegerLiteral[0]]]]] [L1724] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]] [L1724] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]]]] [L1724] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[127]]]]] VAL [arg={0:0}, arg={0:0}, mutex={4:0}, pdev=4, status={7:0}, t1={3:0}] [L1702] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L1702] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[1]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]]] [L1702] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[127]]]]] [L1702] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPNEQ,IdentifierExpression[pdev],IntegerLiteral[0]]]]] [L1702] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]] [L1702] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]]]] [L1702] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]]]] [L1702] 1 pdev = 6 [L1703] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[pdev],IntegerLiteral[0]]]]] [L1703] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]]]] [L1703] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[127]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L1703] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]]]] [L1703] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]] [L1703] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[127]]]]] [L1703] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[1]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]]] VAL [arg={0:0}, arg={0:0}, mutex={4:0}, pdev=6, t1={3:0}] [L1726] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]]]] [L1726] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[127]]]]] [L1726] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]] [L1726] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[1]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]]] [L1726] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPNEQ,IdentifierExpression[pdev],IntegerLiteral[0]]]]] [L1726] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]]]] [L1726] CALL 0 ldv_assert(pdev==4) [L1695] COND TRUE 0 !expression [L1695] 0 reach_error() VAL [\old(expression)=0, arg={0:0}, arg={0:0}, expression=0, mutex={4:0}, pdev=6, t1={3:0}] - UnprovableResult [Line: 1700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1702]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1702]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1702]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1702]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1702]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1702]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1702]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1703]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1703]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1703]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1703]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1703]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1703]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1703]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1704]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1705]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1710]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1695]: 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: 1711]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1712]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1715]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1716]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1695]: 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: 1717]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1723]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1723]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1723]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1723]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1723]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1723]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1727]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1727]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1727]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1727]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1727]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1727]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1729]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1730]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1731]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1695]: 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: 1712]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 133 locations, 77 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: 2.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 593 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 380 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1155 IncrementalHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 78 mSDtfsCounter, 1155 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=0, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 423 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 23:20:29,184 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