./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.2024-01-24_13-31-21.files/SV-COMP24_unreach-call/arithmetic_prog_bad.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d8006e4b 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.2024-01-24_13-31-21.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-d8006e4-m [2024-02-05 10:51:39,112 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-05 10:51:39,187 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-05 10:51:39,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-05 10:51:39,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-05 10:51:39,224 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-05 10:51:39,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-05 10:51:39,225 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-05 10:51:39,226 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-05 10:51:39,232 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-05 10:51:39,233 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-05 10:51:39,233 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-05 10:51:39,234 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-05 10:51:39,235 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-05 10:51:39,236 INFO L153 SettingsManager]: * Use SBE=true [2024-02-05 10:51:39,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-05 10:51:39,236 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-05 10:51:39,236 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-05 10:51:39,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-05 10:51:39,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-05 10:51:39,238 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-05 10:51:39,239 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-05 10:51:39,239 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-05 10:51:39,239 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-05 10:51:39,240 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-05 10:51:39,240 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-05 10:51:39,240 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-05 10:51:39,240 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-05 10:51:39,241 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-05 10:51:39,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-05 10:51:39,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-05 10:51:39,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-05 10:51:39,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-05 10:51:39,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-05 10:51:39,243 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-05 10:51:39,243 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-05 10:51:39,244 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-05 10:51:39,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-05 10:51:39,244 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-05 10:51:39,244 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-05 10:51:39,245 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-05 10:51:39,245 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-05 10:51:39,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-05 10:51:39,246 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-05 10:51:39,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-05 10:51:39,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-05 10:51:39,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-05 10:51:39,566 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-05 10:51:39,567 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-05 10:51:39,568 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-01-24_13-31-21.files/SV-COMP24_unreach-call/arithmetic_prog_bad.yml/witness.yml [2024-02-05 10:51:39,716 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-05 10:51:39,717 INFO L274 PluginConnector]: CDTParser initialized [2024-02-05 10:51:39,717 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-05 10:51:40,862 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-05 10:51:41,141 INFO L384 CDTParser]: Found 1 translation units. [2024-02-05 10:51:41,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2024-02-05 10:51:41,157 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a6997a74/54977fc0b97844f1a8b9aac09b8d3d08/FLAGe041521da [2024-02-05 10:51:41,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a6997a74/54977fc0b97844f1a8b9aac09b8d3d08 [2024-02-05 10:51:41,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-05 10:51:41,170 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-05 10:51:41,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-05 10:51:41,171 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-05 10:51:41,176 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-05 10:51:41,176 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 05.02 10:51:39" (1/2) ... [2024-02-05 10:51:41,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@139159aa and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:51:41, skipping insertion in model container [2024-02-05 10:51:41,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 05.02 10:51:39" (1/2) ... [2024-02-05 10:51:41,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@87111bc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:51:41, skipping insertion in model container [2024-02-05 10:51:41,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:51:41" (2/2) ... [2024-02-05 10:51:41,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@139159aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:41, skipping insertion in model container [2024-02-05 10:51:41,179 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:51:41" (2/2) ... [2024-02-05 10:51:41,180 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-05 10:51:41,306 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-05 10:51:41,307 INFO L101 nessWitnessExtractor]: Loop invariant at [L878-L878] ((unsigned long )arg == 0UL) && ((1 <= i && i <= 3) || (0 == i && i == 0)) [2024-02-05 10:51:41,308 INFO L101 nessWitnessExtractor]: Location invariant before [L897-L897] ((num == 1) && ((unsigned long )arg == 0UL)) && ((0 == j && j == 0) || (1 <= j && j <= 2)) [2024-02-05 10:51:41,308 INFO L101 nessWitnessExtractor]: Loop invariant at [L892-L892] ((unsigned long )arg == 0UL) && ((0 == j && j == 0) || (1 <= j && j <= 3)) [2024-02-05 10:51:41,308 INFO L101 nessWitnessExtractor]: Location invariant before [L895-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-05 10:51:41,308 INFO L101 nessWitnessExtractor]: Location invariant before [L912-L912] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-02-05 10:51:41,308 INFO L101 nessWitnessExtractor]: Location invariant before [L893-L893] ((unsigned long )arg == 0UL) && ((0 == j && j == 0) || (1 <= j && j <= 2)) [2024-02-05 10:51:41,308 INFO L101 nessWitnessExtractor]: Location invariant before [L911-L911] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-02-05 10:51:41,309 INFO L101 nessWitnessExtractor]: Location invariant before [L900-L900] ((unsigned long )arg == 0UL) && ((0 == j && j == 0) || (1 <= j && j <= 2)) [2024-02-05 10:51:41,309 INFO L101 nessWitnessExtractor]: Loop invariant at [L880-L880] (((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-05 10:51:41,309 INFO L101 nessWitnessExtractor]: Location invariant before [L877-L877] (unsigned long )arg == 0UL [2024-02-05 10:51:41,309 INFO L101 nessWitnessExtractor]: Location invariant before [L908-L908] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-02-05 10:51:41,309 INFO L101 nessWitnessExtractor]: Location invariant before [L879-L879] ((unsigned long )arg == 0UL) && ((1 <= i && i <= 2) || (0 == i && i == 0)) [2024-02-05 10:51:41,310 INFO L101 nessWitnessExtractor]: Location invariant before [L896-L896] ((num == 1) && ((unsigned long )arg == 0UL)) && ((0 == j && j == 0) || (1 <= j && j <= 2)) [2024-02-05 10:51:41,310 INFO L101 nessWitnessExtractor]: Location invariant before [L903-L903] (j == 3) && ((unsigned long )arg == 0UL) [2024-02-05 10:51:41,310 INFO L101 nessWitnessExtractor]: Location invariant before [L883-L883] ((num == 1) && ((unsigned long )arg == 0UL)) && ((0 == i && i == 0) || (1 <= i && i <= 2)) [2024-02-05 10:51:41,310 INFO L101 nessWitnessExtractor]: Location invariant before [L885-L885] ((unsigned long )arg == 0UL) && ((0 == i && i == 0) || (1 <= i && i <= 2)) [2024-02-05 10:51:41,310 INFO L101 nessWitnessExtractor]: Location invariant before [L882-L882] ((num == 0) && ((unsigned long )arg == 0UL)) && ((0 == i && i == 0) || (1 <= i && i <= 2)) [2024-02-05 10:51:41,310 INFO L101 nessWitnessExtractor]: Location invariant before [L898-L898] ((num == 0) && ((unsigned long )arg == 0UL)) && ((0 == j && j == 0) || (1 <= j && j <= 2)) [2024-02-05 10:51:41,311 INFO L101 nessWitnessExtractor]: Location invariant before [L891-L891] (unsigned long )arg == 0UL [2024-02-05 10:51:41,311 INFO L101 nessWitnessExtractor]: Location invariant before [L904-L904] (j == 3) && ((unsigned long )arg == 0UL) [2024-02-05 10:51:41,311 INFO L101 nessWitnessExtractor]: Location invariant before [L887-L887] (i == 3) && ((unsigned long )arg == 0UL) [2024-02-05 10:51:41,311 INFO L101 nessWitnessExtractor]: Location invariant before [L884-L884] ((unsigned long )arg == 0UL) && ((0 == i && i == 0) || (1 <= i && i <= 2)) [2024-02-05 10:51:41,312 INFO L101 nessWitnessExtractor]: Location invariant before [L902-L902] (j == 3) && ((unsigned long )arg == 0UL) [2024-02-05 10:51:41,312 INFO L101 nessWitnessExtractor]: Location invariant before [L913-L913] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-02-05 10:51:41,312 INFO L101 nessWitnessExtractor]: Location invariant before [L899-L899] ((unsigned long )arg == 0UL) && ((0 == j && j == 0) || (1 <= j && j <= 2)) [2024-02-05 10:51:41,312 INFO L101 nessWitnessExtractor]: Location invariant before [L910-L910] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-02-05 10:51:41,312 INFO L101 nessWitnessExtractor]: Location invariant before [L881-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-05 10:51:41,312 INFO L101 nessWitnessExtractor]: Loop invariant at [L894-L894] (((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-05 10:51:41,313 INFO L101 nessWitnessExtractor]: Location invariant before [L909-L909] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-02-05 10:51:41,367 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-02-05 10:51:41,809 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-05 10:51:41,816 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-05 10:51:41,830 INFO L204 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-05 10:51:42,026 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-05 10:51:42,027 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-05 10:51:42,077 INFO L208 MainTranslator]: Completed translation [2024-02-05 10:51:42,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:42 WrapperNode [2024-02-05 10:51:42,080 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-05 10:51:42,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-05 10:51:42,081 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-05 10:51:42,081 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-05 10:51:42,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:42" (1/1) ... [2024-02-05 10:51:42,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:42" (1/1) ... [2024-02-05 10:51:42,183 INFO L138 Inliner]: procedures = 244, calls = 54, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 86 [2024-02-05 10:51:42,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-05 10:51:42,186 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-05 10:51:42,186 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-05 10:51:42,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-05 10:51:42,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:42" (1/1) ... [2024-02-05 10:51:42,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:42" (1/1) ... [2024-02-05 10:51:42,218 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:42" (1/1) ... [2024-02-05 10:51:42,262 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-05 10:51:42,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:42" (1/1) ... [2024-02-05 10:51:42,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:42" (1/1) ... [2024-02-05 10:51:42,278 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:42" (1/1) ... [2024-02-05 10:51:42,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:42" (1/1) ... [2024-02-05 10:51:42,284 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:42" (1/1) ... [2024-02-05 10:51:42,286 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:42" (1/1) ... [2024-02-05 10:51:42,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-05 10:51:42,299 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-05 10:51:42,300 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-05 10:51:42,300 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-05 10:51:42,301 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:42" (1/1) ... [2024-02-05 10:51:42,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-05 10:51:42,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:51:42,374 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-05 10:51:42,381 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-05 10:51:42,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-05 10:51:42,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-05 10:51:42,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-02-05 10:51:42,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-02-05 10:51:42,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-02-05 10:51:42,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-02-05 10:51:42,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-02-05 10:51:42,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-02-05 10:51:42,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-02-05 10:51:42,404 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-02-05 10:51:42,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-05 10:51:42,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-05 10:51:42,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-05 10:51:42,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-05 10:51:42,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-05 10:51:42,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-02-05 10:51:42,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-02-05 10:51:42,405 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-05 10:51:42,405 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-05 10:51:42,405 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-05 10:51:42,405 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-05 10:51:42,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-05 10:51:42,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-05 10:51:42,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-05 10:51:42,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-05 10:51:42,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-05 10:51:42,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-02-05 10:51:42,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-02-05 10:51:42,407 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-02-05 10:51:42,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-05 10:51:42,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-05 10:51:42,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-05 10:51:42,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-05 10:51:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-05 10:51:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-05 10:51:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-02-05 10:51:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-02-05 10:51:42,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-05 10:51:42,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-05 10:51:42,410 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-05 10:51:42,547 INFO L244 CfgBuilder]: Building ICFG [2024-02-05 10:51:42,549 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-05 10:51:42,917 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-05 10:51:42,917 INFO L293 CfgBuilder]: Performing block encoding [2024-02-05 10:51:43,109 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-05 10:51:43,109 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-05 10:51:43,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.02 10:51:43 BoogieIcfgContainer [2024-02-05 10:51:43,110 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-05 10:51:43,114 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-05 10:51:43,114 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-05 10:51:43,117 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-05 10:51:43,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 05.02 10:51:39" (1/4) ... [2024-02-05 10:51:43,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316c531 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 05.02 10:51:43, skipping insertion in model container [2024-02-05 10:51:43,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:51:41" (2/4) ... [2024-02-05 10:51:43,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316c531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:51:43, skipping insertion in model container [2024-02-05 10:51:43,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:51:42" (3/4) ... [2024-02-05 10:51:43,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316c531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:51:43, skipping insertion in model container [2024-02-05 10:51:43,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.02 10:51:43" (4/4) ... [2024-02-05 10:51:43,122 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2024-02-05 10:51:43,137 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-05 10:51:43,138 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-02-05 10:51:43,138 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-05 10:51:43,253 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-05 10:51:43,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 102 transitions, 218 flow [2024-02-05 10:51:43,319 INFO L124 PetriNetUnfolderBase]: 10/100 cut-off events. [2024-02-05 10:51:43,322 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-05 10:51:43,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 100 events. 10/100 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 275 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 77. Up to 3 conditions per place. [2024-02-05 10:51:43,327 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 102 transitions, 218 flow [2024-02-05 10:51:43,331 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 96 transitions, 204 flow [2024-02-05 10:51:43,345 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-05 10:51:43,351 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;@681140b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-05 10:51:43,352 INFO L358 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-02-05 10:51:43,355 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-05 10:51:43,355 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-05 10:51:43,356 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-05 10:51:43,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:51:43,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-05 10:51:43,357 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:51:43,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:51:43,361 INFO L85 PathProgramCache]: Analyzing trace with hash 13436, now seen corresponding path program 1 times [2024-02-05 10:51:43,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:51:43,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111400486] [2024-02-05 10:51:43,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:51:43,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:51:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:51:43,702 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-05 10:51:43,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:51:43,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111400486] [2024-02-05 10:51:43,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111400486] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:51:43,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:51:43,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-05 10:51:43,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143984536] [2024-02-05 10:51:43,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:51:43,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:51:43,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:51:43,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:51:43,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:51:43,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 102 [2024-02-05 10:51:43,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 96 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-05 10:51:43,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:51:43,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 102 [2024-02-05 10:51:43,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:51:44,174 INFO L124 PetriNetUnfolderBase]: 621/1788 cut-off events. [2024-02-05 10:51:44,174 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2024-02-05 10:51:44,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2846 conditions, 1788 events. 621/1788 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 12135 event pairs, 195 based on Foata normal form. 203/1713 useless extension candidates. Maximal degree in co-relation 2599. Up to 844 conditions per place. [2024-02-05 10:51:44,191 INFO L140 encePairwiseOnDemand]: 87/102 looper letters, 52 selfloop transitions, 3 changer transitions 0/102 dead transitions. [2024-02-05 10:51:44,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 102 transitions, 332 flow [2024-02-05 10:51:44,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:51:44,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:51:44,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2024-02-05 10:51:44,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7320261437908496 [2024-02-05 10:51:44,207 INFO L175 Difference]: Start difference. First operand has 95 places, 96 transitions, 204 flow. Second operand 3 states and 224 transitions. [2024-02-05 10:51:44,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 102 transitions, 332 flow [2024-02-05 10:51:44,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 102 transitions, 320 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-05 10:51:44,217 INFO L231 Difference]: Finished difference. Result has 88 places, 88 transitions, 197 flow [2024-02-05 10:51:44,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=88, PETRI_TRANSITIONS=88} [2024-02-05 10:51:44,223 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -7 predicate places. [2024-02-05 10:51:44,223 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 88 transitions, 197 flow [2024-02-05 10:51:44,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-05 10:51:44,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:51:44,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:51:44,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-05 10:51:44,228 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:51:44,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:51:44,229 INFO L85 PathProgramCache]: Analyzing trace with hash -252263545, now seen corresponding path program 1 times [2024-02-05 10:51:44,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:51:44,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368934021] [2024-02-05 10:51:44,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:51:44,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:51:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:51:44,460 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-05 10:51:44,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:51:44,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368934021] [2024-02-05 10:51:44,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368934021] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:51:44,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:51:44,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:51:44,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586035233] [2024-02-05 10:51:44,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:51:44,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:51:44,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:51:44,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:51:44,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:51:44,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 102 [2024-02-05 10:51:44,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 88 transitions, 197 flow. Second operand has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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-05 10:51:44,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:51:44,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 102 [2024-02-05 10:51:44,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:51:44,745 INFO L124 PetriNetUnfolderBase]: 488/1602 cut-off events. [2024-02-05 10:51:44,745 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2024-02-05 10:51:44,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2549 conditions, 1602 events. 488/1602 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 11292 event pairs, 151 based on Foata normal form. 0/1288 useless extension candidates. Maximal degree in co-relation 957. Up to 736 conditions per place. [2024-02-05 10:51:44,755 INFO L140 encePairwiseOnDemand]: 99/102 looper letters, 44 selfloop transitions, 2 changer transitions 0/98 dead transitions. [2024-02-05 10:51:44,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 98 transitions, 313 flow [2024-02-05 10:51:44,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:51:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:51:44,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 293 transitions. [2024-02-05 10:51:44,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7181372549019608 [2024-02-05 10:51:44,761 INFO L175 Difference]: Start difference. First operand has 88 places, 88 transitions, 197 flow. Second operand 4 states and 293 transitions. [2024-02-05 10:51:44,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 98 transitions, 313 flow [2024-02-05 10:51:44,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 98 transitions, 309 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-05 10:51:44,765 INFO L231 Difference]: Finished difference. Result has 89 places, 87 transitions, 196 flow [2024-02-05 10:51:44,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=89, PETRI_TRANSITIONS=87} [2024-02-05 10:51:44,766 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -6 predicate places. [2024-02-05 10:51:44,766 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 87 transitions, 196 flow [2024-02-05 10:51:44,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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-05 10:51:44,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:51:44,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:51:44,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-05 10:51:44,767 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:51:44,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:51:44,767 INFO L85 PathProgramCache]: Analyzing trace with hash 769765184, now seen corresponding path program 1 times [2024-02-05 10:51:44,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:51:44,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340936639] [2024-02-05 10:51:44,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:51:44,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:51:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:51:44,842 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-05 10:51:44,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:51:44,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340936639] [2024-02-05 10:51:44,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340936639] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:51:44,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:51:44,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-05 10:51:44,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011957246] [2024-02-05 10:51:44,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:51:44,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:51:44,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:51:44,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:51:44,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:51:44,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 102 [2024-02-05 10:51:44,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 87 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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-05 10:51:44,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:51:44,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 102 [2024-02-05 10:51:44,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:51:45,143 INFO L124 PetriNetUnfolderBase]: 739/2168 cut-off events. [2024-02-05 10:51:45,144 INFO L125 PetriNetUnfolderBase]: For 124/131 co-relation queries the response was YES. [2024-02-05 10:51:45,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3565 conditions, 2168 events. 739/2168 cut-off events. For 124/131 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 16043 event pairs, 358 based on Foata normal form. 84/1884 useless extension candidates. Maximal degree in co-relation 3404. Up to 933 conditions per place. [2024-02-05 10:51:45,154 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 60 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2024-02-05 10:51:45,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 109 transitions, 371 flow [2024-02-05 10:51:45,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:51:45,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:51:45,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2024-02-05 10:51:45,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7679738562091504 [2024-02-05 10:51:45,155 INFO L175 Difference]: Start difference. First operand has 89 places, 87 transitions, 196 flow. Second operand 3 states and 235 transitions. [2024-02-05 10:51:45,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 109 transitions, 371 flow [2024-02-05 10:51:45,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 109 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:51:45,158 INFO L231 Difference]: Finished difference. Result has 90 places, 88 transitions, 213 flow [2024-02-05 10:51:45,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=90, PETRI_TRANSITIONS=88} [2024-02-05 10:51:45,159 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -5 predicate places. [2024-02-05 10:51:45,159 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 88 transitions, 213 flow [2024-02-05 10:51:45,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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-05 10:51:45,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:51:45,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:51:45,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-05 10:51:45,160 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:51:45,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:51:45,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1908828753, now seen corresponding path program 1 times [2024-02-05 10:51:45,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:51:45,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923006516] [2024-02-05 10:51:45,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:51:45,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:51:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:51:45,245 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-05 10:51:45,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:51:45,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923006516] [2024-02-05 10:51:45,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923006516] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:51:45,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:51:45,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:51:45,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676295444] [2024-02-05 10:51:45,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:51:45,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:51:45,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:51:45,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:51:45,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:51:45,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 102 [2024-02-05 10:51:45,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 88 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 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-05 10:51:45,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:51:45,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 102 [2024-02-05 10:51:45,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:51:45,562 INFO L124 PetriNetUnfolderBase]: 556/1754 cut-off events. [2024-02-05 10:51:45,562 INFO L125 PetriNetUnfolderBase]: For 208/251 co-relation queries the response was YES. [2024-02-05 10:51:45,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2948 conditions, 1754 events. 556/1754 cut-off events. For 208/251 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 12724 event pairs, 102 based on Foata normal form. 0/1459 useless extension candidates. Maximal degree in co-relation 2697. Up to 771 conditions per place. [2024-02-05 10:51:45,571 INFO L140 encePairwiseOnDemand]: 99/102 looper letters, 59 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2024-02-05 10:51:45,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 112 transitions, 410 flow [2024-02-05 10:51:45,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:51:45,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:51:45,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 303 transitions. [2024-02-05 10:51:45,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7426470588235294 [2024-02-05 10:51:45,576 INFO L175 Difference]: Start difference. First operand has 90 places, 88 transitions, 213 flow. Second operand 4 states and 303 transitions. [2024-02-05 10:51:45,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 112 transitions, 410 flow [2024-02-05 10:51:45,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 112 transitions, 404 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-05 10:51:45,579 INFO L231 Difference]: Finished difference. Result has 91 places, 87 transitions, 213 flow [2024-02-05 10:51:45,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=213, PETRI_PLACES=91, PETRI_TRANSITIONS=87} [2024-02-05 10:51:45,580 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -4 predicate places. [2024-02-05 10:51:45,580 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 87 transitions, 213 flow [2024-02-05 10:51:45,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 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-05 10:51:45,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:51:45,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:51:45,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-05 10:51:45,581 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:51:45,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:51:45,581 INFO L85 PathProgramCache]: Analyzing trace with hash 955851321, now seen corresponding path program 1 times [2024-02-05 10:51:45,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:51:45,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390070115] [2024-02-05 10:51:45,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:51:45,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:51:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:51:45,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-05 10:51:45,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:51:45,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390070115] [2024-02-05 10:51:45,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390070115] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:51:45,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:51:45,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-05 10:51:45,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713897213] [2024-02-05 10:51:45,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:51:45,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:51:45,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:51:45,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:51:45,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:51:45,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 102 [2024-02-05 10:51:45,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 87 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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-05 10:51:45,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:51:45,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 102 [2024-02-05 10:51:45,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:51:45,978 INFO L124 PetriNetUnfolderBase]: 884/2373 cut-off events. [2024-02-05 10:51:45,978 INFO L125 PetriNetUnfolderBase]: For 275/392 co-relation queries the response was YES. [2024-02-05 10:51:45,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4160 conditions, 2373 events. 884/2373 cut-off events. For 275/392 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 16690 event pairs, 461 based on Foata normal form. 104/2186 useless extension candidates. Maximal degree in co-relation 3957. Up to 974 conditions per place. [2024-02-05 10:51:45,992 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 59 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2024-02-05 10:51:45,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 107 transitions, 385 flow [2024-02-05 10:51:45,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:51:45,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:51:45,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2024-02-05 10:51:45,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.761437908496732 [2024-02-05 10:51:45,995 INFO L175 Difference]: Start difference. First operand has 91 places, 87 transitions, 213 flow. Second operand 3 states and 233 transitions. [2024-02-05 10:51:45,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 107 transitions, 385 flow [2024-02-05 10:51:45,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 107 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:51:45,999 INFO L231 Difference]: Finished difference. Result has 92 places, 87 transitions, 226 flow [2024-02-05 10:51:46,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=92, PETRI_TRANSITIONS=87} [2024-02-05 10:51:46,002 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -3 predicate places. [2024-02-05 10:51:46,002 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 226 flow [2024-02-05 10:51:46,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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-05 10:51:46,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:51:46,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:51:46,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-05 10:51:46,003 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:51:46,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:51:46,004 INFO L85 PathProgramCache]: Analyzing trace with hash 2146100525, now seen corresponding path program 1 times [2024-02-05 10:51:46,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:51:46,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910078054] [2024-02-05 10:51:46,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:51:46,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:51:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:51:46,128 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-05 10:51:46,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:51:46,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910078054] [2024-02-05 10:51:46,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910078054] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:51:46,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:51:46,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:51:46,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228373065] [2024-02-05 10:51:46,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:51:46,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:51:46,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:51:46,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:51:46,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:51:46,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 102 [2024-02-05 10:51:46,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 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-05 10:51:46,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:51:46,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 102 [2024-02-05 10:51:46,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:51:46,959 INFO L124 PetriNetUnfolderBase]: 2878/6605 cut-off events. [2024-02-05 10:51:46,959 INFO L125 PetriNetUnfolderBase]: For 1350/1418 co-relation queries the response was YES. [2024-02-05 10:51:46,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12949 conditions, 6605 events. 2878/6605 cut-off events. For 1350/1418 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 48601 event pairs, 558 based on Foata normal form. 292/6645 useless extension candidates. Maximal degree in co-relation 12691. Up to 2466 conditions per place. [2024-02-05 10:51:47,000 INFO L140 encePairwiseOnDemand]: 89/102 looper letters, 90 selfloop transitions, 8 changer transitions 0/133 dead transitions. [2024-02-05 10:51:47,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 133 transitions, 549 flow [2024-02-05 10:51:47,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:51:47,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:51:47,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 284 transitions. [2024-02-05 10:51:47,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.696078431372549 [2024-02-05 10:51:47,003 INFO L175 Difference]: Start difference. First operand has 92 places, 87 transitions, 226 flow. Second operand 4 states and 284 transitions. [2024-02-05 10:51:47,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 133 transitions, 549 flow [2024-02-05 10:51:47,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 133 transitions, 544 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-05 10:51:47,007 INFO L231 Difference]: Finished difference. Result has 97 places, 91 transitions, 286 flow [2024-02-05 10:51:47,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=286, PETRI_PLACES=97, PETRI_TRANSITIONS=91} [2024-02-05 10:51:47,010 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 2 predicate places. [2024-02-05 10:51:47,010 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 91 transitions, 286 flow [2024-02-05 10:51:47,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 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-05 10:51:47,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:51:47,011 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-05 10:51:47,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-05 10:51:47,011 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:51:47,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:51:47,012 INFO L85 PathProgramCache]: Analyzing trace with hash -26085961, now seen corresponding path program 1 times [2024-02-05 10:51:47,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:51:47,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773204670] [2024-02-05 10:51:47,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:51:47,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:51:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:51:47,101 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-05 10:51:47,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:51:47,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773204670] [2024-02-05 10:51:47,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773204670] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:51:47,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:51:47,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:51:47,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151453289] [2024-02-05 10:51:47,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:51:47,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:51:47,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:51:47,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:51:47,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:51:47,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 102 [2024-02-05 10:51:47,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 91 transitions, 286 flow. Second operand has 4 states, 4 states have (on average 48.5) internal successors, (194), 4 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-05 10:51:47,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:51:47,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 102 [2024-02-05 10:51:47,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:51:47,902 INFO L124 PetriNetUnfolderBase]: 2538/6185 cut-off events. [2024-02-05 10:51:47,903 INFO L125 PetriNetUnfolderBase]: For 2779/2903 co-relation queries the response was YES. [2024-02-05 10:51:47,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13504 conditions, 6185 events. 2538/6185 cut-off events. For 2779/2903 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 45951 event pairs, 709 based on Foata normal form. 16/6037 useless extension candidates. Maximal degree in co-relation 13252. Up to 2253 conditions per place. [2024-02-05 10:51:47,933 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 90 selfloop transitions, 9 changer transitions 0/133 dead transitions. [2024-02-05 10:51:47,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 133 transitions, 611 flow [2024-02-05 10:51:47,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:51:47,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:51:47,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 276 transitions. [2024-02-05 10:51:47,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2024-02-05 10:51:47,936 INFO L175 Difference]: Start difference. First operand has 97 places, 91 transitions, 286 flow. Second operand 4 states and 276 transitions. [2024-02-05 10:51:47,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 133 transitions, 611 flow [2024-02-05 10:51:47,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 133 transitions, 608 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-05 10:51:47,943 INFO L231 Difference]: Finished difference. Result has 101 places, 93 transitions, 329 flow [2024-02-05 10:51:47,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=329, PETRI_PLACES=101, PETRI_TRANSITIONS=93} [2024-02-05 10:51:47,944 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 6 predicate places. [2024-02-05 10:51:47,944 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 93 transitions, 329 flow [2024-02-05 10:51:47,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.5) internal successors, (194), 4 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-05 10:51:47,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:51:47,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:51:47,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-05 10:51:47,945 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:51:47,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:51:47,946 INFO L85 PathProgramCache]: Analyzing trace with hash -401931381, now seen corresponding path program 1 times [2024-02-05 10:51:47,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:51:47,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557493478] [2024-02-05 10:51:47,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:51:47,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:51:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:51:48,058 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-05 10:51:48,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:51:48,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557493478] [2024-02-05 10:51:48,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557493478] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:51:48,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:51:48,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-05 10:51:48,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822294570] [2024-02-05 10:51:48,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:51:48,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-05 10:51:48,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:51:48,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-05 10:51:48,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-05 10:51:48,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 102 [2024-02-05 10:51:48,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 93 transitions, 329 flow. Second operand has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 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-05 10:51:48,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:51:48,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 102 [2024-02-05 10:51:48,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:51:49,024 INFO L124 PetriNetUnfolderBase]: 3275/7240 cut-off events. [2024-02-05 10:51:49,024 INFO L125 PetriNetUnfolderBase]: For 6038/6122 co-relation queries the response was YES. [2024-02-05 10:51:49,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16980 conditions, 7240 events. 3275/7240 cut-off events. For 6038/6122 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 52618 event pairs, 558 based on Foata normal form. 50/7148 useless extension candidates. Maximal degree in co-relation 16687. Up to 2641 conditions per place. [2024-02-05 10:51:49,066 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 115 selfloop transitions, 12 changer transitions 0/159 dead transitions. [2024-02-05 10:51:49,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 159 transitions, 780 flow [2024-02-05 10:51:49,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-05 10:51:49,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-05 10:51:49,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 342 transitions. [2024-02-05 10:51:49,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6705882352941176 [2024-02-05 10:51:49,068 INFO L175 Difference]: Start difference. First operand has 101 places, 93 transitions, 329 flow. Second operand 5 states and 342 transitions. [2024-02-05 10:51:49,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 159 transitions, 780 flow [2024-02-05 10:51:49,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 159 transitions, 771 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-05 10:51:49,082 INFO L231 Difference]: Finished difference. Result has 105 places, 95 transitions, 363 flow [2024-02-05 10:51:49,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=363, PETRI_PLACES=105, PETRI_TRANSITIONS=95} [2024-02-05 10:51:49,084 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 10 predicate places. [2024-02-05 10:51:49,084 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 95 transitions, 363 flow [2024-02-05 10:51:49,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 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-05 10:51:49,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:51:49,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:51:49,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-05 10:51:49,085 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:51:49,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:51:49,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1887091080, now seen corresponding path program 1 times [2024-02-05 10:51:49,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:51:49,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841392929] [2024-02-05 10:51:49,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:51:49,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:51:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:51:49,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:51:49,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:51:49,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841392929] [2024-02-05 10:51:49,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841392929] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:51:49,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656366570] [2024-02-05 10:51:49,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:51:49,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:51:49,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:51:49,193 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:51:49,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-05 10:51:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:51:49,364 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-05 10:51:49,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:51:49,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:51:49,471 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:51:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:51:49,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656366570] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:51:49,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:51:49,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-02-05 10:51:49,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605924857] [2024-02-05 10:51:49,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:51:49,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:51:49,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:51:49,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:51:49,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-02-05 10:51:49,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 102 [2024-02-05 10:51:49,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 95 transitions, 363 flow. Second operand has 6 states, 6 states have (on average 54.166666666666664) internal successors, (325), 6 states have internal predecessors, (325), 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-05 10:51:49,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:51:49,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 102 [2024-02-05 10:51:49,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:51:50,743 INFO L124 PetriNetUnfolderBase]: 3436/8189 cut-off events. [2024-02-05 10:51:50,743 INFO L125 PetriNetUnfolderBase]: For 4607/4727 co-relation queries the response was YES. [2024-02-05 10:51:50,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18136 conditions, 8189 events. 3436/8189 cut-off events. For 4607/4727 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 64037 event pairs, 439 based on Foata normal form. 596/8623 useless extension candidates. Maximal degree in co-relation 17791. Up to 2602 conditions per place. [2024-02-05 10:51:50,791 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 121 selfloop transitions, 7 changer transitions 0/169 dead transitions. [2024-02-05 10:51:50,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 169 transitions, 839 flow [2024-02-05 10:51:50,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-05 10:51:50,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-05 10:51:50,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 425 transitions. [2024-02-05 10:51:50,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2024-02-05 10:51:50,793 INFO L175 Difference]: Start difference. First operand has 105 places, 95 transitions, 363 flow. Second operand 6 states and 425 transitions. [2024-02-05 10:51:50,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 169 transitions, 839 flow [2024-02-05 10:51:50,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 169 transitions, 813 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-05 10:51:50,800 INFO L231 Difference]: Finished difference. Result has 106 places, 93 transitions, 363 flow [2024-02-05 10:51:50,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=363, PETRI_PLACES=106, PETRI_TRANSITIONS=93} [2024-02-05 10:51:50,801 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 11 predicate places. [2024-02-05 10:51:50,801 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 93 transitions, 363 flow [2024-02-05 10:51:50,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 54.166666666666664) internal successors, (325), 6 states have internal predecessors, (325), 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-05 10:51:50,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:51:50,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:51:50,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-02-05 10:51:51,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:51:51,017 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:51:51,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:51:51,017 INFO L85 PathProgramCache]: Analyzing trace with hash -598033558, now seen corresponding path program 1 times [2024-02-05 10:51:51,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:51:51,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526060169] [2024-02-05 10:51:51,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:51:51,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:51:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:51:51,108 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-05 10:51:51,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:51:51,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526060169] [2024-02-05 10:51:51,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526060169] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:51:51,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:51:51,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:51:51,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122967852] [2024-02-05 10:51:51,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:51:51,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:51:51,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:51:51,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:51:51,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:51:51,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 102 [2024-02-05 10:51:51,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 93 transitions, 363 flow. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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-05 10:51:51,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:51:51,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 102 [2024-02-05 10:51:51,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:51:51,478 INFO L124 PetriNetUnfolderBase]: 858/3069 cut-off events. [2024-02-05 10:51:51,478 INFO L125 PetriNetUnfolderBase]: For 2047/2080 co-relation queries the response was YES. [2024-02-05 10:51:51,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6592 conditions, 3069 events. 858/3069 cut-off events. For 2047/2080 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 23349 event pairs, 341 based on Foata normal form. 102/3133 useless extension candidates. Maximal degree in co-relation 6302. Up to 767 conditions per place. [2024-02-05 10:51:51,497 INFO L140 encePairwiseOnDemand]: 94/102 looper letters, 54 selfloop transitions, 8 changer transitions 0/111 dead transitions. [2024-02-05 10:51:51,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 111 transitions, 564 flow [2024-02-05 10:51:51,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:51:51,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:51:51,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 241 transitions. [2024-02-05 10:51:51,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7875816993464052 [2024-02-05 10:51:51,499 INFO L175 Difference]: Start difference. First operand has 106 places, 93 transitions, 363 flow. Second operand 3 states and 241 transitions. [2024-02-05 10:51:51,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 111 transitions, 564 flow [2024-02-05 10:51:51,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 111 transitions, 540 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-02-05 10:51:51,507 INFO L231 Difference]: Finished difference. Result has 106 places, 91 transitions, 347 flow [2024-02-05 10:51:51,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=347, PETRI_PLACES=106, PETRI_TRANSITIONS=91} [2024-02-05 10:51:51,508 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 11 predicate places. [2024-02-05 10:51:51,508 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 91 transitions, 347 flow [2024-02-05 10:51:51,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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-05 10:51:51,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:51:51,508 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:51:51,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-05 10:51:51,509 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:51:51,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:51:51,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1216540427, now seen corresponding path program 1 times [2024-02-05 10:51:51,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:51:51,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207001780] [2024-02-05 10:51:51,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:51:51,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:51:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:51:51,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:51:51,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:51:51,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207001780] [2024-02-05 10:51:51,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207001780] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:51:51,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845680726] [2024-02-05 10:51:51,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:51:51,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:51:51,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:51:51,670 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:51:51,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-05 10:51:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:51:51,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-05 10:51:51,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:51:51,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:51:51,937 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-05 10:51:51,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845680726] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:51:51,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-05 10:51:51,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-02-05 10:51:51,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347730956] [2024-02-05 10:51:51,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:51:51,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:51:51,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:51:51,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:51:51,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-02-05 10:51:52,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 102 [2024-02-05 10:51:52,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 91 transitions, 347 flow. Second operand has 6 states, 6 states have (on average 45.333333333333336) internal successors, (272), 6 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-05 10:51:52,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:51:52,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 102 [2024-02-05 10:51:52,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:51:52,653 INFO L124 PetriNetUnfolderBase]: 1631/3834 cut-off events. [2024-02-05 10:51:52,653 INFO L125 PetriNetUnfolderBase]: For 2268/2374 co-relation queries the response was YES. [2024-02-05 10:51:52,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9034 conditions, 3834 events. 1631/3834 cut-off events. For 2268/2374 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 22278 event pairs, 329 based on Foata normal form. 114/3916 useless extension candidates. Maximal degree in co-relation 8774. Up to 1601 conditions per place. [2024-02-05 10:51:52,678 INFO L140 encePairwiseOnDemand]: 92/102 looper letters, 107 selfloop transitions, 14 changer transitions 1/152 dead transitions. [2024-02-05 10:51:52,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 152 transitions, 801 flow [2024-02-05 10:51:52,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-05 10:51:52,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-05 10:51:52,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 361 transitions. [2024-02-05 10:51:52,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5898692810457516 [2024-02-05 10:51:52,682 INFO L175 Difference]: Start difference. First operand has 106 places, 91 transitions, 347 flow. Second operand 6 states and 361 transitions. [2024-02-05 10:51:52,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 152 transitions, 801 flow [2024-02-05 10:51:52,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 152 transitions, 782 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-05 10:51:52,690 INFO L231 Difference]: Finished difference. Result has 112 places, 94 transitions, 420 flow [2024-02-05 10:51:52,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=420, PETRI_PLACES=112, PETRI_TRANSITIONS=94} [2024-02-05 10:51:52,691 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 17 predicate places. [2024-02-05 10:51:52,691 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 94 transitions, 420 flow [2024-02-05 10:51:52,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.333333333333336) internal successors, (272), 6 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-05 10:51:52,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:51:52,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:51:52,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-02-05 10:51:52,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-02-05 10:51:52,905 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:51:52,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:51:52,905 INFO L85 PathProgramCache]: Analyzing trace with hash 2052610538, now seen corresponding path program 1 times [2024-02-05 10:51:52,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:51:52,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358872012] [2024-02-05 10:51:52,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:51:52,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:51:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:51:53,047 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-05 10:51:53,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:51:53,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358872012] [2024-02-05 10:51:53,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358872012] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:51:53,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:51:53,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:51:53,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864331292] [2024-02-05 10:51:53,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:51:53,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:51:53,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:51:53,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:51:53,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:51:53,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 102 [2024-02-05 10:51:53,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 94 transitions, 420 flow. Second operand has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 states have internal predecessors, (205), 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-05 10:51:53,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:51:53,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 102 [2024-02-05 10:51:53,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:51:53,614 INFO L124 PetriNetUnfolderBase]: 1214/3256 cut-off events. [2024-02-05 10:51:53,615 INFO L125 PetriNetUnfolderBase]: For 3832/3856 co-relation queries the response was YES. [2024-02-05 10:51:53,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8200 conditions, 3256 events. 1214/3256 cut-off events. For 3832/3856 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 20253 event pairs, 822 based on Foata normal form. 12/3190 useless extension candidates. Maximal degree in co-relation 7962. Up to 1864 conditions per place. [2024-02-05 10:51:53,635 INFO L140 encePairwiseOnDemand]: 92/102 looper letters, 87 selfloop transitions, 12 changer transitions 0/132 dead transitions. [2024-02-05 10:51:53,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 132 transitions, 787 flow [2024-02-05 10:51:53,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:51:53,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:51:53,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 272 transitions. [2024-02-05 10:51:53,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-02-05 10:51:53,637 INFO L175 Difference]: Start difference. First operand has 112 places, 94 transitions, 420 flow. Second operand 4 states and 272 transitions. [2024-02-05 10:51:53,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 132 transitions, 787 flow [2024-02-05 10:51:53,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 132 transitions, 773 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:51:53,648 INFO L231 Difference]: Finished difference. Result has 115 places, 101 transitions, 515 flow [2024-02-05 10:51:53,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=515, PETRI_PLACES=115, PETRI_TRANSITIONS=101} [2024-02-05 10:51:53,649 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 20 predicate places. [2024-02-05 10:51:53,650 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 101 transitions, 515 flow [2024-02-05 10:51:53,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 states have internal predecessors, (205), 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-05 10:51:53,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:51:53,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:51:53,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-05 10:51:53,651 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:51:53,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:51:53,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1150019684, now seen corresponding path program 2 times [2024-02-05 10:51:53,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:51:53,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441624729] [2024-02-05 10:51:53,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:51:53,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:51:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:51:53,746 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-05 10:51:53,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:51:53,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441624729] [2024-02-05 10:51:53,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441624729] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:51:53,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:51:53,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:51:53,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565716251] [2024-02-05 10:51:53,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:51:53,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:51:53,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:51:53,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:51:53,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:51:53,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 102 [2024-02-05 10:51:53,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 101 transitions, 515 flow. Second operand has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 states have internal predecessors, (205), 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-05 10:51:53,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:51:53,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 102 [2024-02-05 10:51:53,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:51:54,232 INFO L124 PetriNetUnfolderBase]: 1228/3328 cut-off events. [2024-02-05 10:51:54,232 INFO L125 PetriNetUnfolderBase]: For 4334/4362 co-relation queries the response was YES. [2024-02-05 10:51:54,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8718 conditions, 3328 events. 1228/3328 cut-off events. For 4334/4362 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 20963 event pairs, 484 based on Foata normal form. 16/3283 useless extension candidates. Maximal degree in co-relation 8475. Up to 1120 conditions per place. [2024-02-05 10:51:54,254 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 88 selfloop transitions, 14 changer transitions 0/135 dead transitions. [2024-02-05 10:51:54,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 135 transitions, 869 flow [2024-02-05 10:51:54,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:51:54,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:51:54,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 270 transitions. [2024-02-05 10:51:54,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6617647058823529 [2024-02-05 10:51:54,256 INFO L175 Difference]: Start difference. First operand has 115 places, 101 transitions, 515 flow. Second operand 4 states and 270 transitions. [2024-02-05 10:51:54,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 135 transitions, 869 flow [2024-02-05 10:51:54,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 135 transitions, 861 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:51:54,269 INFO L231 Difference]: Finished difference. Result has 117 places, 104 transitions, 586 flow [2024-02-05 10:51:54,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=586, PETRI_PLACES=117, PETRI_TRANSITIONS=104} [2024-02-05 10:51:54,270 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 22 predicate places. [2024-02-05 10:51:54,271 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 104 transitions, 586 flow [2024-02-05 10:51:54,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 states have internal predecessors, (205), 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-05 10:51:54,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:51:54,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:51:54,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-05 10:51:54,271 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:51:54,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:51:54,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1379422196, now seen corresponding path program 1 times [2024-02-05 10:51:54,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:51:54,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045045238] [2024-02-05 10:51:54,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:51:54,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:51:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:51:54,428 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-05 10:51:54,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:51:54,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045045238] [2024-02-05 10:51:54,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045045238] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:51:54,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:51:54,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-05 10:51:54,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428097869] [2024-02-05 10:51:54,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:51:54,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-05 10:51:54,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:51:54,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-05 10:51:54,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-02-05 10:51:54,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 102 [2024-02-05 10:51:54,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 104 transitions, 586 flow. Second operand has 5 states, 5 states have (on average 46.8) internal successors, (234), 5 states have internal predecessors, (234), 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-05 10:51:54,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:51:54,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 102 [2024-02-05 10:51:54,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:51:55,018 INFO L124 PetriNetUnfolderBase]: 1337/3470 cut-off events. [2024-02-05 10:51:55,018 INFO L125 PetriNetUnfolderBase]: For 5180/5214 co-relation queries the response was YES. [2024-02-05 10:51:55,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9337 conditions, 3470 events. 1337/3470 cut-off events. For 5180/5214 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 21618 event pairs, 900 based on Foata normal form. 4/3404 useless extension candidates. Maximal degree in co-relation 9075. Up to 2020 conditions per place. [2024-02-05 10:51:55,033 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 99 selfloop transitions, 17 changer transitions 0/145 dead transitions. [2024-02-05 10:51:55,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 145 transitions, 1010 flow [2024-02-05 10:51:55,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-05 10:51:55,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-05 10:51:55,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 311 transitions. [2024-02-05 10:51:55,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6098039215686275 [2024-02-05 10:51:55,035 INFO L175 Difference]: Start difference. First operand has 117 places, 104 transitions, 586 flow. Second operand 5 states and 311 transitions. [2024-02-05 10:51:55,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 145 transitions, 1010 flow [2024-02-05 10:51:55,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 145 transitions, 980 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-02-05 10:51:55,047 INFO L231 Difference]: Finished difference. Result has 121 places, 106 transitions, 634 flow [2024-02-05 10:51:55,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=634, PETRI_PLACES=121, PETRI_TRANSITIONS=106} [2024-02-05 10:51:55,048 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 26 predicate places. [2024-02-05 10:51:55,048 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 106 transitions, 634 flow [2024-02-05 10:51:55,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.8) internal successors, (234), 5 states have internal predecessors, (234), 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-05 10:51:55,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:51:55,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:51:55,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-05 10:51:55,049 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:51:55,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:51:55,050 INFO L85 PathProgramCache]: Analyzing trace with hash 2023645167, now seen corresponding path program 1 times [2024-02-05 10:51:55,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:51:55,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652991125] [2024-02-05 10:51:55,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:51:55,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:51:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:51:55,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:51:55,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:51:55,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652991125] [2024-02-05 10:51:55,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652991125] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:51:55,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665384117] [2024-02-05 10:51:55,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:51:55,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:51:55,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:51:55,144 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:51:55,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-02-05 10:51:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:51:55,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-05 10:51:55,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:51:55,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:51:55,349 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:51:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:51:55,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665384117] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:51:55,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:51:55,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-02-05 10:51:55,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447971441] [2024-02-05 10:51:55,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:51:55,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:51:55,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:51:55,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:51:55,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-02-05 10:51:55,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 102 [2024-02-05 10:51:55,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 106 transitions, 634 flow. Second operand has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 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-05 10:51:55,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:51:55,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 102 [2024-02-05 10:51:55,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:51:56,173 INFO L124 PetriNetUnfolderBase]: 1511/3670 cut-off events. [2024-02-05 10:51:56,173 INFO L125 PetriNetUnfolderBase]: For 6048/6097 co-relation queries the response was YES. [2024-02-05 10:51:56,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9786 conditions, 3670 events. 1511/3670 cut-off events. For 6048/6097 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 21914 event pairs, 265 based on Foata normal form. 244/3767 useless extension candidates. Maximal degree in co-relation 9494. Up to 947 conditions per place. [2024-02-05 10:51:56,196 INFO L140 encePairwiseOnDemand]: 91/102 looper letters, 122 selfloop transitions, 10 changer transitions 0/169 dead transitions. [2024-02-05 10:51:56,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 169 transitions, 1158 flow [2024-02-05 10:51:56,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-05 10:51:56,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-05 10:51:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 403 transitions. [2024-02-05 10:51:56,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6584967320261438 [2024-02-05 10:51:56,198 INFO L175 Difference]: Start difference. First operand has 121 places, 106 transitions, 634 flow. Second operand 6 states and 403 transitions. [2024-02-05 10:51:56,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 169 transitions, 1158 flow [2024-02-05 10:51:56,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 169 transitions, 1126 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-05 10:51:56,211 INFO L231 Difference]: Finished difference. Result has 122 places, 104 transitions, 632 flow [2024-02-05 10:51:56,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=632, PETRI_PLACES=122, PETRI_TRANSITIONS=104} [2024-02-05 10:51:56,211 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 27 predicate places. [2024-02-05 10:51:56,212 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 104 transitions, 632 flow [2024-02-05 10:51:56,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 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-05 10:51:56,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:51:56,212 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:51:56,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-02-05 10:51:56,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:51:56,427 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:51:56,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:51:56,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1526654846, now seen corresponding path program 1 times [2024-02-05 10:51:56,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:51:56,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7647504] [2024-02-05 10:51:56,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:51:56,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:51:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:51:56,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:51:56,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:51:56,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7647504] [2024-02-05 10:51:56,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7647504] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:51:56,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834159190] [2024-02-05 10:51:56,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:51:56,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:51:56,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:51:56,612 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:51:56,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-02-05 10:51:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:51:56,741 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-05 10:51:56,744 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:51:56,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:51:56,882 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-05 10:51:56,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834159190] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:51:56,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-05 10:51:56,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-02-05 10:51:56,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637511393] [2024-02-05 10:51:56,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:51:56,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:51:56,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:51:56,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:51:56,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-02-05 10:51:56,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 102 [2024-02-05 10:51:56,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 104 transitions, 632 flow. Second operand has 6 states, 6 states have (on average 46.833333333333336) internal successors, (281), 6 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:51:56,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:51:56,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 102 [2024-02-05 10:51:56,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:51:57,581 INFO L124 PetriNetUnfolderBase]: 1946/4395 cut-off events. [2024-02-05 10:51:57,581 INFO L125 PetriNetUnfolderBase]: For 7252/7274 co-relation queries the response was YES. [2024-02-05 10:51:57,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12191 conditions, 4395 events. 1946/4395 cut-off events. For 7252/7274 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 25266 event pairs, 307 based on Foata normal form. 48/4403 useless extension candidates. Maximal degree in co-relation 11894. Up to 1433 conditions per place. [2024-02-05 10:51:57,601 INFO L140 encePairwiseOnDemand]: 92/102 looper letters, 136 selfloop transitions, 20 changer transitions 0/182 dead transitions. [2024-02-05 10:51:57,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 182 transitions, 1284 flow [2024-02-05 10:51:57,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-05 10:51:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-05 10:51:57,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 372 transitions. [2024-02-05 10:51:57,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2024-02-05 10:51:57,602 INFO L175 Difference]: Start difference. First operand has 122 places, 104 transitions, 632 flow. Second operand 6 states and 372 transitions. [2024-02-05 10:51:57,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 182 transitions, 1284 flow [2024-02-05 10:51:57,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 182 transitions, 1256 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-02-05 10:51:57,619 INFO L231 Difference]: Finished difference. Result has 128 places, 110 transitions, 761 flow [2024-02-05 10:51:57,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=761, PETRI_PLACES=128, PETRI_TRANSITIONS=110} [2024-02-05 10:51:57,620 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 33 predicate places. [2024-02-05 10:51:57,620 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 110 transitions, 761 flow [2024-02-05 10:51:57,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.833333333333336) internal successors, (281), 6 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:51:57,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:51:57,621 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:51:57,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-02-05 10:51:57,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-02-05 10:51:57,835 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:51:57,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:51:57,836 INFO L85 PathProgramCache]: Analyzing trace with hash -922523205, now seen corresponding path program 1 times [2024-02-05 10:51:57,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:51:57,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587346349] [2024-02-05 10:51:57,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:51:57,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:51:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:51:58,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:51:58,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:51:58,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587346349] [2024-02-05 10:51:58,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587346349] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:51:58,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327764503] [2024-02-05 10:51:58,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:51:58,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:51:58,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:51:58,038 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:51:58,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-02-05 10:51:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:51:58,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-05 10:51:58,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:51:58,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:51:58,326 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-05 10:51:58,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327764503] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:51:58,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-05 10:51:58,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-02-05 10:51:58,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682831843] [2024-02-05 10:51:58,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:51:58,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:51:58,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:51:58,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:51:58,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-02-05 10:51:58,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 102 [2024-02-05 10:51:58,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 110 transitions, 761 flow. Second operand has 6 states, 6 states have (on average 45.833333333333336) internal successors, (275), 6 states have internal predecessors, (275), 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-05 10:51:58,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:51:58,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 102 [2024-02-05 10:51:58,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:51:59,053 INFO L124 PetriNetUnfolderBase]: 1837/4247 cut-off events. [2024-02-05 10:51:59,053 INFO L125 PetriNetUnfolderBase]: For 12184/12279 co-relation queries the response was YES. [2024-02-05 10:51:59,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12834 conditions, 4247 events. 1837/4247 cut-off events. For 12184/12279 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 24436 event pairs, 474 based on Foata normal form. 62/4257 useless extension candidates. Maximal degree in co-relation 12504. Up to 1967 conditions per place. [2024-02-05 10:51:59,071 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 112 selfloop transitions, 27 changer transitions 3/170 dead transitions. [2024-02-05 10:51:59,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 170 transitions, 1366 flow [2024-02-05 10:51:59,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-05 10:51:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-05 10:51:59,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 349 transitions. [2024-02-05 10:51:59,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5702614379084967 [2024-02-05 10:51:59,073 INFO L175 Difference]: Start difference. First operand has 128 places, 110 transitions, 761 flow. Second operand 6 states and 349 transitions. [2024-02-05 10:51:59,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 170 transitions, 1366 flow [2024-02-05 10:51:59,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 170 transitions, 1322 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-02-05 10:51:59,090 INFO L231 Difference]: Finished difference. Result has 132 places, 117 transitions, 914 flow [2024-02-05 10:51:59,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=914, PETRI_PLACES=132, PETRI_TRANSITIONS=117} [2024-02-05 10:51:59,090 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 37 predicate places. [2024-02-05 10:51:59,091 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 117 transitions, 914 flow [2024-02-05 10:51:59,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.833333333333336) internal successors, (275), 6 states have internal predecessors, (275), 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-05 10:51:59,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:51:59,091 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:51:59,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-02-05 10:51:59,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-02-05 10:51:59,305 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:51:59,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:51:59,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1271598340, now seen corresponding path program 2 times [2024-02-05 10:51:59,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:51:59,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081802940] [2024-02-05 10:51:59,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:51:59,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:51:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:51:59,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:51:59,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:51:59,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081802940] [2024-02-05 10:51:59,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081802940] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:51:59,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634379747] [2024-02-05 10:51:59,467 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-05 10:51:59,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:51:59,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:51:59,468 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:51:59,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-02-05 10:51:59,613 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-05 10:51:59,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-05 10:51:59,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-05 10:51:59,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:51:59,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:51:59,707 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-05 10:51:59,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634379747] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:51:59,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-05 10:51:59,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-02-05 10:51:59,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047136305] [2024-02-05 10:51:59,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:51:59,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-05 10:51:59,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:51:59,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-05 10:51:59,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-02-05 10:51:59,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 102 [2024-02-05 10:51:59,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 117 transitions, 914 flow. Second operand has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 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-05 10:51:59,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:51:59,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 102 [2024-02-05 10:51:59,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:52:00,561 INFO L124 PetriNetUnfolderBase]: 2562/5650 cut-off events. [2024-02-05 10:52:00,562 INFO L125 PetriNetUnfolderBase]: For 13890/13944 co-relation queries the response was YES. [2024-02-05 10:52:00,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17086 conditions, 5650 events. 2562/5650 cut-off events. For 13890/13944 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 34266 event pairs, 633 based on Foata normal form. 44/5641 useless extension candidates. Maximal degree in co-relation 16774. Up to 1730 conditions per place. [2024-02-05 10:52:00,596 INFO L140 encePairwiseOnDemand]: 88/102 looper letters, 126 selfloop transitions, 36 changer transitions 0/188 dead transitions. [2024-02-05 10:52:00,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 188 transitions, 1564 flow [2024-02-05 10:52:00,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-05 10:52:00,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-05 10:52:00,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 318 transitions. [2024-02-05 10:52:00,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6235294117647059 [2024-02-05 10:52:00,599 INFO L175 Difference]: Start difference. First operand has 132 places, 117 transitions, 914 flow. Second operand 5 states and 318 transitions. [2024-02-05 10:52:00,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 188 transitions, 1564 flow [2024-02-05 10:52:00,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 188 transitions, 1522 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-02-05 10:52:00,634 INFO L231 Difference]: Finished difference. Result has 133 places, 126 transitions, 1046 flow [2024-02-05 10:52:00,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1046, PETRI_PLACES=133, PETRI_TRANSITIONS=126} [2024-02-05 10:52:00,635 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 38 predicate places. [2024-02-05 10:52:00,635 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 126 transitions, 1046 flow [2024-02-05 10:52:00,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 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-05 10:52:00,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:52:00,635 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:52:00,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-02-05 10:52:00,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-02-05 10:52:00,850 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:52:00,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:52:00,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1283390554, now seen corresponding path program 1 times [2024-02-05 10:52:00,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:52:00,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815371525] [2024-02-05 10:52:00,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:52:00,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:52:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:52:01,109 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:52:01,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:52:01,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815371525] [2024-02-05 10:52:01,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815371525] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:52:01,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185028106] [2024-02-05 10:52:01,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:52:01,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:52:01,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:52:01,111 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:52:01,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-02-05 10:52:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:52:01,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-05 10:52:01,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:52:01,436 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:52:01,436 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-05 10:52:01,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185028106] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:52:01,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-05 10:52:01,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-02-05 10:52:01,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104769157] [2024-02-05 10:52:01,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:52:01,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-05 10:52:01,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:52:01,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-05 10:52:01,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-02-05 10:52:01,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 102 [2024-02-05 10:52:01,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 126 transitions, 1046 flow. Second operand has 7 states, 7 states have (on average 43.57142857142857) internal successors, (305), 7 states have internal predecessors, (305), 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-05 10:52:01,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:52:01,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 102 [2024-02-05 10:52:01,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:52:02,318 INFO L124 PetriNetUnfolderBase]: 2813/6283 cut-off events. [2024-02-05 10:52:02,318 INFO L125 PetriNetUnfolderBase]: For 16972/17050 co-relation queries the response was YES. [2024-02-05 10:52:02,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20428 conditions, 6283 events. 2813/6283 cut-off events. For 16972/17050 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 39078 event pairs, 385 based on Foata normal form. 38/6254 useless extension candidates. Maximal degree in co-relation 20088. Up to 1419 conditions per place. [2024-02-05 10:52:02,355 INFO L140 encePairwiseOnDemand]: 90/102 looper letters, 160 selfloop transitions, 47 changer transitions 0/233 dead transitions. [2024-02-05 10:52:02,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 233 transitions, 2050 flow [2024-02-05 10:52:02,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-05 10:52:02,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-05 10:52:02,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 412 transitions. [2024-02-05 10:52:02,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5770308123249299 [2024-02-05 10:52:02,357 INFO L175 Difference]: Start difference. First operand has 133 places, 126 transitions, 1046 flow. Second operand 7 states and 412 transitions. [2024-02-05 10:52:02,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 233 transitions, 2050 flow [2024-02-05 10:52:02,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 233 transitions, 2009 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-02-05 10:52:02,394 INFO L231 Difference]: Finished difference. Result has 138 places, 144 transitions, 1368 flow [2024-02-05 10:52:02,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=1006, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1368, PETRI_PLACES=138, PETRI_TRANSITIONS=144} [2024-02-05 10:52:02,395 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 43 predicate places. [2024-02-05 10:52:02,395 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 144 transitions, 1368 flow [2024-02-05 10:52:02,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.57142857142857) internal successors, (305), 7 states have internal predecessors, (305), 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-05 10:52:02,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:52:02,395 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:52:02,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-02-05 10:52:02,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:52:02,596 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:52:02,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:52:02,596 INFO L85 PathProgramCache]: Analyzing trace with hash -918583519, now seen corresponding path program 1 times [2024-02-05 10:52:02,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:52:02,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414542103] [2024-02-05 10:52:02,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:52:02,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:52:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:52:02,769 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-05 10:52:02,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:52:02,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414542103] [2024-02-05 10:52:02,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414542103] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:52:02,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365388863] [2024-02-05 10:52:02,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:52:02,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:52:02,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:52:02,772 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:52:02,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-02-05 10:52:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:52:02,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-05 10:52:02,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:52:03,097 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-05 10:52:03,097 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-05 10:52:03,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365388863] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:52:03,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-05 10:52:03,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-02-05 10:52:03,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533378233] [2024-02-05 10:52:03,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:52:03,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:52:03,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:52:03,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:52:03,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-02-05 10:52:03,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 102 [2024-02-05 10:52:03,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 144 transitions, 1368 flow. Second operand has 6 states, 6 states have (on average 47.833333333333336) internal successors, (287), 6 states have internal predecessors, (287), 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-05 10:52:03,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:52:03,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 102 [2024-02-05 10:52:03,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:52:04,040 INFO L124 PetriNetUnfolderBase]: 2894/6706 cut-off events. [2024-02-05 10:52:04,040 INFO L125 PetriNetUnfolderBase]: For 26041/26391 co-relation queries the response was YES. [2024-02-05 10:52:04,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22485 conditions, 6706 events. 2894/6706 cut-off events. For 26041/26391 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 43063 event pairs, 495 based on Foata normal form. 154/6768 useless extension candidates. Maximal degree in co-relation 22119. Up to 2562 conditions per place. [2024-02-05 10:52:04,072 INFO L140 encePairwiseOnDemand]: 88/102 looper letters, 161 selfloop transitions, 27 changer transitions 0/225 dead transitions. [2024-02-05 10:52:04,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 225 transitions, 2151 flow [2024-02-05 10:52:04,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-05 10:52:04,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-05 10:52:04,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 376 transitions. [2024-02-05 10:52:04,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6143790849673203 [2024-02-05 10:52:04,074 INFO L175 Difference]: Start difference. First operand has 138 places, 144 transitions, 1368 flow. Second operand 6 states and 376 transitions. [2024-02-05 10:52:04,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 225 transitions, 2151 flow [2024-02-05 10:52:04,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 225 transitions, 2094 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-02-05 10:52:04,107 INFO L231 Difference]: Finished difference. Result has 141 places, 153 transitions, 1493 flow [2024-02-05 10:52:04,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=1318, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1493, PETRI_PLACES=141, PETRI_TRANSITIONS=153} [2024-02-05 10:52:04,107 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 46 predicate places. [2024-02-05 10:52:04,107 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 153 transitions, 1493 flow [2024-02-05 10:52:04,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 47.833333333333336) internal successors, (287), 6 states have internal predecessors, (287), 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-05 10:52:04,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:52:04,112 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:52:04,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-02-05 10:52:04,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:52:04,326 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:52:04,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:52:04,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1116442793, now seen corresponding path program 2 times [2024-02-05 10:52:04,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:52:04,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235368325] [2024-02-05 10:52:04,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:52:04,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:52:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:52:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-05 10:52:04,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:52:04,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235368325] [2024-02-05 10:52:04,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235368325] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:52:04,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560124220] [2024-02-05 10:52:04,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-05 10:52:04,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:52:04,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:52:04,488 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:52:04,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-02-05 10:52:04,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-02-05 10:52:04,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-05 10:52:04,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-05 10:52:04,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:52:04,709 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-02-05 10:52:04,709 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-05 10:52:04,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560124220] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:52:04,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-05 10:52:04,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-02-05 10:52:04,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677443829] [2024-02-05 10:52:04,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:52:04,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-05 10:52:04,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:52:04,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-05 10:52:04,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-02-05 10:52:04,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 102 [2024-02-05 10:52:04,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 153 transitions, 1493 flow. Second operand has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 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-05 10:52:04,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:52:04,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 102 [2024-02-05 10:52:04,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:52:05,044 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L879-1-->L879-4: Formula: (let ((.cse0 (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|))) (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store .cse0 |v_~#m~0.offset_25| 1))) (= |v_thread1Thread1of1ForFork0_#t~nondet4_1| 0) (= (select .cse0 |v_~#m~0.offset_25|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{thread1Thread1of1ForFork0_#t~nondet4=|v_thread1Thread1of1ForFork0_#t~nondet4_1|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet4, #pthreadsMutex][20], [Black: 1072#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 111#(and (= thread1Thread1of1ForFork0_~arg.offset 0) (= |thread1Thread1of1ForFork0_#in~arg.base| 0) (= thread1Thread1of1ForFork0_~arg.base 0) (= |thread1Thread1of1ForFork0_#in~arg.offset| 0)), Black: 126#true, Black: 302#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 645#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 136#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 531#(and (or (and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0)) (= thread2Thread1of1ForFork1_~j~0 0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 1057#(and (<= thread1Thread1of1ForFork0_~i~0 2) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), Black: 395#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), 54#L879-4true, Black: 394#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 401#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), Black: 654#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 1074#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 794#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 653#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 407#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 405#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 121#(and (= |thread2Thread1of1ForFork1_#in~arg.base| 0) (= |thread2Thread1of1ForFork1_#in~arg.offset| 0) (= thread2Thread1of1ForFork1_~arg.base 0) (= thread2Thread1of1ForFork1_~arg.offset 0)), Black: 793#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 898#(and (<= 0 thread2Thread1of1ForFork1_~j~0) (= ~num~0 0) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 221#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0)), 37#L895-4true, Black: 290#(and (<= thread1Thread1of1ForFork0_~i~0 2) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), 655#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 104#(and (= ~total~0 0) (= ~flag~0 0) (= ~num~0 0)), 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 1053#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), 1395#true, Black: 1046#(= ~num~0 0), Black: 1222#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 1221#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 141#(= ~num~0 0), 1220#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 135#(= ~num~0 0), 64#L914-4true, 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 1073#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296)))]) [2024-02-05 10:52:05,045 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is not cut-off event [2024-02-05 10:52:05,045 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is not cut-off event [2024-02-05 10:52:05,045 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is not cut-off event [2024-02-05 10:52:05,045 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is not cut-off event [2024-02-05 10:52:05,050 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L879-1-->L879-4: Formula: (let ((.cse0 (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|))) (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store .cse0 |v_~#m~0.offset_25| 1))) (= |v_thread1Thread1of1ForFork0_#t~nondet4_1| 0) (= (select .cse0 |v_~#m~0.offset_25|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{thread1Thread1of1ForFork0_#t~nondet4=|v_thread1Thread1of1ForFork0_#t~nondet4_1|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet4, #pthreadsMutex][20], [Black: 1072#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 111#(and (= thread1Thread1of1ForFork0_~arg.offset 0) (= |thread1Thread1of1ForFork0_#in~arg.base| 0) (= thread1Thread1of1ForFork0_~arg.base 0) (= |thread1Thread1of1ForFork0_#in~arg.offset| 0)), Black: 126#true, Black: 302#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 645#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 136#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 531#(and (or (and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0)) (= thread2Thread1of1ForFork1_~j~0 0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 1057#(and (<= thread1Thread1of1ForFork0_~i~0 2) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), Black: 395#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), 54#L879-4true, Black: 394#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 401#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), 1074#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 654#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 794#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 653#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 407#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 405#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 19#L915-1true, 121#(and (= |thread2Thread1of1ForFork1_#in~arg.base| 0) (= |thread2Thread1of1ForFork1_#in~arg.offset| 0) (= thread2Thread1of1ForFork1_~arg.base 0) (= thread2Thread1of1ForFork1_~arg.offset 0)), Black: 793#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 898#(and (<= 0 thread2Thread1of1ForFork1_~j~0) (= ~num~0 0) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 221#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0)), 37#L895-4true, Black: 290#(and (<= thread1Thread1of1ForFork0_~i~0 2) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), 655#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 104#(and (= ~total~0 0) (= ~flag~0 0) (= ~num~0 0)), 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 1053#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), 1395#true, Black: 1046#(= ~num~0 0), Black: 1222#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 1221#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 141#(= ~num~0 0), 1220#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 135#(= ~num~0 0), 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 1073#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296)))]) [2024-02-05 10:52:05,050 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is not cut-off event [2024-02-05 10:52:05,050 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2024-02-05 10:52:05,050 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2024-02-05 10:52:05,050 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2024-02-05 10:52:05,657 INFO L124 PetriNetUnfolderBase]: 3017/7212 cut-off events. [2024-02-05 10:52:05,658 INFO L125 PetriNetUnfolderBase]: For 28460/28864 co-relation queries the response was YES. [2024-02-05 10:52:05,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25084 conditions, 7212 events. 3017/7212 cut-off events. For 28460/28864 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 47880 event pairs, 1072 based on Foata normal form. 156/7242 useless extension candidates. Maximal degree in co-relation 24717. Up to 2653 conditions per place. [2024-02-05 10:52:05,688 INFO L140 encePairwiseOnDemand]: 89/102 looper letters, 130 selfloop transitions, 45 changer transitions 0/217 dead transitions. [2024-02-05 10:52:05,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 217 transitions, 2164 flow [2024-02-05 10:52:05,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-05 10:52:05,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-05 10:52:05,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 316 transitions. [2024-02-05 10:52:05,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6196078431372549 [2024-02-05 10:52:05,690 INFO L175 Difference]: Start difference. First operand has 141 places, 153 transitions, 1493 flow. Second operand 5 states and 316 transitions. [2024-02-05 10:52:05,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 217 transitions, 2164 flow [2024-02-05 10:52:05,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 217 transitions, 2125 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-02-05 10:52:05,739 INFO L231 Difference]: Finished difference. Result has 145 places, 163 transitions, 1674 flow [2024-02-05 10:52:05,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1674, PETRI_PLACES=145, PETRI_TRANSITIONS=163} [2024-02-05 10:52:05,739 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 50 predicate places. [2024-02-05 10:52:05,740 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 163 transitions, 1674 flow [2024-02-05 10:52:05,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 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-05 10:52:05,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:52:05,740 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:52:05,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-02-05 10:52:05,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:52:05,940 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:52:05,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:52:05,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2067823209, now seen corresponding path program 3 times [2024-02-05 10:52:05,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:52:05,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796278481] [2024-02-05 10:52:05,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:52:05,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:52:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:52:06,105 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:52:06,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:52:06,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796278481] [2024-02-05 10:52:06,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796278481] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:52:06,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815837768] [2024-02-05 10:52:06,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-05 10:52:06,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:52:06,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:52:06,108 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:52:06,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-02-05 10:52:06,255 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-02-05 10:52:06,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-05 10:52:06,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-05 10:52:06,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:52:06,347 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-02-05 10:52:06,347 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-05 10:52:06,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815837768] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:52:06,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-05 10:52:06,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-02-05 10:52:06,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442783483] [2024-02-05 10:52:06,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:52:06,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-05 10:52:06,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:52:06,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-05 10:52:06,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-02-05 10:52:06,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 102 [2024-02-05 10:52:06,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 163 transitions, 1674 flow. Second operand has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 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-05 10:52:06,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:52:06,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 102 [2024-02-05 10:52:06,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:52:06,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L879-1-->L879-4: Formula: (let ((.cse0 (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|))) (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store .cse0 |v_~#m~0.offset_25| 1))) (= |v_thread1Thread1of1ForFork0_#t~nondet4_1| 0) (= (select .cse0 |v_~#m~0.offset_25|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{thread1Thread1of1ForFork0_#t~nondet4=|v_thread1Thread1of1ForFork0_#t~nondet4_1|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet4, #pthreadsMutex][26], [Black: 1072#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 111#(and (= thread1Thread1of1ForFork0_~arg.offset 0) (= |thread1Thread1of1ForFork0_#in~arg.base| 0) (= thread1Thread1of1ForFork0_~arg.base 0) (= |thread1Thread1of1ForFork0_#in~arg.offset| 0)), Black: 126#true, Black: 302#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 645#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 531#(and (or (and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0)) (= thread2Thread1of1ForFork1_~j~0 0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 136#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), 1057#(and (<= thread1Thread1of1ForFork0_~i~0 2) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), Black: 395#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), 54#L879-4true, Black: 394#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 401#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), 1074#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 654#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 794#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 653#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 407#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 405#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 1735#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= 1 thread2Thread1of1ForFork1_~j~0) (<= thread2Thread1of1ForFork1_~j~0 2))) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 121#(and (= |thread2Thread1of1ForFork1_#in~arg.base| 0) (= |thread2Thread1of1ForFork1_#in~arg.offset| 0) (= thread2Thread1of1ForFork1_~arg.base 0) (= thread2Thread1of1ForFork1_~arg.offset 0)), Black: 793#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 898#(and (<= 0 thread2Thread1of1ForFork1_~j~0) (= ~num~0 0) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 221#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0)), Black: 1548#(= ~num~0 1), 37#L895-4true, Black: 290#(and (<= thread1Thread1of1ForFork0_~i~0 2) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), Black: 1565#(and (= ~num~0 1) (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= 1 thread2Thread1of1ForFork1_~j~0) (<= thread2Thread1of1ForFork1_~j~0 2))) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 1555#(and (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 655#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 104#(and (= ~total~0 0) (= ~flag~0 0) (= ~num~0 0)), 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 1053#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), 1395#true, Black: 1046#(= ~num~0 0), Black: 1222#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 1221#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 141#(= ~num~0 0), 1220#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 135#(= ~num~0 0), 64#L914-4true, 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 1073#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296)))]) [2024-02-05 10:52:06,741 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is not cut-off event [2024-02-05 10:52:06,741 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is not cut-off event [2024-02-05 10:52:06,741 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is not cut-off event [2024-02-05 10:52:06,741 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is not cut-off event [2024-02-05 10:52:06,746 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L879-1-->L879-4: Formula: (let ((.cse0 (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|))) (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store .cse0 |v_~#m~0.offset_25| 1))) (= |v_thread1Thread1of1ForFork0_#t~nondet4_1| 0) (= (select .cse0 |v_~#m~0.offset_25|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{thread1Thread1of1ForFork0_#t~nondet4=|v_thread1Thread1of1ForFork0_#t~nondet4_1|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet4, #pthreadsMutex][26], [Black: 1072#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 111#(and (= thread1Thread1of1ForFork0_~arg.offset 0) (= |thread1Thread1of1ForFork0_#in~arg.base| 0) (= thread1Thread1of1ForFork0_~arg.base 0) (= |thread1Thread1of1ForFork0_#in~arg.offset| 0)), Black: 126#true, Black: 302#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 645#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 531#(and (or (and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0)) (= thread2Thread1of1ForFork1_~j~0 0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 136#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), 1057#(and (<= thread1Thread1of1ForFork0_~i~0 2) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), Black: 395#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), 54#L879-4true, Black: 394#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 401#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), Black: 654#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 1074#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 794#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 653#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 407#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 405#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 19#L915-1true, 1735#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= 1 thread2Thread1of1ForFork1_~j~0) (<= thread2Thread1of1ForFork1_~j~0 2))) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 121#(and (= |thread2Thread1of1ForFork1_#in~arg.base| 0) (= |thread2Thread1of1ForFork1_#in~arg.offset| 0) (= thread2Thread1of1ForFork1_~arg.base 0) (= thread2Thread1of1ForFork1_~arg.offset 0)), Black: 793#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 898#(and (<= 0 thread2Thread1of1ForFork1_~j~0) (= ~num~0 0) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 221#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0)), Black: 1548#(= ~num~0 1), 37#L895-4true, Black: 290#(and (<= thread1Thread1of1ForFork0_~i~0 2) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), Black: 1565#(and (= ~num~0 1) (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= 1 thread2Thread1of1ForFork1_~j~0) (<= thread2Thread1of1ForFork1_~j~0 2))) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 1555#(and (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 655#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 104#(and (= ~total~0 0) (= ~flag~0 0) (= ~num~0 0)), 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 1395#true, Black: 1053#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), Black: 1046#(= ~num~0 0), Black: 1222#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 1221#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 141#(= ~num~0 0), 1220#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 135#(= ~num~0 0), 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 1073#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296)))]) [2024-02-05 10:52:06,746 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is not cut-off event [2024-02-05 10:52:06,746 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2024-02-05 10:52:06,746 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2024-02-05 10:52:06,746 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2024-02-05 10:52:07,399 INFO L124 PetriNetUnfolderBase]: 3040/7396 cut-off events. [2024-02-05 10:52:07,399 INFO L125 PetriNetUnfolderBase]: For 33804/34266 co-relation queries the response was YES. [2024-02-05 10:52:07,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27472 conditions, 7396 events. 3040/7396 cut-off events. For 33804/34266 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 49954 event pairs, 392 based on Foata normal form. 164/7419 useless extension candidates. Maximal degree in co-relation 27093. Up to 2164 conditions per place. [2024-02-05 10:52:07,447 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 134 selfloop transitions, 50 changer transitions 0/226 dead transitions. [2024-02-05 10:52:07,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 226 transitions, 2517 flow [2024-02-05 10:52:07,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-05 10:52:07,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-05 10:52:07,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 303 transitions. [2024-02-05 10:52:07,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5941176470588235 [2024-02-05 10:52:07,449 INFO L175 Difference]: Start difference. First operand has 145 places, 163 transitions, 1674 flow. Second operand 5 states and 303 transitions. [2024-02-05 10:52:07,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 226 transitions, 2517 flow [2024-02-05 10:52:07,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 226 transitions, 2400 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-02-05 10:52:07,600 INFO L231 Difference]: Finished difference. Result has 143 places, 175 transitions, 1870 flow [2024-02-05 10:52:07,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=1551, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1870, PETRI_PLACES=143, PETRI_TRANSITIONS=175} [2024-02-05 10:52:07,601 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 48 predicate places. [2024-02-05 10:52:07,601 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 175 transitions, 1870 flow [2024-02-05 10:52:07,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 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-05 10:52:07,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:52:07,601 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:52:07,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-02-05 10:52:07,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-02-05 10:52:07,803 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:52:07,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:52:07,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1615796025, now seen corresponding path program 1 times [2024-02-05 10:52:07,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:52:07,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239164864] [2024-02-05 10:52:07,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:52:07,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:52:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:52:08,031 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-05 10:52:08,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:52:08,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239164864] [2024-02-05 10:52:08,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239164864] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:52:08,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690330837] [2024-02-05 10:52:08,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:52:08,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:52:08,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:52:08,036 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:52:08,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-02-05 10:52:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:52:08,203 INFO L262 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-05 10:52:08,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:52:08,398 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-05 10:52:08,398 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-05 10:52:08,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690330837] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:52:08,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-05 10:52:08,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2024-02-05 10:52:08,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907127391] [2024-02-05 10:52:08,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:52:08,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-05 10:52:08,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:52:08,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-05 10:52:08,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-02-05 10:52:08,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 102 [2024-02-05 10:52:08,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 175 transitions, 1870 flow. Second operand has 7 states, 7 states have (on average 43.42857142857143) internal successors, (304), 7 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:52:08,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:52:08,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 102 [2024-02-05 10:52:08,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:52:08,967 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L879-1-->L879-4: Formula: (let ((.cse0 (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|))) (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store .cse0 |v_~#m~0.offset_25| 1))) (= |v_thread1Thread1of1ForFork0_#t~nondet4_1| 0) (= (select .cse0 |v_~#m~0.offset_25|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{thread1Thread1of1ForFork0_#t~nondet4=|v_thread1Thread1of1ForFork0_#t~nondet4_1|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet4, #pthreadsMutex][26], [Black: 1072#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 111#(and (= thread1Thread1of1ForFork0_~arg.offset 0) (= |thread1Thread1of1ForFork0_#in~arg.base| 0) (= thread1Thread1of1ForFork0_~arg.base 0) (= |thread1Thread1of1ForFork0_#in~arg.offset| 0)), Black: 126#true, Black: 302#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 645#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 531#(and (or (and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0)) (= thread2Thread1of1ForFork1_~j~0 0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 1057#(and (<= thread1Thread1of1ForFork0_~i~0 2) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), 54#L879-4true, Black: 394#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 654#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 1074#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 794#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 653#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 407#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 1725#(<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0), Black: 405#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 1735#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= 1 thread2Thread1of1ForFork1_~j~0) (<= thread2Thread1of1ForFork1_~j~0 2))) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 121#(and (= |thread2Thread1of1ForFork1_#in~arg.base| 0) (= |thread2Thread1of1ForFork1_#in~arg.offset| 0) (= thread2Thread1of1ForFork1_~arg.base 0) (= thread2Thread1of1ForFork1_~arg.offset 0)), Black: 793#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 221#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0)), Black: 1548#(= ~num~0 1), 37#L895-4true, Black: 290#(and (<= thread1Thread1of1ForFork0_~i~0 2) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), 1824#(and (<= 0 thread2Thread1of1ForFork1_~j~0) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 1555#(and (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 655#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 104#(and (= ~total~0 0) (= ~flag~0 0) (= ~num~0 0)), 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 1053#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), Black: 1046#(= ~num~0 0), Black: 1222#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 1221#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 141#(= ~num~0 0), 1220#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 135#(= ~num~0 0), 64#L914-4true, 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 1073#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296)))]) [2024-02-05 10:52:08,967 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is not cut-off event [2024-02-05 10:52:08,967 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is not cut-off event [2024-02-05 10:52:08,967 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is not cut-off event [2024-02-05 10:52:08,967 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is not cut-off event [2024-02-05 10:52:08,973 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L879-1-->L879-4: Formula: (let ((.cse0 (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|))) (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store .cse0 |v_~#m~0.offset_25| 1))) (= |v_thread1Thread1of1ForFork0_#t~nondet4_1| 0) (= (select .cse0 |v_~#m~0.offset_25|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{thread1Thread1of1ForFork0_#t~nondet4=|v_thread1Thread1of1ForFork0_#t~nondet4_1|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet4, #pthreadsMutex][26], [Black: 1072#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 111#(and (= thread1Thread1of1ForFork0_~arg.offset 0) (= |thread1Thread1of1ForFork0_#in~arg.base| 0) (= thread1Thread1of1ForFork0_~arg.base 0) (= |thread1Thread1of1ForFork0_#in~arg.offset| 0)), Black: 126#true, Black: 302#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 645#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 531#(and (or (and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0)) (= thread2Thread1of1ForFork1_~j~0 0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 1057#(and (<= thread1Thread1of1ForFork0_~i~0 2) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), 54#L879-4true, Black: 394#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 654#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 1074#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 794#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 653#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 1725#(<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0), Black: 407#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 405#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 19#L915-1true, 1735#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= 1 thread2Thread1of1ForFork1_~j~0) (<= thread2Thread1of1ForFork1_~j~0 2))) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 121#(and (= |thread2Thread1of1ForFork1_#in~arg.base| 0) (= |thread2Thread1of1ForFork1_#in~arg.offset| 0) (= thread2Thread1of1ForFork1_~arg.base 0) (= thread2Thread1of1ForFork1_~arg.offset 0)), Black: 793#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 221#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0)), 37#L895-4true, Black: 1548#(= ~num~0 1), Black: 290#(and (<= thread1Thread1of1ForFork0_~i~0 2) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), 1824#(and (<= 0 thread2Thread1of1ForFork1_~j~0) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 1555#(and (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 655#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 104#(and (= ~total~0 0) (= ~flag~0 0) (= ~num~0 0)), 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 1053#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), Black: 1046#(= ~num~0 0), Black: 1222#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 1221#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 141#(= ~num~0 0), 1220#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 135#(= ~num~0 0), 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 1073#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296)))]) [2024-02-05 10:52:08,973 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is not cut-off event [2024-02-05 10:52:08,973 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2024-02-05 10:52:08,973 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2024-02-05 10:52:08,973 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2024-02-05 10:52:09,819 INFO L124 PetriNetUnfolderBase]: 4703/10354 cut-off events. [2024-02-05 10:52:09,819 INFO L125 PetriNetUnfolderBase]: For 50685/51143 co-relation queries the response was YES. [2024-02-05 10:52:09,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41143 conditions, 10354 events. 4703/10354 cut-off events. For 50685/51143 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 70709 event pairs, 977 based on Foata normal form. 150/10300 useless extension candidates. Maximal degree in co-relation 40745. Up to 3181 conditions per place. [2024-02-05 10:52:09,885 INFO L140 encePairwiseOnDemand]: 89/102 looper letters, 193 selfloop transitions, 59 changer transitions 0/286 dead transitions. [2024-02-05 10:52:09,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 286 transitions, 3254 flow [2024-02-05 10:52:09,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-05 10:52:09,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-05 10:52:09,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 402 transitions. [2024-02-05 10:52:09,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5630252100840336 [2024-02-05 10:52:09,887 INFO L175 Difference]: Start difference. First operand has 143 places, 175 transitions, 1870 flow. Second operand 7 states and 402 transitions. [2024-02-05 10:52:09,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 286 transitions, 3254 flow [2024-02-05 10:52:09,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 286 transitions, 3224 flow, removed 14 selfloop flow, removed 1 redundant places. [2024-02-05 10:52:09,953 INFO L231 Difference]: Finished difference. Result has 151 places, 192 transitions, 2345 flow [2024-02-05 10:52:09,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=1860, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2345, PETRI_PLACES=151, PETRI_TRANSITIONS=192} [2024-02-05 10:52:09,954 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 56 predicate places. [2024-02-05 10:52:09,954 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 192 transitions, 2345 flow [2024-02-05 10:52:09,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.42857142857143) internal successors, (304), 7 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:52:09,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:52:09,954 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:52:09,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-02-05 10:52:10,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-02-05 10:52:10,156 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:52:10,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:52:10,156 INFO L85 PathProgramCache]: Analyzing trace with hash -187484203, now seen corresponding path program 2 times [2024-02-05 10:52:10,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:52:10,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689052998] [2024-02-05 10:52:10,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:52:10,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:52:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:52:10,374 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:52:10,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:52:10,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689052998] [2024-02-05 10:52:10,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689052998] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:52:10,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311597269] [2024-02-05 10:52:10,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-05 10:52:10,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:52:10,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:52:10,376 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:52:10,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-02-05 10:52:10,524 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-02-05 10:52:10,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-05 10:52:10,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-05 10:52:10,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:52:10,651 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-02-05 10:52:10,652 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-05 10:52:10,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311597269] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:52:10,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-05 10:52:10,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-02-05 10:52:10,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243910766] [2024-02-05 10:52:10,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:52:10,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:52:10,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:52:10,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:52:10,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-02-05 10:52:10,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 102 [2024-02-05 10:52:10,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 192 transitions, 2345 flow. Second operand has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 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-05 10:52:10,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:52:10,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 102 [2024-02-05 10:52:10,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:52:11,951 INFO L124 PetriNetUnfolderBase]: 4423/10343 cut-off events. [2024-02-05 10:52:11,951 INFO L125 PetriNetUnfolderBase]: For 62098/62622 co-relation queries the response was YES. [2024-02-05 10:52:11,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41875 conditions, 10343 events. 4423/10343 cut-off events. For 62098/62622 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 73436 event pairs, 873 based on Foata normal form. 258/10389 useless extension candidates. Maximal degree in co-relation 41467. Up to 2087 conditions per place. [2024-02-05 10:52:12,027 INFO L140 encePairwiseOnDemand]: 91/102 looper letters, 158 selfloop transitions, 72 changer transitions 0/272 dead transitions. [2024-02-05 10:52:12,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 272 transitions, 3387 flow [2024-02-05 10:52:12,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-05 10:52:12,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-05 10:52:12,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 344 transitions. [2024-02-05 10:52:12,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5620915032679739 [2024-02-05 10:52:12,028 INFO L175 Difference]: Start difference. First operand has 151 places, 192 transitions, 2345 flow. Second operand 6 states and 344 transitions. [2024-02-05 10:52:12,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 272 transitions, 3387 flow [2024-02-05 10:52:12,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 272 transitions, 3365 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-02-05 10:52:12,110 INFO L231 Difference]: Finished difference. Result has 155 places, 202 transitions, 2675 flow [2024-02-05 10:52:12,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=2314, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2675, PETRI_PLACES=155, PETRI_TRANSITIONS=202} [2024-02-05 10:52:12,110 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 60 predicate places. [2024-02-05 10:52:12,110 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 202 transitions, 2675 flow [2024-02-05 10:52:12,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 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-05 10:52:12,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:52:12,111 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:52:12,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-02-05 10:52:12,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-02-05 10:52:12,311 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:52:12,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:52:12,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1904732439, now seen corresponding path program 1 times [2024-02-05 10:52:12,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:52:12,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059081988] [2024-02-05 10:52:12,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:52:12,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:52:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:52:12,443 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-02-05 10:52:12,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:52:12,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059081988] [2024-02-05 10:52:12,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059081988] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:52:12,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:52:12,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-05 10:52:12,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10359741] [2024-02-05 10:52:12,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:52:12,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:52:12,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:52:12,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:52:12,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-02-05 10:52:12,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 102 [2024-02-05 10:52:12,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 202 transitions, 2675 flow. Second operand has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 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-05 10:52:12,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:52:12,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 102 [2024-02-05 10:52:12,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:52:13,730 INFO L124 PetriNetUnfolderBase]: 4034/9387 cut-off events. [2024-02-05 10:52:13,730 INFO L125 PetriNetUnfolderBase]: For 85015/85609 co-relation queries the response was YES. [2024-02-05 10:52:13,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39918 conditions, 9387 events. 4034/9387 cut-off events. For 85015/85609 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 65141 event pairs, 585 based on Foata normal form. 382/9491 useless extension candidates. Maximal degree in co-relation 39548. Up to 5018 conditions per place. [2024-02-05 10:52:13,798 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 188 selfloop transitions, 18 changer transitions 0/270 dead transitions. [2024-02-05 10:52:13,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 270 transitions, 3907 flow [2024-02-05 10:52:13,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-05 10:52:13,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-05 10:52:13,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 338 transitions. [2024-02-05 10:52:13,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6627450980392157 [2024-02-05 10:52:13,799 INFO L175 Difference]: Start difference. First operand has 155 places, 202 transitions, 2675 flow. Second operand 5 states and 338 transitions. [2024-02-05 10:52:13,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 270 transitions, 3907 flow [2024-02-05 10:52:13,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 270 transitions, 3903 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-05 10:52:13,873 INFO L231 Difference]: Finished difference. Result has 157 places, 200 transitions, 2692 flow [2024-02-05 10:52:13,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=2656, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2692, PETRI_PLACES=157, PETRI_TRANSITIONS=200} [2024-02-05 10:52:13,874 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 62 predicate places. [2024-02-05 10:52:13,874 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 200 transitions, 2692 flow [2024-02-05 10:52:13,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 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-05 10:52:13,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:52:13,874 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:52:13,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-02-05 10:52:13,875 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:52:13,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:52:13,875 INFO L85 PathProgramCache]: Analyzing trace with hash 797549030, now seen corresponding path program 1 times [2024-02-05 10:52:13,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:52:13,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882729798] [2024-02-05 10:52:13,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:52:13,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:52:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:52:14,015 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-02-05 10:52:14,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:52:14,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882729798] [2024-02-05 10:52:14,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882729798] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:52:14,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:52:14,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-05 10:52:14,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307728170] [2024-02-05 10:52:14,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:52:14,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:52:14,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:52:14,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:52:14,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-02-05 10:52:14,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 102 [2024-02-05 10:52:14,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 200 transitions, 2692 flow. Second operand has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 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-05 10:52:14,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:52:14,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 102 [2024-02-05 10:52:14,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:52:14,465 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L879-1-->L879-4: Formula: (let ((.cse0 (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|))) (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store .cse0 |v_~#m~0.offset_25| 1))) (= |v_thread1Thread1of1ForFork0_#t~nondet4_1| 0) (= (select .cse0 |v_~#m~0.offset_25|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{thread1Thread1of1ForFork0_#t~nondet4=|v_thread1Thread1of1ForFork0_#t~nondet4_1|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet4, #pthreadsMutex][26], [Black: 1072#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 111#(and (= thread1Thread1of1ForFork0_~arg.offset 0) (= |thread1Thread1of1ForFork0_#in~arg.base| 0) (= thread1Thread1of1ForFork0_~arg.base 0) (= |thread1Thread1of1ForFork0_#in~arg.offset| 0)), Black: 126#true, Black: 302#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 645#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 531#(and (or (and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0)) (= thread2Thread1of1ForFork1_~j~0 0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 1057#(and (<= thread1Thread1of1ForFork0_~i~0 2) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), Black: 394#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 54#L879-4true, 2142#(and (<= thread1Thread1of1ForFork0_~i~0 2) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 2148#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (<= thread2Thread1of1ForFork1_~j~0 2)), 1074#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 654#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 794#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 653#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 2136#(and (= ~num~0 0) (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= 1 thread2Thread1of1ForFork1_~j~0) (<= thread2Thread1of1ForFork1_~j~0 2))) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 1909#(and (<= 0 thread2Thread1of1ForFork1_~j~0) (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 1758#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), Black: 1725#(<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0), Black: 1760#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 2110#(and (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 405#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 2097#(<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0), 1735#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= 1 thread2Thread1of1ForFork1_~j~0) (<= thread2Thread1of1ForFork1_~j~0 2))) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 121#(and (= |thread2Thread1of1ForFork1_#in~arg.base| 0) (= |thread2Thread1of1ForFork1_#in~arg.offset| 0) (= thread2Thread1of1ForFork1_~arg.base 0) (= thread2Thread1of1ForFork1_~arg.offset 0)), Black: 793#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 221#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0)), 37#L895-4true, Black: 1548#(= ~num~0 1), Black: 290#(and (<= thread1Thread1of1ForFork0_~i~0 2) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), 1824#(and (<= 0 thread2Thread1of1ForFork1_~j~0) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 1555#(and (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 655#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 104#(and (= ~total~0 0) (= ~flag~0 0) (= ~num~0 0)), 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 1053#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), Black: 1046#(= ~num~0 0), Black: 1222#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 1221#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 141#(= ~num~0 0), 1220#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 135#(= ~num~0 0), 64#L914-4true, 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 1073#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296)))]) [2024-02-05 10:52:14,466 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is not cut-off event [2024-02-05 10:52:14,466 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is not cut-off event [2024-02-05 10:52:14,466 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is not cut-off event [2024-02-05 10:52:14,466 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is not cut-off event [2024-02-05 10:52:14,471 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L879-1-->L879-4: Formula: (let ((.cse0 (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|))) (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store .cse0 |v_~#m~0.offset_25| 1))) (= |v_thread1Thread1of1ForFork0_#t~nondet4_1| 0) (= (select .cse0 |v_~#m~0.offset_25|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{thread1Thread1of1ForFork0_#t~nondet4=|v_thread1Thread1of1ForFork0_#t~nondet4_1|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet4, #pthreadsMutex][26], [Black: 1072#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 111#(and (= thread1Thread1of1ForFork0_~arg.offset 0) (= |thread1Thread1of1ForFork0_#in~arg.base| 0) (= thread1Thread1of1ForFork0_~arg.base 0) (= |thread1Thread1of1ForFork0_#in~arg.offset| 0)), Black: 126#true, Black: 302#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 645#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 531#(and (or (and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0)) (= thread2Thread1of1ForFork1_~j~0 0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 1057#(and (<= thread1Thread1of1ForFork0_~i~0 2) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), Black: 394#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 54#L879-4true, 2142#(and (<= thread1Thread1of1ForFork0_~i~0 2) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 2148#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 654#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 1074#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 794#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 653#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 2136#(and (= ~num~0 0) (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= 1 thread2Thread1of1ForFork1_~j~0) (<= thread2Thread1of1ForFork1_~j~0 2))) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 1909#(and (<= 0 thread2Thread1of1ForFork1_~j~0) (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 1758#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), Black: 1725#(<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0), Black: 1760#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 2110#(and (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 405#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 2097#(<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0), 19#L915-1true, 1735#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= 1 thread2Thread1of1ForFork1_~j~0) (<= thread2Thread1of1ForFork1_~j~0 2))) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 121#(and (= |thread2Thread1of1ForFork1_#in~arg.base| 0) (= |thread2Thread1of1ForFork1_#in~arg.offset| 0) (= thread2Thread1of1ForFork1_~arg.base 0) (= thread2Thread1of1ForFork1_~arg.offset 0)), Black: 793#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 221#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0)), Black: 1548#(= ~num~0 1), 37#L895-4true, Black: 290#(and (<= thread1Thread1of1ForFork0_~i~0 2) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), 1824#(and (<= 0 thread2Thread1of1ForFork1_~j~0) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 1555#(and (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 655#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 104#(and (= ~total~0 0) (= ~flag~0 0) (= ~num~0 0)), 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 1053#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), Black: 1046#(= ~num~0 0), Black: 1222#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 1221#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 141#(= ~num~0 0), 1220#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 135#(= ~num~0 0), 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 1073#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296)))]) [2024-02-05 10:52:14,471 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is not cut-off event [2024-02-05 10:52:14,471 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2024-02-05 10:52:14,471 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2024-02-05 10:52:14,471 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2024-02-05 10:52:15,251 INFO L124 PetriNetUnfolderBase]: 3756/8996 cut-off events. [2024-02-05 10:52:15,251 INFO L125 PetriNetUnfolderBase]: For 71148/71723 co-relation queries the response was YES. [2024-02-05 10:52:15,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38501 conditions, 8996 events. 3756/8996 cut-off events. For 71148/71723 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 64194 event pairs, 691 based on Foata normal form. 383/9103 useless extension candidates. Maximal degree in co-relation 38103. Up to 4630 conditions per place. [2024-02-05 10:52:15,312 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 158 selfloop transitions, 26 changer transitions 0/238 dead transitions. [2024-02-05 10:52:15,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 238 transitions, 3410 flow [2024-02-05 10:52:15,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-05 10:52:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-05 10:52:15,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 325 transitions. [2024-02-05 10:52:15,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6372549019607843 [2024-02-05 10:52:15,314 INFO L175 Difference]: Start difference. First operand has 157 places, 200 transitions, 2692 flow. Second operand 5 states and 325 transitions. [2024-02-05 10:52:15,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 238 transitions, 3410 flow [2024-02-05 10:52:15,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 238 transitions, 3340 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-02-05 10:52:15,399 INFO L231 Difference]: Finished difference. Result has 154 places, 197 transitions, 2686 flow [2024-02-05 10:52:15,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=2634, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2686, PETRI_PLACES=154, PETRI_TRANSITIONS=197} [2024-02-05 10:52:15,399 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 59 predicate places. [2024-02-05 10:52:15,399 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 197 transitions, 2686 flow [2024-02-05 10:52:15,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 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-05 10:52:15,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:52:15,400 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:52:15,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-02-05 10:52:15,400 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:52:15,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:52:15,401 INFO L85 PathProgramCache]: Analyzing trace with hash 990134852, now seen corresponding path program 1 times [2024-02-05 10:52:15,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:52:15,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796341620] [2024-02-05 10:52:15,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:52:15,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:52:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-05 10:52:15,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-05 10:52:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-05 10:52:15,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-05 10:52:15,495 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-05 10:52:15,495 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (54 of 55 remaining) [2024-02-05 10:52:15,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 55 remaining) [2024-02-05 10:52:15,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 55 remaining) [2024-02-05 10:52:15,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 55 remaining) [2024-02-05 10:52:15,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 55 remaining) [2024-02-05 10:52:15,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 55 remaining) [2024-02-05 10:52:15,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 55 remaining) [2024-02-05 10:52:15,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 55 remaining) [2024-02-05 10:52:15,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 55 remaining) [2024-02-05 10:52:15,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 55 remaining) [2024-02-05 10:52:15,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 55 remaining) [2024-02-05 10:52:15,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 55 remaining) [2024-02-05 10:52:15,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 55 remaining) [2024-02-05 10:52:15,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 55 remaining) [2024-02-05 10:52:15,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 55 remaining) [2024-02-05 10:52:15,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 55 remaining) [2024-02-05 10:52:15,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 55 remaining) [2024-02-05 10:52:15,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 55 remaining) [2024-02-05 10:52:15,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 55 remaining) [2024-02-05 10:52:15,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 55 remaining) [2024-02-05 10:52:15,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 55 remaining) [2024-02-05 10:52:15,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 55 remaining) [2024-02-05 10:52:15,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 55 remaining) [2024-02-05 10:52:15,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 55 remaining) [2024-02-05 10:52:15,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 55 remaining) [2024-02-05 10:52:15,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 55 remaining) [2024-02-05 10:52:15,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 55 remaining) [2024-02-05 10:52:15,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 55 remaining) [2024-02-05 10:52:15,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 55 remaining) [2024-02-05 10:52:15,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 55 remaining) [2024-02-05 10:52:15,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 55 remaining) [2024-02-05 10:52:15,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 55 remaining) [2024-02-05 10:52:15,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 55 remaining) [2024-02-05 10:52:15,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 55 remaining) [2024-02-05 10:52:15,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 55 remaining) [2024-02-05 10:52:15,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 55 remaining) [2024-02-05 10:52:15,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 55 remaining) [2024-02-05 10:52:15,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 55 remaining) [2024-02-05 10:52:15,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 55 remaining) [2024-02-05 10:52:15,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 55 remaining) [2024-02-05 10:52:15,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 55 remaining) [2024-02-05 10:52:15,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 55 remaining) [2024-02-05 10:52:15,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 55 remaining) [2024-02-05 10:52:15,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 55 remaining) [2024-02-05 10:52:15,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 55 remaining) [2024-02-05 10:52:15,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 55 remaining) [2024-02-05 10:52:15,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 55 remaining) [2024-02-05 10:52:15,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 55 remaining) [2024-02-05 10:52:15,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 55 remaining) [2024-02-05 10:52:15,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 55 remaining) [2024-02-05 10:52:15,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 55 remaining) [2024-02-05 10:52:15,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 55 remaining) [2024-02-05 10:52:15,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 55 remaining) [2024-02-05 10:52:15,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 55 remaining) [2024-02-05 10:52:15,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 55 remaining) [2024-02-05 10:52:15,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-02-05 10:52:15,506 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:52:15,511 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-05 10:52:15,512 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-05 10:52:15,615 INFO L503 ceAbstractionStarter]: Automizer considered 29 witness invariants [2024-02-05 10:52:15,616 INFO L504 ceAbstractionStarter]: WitnessConsidered=29 [2024-02-05 10:52:15,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:52:15 BasicIcfg [2024-02-05 10:52:15,616 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-05 10:52:15,617 INFO L158 Benchmark]: Toolchain (without parser) took 34447.15ms. Allocated memory was 151.0MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 91.8MB in the beginning and 1.0GB in the end (delta: -913.6MB). Peak memory consumption was 601.8MB. Max. memory is 16.1GB. [2024-02-05 10:52:15,617 INFO L158 Benchmark]: Witness Parser took 0.19ms. Allocated memory is still 151.0MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-05 10:52:15,617 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 151.0MB. Free memory is still 111.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-05 10:52:15,618 INFO L158 Benchmark]: CACSL2BoogieTranslator took 909.49ms. Allocated memory is still 151.0MB. Free memory was 91.8MB in the beginning and 43.6MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-02-05 10:52:15,618 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.27ms. Allocated memory is still 151.0MB. Free memory was 43.6MB in the beginning and 118.4MB in the end (delta: -74.8MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-02-05 10:52:15,618 INFO L158 Benchmark]: Boogie Preprocessor took 112.76ms. Allocated memory is still 151.0MB. Free memory was 118.4MB in the beginning and 114.2MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-05 10:52:15,618 INFO L158 Benchmark]: RCFGBuilder took 811.03ms. Allocated memory is still 151.0MB. Free memory was 114.2MB in the beginning and 50.0MB in the end (delta: 64.2MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-02-05 10:52:15,619 INFO L158 Benchmark]: TraceAbstraction took 32502.81ms. Allocated memory was 151.0MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 50.0MB in the beginning and 1.0GB in the end (delta: -955.4MB). Peak memory consumption was 559.5MB. Max. memory is 16.1GB. [2024-02-05 10:52:15,620 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.19ms. Allocated memory is still 151.0MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.10ms. Allocated memory is still 151.0MB. Free memory is still 111.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 909.49ms. Allocated memory is still 151.0MB. Free memory was 91.8MB in the beginning and 43.6MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.27ms. Allocated memory is still 151.0MB. Free memory was 43.6MB in the beginning and 118.4MB in the end (delta: -74.8MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 112.76ms. Allocated memory is still 151.0MB. Free memory was 118.4MB in the beginning and 114.2MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 811.03ms. Allocated memory is still 151.0MB. Free memory was 114.2MB in the beginning and 50.0MB in the end (delta: 64.2MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * TraceAbstraction took 32502.81ms. Allocated memory was 151.0MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 50.0MB in the beginning and 1.0GB in the end (delta: -955.4MB). Peak memory consumption was 559.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 919]: a call to reach_error is reachable a call to reach_error is reachable 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] [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6: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}, 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}, 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}, 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}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L915] 0 \read(t1) VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L890] 2 int j; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L891] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L891] 2 j = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, total=0] [L892] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[3]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, total=0] [L892] COND TRUE 2 j < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, total=0] [L893] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=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}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, total=0] [L882] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,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]]]]]]] [L882] 1 num++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=1, total=0] [L883] 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[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]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=1, total=0] [L894] 2 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[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=1, total=0] [L884] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,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]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=1, total=0] [L896] 2 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[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] [L896] 2 total = total + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=1, total=0] [L897] 2 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[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] [L897] 2 num-- VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, total=0] [L898] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, total=0] [L899] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, total=0] [L885] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,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]]]]]]] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=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}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=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}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=0, total=0] [L900] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] [L900] 2 j++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=0] [L892] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[3]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, 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}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=0] [L892] COND TRUE 2 j < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=0] [L882] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,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]]]]]]] [L882] 1 num++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=1, total=0] [L883] 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[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]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=1, total=0] [L893] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=1, total=0] [L894] 2 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[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=1, total=0] [L896] 2 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[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] [L896] 2 total = total + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=1, total=1] [L884] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,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]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=1, total=1] [L897] 2 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[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] [L897] 2 num-- VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=1] [L898] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=1] [L899] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=1] [L885] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,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]]]]]]] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=0, total=1] [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}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=0, total=1] [L878] COND TRUE 1 i < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=0, total=1] [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}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=0, total=1] [L900] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] [L900] 2 j++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [L892] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[3]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [L892] COND TRUE 2 j < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [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}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [L882] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,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]]]]]]] [L882] 1 num++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=1, total=1] [L883] 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[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]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=1, total=1] [L893] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=1, total=1] [L894] 2 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[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=1, total=1] [L894] COND FALSE 2 !(num == 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=1, total=1] [L896] 2 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[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] [L896] 2 total = total + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=1, total=3] [L884] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,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]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=1, total=3] [L897] 2 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[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] [L897] 2 num-- VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=3] [L898] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=3] [L899] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=3] [L885] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,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]]]]]]] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=0, total=3] [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}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=0, total=3] [L878] COND FALSE 1 !(i < 3) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=0, total=3] [L887] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L887] 1 return ((void *)0); [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=3] [L916] 0 \read(t2) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=0, total=3] [L900] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] [L900] 2 j++ VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=3] [L892] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[3]]]]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=3] [L892] COND FALSE 2 !(j < 3) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=3] [L902] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[3]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L902] 2 total = total + j VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=6] [L903] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[3]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L903] 2 flag = 1 VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, total=6] [L904] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[3]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L904] 2 return ((void *)0); [L916] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] [L917] COND TRUE 0 \read(flag) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] [L919] 0 reach_error() VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] - 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: 887]: 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: 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: 881]: 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: 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: 902]: 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: 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: 896]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 895]: 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: 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: 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, 161 locations, 55 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: 32.2s, OverallIterations: 27, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 21.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4103 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3048 mSDsluCounter, 817 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 422 mSDsCounter, 476 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6811 IncrementalHoareTripleChecker+Invalid, 7287 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 476 mSolverCounterUnsat, 395 mSDtfsCounter, 6811 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 721 GetRequests, 606 SyntacticMatches, 8 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2692occurred in iteration=25, InterpolantAutomatonStates: 127, 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.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1638 NumberOfCodeBlocks, 1554 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1550 ConstructedInterpolants, 0 QuantifiedInterpolants, 14086 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3908 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 40 InterpolantComputations, 24 PerfectInterpolantSequences, 295/385 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-05 10:52:15,650 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