./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.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/arithmetic_prog_bad.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 59af5db6 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/pthread-deagle/arithmetic_prog_bad.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/arithmetic_prog_bad.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-59af5db-m [2024-02-02 09:37:01,851 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-02 09:37:01,924 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-02 09:37:01,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-02 09:37:01,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-02 09:37:01,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-02 09:37:01,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-02 09:37:01,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-02 09:37:01,951 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-02 09:37:01,951 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-02 09:37:01,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-02 09:37:01,952 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-02 09:37:01,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-02 09:37:01,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-02 09:37:01,954 INFO L153 SettingsManager]: * Use SBE=true [2024-02-02 09:37:01,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-02 09:37:01,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-02 09:37:01,955 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-02 09:37:01,955 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-02 09:37:01,955 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-02 09:37:01,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-02 09:37:01,963 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-02 09:37:01,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-02 09:37:01,964 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-02 09:37:01,967 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-02 09:37:01,967 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-02 09:37:01,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-02 09:37:01,968 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-02 09:37:01,968 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-02 09:37:01,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-02 09:37:01,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-02 09:37:01,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-02 09:37:01,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:37:01,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-02 09:37:01,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-02 09:37:01,972 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-02 09:37:01,972 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-02 09:37:01,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-02 09:37:01,972 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-02 09:37:01,972 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-02 09:37:01,973 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-02 09:37:01,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-02 09:37:01,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-02 09:37:01,974 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-02-02 09:37:02,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-02 09:37:02,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-02 09:37:02,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-02 09:37:02,221 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-02 09:37:02,222 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-02 09:37:02,222 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/arithmetic_prog_bad.yml/witness.yml [2024-02-02 09:37:02,385 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-02 09:37:02,388 INFO L274 PluginConnector]: CDTParser initialized [2024-02-02 09:37:02,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2024-02-02 09:37:03,554 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-02 09:37:03,815 INFO L384 CDTParser]: Found 1 translation units. [2024-02-02 09:37:03,816 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2024-02-02 09:37:03,833 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4abb839b2/a99e31824ea24a4f9e02da3bc6bda5ca/FLAG59f0b14bd [2024-02-02 09:37:03,845 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4abb839b2/a99e31824ea24a4f9e02da3bc6bda5ca [2024-02-02 09:37:03,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-02 09:37:03,847 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-02 09:37:03,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-02 09:37:03,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-02 09:37:03,854 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-02 09:37:03,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:37:02" (1/2) ... [2024-02-02 09:37:03,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab1a902 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:37:03, skipping insertion in model container [2024-02-02 09:37:03,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:37:02" (1/2) ... [2024-02-02 09:37:03,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@62d18ed6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:37:03, skipping insertion in model container [2024-02-02 09:37:03,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:37:03" (2/2) ... [2024-02-02 09:37:03,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab1a902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:37:03, skipping insertion in model container [2024-02-02 09:37:03,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:37:03" (2/2) ... [2024-02-02 09:37:03,861 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-02 09:37:03,958 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-02 09:37:03,959 INFO L101 nessWitnessExtractor]: Loop invariant at [L894-L895] (((0 <= num) && (num <= 1)) && ((unsigned long )arg == 0UL)) && ((((((((((((((((((((((((((((((((((((((((((((((((((((0 == j && j == 0) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) [2024-02-02 09:37:03,960 INFO L101 nessWitnessExtractor]: Location invariant after [L894-L895] ((num == 0) && ((unsigned long )arg == 0UL)) && ((((((((((((((((((((((((((((((((((((((((((((((((((((0 == j && j == 0) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) [2024-02-02 09:37:03,960 INFO L101 nessWitnessExtractor]: Loop invariant at [L878-L886] ((unsigned long )arg == 0UL) && ((1 <= i && i <= 3) || (0 == i && i == 0)) [2024-02-02 09:37:03,960 INFO L101 nessWitnessExtractor]: Location invariant before [L902-L902] (j == 3) && ((unsigned long )arg == 0UL) [2024-02-02 09:37:03,960 INFO L101 nessWitnessExtractor]: Location invariant before [L883-L883] ((num == 1) && ((unsigned long )arg == 0UL)) && ((0 == i && i == 0) || (1 <= i && i <= 2)) [2024-02-02 09:37:03,960 INFO L101 nessWitnessExtractor]: Location invariant before [L882-L882] ((num == 0) && ((unsigned long )arg == 0UL)) && ((0 == i && i == 0) || (1 <= i && i <= 2)) [2024-02-02 09:37:03,961 INFO L101 nessWitnessExtractor]: Location invariant before [L913-L913] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-02-02 09:37:03,961 INFO L101 nessWitnessExtractor]: Location invariant before [L887-L887] (i == 3) && ((unsigned long )arg == 0UL) [2024-02-02 09:37:03,961 INFO L101 nessWitnessExtractor]: Location invariant before [L896-L896] ((num == 1) && ((unsigned long )arg == 0UL)) && ((0 == j && j == 0) || (1 <= j && j <= 2)) [2024-02-02 09:37:03,961 INFO L101 nessWitnessExtractor]: Location invariant before [L885-L885] ((unsigned long )arg == 0UL) && ((0 == i && i == 0) || (1 <= i && i <= 2)) [2024-02-02 09:37:03,961 INFO L101 nessWitnessExtractor]: Location invariant before [L898-L898] ((num == 0) && ((unsigned long )arg == 0UL)) && ((0 == j && j == 0) || (1 <= j && j <= 2)) [2024-02-02 09:37:03,961 INFO L101 nessWitnessExtractor]: Location invariant before [L879-L879] ((unsigned long )arg == 0UL) && ((1 <= i && i <= 2) || (0 == i && i == 0)) [2024-02-02 09:37:03,962 INFO L101 nessWitnessExtractor]: Location invariant before [L903-L903] (j == 3) && ((unsigned long )arg == 0UL) [2024-02-02 09:37:03,962 INFO L101 nessWitnessExtractor]: Location invariant before [L897-L897] ((num == 1) && ((unsigned long )arg == 0UL)) && ((0 == j && j == 0) || (1 <= j && j <= 2)) [2024-02-02 09:37:03,962 INFO L101 nessWitnessExtractor]: Location invariant before [L904-L904] (j == 3) && ((unsigned long )arg == 0UL) [2024-02-02 09:37:03,962 INFO L101 nessWitnessExtractor]: Location invariant before [L893-L893] ((unsigned long )arg == 0UL) && ((0 == j && j == 0) || (1 <= j && j <= 2)) [2024-02-02 09:37:03,962 INFO L101 nessWitnessExtractor]: Location invariant before [L877-L877] (unsigned long )arg == 0UL [2024-02-02 09:37:03,963 INFO L101 nessWitnessExtractor]: Loop invariant at [L892-L901] ((unsigned long )arg == 0UL) && ((0 == j && j == 0) || (1 <= j && j <= 3)) [2024-02-02 09:37:03,963 INFO L101 nessWitnessExtractor]: Location invariant before [L911-L911] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-02-02 09:37:03,963 INFO L101 nessWitnessExtractor]: Location invariant before [L912-L912] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-02-02 09:37:03,963 INFO L101 nessWitnessExtractor]: Location invariant before [L908-L908] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-02-02 09:37:03,964 INFO L101 nessWitnessExtractor]: Location invariant before [L910-L910] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-02-02 09:37:03,964 INFO L101 nessWitnessExtractor]: Location invariant before [L899-L899] ((unsigned long )arg == 0UL) && ((0 == j && j == 0) || (1 <= j && j <= 2)) [2024-02-02 09:37:03,964 INFO L101 nessWitnessExtractor]: Location invariant before [L909-L909] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-02-02 09:37:03,964 INFO L101 nessWitnessExtractor]: Location invariant before [L900-L900] ((unsigned long )arg == 0UL) && ((0 == j && j == 0) || (1 <= j && j <= 2)) [2024-02-02 09:37:03,964 INFO L101 nessWitnessExtractor]: Location invariant before [L884-L884] ((unsigned long )arg == 0UL) && ((0 == i && i == 0) || (1 <= i && i <= 2)) [2024-02-02 09:37:03,965 INFO L101 nessWitnessExtractor]: Location invariant before [L891-L891] (unsigned long )arg == 0UL [2024-02-02 09:37:03,965 INFO L101 nessWitnessExtractor]: Loop invariant at [L880-L881] (((0 <= num) && (num <= 1)) && ((unsigned long )arg == 0UL)) && (((((((((((((((((((((((((((((((((((((((((((((((1 <= i && i <= 2) || (0 == i && i == 0)) || (0 == i && i == 0)) || (0 == i && i == 0)) || (0 == i && i == 0)) || (0 == i && i == 0)) || (0 == i && i == 0)) || (0 == i && i == 0)) || (0 == i && i == 0)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (1 <= i && i <= 2)) || (1 <= i && i <= 2)) [2024-02-02 09:37:03,965 INFO L101 nessWitnessExtractor]: Location invariant after [L880-L881] ((num == 1) && ((unsigned long )arg == 0UL)) && (((((((((((((((((((((((((((((((((((((((((((((((1 <= i && i <= 2) || (0 == i && i == 0)) || (0 == i && i == 0)) || (0 == i && i == 0)) || (0 == i && i == 0)) || (0 == i && i == 0)) || (0 == i && i == 0)) || (0 == i && i == 0)) || (0 == i && i == 0)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (1 <= i && i <= 2)) || (1 <= i && i <= 2)) [2024-02-02 09:37:04,012 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-02 09:37:04,452 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2024-02-02 09:37:04,459 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:37:04,490 INFO L202 MainTranslator]: Completed pre-run 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-02-02 09:37:04,656 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2024-02-02 09:37:04,657 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:37:04,760 INFO L206 MainTranslator]: Completed translation [2024-02-02 09:37:04,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:37:04 WrapperNode [2024-02-02 09:37:04,761 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-02 09:37:04,762 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-02 09:37:04,762 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-02 09:37:04,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-02 09:37:04,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:37:04" (1/1) ... [2024-02-02 09:37:04,785 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:37:04" (1/1) ... [2024-02-02 09:37:04,806 INFO L138 Inliner]: procedures = 244, calls = 54, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 86 [2024-02-02 09:37:04,807 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-02 09:37:04,808 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-02 09:37:04,808 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-02 09:37:04,808 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-02 09:37:04,818 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:37:04" (1/1) ... [2024-02-02 09:37:04,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:37:04" (1/1) ... [2024-02-02 09:37:04,823 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:37:04" (1/1) ... [2024-02-02 09:37:04,841 INFO L175 MemorySlicer]: Split 31 memory accesses to 7 slices as follows [2, 1, 8, 8, 8, 2, 2]. 26 percent of accesses are in the largest equivalence class. The 27 initializations are split as follows [2, 1, 8, 8, 8, 0, 0]. The 2 writes are split as follows [0, 0, 0, 0, 0, 1, 1]. [2024-02-02 09:37:04,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:37:04" (1/1) ... [2024-02-02 09:37:04,841 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:37:04" (1/1) ... [2024-02-02 09:37:04,861 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:37:04" (1/1) ... [2024-02-02 09:37:04,864 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:37:04" (1/1) ... [2024-02-02 09:37:04,868 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:37:04" (1/1) ... [2024-02-02 09:37:04,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:37:04" (1/1) ... [2024-02-02 09:37:04,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-02 09:37:04,875 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-02 09:37:04,875 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-02 09:37:04,875 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-02 09:37:04,876 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:37:04" (1/1) ... [2024-02-02 09:37:04,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:37:04,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-02 09:37:04,903 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-02-02 09:37:04,928 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-02-02 09:37:04,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-02 09:37:04,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-02 09:37:04,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-02-02 09:37:04,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-02-02 09:37:04,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-02-02 09:37:04,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-02-02 09:37:04,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-02-02 09:37:04,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-02-02 09:37:04,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-02-02 09:37:04,946 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-02-02 09:37:04,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-02 09:37:04,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-02 09:37:04,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-02 09:37:04,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-02 09:37:04,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-02 09:37:04,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-02-02 09:37:04,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-02-02 09:37:04,947 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-02 09:37:04,947 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-02 09:37:04,948 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-02 09:37:04,948 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-02 09:37:04,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-02 09:37:04,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-02 09:37:04,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-02 09:37:04,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-02 09:37:04,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-02 09:37:04,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-02-02 09:37:04,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-02-02 09:37:04,949 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-02-02 09:37:04,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-02 09:37:04,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-02 09:37:04,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-02 09:37:04,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-02 09:37:04,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-02 09:37:04,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-02 09:37:04,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-02-02 09:37:04,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-02-02 09:37:04,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-02 09:37:04,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-02 09:37:04,952 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-02 09:37:05,105 INFO L244 CfgBuilder]: Building ICFG [2024-02-02 09:37:05,108 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-02 09:37:05,521 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-02 09:37:05,521 INFO L293 CfgBuilder]: Performing block encoding [2024-02-02 09:37:05,764 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-02 09:37:05,765 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-02 09:37:05,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:37:05 BoogieIcfgContainer [2024-02-02 09:37:05,767 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-02 09:37:05,771 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-02 09:37:05,771 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-02 09:37:05,774 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-02 09:37:05,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:37:02" (1/4) ... [2024-02-02 09:37:05,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b0bf83 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 02.02 09:37:05, skipping insertion in model container [2024-02-02 09:37:05,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:37:03" (2/4) ... [2024-02-02 09:37:05,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b0bf83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:37:05, skipping insertion in model container [2024-02-02 09:37:05,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:37:04" (3/4) ... [2024-02-02 09:37:05,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b0bf83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:37:05, skipping insertion in model container [2024-02-02 09:37:05,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:37:05" (4/4) ... [2024-02-02 09:37:05,781 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2024-02-02 09:37:05,799 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-02 09:37:05,800 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2024-02-02 09:37:05,800 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-02 09:37:05,897 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-02 09:37:05,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 106 transitions, 226 flow [2024-02-02 09:37:05,990 INFO L124 PetriNetUnfolderBase]: 6/104 cut-off events. [2024-02-02 09:37:05,991 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-02 09:37:05,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 104 events. 6/104 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 284 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 81. Up to 3 conditions per place. [2024-02-02 09:37:05,996 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 106 transitions, 226 flow [2024-02-02 09:37:06,000 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 100 transitions, 212 flow [2024-02-02 09:37:06,015 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-02 09:37:06,023 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;@35ba3448, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-02 09:37:06,024 INFO L358 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2024-02-02 09:37:06,027 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-02 09:37:06,027 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-02 09:37:06,027 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:37:06,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:37:06,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-02 09:37:06,029 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 60 more)] === [2024-02-02 09:37:06,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:37:06,036 INFO L85 PathProgramCache]: Analyzing trace with hash 13363, now seen corresponding path program 1 times [2024-02-02 09:37:06,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:37:06,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632106298] [2024-02-02 09:37:06,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:37:06,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:37:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:37:06,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:37:06,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:37:06,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632106298] [2024-02-02 09:37:06,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632106298] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:37:06,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:37:06,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:37:06,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973278648] [2024-02-02 09:37:06,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:37:06,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:37:06,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:37:06,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:37:06,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:37:06,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 106 [2024-02-02 09:37:06,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 100 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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-02-02 09:37:06,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:37:06,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 106 [2024-02-02 09:37:06,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:37:06,706 INFO L124 PetriNetUnfolderBase]: 303/818 cut-off events. [2024-02-02 09:37:06,706 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-02-02 09:37:06,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1370 conditions, 818 events. 303/818 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4807 event pairs, 176 based on Foata normal form. 35/740 useless extension candidates. Maximal degree in co-relation 1241. Up to 279 conditions per place. [2024-02-02 09:37:06,718 INFO L140 encePairwiseOnDemand]: 95/106 looper letters, 44 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2024-02-02 09:37:06,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 86 transitions, 279 flow [2024-02-02 09:37:06,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:37:06,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:37:06,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2024-02-02 09:37:06,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7012578616352201 [2024-02-02 09:37:06,736 INFO L175 Difference]: Start difference. First operand has 103 places, 100 transitions, 212 flow. Second operand 3 states and 223 transitions. [2024-02-02 09:37:06,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 86 transitions, 279 flow [2024-02-02 09:37:06,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 86 transitions, 269 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-02 09:37:06,746 INFO L231 Difference]: Finished difference. Result has 80 places, 77 transitions, 168 flow [2024-02-02 09:37:06,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=80, PETRI_TRANSITIONS=77} [2024-02-02 09:37:06,754 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, -23 predicate places. [2024-02-02 09:37:06,755 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 77 transitions, 168 flow [2024-02-02 09:37:06,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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-02-02 09:37:06,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:37:06,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:37:06,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-02 09:37:06,760 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 60 more)] === [2024-02-02 09:37:06,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:37:06,761 INFO L85 PathProgramCache]: Analyzing trace with hash 669839889, now seen corresponding path program 1 times [2024-02-02 09:37:06,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:37:06,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557384907] [2024-02-02 09:37:06,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:37:06,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:37:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:37:06,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:37:06,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:37:06,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557384907] [2024-02-02 09:37:06,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557384907] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:37:06,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:37:06,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:37:06,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120838426] [2024-02-02 09:37:06,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:37:06,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:37:06,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:37:06,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:37:06,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:37:07,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 106 [2024-02-02 09:37:07,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 77 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 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-02-02 09:37:07,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:37:07,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 106 [2024-02-02 09:37:07,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:37:07,172 INFO L124 PetriNetUnfolderBase]: 256/785 cut-off events. [2024-02-02 09:37:07,173 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-02-02 09:37:07,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1294 conditions, 785 events. 256/785 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4990 event pairs, 9 based on Foata normal form. 0/683 useless extension candidates. Maximal degree in co-relation 743. Up to 416 conditions per place. [2024-02-02 09:37:07,178 INFO L140 encePairwiseOnDemand]: 103/106 looper letters, 42 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2024-02-02 09:37:07,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 88 transitions, 282 flow [2024-02-02 09:37:07,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:37:07,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:37:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 309 transitions. [2024-02-02 09:37:07,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7287735849056604 [2024-02-02 09:37:07,181 INFO L175 Difference]: Start difference. First operand has 80 places, 77 transitions, 168 flow. Second operand 4 states and 309 transitions. [2024-02-02 09:37:07,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 88 transitions, 282 flow [2024-02-02 09:37:07,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 88 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:37:07,183 INFO L231 Difference]: Finished difference. Result has 80 places, 76 transitions, 166 flow [2024-02-02 09:37:07,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=80, PETRI_TRANSITIONS=76} [2024-02-02 09:37:07,184 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, -23 predicate places. [2024-02-02 09:37:07,185 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 76 transitions, 166 flow [2024-02-02 09:37:07,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 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-02-02 09:37:07,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:37:07,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:37:07,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-02 09:37:07,186 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 60 more)] === [2024-02-02 09:37:07,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:37:07,186 INFO L85 PathProgramCache]: Analyzing trace with hash -709799418, now seen corresponding path program 1 times [2024-02-02 09:37:07,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:37:07,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477349580] [2024-02-02 09:37:07,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:37:07,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:37:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:37:07,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:37:07,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:37:07,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477349580] [2024-02-02 09:37:07,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477349580] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:37:07,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:37:07,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:37:07,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295021644] [2024-02-02 09:37:07,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:37:07,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:37:07,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:37:07,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:37:07,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:37:07,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 106 [2024-02-02 09:37:07,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-02-02 09:37:07,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:37:07,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 106 [2024-02-02 09:37:07,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:37:07,441 INFO L124 PetriNetUnfolderBase]: 278/828 cut-off events. [2024-02-02 09:37:07,442 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-02-02 09:37:07,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1381 conditions, 828 events. 278/828 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4512 event pairs, 134 based on Foata normal form. 72/810 useless extension candidates. Maximal degree in co-relation 1203. Up to 283 conditions per place. [2024-02-02 09:37:07,447 INFO L140 encePairwiseOnDemand]: 99/106 looper letters, 53 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2024-02-02 09:37:07,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 94 transitions, 314 flow [2024-02-02 09:37:07,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:37:07,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:37:07,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2024-02-02 09:37:07,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7641509433962265 [2024-02-02 09:37:07,449 INFO L175 Difference]: Start difference. First operand has 80 places, 76 transitions, 166 flow. Second operand 3 states and 243 transitions. [2024-02-02 09:37:07,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 94 transitions, 314 flow [2024-02-02 09:37:07,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 94 transitions, 311 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:37:07,452 INFO L231 Difference]: Finished difference. Result has 80 places, 76 transitions, 179 flow [2024-02-02 09:37:07,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=179, PETRI_PLACES=80, PETRI_TRANSITIONS=76} [2024-02-02 09:37:07,453 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, -23 predicate places. [2024-02-02 09:37:07,453 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 76 transitions, 179 flow [2024-02-02 09:37:07,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-02-02 09:37:07,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:37:07,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:37:07,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-02 09:37:07,454 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 60 more)] === [2024-02-02 09:37:07,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:37:07,455 INFO L85 PathProgramCache]: Analyzing trace with hash -529646472, now seen corresponding path program 1 times [2024-02-02 09:37:07,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:37:07,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636627001] [2024-02-02 09:37:07,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:37:07,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:37:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:37:07,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:37:07,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:37:07,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636627001] [2024-02-02 09:37:07,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636627001] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:37:07,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:37:07,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:37:07,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67224430] [2024-02-02 09:37:07,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:37:07,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:37:07,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:37:07,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:37:07,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:37:07,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 106 [2024-02-02 09:37:07,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 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-02-02 09:37:07,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:37:07,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 106 [2024-02-02 09:37:07,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:37:07,848 INFO L124 PetriNetUnfolderBase]: 262/714 cut-off events. [2024-02-02 09:37:07,848 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2024-02-02 09:37:07,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1275 conditions, 714 events. 262/714 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3744 event pairs, 60 based on Foata normal form. 0/616 useless extension candidates. Maximal degree in co-relation 1098. Up to 411 conditions per place. [2024-02-02 09:37:07,854 INFO L140 encePairwiseOnDemand]: 103/106 looper letters, 40 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2024-02-02 09:37:07,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 84 transitions, 287 flow [2024-02-02 09:37:07,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:37:07,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:37:07,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 306 transitions. [2024-02-02 09:37:07,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7216981132075472 [2024-02-02 09:37:07,860 INFO L175 Difference]: Start difference. First operand has 80 places, 76 transitions, 179 flow. Second operand 4 states and 306 transitions. [2024-02-02 09:37:07,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 84 transitions, 287 flow [2024-02-02 09:37:07,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 84 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-02 09:37:07,865 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 179 flow [2024-02-02 09:37:07,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2024-02-02 09:37:07,867 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, -22 predicate places. [2024-02-02 09:37:07,867 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 179 flow [2024-02-02 09:37:07,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 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-02-02 09:37:07,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:37:07,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:37:07,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-02 09:37:07,868 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 60 more)] === [2024-02-02 09:37:07,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:37:07,869 INFO L85 PathProgramCache]: Analyzing trace with hash 760829090, now seen corresponding path program 1 times [2024-02-02 09:37:07,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:37:07,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708996919] [2024-02-02 09:37:07,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:37:07,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:37:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:37:07,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:37:07,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:37:07,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708996919] [2024-02-02 09:37:07,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708996919] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:37:07,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:37:07,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:37:07,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283440972] [2024-02-02 09:37:07,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:37:07,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:37:07,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:37:07,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:37:07,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:37:07,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 106 [2024-02-02 09:37:07,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 75 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 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-02-02 09:37:07,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:37:07,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 106 [2024-02-02 09:37:07,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:37:08,056 INFO L124 PetriNetUnfolderBase]: 87/258 cut-off events. [2024-02-02 09:37:08,057 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-02-02 09:37:08,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 258 events. 87/258 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1097 event pairs, 25 based on Foata normal form. 30/259 useless extension candidates. Maximal degree in co-relation 344. Up to 92 conditions per place. [2024-02-02 09:37:08,059 INFO L140 encePairwiseOnDemand]: 102/106 looper letters, 22 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2024-02-02 09:37:08,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 141 flow [2024-02-02 09:37:08,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:37:08,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:37:08,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2024-02-02 09:37:08,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6572327044025157 [2024-02-02 09:37:08,061 INFO L175 Difference]: Start difference. First operand has 81 places, 75 transitions, 179 flow. Second operand 3 states and 209 transitions. [2024-02-02 09:37:08,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 141 flow [2024-02-02 09:37:08,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 135 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-02 09:37:08,062 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 79 flow [2024-02-02 09:37:08,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2024-02-02 09:37:08,063 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, -60 predicate places. [2024-02-02 09:37:08,063 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 79 flow [2024-02-02 09:37:08,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 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-02-02 09:37:08,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:37:08,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:37:08,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-02 09:37:08,064 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 60 more)] === [2024-02-02 09:37:08,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:37:08,065 INFO L85 PathProgramCache]: Analyzing trace with hash 624654903, now seen corresponding path program 1 times [2024-02-02 09:37:08,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:37:08,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927984385] [2024-02-02 09:37:08,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:37:08,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:37:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:37:08,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:37:08,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:37:08,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927984385] [2024-02-02 09:37:08,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927984385] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:37:08,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:37:08,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:37:08,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108033959] [2024-02-02 09:37:08,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:37:08,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:37:08,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:37:08,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:37:08,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:37:08,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 106 [2024-02-02 09:37:08,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 79 flow. Second operand has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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-02-02 09:37:08,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:37:08,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 106 [2024-02-02 09:37:08,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:37:08,298 INFO L124 PetriNetUnfolderBase]: 94/305 cut-off events. [2024-02-02 09:37:08,299 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-02-02 09:37:08,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 305 events. 94/305 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1365 event pairs, 27 based on Foata normal form. 16/313 useless extension candidates. Maximal degree in co-relation 412. Up to 111 conditions per place. [2024-02-02 09:37:08,301 INFO L140 encePairwiseOnDemand]: 103/106 looper letters, 28 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2024-02-02 09:37:08,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 44 transitions, 159 flow [2024-02-02 09:37:08,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:37:08,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:37:08,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 231 transitions. [2024-02-02 09:37:08,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5448113207547169 [2024-02-02 09:37:08,303 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 79 flow. Second operand 4 states and 231 transitions. [2024-02-02 09:37:08,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 44 transitions, 159 flow [2024-02-02 09:37:08,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 157 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-02 09:37:08,304 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 80 flow [2024-02-02 09:37:08,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2024-02-02 09:37:08,305 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, -59 predicate places. [2024-02-02 09:37:08,305 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 80 flow [2024-02-02 09:37:08,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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-02-02 09:37:08,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:37:08,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:37:08,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-02 09:37:08,306 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 60 more)] === [2024-02-02 09:37:08,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:37:08,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1002043174, now seen corresponding path program 1 times [2024-02-02 09:37:08,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:37:08,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258718906] [2024-02-02 09:37:08,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:37:08,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:37:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:37:08,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-02 09:37:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:37:08,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-02 09:37:08,354 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-02 09:37:08,355 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 63 remaining) [2024-02-02 09:37:08,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 63 remaining) [2024-02-02 09:37:08,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 63 remaining) [2024-02-02 09:37:08,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 63 remaining) [2024-02-02 09:37:08,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 63 remaining) [2024-02-02 09:37:08,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 63 remaining) [2024-02-02 09:37:08,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 63 remaining) [2024-02-02 09:37:08,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 63 remaining) [2024-02-02 09:37:08,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 63 remaining) [2024-02-02 09:37:08,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 63 remaining) [2024-02-02 09:37:08,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 63 remaining) [2024-02-02 09:37:08,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 63 remaining) [2024-02-02 09:37:08,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 63 remaining) [2024-02-02 09:37:08,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 63 remaining) [2024-02-02 09:37:08,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 63 remaining) [2024-02-02 09:37:08,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 63 remaining) [2024-02-02 09:37:08,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 63 remaining) [2024-02-02 09:37:08,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 63 remaining) [2024-02-02 09:37:08,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 63 remaining) [2024-02-02 09:37:08,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 63 remaining) [2024-02-02 09:37:08,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 63 remaining) [2024-02-02 09:37:08,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 63 remaining) [2024-02-02 09:37:08,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 63 remaining) [2024-02-02 09:37:08,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 63 remaining) [2024-02-02 09:37:08,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 63 remaining) [2024-02-02 09:37:08,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 63 remaining) [2024-02-02 09:37:08,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 63 remaining) [2024-02-02 09:37:08,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 63 remaining) [2024-02-02 09:37:08,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 63 remaining) [2024-02-02 09:37:08,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 63 remaining) [2024-02-02 09:37:08,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 63 remaining) [2024-02-02 09:37:08,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 63 remaining) [2024-02-02 09:37:08,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 63 remaining) [2024-02-02 09:37:08,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 63 remaining) [2024-02-02 09:37:08,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (28 of 63 remaining) [2024-02-02 09:37:08,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 63 remaining) [2024-02-02 09:37:08,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 63 remaining) [2024-02-02 09:37:08,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 63 remaining) [2024-02-02 09:37:08,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 63 remaining) [2024-02-02 09:37:08,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 63 remaining) [2024-02-02 09:37:08,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 63 remaining) [2024-02-02 09:37:08,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 63 remaining) [2024-02-02 09:37:08,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 63 remaining) [2024-02-02 09:37:08,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 63 remaining) [2024-02-02 09:37:08,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 63 remaining) [2024-02-02 09:37:08,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 63 remaining) [2024-02-02 09:37:08,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 63 remaining) [2024-02-02 09:37:08,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 63 remaining) [2024-02-02 09:37:08,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 63 remaining) [2024-02-02 09:37:08,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 63 remaining) [2024-02-02 09:37:08,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 63 remaining) [2024-02-02 09:37:08,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 63 remaining) [2024-02-02 09:37:08,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 63 remaining) [2024-02-02 09:37:08,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 63 remaining) [2024-02-02 09:37:08,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 63 remaining) [2024-02-02 09:37:08,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 63 remaining) [2024-02-02 09:37:08,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 63 remaining) [2024-02-02 09:37:08,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 63 remaining) [2024-02-02 09:37:08,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 63 remaining) [2024-02-02 09:37:08,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 63 remaining) [2024-02-02 09:37:08,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 63 remaining) [2024-02-02 09:37:08,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 63 remaining) [2024-02-02 09:37:08,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 63 remaining) [2024-02-02 09:37:08,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-02 09:37:08,369 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:37:08,375 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-02 09:37:08,375 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-02 09:37:08,403 INFO L503 ceAbstractionStarter]: Automizer considered 33 witness invariants [2024-02-02 09:37:08,404 INFO L504 ceAbstractionStarter]: WitnessConsidered=33 [2024-02-02 09:37:08,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:37:08 BasicIcfg [2024-02-02 09:37:08,405 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-02 09:37:08,405 INFO L158 Benchmark]: Toolchain (without parser) took 4558.53ms. Allocated memory was 148.9MB in the beginning and 257.9MB in the end (delta: 109.1MB). Free memory was 87.4MB in the beginning and 126.9MB in the end (delta: -39.5MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. [2024-02-02 09:37:08,405 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 148.9MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:37:08,406 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 148.9MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:37:08,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 911.69ms. Allocated memory is still 148.9MB. Free memory was 87.4MB in the beginning and 108.6MB in the end (delta: -21.2MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. [2024-02-02 09:37:08,406 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.93ms. Allocated memory is still 148.9MB. Free memory was 108.6MB in the beginning and 105.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-02 09:37:08,406 INFO L158 Benchmark]: Boogie Preprocessor took 66.95ms. Allocated memory is still 148.9MB. Free memory was 105.8MB in the beginning and 102.4MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-02 09:37:08,407 INFO L158 Benchmark]: RCFGBuilder took 891.86ms. Allocated memory was 148.9MB in the beginning and 201.3MB in the end (delta: 52.4MB). Free memory was 102.4MB in the beginning and 152.7MB in the end (delta: -50.3MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. [2024-02-02 09:37:08,407 INFO L158 Benchmark]: TraceAbstraction took 2633.86ms. Allocated memory was 201.3MB in the beginning and 257.9MB in the end (delta: 56.6MB). Free memory was 151.6MB in the beginning and 126.9MB in the end (delta: 24.7MB). Peak memory consumption was 82.4MB. Max. memory is 16.1GB. [2024-02-02 09:37:08,409 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 148.9MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.21ms. Allocated memory is still 148.9MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 911.69ms. Allocated memory is still 148.9MB. Free memory was 87.4MB in the beginning and 108.6MB in the end (delta: -21.2MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.93ms. Allocated memory is still 148.9MB. Free memory was 108.6MB in the beginning and 105.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.95ms. Allocated memory is still 148.9MB. Free memory was 105.8MB in the beginning and 102.4MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 891.86ms. Allocated memory was 148.9MB in the beginning and 201.3MB in the end (delta: 52.4MB). Free memory was 102.4MB in the beginning and 152.7MB in the end (delta: -50.3MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2633.86ms. Allocated memory was 201.3MB in the beginning and 257.9MB in the end (delta: 56.6MB). Free memory was 151.6MB in the beginning and 126.9MB in the end (delta: 24.7MB). Peak memory consumption was 82.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 880]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L870] 0 int num; [L871] 0 unsigned long total; [L872] 0 int flag; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L907] 0 pthread_t t1, t2; VAL [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L908] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[total],IntegerLiteral[0UL]]],BinaryExpression[COMPEQ,IdentifierExpression[flag],IntegerLiteral[0]]]]] [L908] 0 num = 0 VAL [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L909] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[total],IntegerLiteral[0UL]]],BinaryExpression[COMPEQ,IdentifierExpression[flag],IntegerLiteral[0]]]]] [L909] 0 total = 0 VAL [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L910] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[total],IntegerLiteral[0UL]]],BinaryExpression[COMPEQ,IdentifierExpression[flag],IntegerLiteral[0]]]]] [L911] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[total],IntegerLiteral[0UL]]],BinaryExpression[COMPEQ,IdentifierExpression[flag],IntegerLiteral[0]]]]] VAL [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L912] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[total],IntegerLiteral[0UL]]],BinaryExpression[COMPEQ,IdentifierExpression[flag],IntegerLiteral[0]]]]] VAL [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L913] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[total],IntegerLiteral[0UL]]],BinaryExpression[COMPEQ,IdentifierExpression[flag],IntegerLiteral[0]]]]] [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L876] 1 int i; VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, total=0] [L877] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L877] 1 i = 0 VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L878] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]]] VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L879] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]]] VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L880] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[num]],BinaryExpression[COMPLEQ,IdentifierExpression[num],IntegerLiteral[1]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L880] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] - UnprovableResult [Line: 877]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 879]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 887]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 880]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 882]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 880]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 883]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 884]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 885]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 891]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 892]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 893]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 902]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 903]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 904]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 894]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 894]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 896]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 894]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 897]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 898]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 899]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 900]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 892]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 908]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 909]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 910]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 911]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 912]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 913]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 919]: 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: 913]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 914]: 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 5 procedures, 177 locations, 63 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.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 654 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 385 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 646 IncrementalHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 25 mSDtfsCounter, 646 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=0, InterpolantAutomatonStates: 21, 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.6s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 237 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-02-02 09:37:08,443 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