./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_ok.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_ok.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_ok.i ./goblint.2024-01-24_13-31-21.files/SV-COMP24_unreach-call/arithmetic_prog_ok.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:37:11,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-05 10:37:11,170 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-05 10:37:11,185 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-05 10:37:11,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-05 10:37:11,212 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-05 10:37:11,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-05 10:37:11,213 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-05 10:37:11,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-05 10:37:11,216 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-05 10:37:11,216 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-05 10:37:11,217 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-05 10:37:11,218 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-05 10:37:11,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-05 10:37:11,219 INFO L153 SettingsManager]: * Use SBE=true [2024-02-05 10:37:11,219 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-05 10:37:11,219 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-05 10:37:11,219 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-05 10:37:11,220 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-05 10:37:11,220 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-05 10:37:11,221 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-05 10:37:11,221 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-05 10:37:11,221 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-05 10:37:11,221 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-05 10:37:11,222 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-05 10:37:11,222 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-05 10:37:11,222 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-05 10:37:11,222 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-05 10:37:11,223 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-05 10:37:11,223 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-05 10:37:11,224 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-05 10:37:11,224 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-05 10:37:11,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-05 10:37:11,224 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-05 10:37:11,224 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-05 10:37:11,224 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-05 10:37:11,225 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-05 10:37:11,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-05 10:37:11,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-05 10:37:11,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-05 10:37:11,225 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-05 10:37:11,225 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-05 10:37:11,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-05 10:37:11,226 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:37:11,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-05 10:37:11,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-05 10:37:11,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-05 10:37:11,464 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-05 10:37:11,464 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-05 10:37:11,465 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_ok.yml/witness.yml [2024-02-05 10:37:11,566 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-05 10:37:11,567 INFO L274 PluginConnector]: CDTParser initialized [2024-02-05 10:37:11,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_ok.i [2024-02-05 10:37:12,528 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-05 10:37:12,770 INFO L384 CDTParser]: Found 1 translation units. [2024-02-05 10:37:12,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_ok.i [2024-02-05 10:37:12,785 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71e4a6541/5af0ce88e2e64345b46344c849d78cbb/FLAG30549e294 [2024-02-05 10:37:12,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71e4a6541/5af0ce88e2e64345b46344c849d78cbb [2024-02-05 10:37:12,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-05 10:37:12,798 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-05 10:37:12,801 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-05 10:37:12,801 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-05 10:37:12,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-05 10:37:12,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 05.02 10:37:11" (1/2) ... [2024-02-05 10:37:12,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67659706 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:37:12, skipping insertion in model container [2024-02-05 10:37:12,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 05.02 10:37:11" (1/2) ... [2024-02-05 10:37:12,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7b10c4cf and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:37:12, skipping insertion in model container [2024-02-05 10:37:12,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:37:12" (2/2) ... [2024-02-05 10:37:12,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67659706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:37:12, skipping insertion in model container [2024-02-05 10:37:12,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:37:12" (2/2) ... [2024-02-05 10:37:12,810 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-05 10:37:12,902 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-05 10:37:12,903 INFO L101 nessWitnessExtractor]: Location invariant before [L895-L895] ((num == 0) && ((unsigned long )arg == 0UL)) && ((((((((((((((((((((((((((((((((((((((((((((((((((((0 == j && j == 0) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (1 <= j && j <= 3)) || (1 <= j && j <= 3)) || (1 <= j && j <= 3)) || (1 <= j && j <= 3)) || (1 <= j && j <= 3)) || (1 <= j && j <= 3)) || (1 <= j && j <= 3)) || (1 <= j && j <= 3)) || (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 <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) [2024-02-05 10:37:12,903 INFO L101 nessWitnessExtractor]: Location invariant before [L899-L899] ((unsigned long )arg == 0UL) && ((0 == j && j == 0) || (1 <= j && j <= 3)) [2024-02-05 10:37:12,904 INFO L101 nessWitnessExtractor]: Location invariant before [L881-L881] ((num == 1) && ((unsigned long )arg == 0UL)) && (((((((((((((((((((((((((((((((((((((((((((((((1 <= i && i <= 3) || (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 <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (1 <= i && i <= 3)) || (1 <= i && i <= 3)) [2024-02-05 10:37:12,904 INFO L101 nessWitnessExtractor]: Location invariant before [L909-L909] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-02-05 10:37:12,904 INFO L101 nessWitnessExtractor]: Location invariant before [L896-L896] ((num == 1) && ((unsigned long )arg == 0UL)) && ((0 == j && j == 0) || (1 <= j && j <= 3)) [2024-02-05 10:37:12,905 INFO L101 nessWitnessExtractor]: Loop invariant at [L878-L878] ((unsigned long )arg == 0UL) && ((1 <= i && i <= 4) || (0 == i && i == 0)) [2024-02-05 10:37:12,905 INFO L101 nessWitnessExtractor]: Location invariant before [L877-L877] (unsigned long )arg == 0UL [2024-02-05 10:37:12,905 INFO L101 nessWitnessExtractor]: Location invariant before [L902-L902] (j == 4) && ((unsigned long )arg == 0UL) [2024-02-05 10:37:12,905 INFO L101 nessWitnessExtractor]: Location invariant before [L883-L883] ((num == 1) && ((unsigned long )arg == 0UL)) && ((0 == i && i == 0) || (1 <= i && i <= 3)) [2024-02-05 10:37:12,905 INFO L101 nessWitnessExtractor]: Loop invariant at [L892-L892] ((unsigned long )arg == 0UL) && ((0 == j && j == 0) || (1 <= j && j <= 4)) [2024-02-05 10:37:12,906 INFO L101 nessWitnessExtractor]: Location invariant before [L891-L891] (unsigned long )arg == 0UL [2024-02-05 10:37:12,906 INFO L101 nessWitnessExtractor]: Location invariant before [L879-L879] ((unsigned long )arg == 0UL) && ((1 <= i && i <= 3) || (0 == i && i == 0)) [2024-02-05 10:37:12,906 INFO L101 nessWitnessExtractor]: Location invariant before [L908-L908] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-02-05 10:37:12,906 INFO L101 nessWitnessExtractor]: Location invariant before [L900-L900] ((unsigned long )arg == 0UL) && ((0 == j && j == 0) || (1 <= j && j <= 3)) [2024-02-05 10:37:12,906 INFO L101 nessWitnessExtractor]: Location invariant before [L913-L913] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-02-05 10:37:12,906 INFO L101 nessWitnessExtractor]: Location invariant before [L897-L897] ((num == 1) && ((unsigned long )arg == 0UL)) && ((0 == j && j == 0) || (1 <= j && j <= 3)) [2024-02-05 10:37:12,906 INFO L101 nessWitnessExtractor]: Location invariant before [L893-L893] ((unsigned long )arg == 0UL) && ((0 == j && j == 0) || (1 <= j && j <= 3)) [2024-02-05 10:37:12,907 INFO L101 nessWitnessExtractor]: Location invariant before [L887-L887] (i == 4) && ((unsigned long )arg == 0UL) [2024-02-05 10:37:12,907 INFO L101 nessWitnessExtractor]: Location invariant before [L903-L903] (j == 4) && ((unsigned long )arg == 0UL) [2024-02-05 10:37:12,907 INFO L101 nessWitnessExtractor]: Loop invariant at [L880-L880] (((0 <= num) && (num <= 1)) && ((unsigned long )arg == 0UL)) && (((((((((((((((((((((((((((((((((((((((((((((((1 <= i && i <= 3) || (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 <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (0 == i && i == 0)) || (1 <= i && i <= 3)) || (1 <= i && i <= 3)) || (1 <= i && i <= 3)) [2024-02-05 10:37:12,907 INFO L101 nessWitnessExtractor]: Location invariant before [L882-L882] ((num == 0) && ((unsigned long )arg == 0UL)) && ((0 == i && i == 0) || (1 <= i && i <= 3)) [2024-02-05 10:37:12,908 INFO L101 nessWitnessExtractor]: Location invariant before [L911-L911] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-02-05 10:37:12,908 INFO L101 nessWitnessExtractor]: Location invariant before [L904-L904] (j == 4) && ((unsigned long )arg == 0UL) [2024-02-05 10:37:12,908 INFO L101 nessWitnessExtractor]: Location invariant before [L884-L884] ((unsigned long )arg == 0UL) && ((0 == i && i == 0) || (1 <= i && i <= 3)) [2024-02-05 10:37:12,908 INFO L101 nessWitnessExtractor]: Location invariant before [L912-L912] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-02-05 10:37:12,908 INFO L101 nessWitnessExtractor]: Loop invariant at [L894-L894] (((0 <= num) && (num <= 1)) && ((unsigned long )arg == 0UL)) && ((((((((((((((((((((((((((((((((((((((((((((((((((((0 == j && j == 0) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (1 <= j && j <= 3)) || (1 <= j && j <= 3)) || (1 <= j && j <= 3)) || (1 <= j && j <= 3)) || (1 <= j && j <= 3)) || (1 <= j && j <= 3)) || (1 <= j && j <= 3)) || (1 <= j && j <= 3)) || (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 <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) || (0 == j && j == 0)) || (1 <= j && j <= 3)) [2024-02-05 10:37:12,908 INFO L101 nessWitnessExtractor]: Location invariant before [L910-L910] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-02-05 10:37:12,908 INFO L101 nessWitnessExtractor]: Location invariant before [L885-L885] ((unsigned long )arg == 0UL) && ((0 == i && i == 0) || (1 <= i && i <= 3)) [2024-02-05 10:37:12,909 INFO L101 nessWitnessExtractor]: Location invariant before [L898-L898] ((num == 0) && ((unsigned long )arg == 0UL)) && ((0 == j && j == 0) || (1 <= j && j <= 3)) [2024-02-05 10:37:12,958 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-02-05 10:37:13,246 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_ok.i[39757,39770] [2024-02-05 10:37:13,252 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-05 10:37:13,264 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:37:13,399 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_ok.i[39757,39770] [2024-02-05 10:37:13,400 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-05 10:37:13,441 INFO L208 MainTranslator]: Completed translation [2024-02-05 10:37:13,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:37:13 WrapperNode [2024-02-05 10:37:13,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-05 10:37:13,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-05 10:37:13,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-05 10:37:13,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-05 10:37:13,451 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:37:13" (1/1) ... [2024-02-05 10:37:13,480 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:37:13" (1/1) ... [2024-02-05 10:37:13,507 INFO L138 Inliner]: procedures = 244, calls = 54, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 86 [2024-02-05 10:37:13,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-05 10:37:13,508 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-05 10:37:13,508 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-05 10:37:13,508 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-05 10:37:13,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:37:13" (1/1) ... [2024-02-05 10:37:13,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:37:13" (1/1) ... [2024-02-05 10:37:13,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:37:13" (1/1) ... [2024-02-05 10:37:13,561 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:37:13,562 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:37:13" (1/1) ... [2024-02-05 10:37:13,562 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:37:13" (1/1) ... [2024-02-05 10:37:13,591 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:37:13" (1/1) ... [2024-02-05 10:37:13,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:37:13" (1/1) ... [2024-02-05 10:37:13,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:37:13" (1/1) ... [2024-02-05 10:37:13,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:37:13" (1/1) ... [2024-02-05 10:37:13,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-05 10:37:13,625 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-05 10:37:13,626 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-05 10:37:13,626 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-05 10:37:13,627 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:37:13" (1/1) ... [2024-02-05 10:37:13,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-05 10:37:13,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:37:13,657 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:37:13,677 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:37:13,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-05 10:37:13,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-05 10:37:13,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-02-05 10:37:13,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-02-05 10:37:13,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-02-05 10:37:13,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-02-05 10:37:13,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-02-05 10:37:13,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-02-05 10:37:13,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-02-05 10:37:13,692 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-02-05 10:37:13,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-05 10:37:13,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-05 10:37:13,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-05 10:37:13,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-05 10:37:13,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-05 10:37:13,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-02-05 10:37:13,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-02-05 10:37:13,693 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-05 10:37:13,693 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-05 10:37:13,693 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-05 10:37:13,693 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-05 10:37:13,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-05 10:37:13,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-05 10:37:13,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-05 10:37:13,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-05 10:37:13,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-05 10:37:13,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-02-05 10:37:13,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-02-05 10:37:13,694 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-02-05 10:37:13,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-05 10:37:13,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-05 10:37:13,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-05 10:37:13,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-05 10:37:13,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-05 10:37:13,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-05 10:37:13,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-02-05 10:37:13,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-02-05 10:37:13,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-05 10:37:13,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-05 10:37:13,698 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:37:13,846 INFO L244 CfgBuilder]: Building ICFG [2024-02-05 10:37:13,847 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-05 10:37:14,164 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-05 10:37:14,165 INFO L293 CfgBuilder]: Performing block encoding [2024-02-05 10:37:14,284 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-05 10:37:14,284 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-05 10:37:14,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.02 10:37:14 BoogieIcfgContainer [2024-02-05 10:37:14,285 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-05 10:37:14,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-05 10:37:14,289 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-05 10:37:14,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-05 10:37:14,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 05.02 10:37:11" (1/4) ... [2024-02-05 10:37:14,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510a41fa and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 05.02 10:37:14, skipping insertion in model container [2024-02-05 10:37:14,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:37:12" (2/4) ... [2024-02-05 10:37:14,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510a41fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:37:14, skipping insertion in model container [2024-02-05 10:37:14,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:37:13" (3/4) ... [2024-02-05 10:37:14,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510a41fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:37:14, skipping insertion in model container [2024-02-05 10:37:14,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.02 10:37:14" (4/4) ... [2024-02-05 10:37:14,295 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_ok.i [2024-02-05 10:37:14,308 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-05 10:37:14,308 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-02-05 10:37:14,308 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-05 10:37:14,404 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-05 10:37:14,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 102 transitions, 218 flow [2024-02-05 10:37:14,475 INFO L124 PetriNetUnfolderBase]: 10/100 cut-off events. [2024-02-05 10:37:14,475 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-05 10:37:14,480 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:37:14,480 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 102 transitions, 218 flow [2024-02-05 10:37:14,483 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 96 transitions, 204 flow [2024-02-05 10:37:14,495 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-05 10:37:14,500 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;@191f4cc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-05 10:37:14,501 INFO L358 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-02-05 10:37:14,503 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-05 10:37:14,503 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-05 10:37:14,504 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-05 10:37:14,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:14,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-05 10:37:14,505 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:37:14,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:14,509 INFO L85 PathProgramCache]: Analyzing trace with hash 13436, now seen corresponding path program 1 times [2024-02-05 10:37:14,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:14,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015009133] [2024-02-05 10:37:14,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:14,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:14,837 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:37:14,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:14,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015009133] [2024-02-05 10:37:14,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015009133] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:14,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:37:14,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-05 10:37:14,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440424127] [2024-02-05 10:37:14,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:14,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:37:14,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:14,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:37:14,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:37:14,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 102 [2024-02-05 10:37:14,921 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:37:14,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:14,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 102 [2024-02-05 10:37:14,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:15,266 INFO L124 PetriNetUnfolderBase]: 621/1788 cut-off events. [2024-02-05 10:37:15,267 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2024-02-05 10:37:15,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2845 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 843 conditions per place. [2024-02-05 10:37:15,281 INFO L140 encePairwiseOnDemand]: 87/102 looper letters, 51 selfloop transitions, 3 changer transitions 0/102 dead transitions. [2024-02-05 10:37:15,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 102 transitions, 330 flow [2024-02-05 10:37:15,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:37:15,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:37:15,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2024-02-05 10:37:15,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7287581699346405 [2024-02-05 10:37:15,295 INFO L175 Difference]: Start difference. First operand has 95 places, 96 transitions, 204 flow. Second operand 3 states and 223 transitions. [2024-02-05 10:37:15,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 102 transitions, 330 flow [2024-02-05 10:37:15,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 102 transitions, 318 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-05 10:37:15,310 INFO L231 Difference]: Finished difference. Result has 88 places, 88 transitions, 197 flow [2024-02-05 10:37:15,312 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:37:15,316 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -7 predicate places. [2024-02-05 10:37:15,316 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 88 transitions, 197 flow [2024-02-05 10:37:15,321 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:37:15,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:15,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:37:15,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-05 10:37:15,322 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:37:15,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:15,323 INFO L85 PathProgramCache]: Analyzing trace with hash -252263545, now seen corresponding path program 1 times [2024-02-05 10:37:15,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:15,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878793514] [2024-02-05 10:37:15,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:15,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:15,464 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:37:15,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:15,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878793514] [2024-02-05 10:37:15,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878793514] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:15,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:37:15,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:37:15,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588507066] [2024-02-05 10:37:15,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:15,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:37:15,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:15,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:37:15,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:37:15,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 102 [2024-02-05 10:37:15,531 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:37:15,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:15,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 102 [2024-02-05 10:37:15,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:15,752 INFO L124 PetriNetUnfolderBase]: 488/1602 cut-off events. [2024-02-05 10:37:15,753 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2024-02-05 10:37:15,756 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:37:15,762 INFO L140 encePairwiseOnDemand]: 99/102 looper letters, 44 selfloop transitions, 2 changer transitions 0/98 dead transitions. [2024-02-05 10:37:15,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 98 transitions, 313 flow [2024-02-05 10:37:15,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:37:15,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:37:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 293 transitions. [2024-02-05 10:37:15,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7181372549019608 [2024-02-05 10:37:15,768 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:37:15,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 98 transitions, 313 flow [2024-02-05 10:37:15,770 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:37:15,771 INFO L231 Difference]: Finished difference. Result has 89 places, 87 transitions, 196 flow [2024-02-05 10:37:15,771 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:37:15,772 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -6 predicate places. [2024-02-05 10:37:15,772 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 87 transitions, 196 flow [2024-02-05 10:37:15,773 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:37:15,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:15,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:37:15,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-05 10:37:15,773 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:37:15,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:15,774 INFO L85 PathProgramCache]: Analyzing trace with hash 769765184, now seen corresponding path program 1 times [2024-02-05 10:37:15,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:15,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188187291] [2024-02-05 10:37:15,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:15,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:15,857 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:37:15,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:15,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188187291] [2024-02-05 10:37:15,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188187291] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:15,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:37:15,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-05 10:37:15,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274189745] [2024-02-05 10:37:15,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:15,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:37:15,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:15,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:37:15,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:37:15,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 102 [2024-02-05 10:37:15,894 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:37:15,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:15,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 102 [2024-02-05 10:37:15,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:16,107 INFO L124 PetriNetUnfolderBase]: 739/2168 cut-off events. [2024-02-05 10:37:16,107 INFO L125 PetriNetUnfolderBase]: For 124/131 co-relation queries the response was YES. [2024-02-05 10:37:16,110 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:37:16,117 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 60 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2024-02-05 10:37:16,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 109 transitions, 371 flow [2024-02-05 10:37:16,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:37:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:37:16,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2024-02-05 10:37:16,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7679738562091504 [2024-02-05 10:37:16,118 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:37:16,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 109 transitions, 371 flow [2024-02-05 10:37:16,120 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:37:16,122 INFO L231 Difference]: Finished difference. Result has 90 places, 88 transitions, 213 flow [2024-02-05 10:37:16,123 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:37:16,124 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -5 predicate places. [2024-02-05 10:37:16,124 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 88 transitions, 213 flow [2024-02-05 10:37:16,124 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:37:16,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:16,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:37:16,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-05 10:37:16,125 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:37:16,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:16,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1908828753, now seen corresponding path program 1 times [2024-02-05 10:37:16,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:16,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230006183] [2024-02-05 10:37:16,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:16,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:16,203 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:37:16,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:16,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230006183] [2024-02-05 10:37:16,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230006183] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:16,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:37:16,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:37:16,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759380357] [2024-02-05 10:37:16,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:16,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:37:16,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:16,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:37:16,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:37:16,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 102 [2024-02-05 10:37:16,259 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:37:16,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:16,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 102 [2024-02-05 10:37:16,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:16,454 INFO L124 PetriNetUnfolderBase]: 556/1754 cut-off events. [2024-02-05 10:37:16,454 INFO L125 PetriNetUnfolderBase]: For 208/251 co-relation queries the response was YES. [2024-02-05 10:37:16,457 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:37:16,462 INFO L140 encePairwiseOnDemand]: 99/102 looper letters, 59 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2024-02-05 10:37:16,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 112 transitions, 410 flow [2024-02-05 10:37:16,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:37:16,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:37:16,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 303 transitions. [2024-02-05 10:37:16,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7426470588235294 [2024-02-05 10:37:16,470 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:37:16,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 112 transitions, 410 flow [2024-02-05 10:37:16,472 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:37:16,473 INFO L231 Difference]: Finished difference. Result has 91 places, 87 transitions, 213 flow [2024-02-05 10:37:16,473 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:37:16,474 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -4 predicate places. [2024-02-05 10:37:16,474 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 87 transitions, 213 flow [2024-02-05 10:37:16,474 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:37:16,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:16,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:37:16,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-05 10:37:16,475 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:37:16,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:16,476 INFO L85 PathProgramCache]: Analyzing trace with hash 955851321, now seen corresponding path program 1 times [2024-02-05 10:37:16,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:16,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72100603] [2024-02-05 10:37:16,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:16,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:16,522 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:37:16,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:16,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72100603] [2024-02-05 10:37:16,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72100603] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:16,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:37:16,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-05 10:37:16,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991393053] [2024-02-05 10:37:16,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:16,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:37:16,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:16,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:37:16,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:37:16,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 102 [2024-02-05 10:37:16,553 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:37:16,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:16,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 102 [2024-02-05 10:37:16,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:16,788 INFO L124 PetriNetUnfolderBase]: 884/2373 cut-off events. [2024-02-05 10:37:16,788 INFO L125 PetriNetUnfolderBase]: For 275/392 co-relation queries the response was YES. [2024-02-05 10:37:16,792 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:37:16,799 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 59 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2024-02-05 10:37:16,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 107 transitions, 385 flow [2024-02-05 10:37:16,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:37:16,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:37:16,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2024-02-05 10:37:16,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.761437908496732 [2024-02-05 10:37:16,801 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:37:16,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 107 transitions, 385 flow [2024-02-05 10:37:16,802 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:37:16,805 INFO L231 Difference]: Finished difference. Result has 92 places, 87 transitions, 226 flow [2024-02-05 10:37:16,805 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:37:16,807 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -3 predicate places. [2024-02-05 10:37:16,807 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 226 flow [2024-02-05 10:37:16,807 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:37:16,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:16,808 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:37:16,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-05 10:37:16,808 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:37:16,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:16,808 INFO L85 PathProgramCache]: Analyzing trace with hash 2146100525, now seen corresponding path program 1 times [2024-02-05 10:37:16,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:16,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071442829] [2024-02-05 10:37:16,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:16,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:16,869 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:37:16,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:16,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071442829] [2024-02-05 10:37:16,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071442829] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:16,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:37:16,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:37:16,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581483974] [2024-02-05 10:37:16,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:16,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:37:16,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:16,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:37:16,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:37:16,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 102 [2024-02-05 10:37:16,951 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:37:16,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:16,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 102 [2024-02-05 10:37:16,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:17,487 INFO L124 PetriNetUnfolderBase]: 2878/6605 cut-off events. [2024-02-05 10:37:17,487 INFO L125 PetriNetUnfolderBase]: For 1350/1418 co-relation queries the response was YES. [2024-02-05 10:37:17,494 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:37:17,514 INFO L140 encePairwiseOnDemand]: 89/102 looper letters, 90 selfloop transitions, 8 changer transitions 0/133 dead transitions. [2024-02-05 10:37:17,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 133 transitions, 549 flow [2024-02-05 10:37:17,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:37:17,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:37:17,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 284 transitions. [2024-02-05 10:37:17,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.696078431372549 [2024-02-05 10:37:17,516 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:37:17,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 133 transitions, 549 flow [2024-02-05 10:37:17,518 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:37:17,519 INFO L231 Difference]: Finished difference. Result has 97 places, 91 transitions, 286 flow [2024-02-05 10:37:17,519 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:37:17,519 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 2 predicate places. [2024-02-05 10:37:17,520 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 91 transitions, 286 flow [2024-02-05 10:37:17,520 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:37:17,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:17,520 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:37:17,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-05 10:37:17,520 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:37:17,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:17,521 INFO L85 PathProgramCache]: Analyzing trace with hash -26085961, now seen corresponding path program 1 times [2024-02-05 10:37:17,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:17,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795417] [2024-02-05 10:37:17,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:17,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:17,580 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:37:17,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:17,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795417] [2024-02-05 10:37:17,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795417] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:17,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:37:17,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:37:17,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056880636] [2024-02-05 10:37:17,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:17,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:37:17,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:17,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:37:17,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:37:17,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 102 [2024-02-05 10:37:17,646 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:37:17,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:17,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 102 [2024-02-05 10:37:17,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:18,199 INFO L124 PetriNetUnfolderBase]: 2538/6185 cut-off events. [2024-02-05 10:37:18,199 INFO L125 PetriNetUnfolderBase]: For 2779/2903 co-relation queries the response was YES. [2024-02-05 10:37:18,209 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:37:18,227 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 90 selfloop transitions, 9 changer transitions 0/133 dead transitions. [2024-02-05 10:37:18,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 133 transitions, 611 flow [2024-02-05 10:37:18,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:37:18,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:37:18,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 276 transitions. [2024-02-05 10:37:18,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2024-02-05 10:37:18,228 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:37:18,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 133 transitions, 611 flow [2024-02-05 10:37:18,233 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:37:18,234 INFO L231 Difference]: Finished difference. Result has 101 places, 93 transitions, 329 flow [2024-02-05 10:37:18,234 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:37:18,235 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 6 predicate places. [2024-02-05 10:37:18,235 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 93 transitions, 329 flow [2024-02-05 10:37:18,235 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:37:18,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:18,235 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:37:18,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-05 10:37:18,236 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:37:18,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:18,236 INFO L85 PathProgramCache]: Analyzing trace with hash -401931381, now seen corresponding path program 1 times [2024-02-05 10:37:18,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:18,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315700548] [2024-02-05 10:37:18,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:18,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:18,362 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:37:18,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:18,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315700548] [2024-02-05 10:37:18,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315700548] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:18,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:37:18,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-05 10:37:18,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792378096] [2024-02-05 10:37:18,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:18,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-05 10:37:18,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:18,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-05 10:37:18,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-05 10:37:18,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 102 [2024-02-05 10:37:18,491 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:37:18,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:18,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 102 [2024-02-05 10:37:18,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:19,138 INFO L124 PetriNetUnfolderBase]: 3275/7240 cut-off events. [2024-02-05 10:37:19,139 INFO L125 PetriNetUnfolderBase]: For 6038/6122 co-relation queries the response was YES. [2024-02-05 10:37:19,151 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:37:19,178 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 115 selfloop transitions, 12 changer transitions 0/159 dead transitions. [2024-02-05 10:37:19,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 159 transitions, 780 flow [2024-02-05 10:37:19,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-05 10:37:19,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-05 10:37:19,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 342 transitions. [2024-02-05 10:37:19,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6705882352941176 [2024-02-05 10:37:19,180 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:37:19,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 159 transitions, 780 flow [2024-02-05 10:37:19,188 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:37:19,189 INFO L231 Difference]: Finished difference. Result has 105 places, 95 transitions, 363 flow [2024-02-05 10:37:19,190 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:37:19,192 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 10 predicate places. [2024-02-05 10:37:19,192 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 95 transitions, 363 flow [2024-02-05 10:37:19,192 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:37:19,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:19,192 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:37:19,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-05 10:37:19,192 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:37:19,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:19,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1887091080, now seen corresponding path program 1 times [2024-02-05 10:37:19,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:19,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092848186] [2024-02-05 10:37:19,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:19,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:19,277 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:37:19,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:19,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092848186] [2024-02-05 10:37:19,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092848186] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:37:19,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697804734] [2024-02-05 10:37:19,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:19,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:37:19,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:37:19,280 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:37:19,294 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:37:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:19,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-05 10:37:19,401 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:37:19,559 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:37:19,559 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:37:19,759 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:37:19,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697804734] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:37:19,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:37:19,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-02-05 10:37:19,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579266160] [2024-02-05 10:37:19,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:37:19,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:37:19,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:19,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:37:19,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-02-05 10:37:19,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 102 [2024-02-05 10:37:19,806 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:37:19,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:19,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 102 [2024-02-05 10:37:19,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:20,609 INFO L124 PetriNetUnfolderBase]: 3436/8189 cut-off events. [2024-02-05 10:37:20,609 INFO L125 PetriNetUnfolderBase]: For 4607/4727 co-relation queries the response was YES. [2024-02-05 10:37:20,625 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:37:20,648 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 121 selfloop transitions, 7 changer transitions 0/169 dead transitions. [2024-02-05 10:37:20,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 169 transitions, 839 flow [2024-02-05 10:37:20,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-05 10:37:20,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-05 10:37:20,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 425 transitions. [2024-02-05 10:37:20,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2024-02-05 10:37:20,650 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:37:20,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 169 transitions, 839 flow [2024-02-05 10:37:20,654 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:37:20,656 INFO L231 Difference]: Finished difference. Result has 106 places, 93 transitions, 363 flow [2024-02-05 10:37:20,656 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:37:20,657 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 11 predicate places. [2024-02-05 10:37:20,657 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 93 transitions, 363 flow [2024-02-05 10:37:20,657 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:37:20,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:20,658 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:37:20,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-02-05 10:37:20,871 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:37:20,872 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:37:20,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:20,872 INFO L85 PathProgramCache]: Analyzing trace with hash -598033558, now seen corresponding path program 1 times [2024-02-05 10:37:20,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:20,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627238264] [2024-02-05 10:37:20,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:20,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:20,954 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:37:20,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:20,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627238264] [2024-02-05 10:37:20,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627238264] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:20,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:37:20,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:37:20,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189292829] [2024-02-05 10:37:20,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:20,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:37:20,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:20,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:37:20,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:37:20,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 102 [2024-02-05 10:37:20,957 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:37:20,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:20,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 102 [2024-02-05 10:37:20,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:21,327 INFO L124 PetriNetUnfolderBase]: 858/3069 cut-off events. [2024-02-05 10:37:21,327 INFO L125 PetriNetUnfolderBase]: For 2047/2080 co-relation queries the response was YES. [2024-02-05 10:37:21,336 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:37:21,344 INFO L140 encePairwiseOnDemand]: 94/102 looper letters, 54 selfloop transitions, 8 changer transitions 0/111 dead transitions. [2024-02-05 10:37:21,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 111 transitions, 564 flow [2024-02-05 10:37:21,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:37:21,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:37:21,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 241 transitions. [2024-02-05 10:37:21,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7875816993464052 [2024-02-05 10:37:21,345 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:37:21,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 111 transitions, 564 flow [2024-02-05 10:37:21,350 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:37:21,352 INFO L231 Difference]: Finished difference. Result has 106 places, 91 transitions, 347 flow [2024-02-05 10:37:21,352 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:37:21,353 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 11 predicate places. [2024-02-05 10:37:21,353 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 91 transitions, 347 flow [2024-02-05 10:37:21,353 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:37:21,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:21,354 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:37:21,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-05 10:37:21,354 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:37:21,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:21,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1216540427, now seen corresponding path program 1 times [2024-02-05 10:37:21,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:21,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973781334] [2024-02-05 10:37:21,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:21,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:21,514 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:37:21,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:21,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973781334] [2024-02-05 10:37:21,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973781334] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:37:21,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974757] [2024-02-05 10:37:21,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:21,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:37:21,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:37:21,520 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:37:21,536 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:37:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:21,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-05 10:37:21,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:37:21,749 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:37:21,750 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-05 10:37:21,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974757] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:21,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-05 10:37:21,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-02-05 10:37:21,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441131101] [2024-02-05 10:37:21,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:21,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:37:21,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:21,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:37:21,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-02-05 10:37:21,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 102 [2024-02-05 10:37:21,883 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:37:21,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:21,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 102 [2024-02-05 10:37:21,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:22,351 INFO L124 PetriNetUnfolderBase]: 1631/3834 cut-off events. [2024-02-05 10:37:22,351 INFO L125 PetriNetUnfolderBase]: For 2268/2374 co-relation queries the response was YES. [2024-02-05 10:37:22,359 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:37:22,368 INFO L140 encePairwiseOnDemand]: 92/102 looper letters, 107 selfloop transitions, 14 changer transitions 1/152 dead transitions. [2024-02-05 10:37:22,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 152 transitions, 801 flow [2024-02-05 10:37:22,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-05 10:37:22,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-05 10:37:22,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 361 transitions. [2024-02-05 10:37:22,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5898692810457516 [2024-02-05 10:37:22,370 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:37:22,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 152 transitions, 801 flow [2024-02-05 10:37:22,375 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:37:22,376 INFO L231 Difference]: Finished difference. Result has 112 places, 94 transitions, 420 flow [2024-02-05 10:37:22,376 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:37:22,377 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 17 predicate places. [2024-02-05 10:37:22,377 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 94 transitions, 420 flow [2024-02-05 10:37:22,377 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:37:22,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:22,377 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:37:22,394 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:37:22,584 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:37:22,584 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:37:22,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:22,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2052610538, now seen corresponding path program 1 times [2024-02-05 10:37:22,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:22,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948581293] [2024-02-05 10:37:22,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:22,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:22,654 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:37:22,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:22,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948581293] [2024-02-05 10:37:22,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948581293] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:22,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:37:22,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:37:22,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766479622] [2024-02-05 10:37:22,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:22,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:37:22,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:22,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:37:22,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:37:22,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 102 [2024-02-05 10:37:22,705 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:37:22,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:22,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 102 [2024-02-05 10:37:22,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:23,063 INFO L124 PetriNetUnfolderBase]: 1214/3256 cut-off events. [2024-02-05 10:37:23,063 INFO L125 PetriNetUnfolderBase]: For 3832/3856 co-relation queries the response was YES. [2024-02-05 10:37:23,072 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:37:23,082 INFO L140 encePairwiseOnDemand]: 92/102 looper letters, 87 selfloop transitions, 12 changer transitions 0/132 dead transitions. [2024-02-05 10:37:23,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 132 transitions, 787 flow [2024-02-05 10:37:23,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:37:23,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:37:23,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 272 transitions. [2024-02-05 10:37:23,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-02-05 10:37:23,083 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:37:23,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 132 transitions, 787 flow [2024-02-05 10:37:23,090 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:37:23,091 INFO L231 Difference]: Finished difference. Result has 115 places, 101 transitions, 515 flow [2024-02-05 10:37:23,092 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:37:23,092 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 20 predicate places. [2024-02-05 10:37:23,092 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 101 transitions, 515 flow [2024-02-05 10:37:23,093 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:37:23,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:23,093 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:37:23,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-05 10:37:23,093 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:37:23,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:23,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1150019684, now seen corresponding path program 2 times [2024-02-05 10:37:23,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:23,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935434492] [2024-02-05 10:37:23,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:23,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:23,167 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:37:23,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:23,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935434492] [2024-02-05 10:37:23,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935434492] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:23,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:37:23,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:37:23,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491697435] [2024-02-05 10:37:23,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:23,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:37:23,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:23,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:37:23,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:37:23,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 102 [2024-02-05 10:37:23,238 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:37:23,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:23,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 102 [2024-02-05 10:37:23,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:23,657 INFO L124 PetriNetUnfolderBase]: 1228/3328 cut-off events. [2024-02-05 10:37:23,657 INFO L125 PetriNetUnfolderBase]: For 4334/4362 co-relation queries the response was YES. [2024-02-05 10:37:23,666 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:37:23,675 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 88 selfloop transitions, 14 changer transitions 0/135 dead transitions. [2024-02-05 10:37:23,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 135 transitions, 869 flow [2024-02-05 10:37:23,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:37:23,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:37:23,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 270 transitions. [2024-02-05 10:37:23,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6617647058823529 [2024-02-05 10:37:23,677 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:37:23,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 135 transitions, 869 flow [2024-02-05 10:37:23,685 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:37:23,689 INFO L231 Difference]: Finished difference. Result has 117 places, 104 transitions, 586 flow [2024-02-05 10:37:23,689 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:37:23,690 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 22 predicate places. [2024-02-05 10:37:23,690 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 104 transitions, 586 flow [2024-02-05 10:37:23,690 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:37:23,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:23,690 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:37:23,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-05 10:37:23,691 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:37:23,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:23,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1379422196, now seen corresponding path program 1 times [2024-02-05 10:37:23,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:23,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23878109] [2024-02-05 10:37:23,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:23,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:23,835 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:37:23,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:23,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23878109] [2024-02-05 10:37:23,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23878109] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:23,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:37:23,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-05 10:37:23,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808296355] [2024-02-05 10:37:23,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:23,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-05 10:37:23,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:23,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-05 10:37:23,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-02-05 10:37:23,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 102 [2024-02-05 10:37:23,897 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:37:23,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:23,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 102 [2024-02-05 10:37:23,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:24,294 INFO L124 PetriNetUnfolderBase]: 1337/3470 cut-off events. [2024-02-05 10:37:24,294 INFO L125 PetriNetUnfolderBase]: For 5180/5214 co-relation queries the response was YES. [2024-02-05 10:37:24,303 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:37:24,313 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 99 selfloop transitions, 17 changer transitions 0/145 dead transitions. [2024-02-05 10:37:24,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 145 transitions, 1010 flow [2024-02-05 10:37:24,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-05 10:37:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-05 10:37:24,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 311 transitions. [2024-02-05 10:37:24,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6098039215686275 [2024-02-05 10:37:24,315 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:37:24,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 145 transitions, 1010 flow [2024-02-05 10:37:24,324 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:37:24,326 INFO L231 Difference]: Finished difference. Result has 121 places, 106 transitions, 634 flow [2024-02-05 10:37:24,326 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:37:24,327 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 26 predicate places. [2024-02-05 10:37:24,327 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 106 transitions, 634 flow [2024-02-05 10:37:24,327 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:37:24,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:24,328 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:37:24,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-05 10:37:24,328 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:37:24,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:24,328 INFO L85 PathProgramCache]: Analyzing trace with hash 2023645167, now seen corresponding path program 1 times [2024-02-05 10:37:24,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:24,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283696812] [2024-02-05 10:37:24,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:24,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:24,407 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:37:24,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:24,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283696812] [2024-02-05 10:37:24,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283696812] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:37:24,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340876843] [2024-02-05 10:37:24,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:24,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:37:24,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:37:24,412 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:37:24,439 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:37:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:24,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-05 10:37:24,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:37:24,596 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:37:24,596 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:37:24,792 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:37:24,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340876843] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:37:24,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:37:24,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-02-05 10:37:24,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048822151] [2024-02-05 10:37:24,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:37:24,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:37:24,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:24,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:37:24,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-02-05 10:37:24,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 102 [2024-02-05 10:37:24,859 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:37:24,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:24,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 102 [2024-02-05 10:37:24,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:25,294 INFO L124 PetriNetUnfolderBase]: 1511/3670 cut-off events. [2024-02-05 10:37:25,294 INFO L125 PetriNetUnfolderBase]: For 6048/6097 co-relation queries the response was YES. [2024-02-05 10:37:25,308 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:37:25,321 INFO L140 encePairwiseOnDemand]: 91/102 looper letters, 122 selfloop transitions, 10 changer transitions 0/169 dead transitions. [2024-02-05 10:37:25,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 169 transitions, 1158 flow [2024-02-05 10:37:25,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-05 10:37:25,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-05 10:37:25,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 403 transitions. [2024-02-05 10:37:25,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6584967320261438 [2024-02-05 10:37:25,324 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:37:25,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 169 transitions, 1158 flow [2024-02-05 10:37:25,332 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:37:25,334 INFO L231 Difference]: Finished difference. Result has 122 places, 104 transitions, 632 flow [2024-02-05 10:37:25,334 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:37:25,335 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 27 predicate places. [2024-02-05 10:37:25,335 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 104 transitions, 632 flow [2024-02-05 10:37:25,335 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:37:25,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:25,336 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:37:25,362 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:37:25,542 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:37:25,543 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:37:25,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:25,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1526654846, now seen corresponding path program 1 times [2024-02-05 10:37:25,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:25,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749445936] [2024-02-05 10:37:25,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:25,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:25,669 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:37:25,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:25,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749445936] [2024-02-05 10:37:25,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749445936] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:37:25,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567678399] [2024-02-05 10:37:25,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:25,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:37:25,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:37:25,798 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:37:25,822 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:37:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:25,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-05 10:37:25,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:37:26,044 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:37:26,044 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-05 10:37:26,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567678399] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:26,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-05 10:37:26,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-02-05 10:37:26,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147784491] [2024-02-05 10:37:26,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:26,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:37:26,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:26,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:37:26,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-02-05 10:37:26,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 102 [2024-02-05 10:37:26,114 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:37:26,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:26,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 102 [2024-02-05 10:37:26,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:26,668 INFO L124 PetriNetUnfolderBase]: 1946/4395 cut-off events. [2024-02-05 10:37:26,669 INFO L125 PetriNetUnfolderBase]: For 7252/7274 co-relation queries the response was YES. [2024-02-05 10:37:26,679 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:37:26,691 INFO L140 encePairwiseOnDemand]: 92/102 looper letters, 136 selfloop transitions, 20 changer transitions 0/182 dead transitions. [2024-02-05 10:37:26,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 182 transitions, 1284 flow [2024-02-05 10:37:26,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-05 10:37:26,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-05 10:37:26,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 372 transitions. [2024-02-05 10:37:26,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2024-02-05 10:37:26,693 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:37:26,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 182 transitions, 1284 flow [2024-02-05 10:37:26,702 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:37:26,704 INFO L231 Difference]: Finished difference. Result has 128 places, 110 transitions, 761 flow [2024-02-05 10:37:26,704 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:37:26,705 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 33 predicate places. [2024-02-05 10:37:26,705 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 110 transitions, 761 flow [2024-02-05 10:37:26,705 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:37:26,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:26,705 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:37:26,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-02-05 10:37:26,917 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:37:26,917 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:37:26,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:26,917 INFO L85 PathProgramCache]: Analyzing trace with hash -922523205, now seen corresponding path program 1 times [2024-02-05 10:37:26,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:26,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878060968] [2024-02-05 10:37:26,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:26,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:27,090 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:37:27,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:27,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878060968] [2024-02-05 10:37:27,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878060968] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:37:27,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163132597] [2024-02-05 10:37:27,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:27,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:37:27,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:37:27,092 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:37:27,112 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:37:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:27,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-05 10:37:27,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:37:27,374 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:37:27,374 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-05 10:37:27,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163132597] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:27,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-05 10:37:27,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-02-05 10:37:27,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362230130] [2024-02-05 10:37:27,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:27,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:37:27,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:27,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:37:27,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-02-05 10:37:27,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 102 [2024-02-05 10:37:27,510 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:37:27,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:27,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 102 [2024-02-05 10:37:27,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:28,136 INFO L124 PetriNetUnfolderBase]: 1837/4247 cut-off events. [2024-02-05 10:37:28,136 INFO L125 PetriNetUnfolderBase]: For 12184/12279 co-relation queries the response was YES. [2024-02-05 10:37:28,152 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:37:28,165 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 112 selfloop transitions, 27 changer transitions 3/170 dead transitions. [2024-02-05 10:37:28,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 170 transitions, 1366 flow [2024-02-05 10:37:28,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-05 10:37:28,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-05 10:37:28,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 349 transitions. [2024-02-05 10:37:28,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5702614379084967 [2024-02-05 10:37:28,167 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:37:28,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 170 transitions, 1366 flow [2024-02-05 10:37:28,183 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:37:28,185 INFO L231 Difference]: Finished difference. Result has 132 places, 117 transitions, 914 flow [2024-02-05 10:37:28,186 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:37:28,186 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 37 predicate places. [2024-02-05 10:37:28,186 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 117 transitions, 914 flow [2024-02-05 10:37:28,186 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:37:28,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:28,187 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:37:28,201 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:37:28,401 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:37:28,402 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:37:28,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:28,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1271598340, now seen corresponding path program 2 times [2024-02-05 10:37:28,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:28,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399647659] [2024-02-05 10:37:28,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:28,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:28,546 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:37:28,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:28,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399647659] [2024-02-05 10:37:28,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399647659] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:37:28,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927250359] [2024-02-05 10:37:28,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-05 10:37:28,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:37:28,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:37:28,557 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:37:28,579 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:37:28,683 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-05 10:37:28,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-05 10:37:28,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-05 10:37:28,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:37:28,752 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:37:28,752 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-05 10:37:28,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927250359] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:28,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-05 10:37:28,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-02-05 10:37:28,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097125622] [2024-02-05 10:37:28,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:28,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-05 10:37:28,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:28,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-05 10:37:28,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-02-05 10:37:28,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 102 [2024-02-05 10:37:28,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 117 transitions, 914 flow. Second operand has 5 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 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:37:28,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:28,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 102 [2024-02-05 10:37:28,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:29,470 INFO L124 PetriNetUnfolderBase]: 2216/5062 cut-off events. [2024-02-05 10:37:29,470 INFO L125 PetriNetUnfolderBase]: For 12420/12466 co-relation queries the response was YES. [2024-02-05 10:37:29,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15072 conditions, 5062 events. 2216/5062 cut-off events. For 12420/12466 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 30486 event pairs, 423 based on Foata normal form. 46/5065 useless extension candidates. Maximal degree in co-relation 14766. Up to 1509 conditions per place. [2024-02-05 10:37:29,499 INFO L140 encePairwiseOnDemand]: 90/102 looper letters, 122 selfloop transitions, 34 changer transitions 0/188 dead transitions. [2024-02-05 10:37:29,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 188 transitions, 1542 flow [2024-02-05 10:37:29,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-05 10:37:29,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-05 10:37:29,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 322 transitions. [2024-02-05 10:37:29,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6313725490196078 [2024-02-05 10:37:29,501 INFO L175 Difference]: Start difference. First operand has 132 places, 117 transitions, 914 flow. Second operand 5 states and 322 transitions. [2024-02-05 10:37:29,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 188 transitions, 1542 flow [2024-02-05 10:37:29,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 188 transitions, 1500 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-02-05 10:37:29,520 INFO L231 Difference]: Finished difference. Result has 133 places, 124 transitions, 1010 flow [2024-02-05 10:37:29,520 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=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1010, PETRI_PLACES=133, PETRI_TRANSITIONS=124} [2024-02-05 10:37:29,521 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 38 predicate places. [2024-02-05 10:37:29,521 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 124 transitions, 1010 flow [2024-02-05 10:37:29,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 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:37:29,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:29,521 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:37:29,533 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:37:29,733 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:37:29,733 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:37:29,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:29,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1045254400, now seen corresponding path program 1 times [2024-02-05 10:37:29,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:29,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645681369] [2024-02-05 10:37:29,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:29,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:29,914 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:37:29,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:29,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645681369] [2024-02-05 10:37:29,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645681369] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:37:29,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129937135] [2024-02-05 10:37:29,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:29,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:37:29,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:37:29,916 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:37:29,940 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:37:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:30,055 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-05 10:37:30,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:37:30,204 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:37:30,205 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-05 10:37:30,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129937135] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:30,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-05 10:37:30,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-02-05 10:37:30,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985333735] [2024-02-05 10:37:30,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:30,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-05 10:37:30,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:30,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-05 10:37:30,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-02-05 10:37:30,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 102 [2024-02-05 10:37:30,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 124 transitions, 1010 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:37:30,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:30,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 102 [2024-02-05 10:37:30,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:30,989 INFO L124 PetriNetUnfolderBase]: 2613/5744 cut-off events. [2024-02-05 10:37:30,989 INFO L125 PetriNetUnfolderBase]: For 16019/16067 co-relation queries the response was YES. [2024-02-05 10:37:31,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18829 conditions, 5744 events. 2613/5744 cut-off events. For 16019/16067 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 34578 event pairs, 396 based on Foata normal form. 36/5717 useless extension candidates. Maximal degree in co-relation 18487. Up to 1365 conditions per place. [2024-02-05 10:37:31,026 INFO L140 encePairwiseOnDemand]: 91/102 looper letters, 163 selfloop transitions, 36 changer transitions 0/224 dead transitions. [2024-02-05 10:37:31,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 224 transitions, 1939 flow [2024-02-05 10:37:31,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-05 10:37:31,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-05 10:37:31,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 410 transitions. [2024-02-05 10:37:31,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5742296918767507 [2024-02-05 10:37:31,028 INFO L175 Difference]: Start difference. First operand has 133 places, 124 transitions, 1010 flow. Second operand 7 states and 410 transitions. [2024-02-05 10:37:31,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 224 transitions, 1939 flow [2024-02-05 10:37:31,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 224 transitions, 1907 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-02-05 10:37:31,055 INFO L231 Difference]: Finished difference. Result has 137 places, 130 transitions, 1161 flow [2024-02-05 10:37:31,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1161, PETRI_PLACES=137, PETRI_TRANSITIONS=130} [2024-02-05 10:37:31,055 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 42 predicate places. [2024-02-05 10:37:31,055 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 130 transitions, 1161 flow [2024-02-05 10:37:31,056 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:37:31,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:31,056 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:37:31,068 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:37:31,267 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:37:31,268 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:37:31,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:31,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1712565939, now seen corresponding path program 1 times [2024-02-05 10:37:31,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:31,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603837387] [2024-02-05 10:37:31,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:31,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:31,401 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:37:31,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:31,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603837387] [2024-02-05 10:37:31,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603837387] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:37:31,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40898832] [2024-02-05 10:37:31,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:31,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:37:31,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:37:31,403 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:37:31,406 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:37:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:31,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-05 10:37:31,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:37:31,692 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:37:31,692 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-05 10:37:31,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40898832] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:31,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-05 10:37:31,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-02-05 10:37:31,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901149845] [2024-02-05 10:37:31,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:31,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:37:31,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:31,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:37:31,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-02-05 10:37:31,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 102 [2024-02-05 10:37:31,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 130 transitions, 1161 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:37:31,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:31,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 102 [2024-02-05 10:37:31,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:32,266 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][102], [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 (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 301#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), 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 (= thread2Thread1of1ForFork1_~j~0 0) (and (<= thread2Thread1of1ForFork1_~j~0 4) (<= 1 thread2Thread1of1ForFork1_~j~0))) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 290#(and (<= thread1Thread1of1ForFork0_~i~0 3) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 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)), 794#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 655#(and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 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))), 21#L893true, 121#(and (= |thread2Thread1of1ForFork1_#in~arg.base| 0) (= |thread2Thread1of1ForFork1_#in~arg.offset| 0) (= thread2Thread1of1ForFork1_~arg.base 0) (= thread2Thread1of1ForFork1_~arg.offset 0)), 1060#(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: 793#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), 654#(and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 898#(and (<= 0 thread2Thread1of1ForFork1_~j~0) (= ~num~0 0) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 221#(and (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 4)))), Black: 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ 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)), Black: 1053#(and (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), Black: 1046#(= ~num~0 0), 1073#(and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 645#(and (<= thread2Thread1of1ForFork1_~j~0 3) (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 141#(= ~num~0 0), 1220#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 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, Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)))]) [2024-02-05 10:37:32,267 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2024-02-05 10:37:32,267 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-02-05 10:37:32,267 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-02-05 10:37:32,267 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-02-05 10:37:32,272 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][102], [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 (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 301#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), 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 (= thread2Thread1of1ForFork1_~j~0 0) (and (<= thread2Thread1of1ForFork1_~j~0 4) (<= 1 thread2Thread1of1ForFork1_~j~0))) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 290#(and (<= thread1Thread1of1ForFork0_~i~0 3) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 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: 655#(and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 794#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), 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))), 21#L893true, 19#L915-1true, 121#(and (= |thread2Thread1of1ForFork1_#in~arg.base| 0) (= |thread2Thread1of1ForFork1_#in~arg.offset| 0) (= thread2Thread1of1ForFork1_~arg.base 0) (= thread2Thread1of1ForFork1_~arg.offset 0)), 1060#(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: 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)), 654#(and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 221#(and (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 4)))), Black: 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ 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)), Black: 1053#(and (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), Black: 1046#(= ~num~0 0), 1073#(and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 645#(and (<= thread2Thread1of1ForFork1_~j~0 3) (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 141#(= ~num~0 0), 1220#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 135#(= ~num~0 0), Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)))]) [2024-02-05 10:37:32,273 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2024-02-05 10:37:32,273 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-02-05 10:37:32,273 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-02-05 10:37:32,273 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-02-05 10:37:32,278 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][102], [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 (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 301#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), 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 (= thread2Thread1of1ForFork1_~j~0 0) (and (<= thread2Thread1of1ForFork1_~j~0 4) (<= 1 thread2Thread1of1ForFork1_~j~0))) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 290#(and (<= thread1Thread1of1ForFork0_~i~0 3) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 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)), 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, 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)), 794#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 655#(and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 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)), 1060#(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: 793#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), 654#(and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 898#(and (<= 0 thread2Thread1of1ForFork1_~j~0) (= ~num~0 0) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 221#(and (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 4)))), Black: 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ 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)), Black: 1053#(and (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), Black: 1046#(= ~num~0 0), 1073#(and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 645#(and (<= thread2Thread1of1ForFork1_~j~0 3) (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 141#(= ~num~0 0), 1220#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 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, 93#L893-1true, Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)))]) [2024-02-05 10:37:32,279 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2024-02-05 10:37:32,279 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-02-05 10:37:32,279 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-02-05 10:37:32,279 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-02-05 10:37:32,284 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][102], [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 (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 301#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), 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 (= thread2Thread1of1ForFork1_~j~0 0) (and (<= thread2Thread1of1ForFork1_~j~0 4) (<= 1 thread2Thread1of1ForFork1_~j~0))) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 290#(and (<= thread1Thread1of1ForFork0_~i~0 3) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 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: 655#(and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 794#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), 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)), 1060#(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: 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)), 654#(and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 221#(and (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 4)))), Black: 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ 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)), Black: 1053#(and (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), Black: 1046#(= ~num~0 0), 1073#(and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 645#(and (<= thread2Thread1of1ForFork1_~j~0 3) (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 141#(= ~num~0 0), 1220#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 135#(= ~num~0 0), 93#L893-1true, Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)))]) [2024-02-05 10:37:32,284 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2024-02-05 10:37:32,285 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-02-05 10:37:32,285 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-02-05 10:37:32,285 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-02-05 10:37:32,412 INFO L124 PetriNetUnfolderBase]: 2621/6074 cut-off events. [2024-02-05 10:37:32,412 INFO L125 PetriNetUnfolderBase]: For 22574/22792 co-relation queries the response was YES. [2024-02-05 10:37:32,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20130 conditions, 6074 events. 2621/6074 cut-off events. For 22574/22792 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 38124 event pairs, 516 based on Foata normal form. 172/6154 useless extension candidates. Maximal degree in co-relation 19771. Up to 1673 conditions per place. [2024-02-05 10:37:32,445 INFO L140 encePairwiseOnDemand]: 91/102 looper letters, 154 selfloop transitions, 25 changer transitions 0/209 dead transitions. [2024-02-05 10:37:32,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 209 transitions, 1988 flow [2024-02-05 10:37:32,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-05 10:37:32,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-05 10:37:32,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 366 transitions. [2024-02-05 10:37:32,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5980392156862745 [2024-02-05 10:37:32,448 INFO L175 Difference]: Start difference. First operand has 137 places, 130 transitions, 1161 flow. Second operand 6 states and 366 transitions. [2024-02-05 10:37:32,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 209 transitions, 1988 flow [2024-02-05 10:37:32,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 209 transitions, 1848 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-02-05 10:37:32,474 INFO L231 Difference]: Finished difference. Result has 137 places, 135 transitions, 1201 flow [2024-02-05 10:37:32,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=1055, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1201, PETRI_PLACES=137, PETRI_TRANSITIONS=135} [2024-02-05 10:37:32,475 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 42 predicate places. [2024-02-05 10:37:32,475 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 135 transitions, 1201 flow [2024-02-05 10:37:32,475 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:37:32,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:32,475 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:37:32,492 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:37:32,689 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:37:32,689 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:37:32,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:32,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1255561007, now seen corresponding path program 2 times [2024-02-05 10:37:32,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:32,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427062470] [2024-02-05 10:37:32,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:32,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:32,816 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:37:32,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:32,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427062470] [2024-02-05 10:37:32,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427062470] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:37:32,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834005831] [2024-02-05 10:37:32,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-05 10:37:32,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:37:32,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:37:32,820 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:37:32,822 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:37:32,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-02-05 10:37:32,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-05 10:37:32,940 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-05 10:37:32,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:37:33,021 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:37:33,022 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-05 10:37:33,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834005831] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:33,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-05 10:37:33,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-02-05 10:37:33,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571161369] [2024-02-05 10:37:33,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:33,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-05 10:37:33,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:33,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-05 10:37:33,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-02-05 10:37:33,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 102 [2024-02-05 10:37:33,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 135 transitions, 1201 flow. Second operand has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 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:37:33,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:33,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 102 [2024-02-05 10:37:33,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:33,611 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], [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 (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 301#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 531#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= thread2Thread1of1ForFork1_~j~0 4) (<= 1 thread2Thread1of1ForFork1_~j~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)), 290#(and (<= thread1Thread1of1ForFork0_~i~0 3) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 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)), 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, 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)), 794#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), 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)), 1060#(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: 898#(and (<= 0 thread2Thread1of1ForFork1_~j~0) (= ~num~0 0) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 221#(and (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 4)))), Black: 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ 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)), Black: 1053#(and (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), Black: 1046#(= ~num~0 0), Black: 1221#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), Black: 1219#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 1073#(and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 645#(and (<= thread2Thread1of1ForFork1_~j~0 3) (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 141#(= ~num~0 0), 1220#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 1517#(<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0), 135#(= ~num~0 0), 64#L914-4true, 93#L893-1true, Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)))]) [2024-02-05 10:37:33,611 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2024-02-05 10:37:33,611 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-02-05 10:37:33,611 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-02-05 10:37:33,611 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-02-05 10:37:33,618 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], [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 (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 301#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), 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 (= thread2Thread1of1ForFork1_~j~0 0) (and (<= thread2Thread1of1ForFork1_~j~0 4) (<= 1 thread2Thread1of1ForFork1_~j~0))) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 290#(and (<= thread1Thread1of1ForFork0_~i~0 3) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 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)), 794#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), 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)), 1060#(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: 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 (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 4)))), Black: 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ 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)), Black: 1053#(and (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), Black: 1046#(= ~num~0 0), Black: 1221#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), Black: 1219#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 1073#(and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 645#(and (<= thread2Thread1of1ForFork1_~j~0 3) (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 141#(= ~num~0 0), 1220#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 1517#(<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0), 135#(= ~num~0 0), 93#L893-1true, Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)))]) [2024-02-05 10:37:33,618 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2024-02-05 10:37:33,618 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-02-05 10:37:33,618 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-02-05 10:37:33,618 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-02-05 10:37:33,761 INFO L124 PetriNetUnfolderBase]: 2525/6055 cut-off events. [2024-02-05 10:37:33,761 INFO L125 PetriNetUnfolderBase]: For 21807/22005 co-relation queries the response was YES. [2024-02-05 10:37:33,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20042 conditions, 6055 events. 2525/6055 cut-off events. For 21807/22005 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 38844 event pairs, 389 based on Foata normal form. 146/6099 useless extension candidates. Maximal degree in co-relation 19689. Up to 2432 conditions per place. [2024-02-05 10:37:33,798 INFO L140 encePairwiseOnDemand]: 90/102 looper letters, 117 selfloop transitions, 35 changer transitions 0/187 dead transitions. [2024-02-05 10:37:33,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 187 transitions, 1768 flow [2024-02-05 10:37:33,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-05 10:37:33,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-05 10:37:33,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 308 transitions. [2024-02-05 10:37:33,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6039215686274509 [2024-02-05 10:37:33,800 INFO L175 Difference]: Start difference. First operand has 137 places, 135 transitions, 1201 flow. Second operand 5 states and 308 transitions. [2024-02-05 10:37:33,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 187 transitions, 1768 flow [2024-02-05 10:37:33,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 187 transitions, 1652 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-02-05 10:37:33,829 INFO L231 Difference]: Finished difference. Result has 133 places, 139 transitions, 1235 flow [2024-02-05 10:37:33,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=1082, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1235, PETRI_PLACES=133, PETRI_TRANSITIONS=139} [2024-02-05 10:37:33,830 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 38 predicate places. [2024-02-05 10:37:33,830 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 139 transitions, 1235 flow [2024-02-05 10:37:33,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 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:37:33,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:33,830 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:37:33,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-02-05 10:37:34,040 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:37:34,041 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:37:34,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:34,041 INFO L85 PathProgramCache]: Analyzing trace with hash -975730855, now seen corresponding path program 1 times [2024-02-05 10:37:34,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:34,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754457976] [2024-02-05 10:37:34,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:34,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:34,194 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:37:34,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:34,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754457976] [2024-02-05 10:37:34,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754457976] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:37:34,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114118114] [2024-02-05 10:37:34,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:34,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:37:34,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:37:34,195 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:37:34,216 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:37:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:34,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-05 10:37:34,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:37:34,471 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:37:34,471 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-05 10:37:34,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114118114] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:34,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-05 10:37:34,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-02-05 10:37:34,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988207060] [2024-02-05 10:37:34,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:34,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-05 10:37:34,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:34,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-05 10:37:34,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-02-05 10:37:34,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 102 [2024-02-05 10:37:34,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 139 transitions, 1235 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:37:34,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:34,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 102 [2024-02-05 10:37:34,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:35,146 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][105], [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 (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 301#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 531#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= thread2Thread1of1ForFork1_~j~0 4) (<= 1 thread2Thread1of1ForFork1_~j~0))) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 290#(and (<= thread1Thread1of1ForFork0_~i~0 3) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 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))), 794#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), 1577#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 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))), 21#L893true, 121#(and (= |thread2Thread1of1ForFork1_#in~arg.base| 0) (= |thread2Thread1of1ForFork1_#in~arg.offset| 0) (= thread2Thread1of1ForFork1_~arg.base 0) (= thread2Thread1of1ForFork1_~arg.offset 0)), 1060#(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: 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: 1564#(and (or (and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0)) (= thread2Thread1of1ForFork1_~j~0 0)) (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 221#(and (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 4)))), Black: 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 1548#(and (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 104#(and (= ~total~0 0) (= ~flag~0 0) (= ~num~0 0)), Black: 1053#(and (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), Black: 1046#(= ~num~0 0), Black: 1219#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 1073#(and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 645#(and (<= thread2Thread1of1ForFork1_~j~0 3) (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 141#(= ~num~0 0), 1220#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 1517#(<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0), 135#(= ~num~0 0), 64#L914-4true, Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)))]) [2024-02-05 10:37:35,146 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2024-02-05 10:37:35,146 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-02-05 10:37:35,146 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-02-05 10:37:35,146 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-02-05 10:37:35,207 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][105], [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 (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 301#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 531#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= thread2Thread1of1ForFork1_~j~0 4) (<= 1 thread2Thread1of1ForFork1_~j~0))) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 290#(and (<= thread1Thread1of1ForFork0_~i~0 3) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 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, 794#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), 1577#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 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))), 21#L893true, 19#L915-1true, 121#(and (= |thread2Thread1of1ForFork1_#in~arg.base| 0) (= |thread2Thread1of1ForFork1_#in~arg.offset| 0) (= thread2Thread1of1ForFork1_~arg.base 0) (= thread2Thread1of1ForFork1_~arg.offset 0)), 1060#(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: 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: 1564#(and (or (and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0)) (= thread2Thread1of1ForFork1_~j~0 0)) (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 221#(and (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 4)))), Black: 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 1548#(and (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 104#(and (= ~total~0 0) (= ~flag~0 0) (= ~num~0 0)), Black: 1053#(and (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), Black: 1046#(= ~num~0 0), Black: 1219#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 1073#(and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 645#(and (<= thread2Thread1of1ForFork1_~j~0 3) (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 141#(= ~num~0 0), 1220#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 1517#(<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0), 135#(= ~num~0 0), Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)))]) [2024-02-05 10:37:35,207 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2024-02-05 10:37:35,207 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-02-05 10:37:35,207 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-02-05 10:37:35,207 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-02-05 10:37:35,213 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][105], [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 (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 301#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 531#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= thread2Thread1of1ForFork1_~j~0 4) (<= 1 thread2Thread1of1ForFork1_~j~0))) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 290#(and (<= thread1Thread1of1ForFork0_~i~0 3) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 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))), 794#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), 1577#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 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)), 1060#(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: 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: 1564#(and (or (and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0)) (= thread2Thread1of1ForFork1_~j~0 0)) (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 221#(and (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 4)))), Black: 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 1548#(and (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 104#(and (= ~total~0 0) (= ~flag~0 0) (= ~num~0 0)), Black: 1053#(and (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), Black: 1046#(= ~num~0 0), Black: 1219#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 1073#(and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 645#(and (<= thread2Thread1of1ForFork1_~j~0 3) (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 141#(= ~num~0 0), 1220#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 1517#(<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0), 135#(= ~num~0 0), 64#L914-4true, 93#L893-1true, Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)))]) [2024-02-05 10:37:35,213 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2024-02-05 10:37:35,213 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-02-05 10:37:35,213 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-02-05 10:37:35,213 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-02-05 10:37:35,218 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][105], [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 (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 301#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 531#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= thread2Thread1of1ForFork1_~j~0 4) (<= 1 thread2Thread1of1ForFork1_~j~0))) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 290#(and (<= thread1Thread1of1ForFork0_~i~0 3) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 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, 794#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), 1577#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 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)), 1060#(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: 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: 1564#(and (or (and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0)) (= thread2Thread1of1ForFork1_~j~0 0)) (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 221#(and (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 4)))), Black: 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 1548#(and (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 104#(and (= ~total~0 0) (= ~flag~0 0) (= ~num~0 0)), Black: 1053#(and (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), Black: 1046#(= ~num~0 0), Black: 1219#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 1073#(and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 645#(and (<= thread2Thread1of1ForFork1_~j~0 3) (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 141#(= ~num~0 0), 1220#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 1517#(<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0), 135#(= ~num~0 0), 93#L893-1true, Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)))]) [2024-02-05 10:37:35,218 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2024-02-05 10:37:35,218 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-02-05 10:37:35,218 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-02-05 10:37:35,218 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-02-05 10:37:35,356 INFO L124 PetriNetUnfolderBase]: 3127/6918 cut-off events. [2024-02-05 10:37:35,356 INFO L125 PetriNetUnfolderBase]: For 24103/24331 co-relation queries the response was YES. [2024-02-05 10:37:35,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23949 conditions, 6918 events. 3127/6918 cut-off events. For 24103/24331 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 43144 event pairs, 666 based on Foata normal form. 162/6970 useless extension candidates. Maximal degree in co-relation 23580. Up to 1417 conditions per place. [2024-02-05 10:37:35,389 INFO L140 encePairwiseOnDemand]: 92/102 looper letters, 179 selfloop transitions, 32 changer transitions 1/239 dead transitions. [2024-02-05 10:37:35,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 239 transitions, 2299 flow [2024-02-05 10:37:35,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-05 10:37:35,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-05 10:37:35,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 394 transitions. [2024-02-05 10:37:35,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5518207282913166 [2024-02-05 10:37:35,391 INFO L175 Difference]: Start difference. First operand has 133 places, 139 transitions, 1235 flow. Second operand 7 states and 394 transitions. [2024-02-05 10:37:35,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 239 transitions, 2299 flow [2024-02-05 10:37:35,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 239 transitions, 2251 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-02-05 10:37:35,416 INFO L231 Difference]: Finished difference. Result has 136 places, 142 transitions, 1317 flow [2024-02-05 10:37:35,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1317, PETRI_PLACES=136, PETRI_TRANSITIONS=142} [2024-02-05 10:37:35,416 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 41 predicate places. [2024-02-05 10:37:35,416 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 142 transitions, 1317 flow [2024-02-05 10:37:35,417 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:37:35,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:35,417 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:37:35,428 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:37:35,617 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:37:35,617 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:37:35,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:35,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1262913583, now seen corresponding path program 1 times [2024-02-05 10:37:35,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:35,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962284735] [2024-02-05 10:37:35,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:35,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:35,732 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-02-05 10:37:35,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:35,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962284735] [2024-02-05 10:37:35,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962284735] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:35,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:37:35,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-05 10:37:35,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517702237] [2024-02-05 10:37:35,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:35,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:37:35,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:35,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:37:35,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-02-05 10:37:35,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 102 [2024-02-05 10:37:35,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 142 transitions, 1317 flow. Second operand has 6 states, 6 states have (on average 58.833333333333336) internal successors, (353), 6 states have internal predecessors, (353), 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:37:35,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:35,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 102 [2024-02-05 10:37:35,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:36,395 INFO L124 PetriNetUnfolderBase]: 2576/5938 cut-off events. [2024-02-05 10:37:36,396 INFO L125 PetriNetUnfolderBase]: For 25225/25419 co-relation queries the response was YES. [2024-02-05 10:37:36,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21134 conditions, 5938 events. 2576/5938 cut-off events. For 25225/25419 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 37564 event pairs, 415 based on Foata normal form. 182/5958 useless extension candidates. Maximal degree in co-relation 20818. Up to 3173 conditions per place. [2024-02-05 10:37:36,431 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 137 selfloop transitions, 15 changer transitions 0/190 dead transitions. [2024-02-05 10:37:36,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 190 transitions, 1972 flow [2024-02-05 10:37:36,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-05 10:37:36,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-05 10:37:36,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 338 transitions. [2024-02-05 10:37:36,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6627450980392157 [2024-02-05 10:37:36,432 INFO L175 Difference]: Start difference. First operand has 136 places, 142 transitions, 1317 flow. Second operand 5 states and 338 transitions. [2024-02-05 10:37:36,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 190 transitions, 1972 flow [2024-02-05 10:37:36,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 190 transitions, 1866 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-02-05 10:37:36,457 INFO L231 Difference]: Finished difference. Result has 134 places, 141 transitions, 1273 flow [2024-02-05 10:37:36,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1273, PETRI_PLACES=134, PETRI_TRANSITIONS=141} [2024-02-05 10:37:36,458 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 39 predicate places. [2024-02-05 10:37:36,458 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 141 transitions, 1273 flow [2024-02-05 10:37:36,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.833333333333336) internal successors, (353), 6 states have internal predecessors, (353), 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:37:36,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:36,458 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:37:36,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-02-05 10:37:36,459 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:37:36,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:36,459 INFO L85 PathProgramCache]: Analyzing trace with hash -591614232, now seen corresponding path program 1 times [2024-02-05 10:37:36,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:36,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544907293] [2024-02-05 10:37:36,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:36,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:36,587 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-02-05 10:37:36,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:36,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544907293] [2024-02-05 10:37:36,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544907293] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:36,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:37:36,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-05 10:37:36,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809626807] [2024-02-05 10:37:36,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:36,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:37:36,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:36,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:37:36,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-02-05 10:37:36,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 102 [2024-02-05 10:37:36,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 141 transitions, 1273 flow. Second operand has 6 states, 6 states have (on average 57.166666666666664) internal successors, (343), 6 states have internal predecessors, (343), 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:37:36,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:36,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 102 [2024-02-05 10:37:36,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:37,145 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], [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 (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 301#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 531#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= thread2Thread1of1ForFork1_~j~0 4) (<= 1 thread2Thread1of1ForFork1_~j~0))) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 290#(and (<= thread1Thread1of1ForFork0_~i~0 3) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 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, 794#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), 1765#(and (<= thread1Thread1of1ForFork0_~i~0 3) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 1577#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 653#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 21#L893true, 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)), 1060#(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: 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 (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 4)))), Black: 1564#(and (or (and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0)) (= thread2Thread1of1ForFork1_~j~0 0)) (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 1548#(and (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 104#(and (= ~total~0 0) (= ~flag~0 0) (= ~num~0 0)), Black: 1053#(and (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), Black: 1046#(= ~num~0 0), 1771#(and (<= thread2Thread1of1ForFork1_~j~0 3) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 1219#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 1073#(and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 645#(and (<= thread2Thread1of1ForFork1_~j~0 3) (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 141#(= ~num~0 0), 135#(= ~num~0 0), 64#L914-4true, Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)))]) [2024-02-05 10:37:37,145 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2024-02-05 10:37:37,145 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-02-05 10:37:37,145 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-02-05 10:37:37,145 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-02-05 10:37:37,150 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], [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 (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 301#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 531#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= thread2Thread1of1ForFork1_~j~0 4) (<= 1 thread2Thread1of1ForFork1_~j~0))) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 290#(and (<= thread1Thread1of1ForFork0_~i~0 3) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 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))), 794#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), 1765#(and (<= thread1Thread1of1ForFork0_~i~0 3) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 1577#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 653#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 405#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 21#L893true, 19#L915-1true, 121#(and (= |thread2Thread1of1ForFork1_#in~arg.base| 0) (= |thread2Thread1of1ForFork1_#in~arg.offset| 0) (= thread2Thread1of1ForFork1_~arg.base 0) (= thread2Thread1of1ForFork1_~arg.offset 0)), 1060#(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: 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: 1564#(and (or (and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0)) (= thread2Thread1of1ForFork1_~j~0 0)) (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 221#(and (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 4)))), Black: 1548#(and (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ 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)), Black: 1053#(and (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), Black: 1046#(= ~num~0 0), 1771#(and (<= thread2Thread1of1ForFork1_~j~0 3) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 1219#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 1073#(and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 645#(and (<= thread2Thread1of1ForFork1_~j~0 3) (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 141#(= ~num~0 0), 135#(= ~num~0 0), Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)))]) [2024-02-05 10:37:37,150 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2024-02-05 10:37:37,150 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-02-05 10:37:37,150 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-02-05 10:37:37,150 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-02-05 10:37:37,154 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], [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 (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 301#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 531#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= thread2Thread1of1ForFork1_~j~0 4) (<= 1 thread2Thread1of1ForFork1_~j~0))) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 290#(and (<= thread1Thread1of1ForFork0_~i~0 3) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 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))), 794#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), 1765#(and (<= thread1Thread1of1ForFork0_~i~0 3) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 1577#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 653#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 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)), 1060#(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: 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 (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 4)))), Black: 1564#(and (or (and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0)) (= thread2Thread1of1ForFork1_~j~0 0)) (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 1548#(and (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 104#(and (= ~total~0 0) (= ~flag~0 0) (= ~num~0 0)), Black: 1053#(and (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), Black: 1046#(= ~num~0 0), 1771#(and (<= thread2Thread1of1ForFork1_~j~0 3) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 1219#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 1073#(and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 645#(and (<= thread2Thread1of1ForFork1_~j~0 3) (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 141#(= ~num~0 0), 135#(= ~num~0 0), 64#L914-4true, 93#L893-1true, Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)))]) [2024-02-05 10:37:37,154 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2024-02-05 10:37:37,154 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-02-05 10:37:37,154 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-02-05 10:37:37,154 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-02-05 10:37:37,159 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], [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 (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 301#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 531#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= thread2Thread1of1ForFork1_~j~0 4) (<= 1 thread2Thread1of1ForFork1_~j~0))) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 290#(and (<= thread1Thread1of1ForFork0_~i~0 3) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 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, 794#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), 1765#(and (<= thread1Thread1of1ForFork0_~i~0 3) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 1577#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 653#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 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)), 1060#(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: 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: 1564#(and (or (and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0)) (= thread2Thread1of1ForFork1_~j~0 0)) (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 221#(and (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 4)))), Black: 1548#(and (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ 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)), Black: 1053#(and (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), Black: 1046#(= ~num~0 0), 1771#(and (<= thread2Thread1of1ForFork1_~j~0 3) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 1219#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 1073#(and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 645#(and (<= thread2Thread1of1ForFork1_~j~0 3) (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 141#(= ~num~0 0), 135#(= ~num~0 0), 93#L893-1true, Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)))]) [2024-02-05 10:37:37,159 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2024-02-05 10:37:37,159 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-02-05 10:37:37,159 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-02-05 10:37:37,159 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-02-05 10:37:37,281 INFO L124 PetriNetUnfolderBase]: 2451/5656 cut-off events. [2024-02-05 10:37:37,281 INFO L125 PetriNetUnfolderBase]: For 24934/25228 co-relation queries the response was YES. [2024-02-05 10:37:37,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19914 conditions, 5656 events. 2451/5656 cut-off events. For 24934/25228 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 35621 event pairs, 472 based on Foata normal form. 280/5748 useless extension candidates. Maximal degree in co-relation 19574. Up to 3064 conditions per place. [2024-02-05 10:37:37,310 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 120 selfloop transitions, 16 changer transitions 0/178 dead transitions. [2024-02-05 10:37:37,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 178 transitions, 1826 flow [2024-02-05 10:37:37,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-05 10:37:37,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-05 10:37:37,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 325 transitions. [2024-02-05 10:37:37,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6372549019607843 [2024-02-05 10:37:37,311 INFO L175 Difference]: Start difference. First operand has 134 places, 141 transitions, 1273 flow. Second operand 5 states and 325 transitions. [2024-02-05 10:37:37,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 178 transitions, 1826 flow [2024-02-05 10:37:37,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 178 transitions, 1762 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-02-05 10:37:37,333 INFO L231 Difference]: Finished difference. Result has 131 places, 138 transitions, 1253 flow [2024-02-05 10:37:37,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=1221, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1253, PETRI_PLACES=131, PETRI_TRANSITIONS=138} [2024-02-05 10:37:37,333 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 36 predicate places. [2024-02-05 10:37:37,333 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 138 transitions, 1253 flow [2024-02-05 10:37:37,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 57.166666666666664) internal successors, (343), 6 states have internal predecessors, (343), 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:37:37,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:37,334 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:37:37,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-02-05 10:37:37,334 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:37:37,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:37,335 INFO L85 PathProgramCache]: Analyzing trace with hash 191862386, now seen corresponding path program 1 times [2024-02-05 10:37:37,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:37,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919110366] [2024-02-05 10:37:37,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:37,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:37,539 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 8 proven. 75 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-02-05 10:37:37,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:37,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919110366] [2024-02-05 10:37:37,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919110366] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:37:37,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765357040] [2024-02-05 10:37:37,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:37,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:37:37,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:37:37,569 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:37:37,571 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:37:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:37,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-05 10:37:37,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:37:37,793 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 8 proven. 75 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-02-05 10:37:37,793 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:37:37,881 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 8 proven. 75 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-02-05 10:37:37,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765357040] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:37:37,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:37:37,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-02-05 10:37:37,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762707013] [2024-02-05 10:37:37,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:37:37,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-05 10:37:37,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:37,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-05 10:37:37,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-02-05 10:37:37,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 102 [2024-02-05 10:37:37,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 138 transitions, 1253 flow. Second operand has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 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:37:37,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:37,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 102 [2024-02-05 10:37:37,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:38,628 INFO L124 PetriNetUnfolderBase]: 2945/6675 cut-off events. [2024-02-05 10:37:38,628 INFO L125 PetriNetUnfolderBase]: For 27475/27667 co-relation queries the response was YES. [2024-02-05 10:37:38,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23533 conditions, 6675 events. 2945/6675 cut-off events. For 27475/27667 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 40979 event pairs, 540 based on Foata normal form. 156/6630 useless extension candidates. Maximal degree in co-relation 23219. Up to 1673 conditions per place. [2024-02-05 10:37:38,670 INFO L140 encePairwiseOnDemand]: 98/102 looper letters, 216 selfloop transitions, 15 changer transitions 0/266 dead transitions. [2024-02-05 10:37:38,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 266 transitions, 2748 flow [2024-02-05 10:37:38,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-05 10:37:38,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-05 10:37:38,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 456 transitions. [2024-02-05 10:37:38,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7450980392156863 [2024-02-05 10:37:38,671 INFO L175 Difference]: Start difference. First operand has 131 places, 138 transitions, 1253 flow. Second operand 6 states and 456 transitions. [2024-02-05 10:37:38,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 266 transitions, 2748 flow [2024-02-05 10:37:38,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 266 transitions, 2682 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-02-05 10:37:38,698 INFO L231 Difference]: Finished difference. Result has 134 places, 143 transitions, 1332 flow [2024-02-05 10:37:38,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=1216, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1332, PETRI_PLACES=134, PETRI_TRANSITIONS=143} [2024-02-05 10:37:38,698 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 39 predicate places. [2024-02-05 10:37:38,698 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 143 transitions, 1332 flow [2024-02-05 10:37:38,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 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:37:38,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:38,699 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:37:38,713 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:37:38,900 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,SelfDestructingSolverStorable24 [2024-02-05 10:37:38,900 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-02-05 10:37:38,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:38,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1609983700, now seen corresponding path program 2 times [2024-02-05 10:37:38,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:38,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476558504] [2024-02-05 10:37:38,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:38,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 46 proven. 82 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-05 10:37:39,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:39,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476558504] [2024-02-05 10:37:39,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476558504] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:37:39,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935019481] [2024-02-05 10:37:39,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-05 10:37:39,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:37:39,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:37:39,053 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:37:39,088 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:37:39,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-05 10:37:39,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-05 10:37:39,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-05 10:37:39,238 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:37:39,294 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 46 proven. 82 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-05 10:37:39,294 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:37:39,368 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 46 proven. 82 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-05 10:37:39,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935019481] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:37:39,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:37:39,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-02-05 10:37:39,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378230876] [2024-02-05 10:37:39,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:37:39,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-05 10:37:39,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:39,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-05 10:37:39,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-02-05 10:37:39,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 102 [2024-02-05 10:37:39,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 143 transitions, 1332 flow. Second operand has 7 states, 7 states have (on average 67.42857142857143) internal successors, (472), 7 states have internal predecessors, (472), 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:37:39,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:39,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 102 [2024-02-05 10:37:39,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:40,112 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][197], [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 (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 301#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 531#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= thread2Thread1of1ForFork1_~j~0 4) (<= 1 thread2Thread1of1ForFork1_~j~0))) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 1779#(<= thread1Thread1of1ForFork0_~i~0 3), Black: 1774#true, 290#(and (<= thread1Thread1of1ForFork0_~i~0 3) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 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))), 794#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), 1577#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 653#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 21#L893true, 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)), 1060#(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: 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: 1564#(and (or (and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0)) (= thread2Thread1of1ForFork1_~j~0 0)) (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 221#(and (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 4)))), Black: 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 1548#(and (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 2448#(<= thread2Thread1of1ForFork1_~j~0 3), Black: 104#(and (= ~total~0 0) (= ~flag~0 0) (= ~num~0 0)), Black: 1053#(and (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), Black: 1046#(= ~num~0 0), Black: 1219#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 1073#(and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 645#(and (<= thread2Thread1of1ForFork1_~j~0 3) (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 141#(= ~num~0 0), 135#(= ~num~0 0), 64#L914-4true]) [2024-02-05 10:37:40,112 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2024-02-05 10:37:40,112 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-02-05 10:37:40,112 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-02-05 10:37:40,112 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-02-05 10:37:40,126 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][197], [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 (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 301#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 531#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= thread2Thread1of1ForFork1_~j~0 4) (<= 1 thread2Thread1of1ForFork1_~j~0))) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 1779#(<= thread1Thread1of1ForFork0_~i~0 3), Black: 1774#true, 290#(and (<= thread1Thread1of1ForFork0_~i~0 3) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 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))), 794#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), 1577#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 653#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 405#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 21#L893true, 19#L915-1true, 121#(and (= |thread2Thread1of1ForFork1_#in~arg.base| 0) (= |thread2Thread1of1ForFork1_#in~arg.offset| 0) (= thread2Thread1of1ForFork1_~arg.base 0) (= thread2Thread1of1ForFork1_~arg.offset 0)), 1060#(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: 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: 1564#(and (or (and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0)) (= thread2Thread1of1ForFork1_~j~0 0)) (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 221#(and (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 4)))), Black: 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 1548#(and (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 2448#(<= thread2Thread1of1ForFork1_~j~0 3), Black: 104#(and (= ~total~0 0) (= ~flag~0 0) (= ~num~0 0)), Black: 1053#(and (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), Black: 1046#(= ~num~0 0), Black: 1219#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 1073#(and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 645#(and (<= thread2Thread1of1ForFork1_~j~0 3) (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 141#(= ~num~0 0), 135#(= ~num~0 0)]) [2024-02-05 10:37:40,127 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2024-02-05 10:37:40,127 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-02-05 10:37:40,127 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-02-05 10:37:40,127 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-02-05 10:37:40,132 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][197], [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 (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 301#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 531#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= thread2Thread1of1ForFork1_~j~0 4) (<= 1 thread2Thread1of1ForFork1_~j~0))) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 1779#(<= thread1Thread1of1ForFork0_~i~0 3), Black: 1774#true, 290#(and (<= thread1Thread1of1ForFork0_~i~0 3) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 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))), 794#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), 1577#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 653#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 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)), 1060#(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: 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: 1564#(and (or (and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0)) (= thread2Thread1of1ForFork1_~j~0 0)) (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 221#(and (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 4)))), Black: 1548#(and (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 2448#(<= thread2Thread1of1ForFork1_~j~0 3), Black: 104#(and (= ~total~0 0) (= ~flag~0 0) (= ~num~0 0)), Black: 1053#(and (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), Black: 1046#(= ~num~0 0), Black: 1219#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 1073#(and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 645#(and (<= thread2Thread1of1ForFork1_~j~0 3) (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 141#(= ~num~0 0), 135#(= ~num~0 0), 64#L914-4true, 93#L893-1true]) [2024-02-05 10:37:40,132 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2024-02-05 10:37:40,132 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-02-05 10:37:40,132 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-02-05 10:37:40,132 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-02-05 10:37:40,138 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][197], [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 (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 301#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 531#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= thread2Thread1of1ForFork1_~j~0 4) (<= 1 thread2Thread1of1ForFork1_~j~0))) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 1779#(<= thread1Thread1of1ForFork0_~i~0 3), Black: 1774#true, 290#(and (<= thread1Thread1of1ForFork0_~i~0 3) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 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, 794#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), 1577#(and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 653#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 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)), 1060#(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: 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: 1564#(and (or (and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0)) (= thread2Thread1of1ForFork1_~j~0 0)) (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 221#(and (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 4)))), Black: 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 1548#(and (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 2448#(<= thread2Thread1of1ForFork1_~j~0 3), Black: 104#(and (= ~total~0 0) (= ~flag~0 0) (= ~num~0 0)), Black: 1053#(and (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), Black: 1046#(= ~num~0 0), Black: 1219#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 1073#(and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 645#(and (<= thread2Thread1of1ForFork1_~j~0 3) (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 141#(= ~num~0 0), 135#(= ~num~0 0), 93#L893-1true]) [2024-02-05 10:37:40,138 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-02-05 10:37:40,138 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-02-05 10:37:40,138 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-02-05 10:37:40,138 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-02-05 10:37:40,267 INFO L124 PetriNetUnfolderBase]: 2996/6979 cut-off events. [2024-02-05 10:37:40,267 INFO L125 PetriNetUnfolderBase]: For 33737/34097 co-relation queries the response was YES. [2024-02-05 10:37:40,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24694 conditions, 6979 events. 2996/6979 cut-off events. For 33737/34097 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 43877 event pairs, 634 based on Foata normal form. 192/6959 useless extension candidates. Maximal degree in co-relation 24356. Up to 1525 conditions per place. [2024-02-05 10:37:40,308 INFO L140 encePairwiseOnDemand]: 98/102 looper letters, 213 selfloop transitions, 16 changer transitions 0/273 dead transitions. [2024-02-05 10:37:40,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 273 transitions, 2924 flow [2024-02-05 10:37:40,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-05 10:37:40,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-05 10:37:40,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 452 transitions. [2024-02-05 10:37:40,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.738562091503268 [2024-02-05 10:37:40,310 INFO L175 Difference]: Start difference. First operand has 134 places, 143 transitions, 1332 flow. Second operand 6 states and 452 transitions. [2024-02-05 10:37:40,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 273 transitions, 2924 flow [2024-02-05 10:37:40,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 273 transitions, 2904 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:37:40,336 INFO L231 Difference]: Finished difference. Result has 139 places, 148 transitions, 1439 flow [2024-02-05 10:37:40,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=1322, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1439, PETRI_PLACES=139, PETRI_TRANSITIONS=148} [2024-02-05 10:37:40,337 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 44 predicate places. [2024-02-05 10:37:40,337 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 148 transitions, 1439 flow [2024-02-05 10:37:40,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 67.42857142857143) internal successors, (472), 7 states have internal predecessors, (472), 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:37:40,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:40,337 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 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:37:40,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-02-05 10:37:40,541 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,SelfDestructingSolverStorable25 [2024-02-05 10:37:40,541 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:37:40,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:40,541 INFO L85 PathProgramCache]: Analyzing trace with hash -982179963, now seen corresponding path program 3 times [2024-02-05 10:37:40,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:40,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742156639] [2024-02-05 10:37:40,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:40,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:41,017 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 4 proven. 163 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-02-05 10:37:41,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:41,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742156639] [2024-02-05 10:37:41,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742156639] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:37:41,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206737383] [2024-02-05 10:37:41,018 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-05 10:37:41,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:37:41,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:37:41,061 INFO L229 MonitoredProcess]: Starting monitored process 14 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:37:41,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-02-05 10:37:41,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-02-05 10:37:41,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-05 10:37:41,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 23 conjunts are in the unsatisfiable core [2024-02-05 10:37:41,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:37:41,635 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-05 10:37:41,635 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:37:42,206 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-05 10:37:42,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206737383] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:37:42,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:37:42,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 33 [2024-02-05 10:37:42,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768134639] [2024-02-05 10:37:42,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:37:42,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-02-05 10:37:42,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:42,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-02-05 10:37:42,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2024-02-05 10:37:44,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 102 [2024-02-05 10:37:44,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 148 transitions, 1439 flow. Second operand has 33 states, 33 states have (on average 58.121212121212125) internal successors, (1918), 33 states have internal predecessors, (1918), 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:37:44,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:44,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 102 [2024-02-05 10:37:44,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:46,210 INFO L124 PetriNetUnfolderBase]: 2780/6639 cut-off events. [2024-02-05 10:37:46,210 INFO L125 PetriNetUnfolderBase]: For 34148/34468 co-relation queries the response was YES. [2024-02-05 10:37:46,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23604 conditions, 6639 events. 2780/6639 cut-off events. For 34148/34468 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 41823 event pairs, 434 based on Foata normal form. 199/6628 useless extension candidates. Maximal degree in co-relation 23260. Up to 1118 conditions per place. [2024-02-05 10:37:46,240 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 0 selfloop transitions, 0 changer transitions 309/309 dead transitions. [2024-02-05 10:37:46,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 309 transitions, 3225 flow [2024-02-05 10:37:46,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-05 10:37:46,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-05 10:37:46,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 777 transitions. [2024-02-05 10:37:46,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6348039215686274 [2024-02-05 10:37:46,241 INFO L175 Difference]: Start difference. First operand has 139 places, 148 transitions, 1439 flow. Second operand 12 states and 777 transitions. [2024-02-05 10:37:46,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 309 transitions, 3225 flow [2024-02-05 10:37:46,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 309 transitions, 3209 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-05 10:37:46,273 INFO L231 Difference]: Finished difference. Result has 145 places, 0 transitions, 0 flow [2024-02-05 10:37:46,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=1384, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=0, PETRI_PLACES=145, PETRI_TRANSITIONS=0} [2024-02-05 10:37:46,273 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 50 predicate places. [2024-02-05 10:37:46,273 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 0 transitions, 0 flow [2024-02-05 10:37:46,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 58.121212121212125) internal successors, (1918), 33 states have internal predecessors, (1918), 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:37:46,276 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 55 remaining) [2024-02-05 10:37:46,276 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 55 remaining) [2024-02-05 10:37:46,276 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 55 remaining) [2024-02-05 10:37:46,277 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 55 remaining) [2024-02-05 10:37:46,277 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 55 remaining) [2024-02-05 10:37:46,277 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 55 remaining) [2024-02-05 10:37:46,277 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 55 remaining) [2024-02-05 10:37:46,277 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 55 remaining) [2024-02-05 10:37:46,277 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 55 remaining) [2024-02-05 10:37:46,277 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 55 remaining) [2024-02-05 10:37:46,277 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 55 remaining) [2024-02-05 10:37:46,277 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 55 remaining) [2024-02-05 10:37:46,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 55 remaining) [2024-02-05 10:37:46,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 55 remaining) [2024-02-05 10:37:46,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 55 remaining) [2024-02-05 10:37:46,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 55 remaining) [2024-02-05 10:37:46,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 55 remaining) [2024-02-05 10:37:46,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 55 remaining) [2024-02-05 10:37:46,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 55 remaining) [2024-02-05 10:37:46,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 55 remaining) [2024-02-05 10:37:46,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 55 remaining) [2024-02-05 10:37:46,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 55 remaining) [2024-02-05 10:37:46,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 55 remaining) [2024-02-05 10:37:46,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 55 remaining) [2024-02-05 10:37:46,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 55 remaining) [2024-02-05 10:37:46,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 55 remaining) [2024-02-05 10:37:46,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 55 remaining) [2024-02-05 10:37:46,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 55 remaining) [2024-02-05 10:37:46,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 55 remaining) [2024-02-05 10:37:46,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (25 of 55 remaining) [2024-02-05 10:37:46,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 55 remaining) [2024-02-05 10:37:46,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 55 remaining) [2024-02-05 10:37:46,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 55 remaining) [2024-02-05 10:37:46,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 55 remaining) [2024-02-05 10:37:46,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 55 remaining) [2024-02-05 10:37:46,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 55 remaining) [2024-02-05 10:37:46,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 55 remaining) [2024-02-05 10:37:46,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 55 remaining) [2024-02-05 10:37:46,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 55 remaining) [2024-02-05 10:37:46,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 55 remaining) [2024-02-05 10:37:46,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 55 remaining) [2024-02-05 10:37:46,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 55 remaining) [2024-02-05 10:37:46,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 55 remaining) [2024-02-05 10:37:46,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 55 remaining) [2024-02-05 10:37:46,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 55 remaining) [2024-02-05 10:37:46,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 55 remaining) [2024-02-05 10:37:46,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 55 remaining) [2024-02-05 10:37:46,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 55 remaining) [2024-02-05 10:37:46,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 55 remaining) [2024-02-05 10:37:46,281 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 55 remaining) [2024-02-05 10:37:46,281 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 55 remaining) [2024-02-05 10:37:46,281 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 55 remaining) [2024-02-05 10:37:46,281 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 55 remaining) [2024-02-05 10:37:46,281 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 55 remaining) [2024-02-05 10:37:46,281 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 55 remaining) [2024-02-05 10:37:46,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-02-05 10:37:46,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-02-05 10:37:46,493 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:37:46,497 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-05 10:37:46,497 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-05 10:37:46,500 INFO L503 ceAbstractionStarter]: Automizer considered 29 witness invariants [2024-02-05 10:37:46,500 INFO L504 ceAbstractionStarter]: WitnessConsidered=29 [2024-02-05 10:37:46,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:37:46 BasicIcfg [2024-02-05 10:37:46,501 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-05 10:37:46,501 INFO L158 Benchmark]: Toolchain (without parser) took 33703.16ms. Allocated memory was 159.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 99.9MB in the beginning and 947.9MB in the end (delta: -848.0MB). Peak memory consumption was 669.3MB. Max. memory is 16.1GB. [2024-02-05 10:37:46,501 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 111.1MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-05 10:37:46,502 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 111.1MB. Free memory is still 75.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-05 10:37:46,502 INFO L158 Benchmark]: CACSL2BoogieTranslator took 642.83ms. Allocated memory is still 159.4MB. Free memory was 99.2MB in the beginning and 51.7MB in the end (delta: 47.5MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-02-05 10:37:46,502 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.94ms. Allocated memory is still 159.4MB. Free memory was 51.7MB in the beginning and 48.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-05 10:37:46,502 INFO L158 Benchmark]: Boogie Preprocessor took 116.91ms. Allocated memory is still 159.4MB. Free memory was 48.9MB in the beginning and 127.5MB in the end (delta: -78.7MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2024-02-05 10:37:46,502 INFO L158 Benchmark]: RCFGBuilder took 660.65ms. Allocated memory is still 159.4MB. Free memory was 127.5MB in the beginning and 63.7MB in the end (delta: 63.8MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-02-05 10:37:46,503 INFO L158 Benchmark]: TraceAbstraction took 32212.61ms. Allocated memory was 159.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 62.8MB in the beginning and 947.9MB in the end (delta: -885.2MB). Peak memory consumption was 629.8MB. Max. memory is 16.1GB. [2024-02-05 10:37:46,503 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.15ms. Allocated memory is still 111.1MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 111.1MB. Free memory is still 75.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 642.83ms. Allocated memory is still 159.4MB. Free memory was 99.2MB in the beginning and 51.7MB in the end (delta: 47.5MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.94ms. Allocated memory is still 159.4MB. Free memory was 51.7MB in the beginning and 48.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 116.91ms. Allocated memory is still 159.4MB. Free memory was 48.9MB in the beginning and 127.5MB in the end (delta: -78.7MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * RCFGBuilder took 660.65ms. Allocated memory is still 159.4MB. Free memory was 127.5MB in the beginning and 63.7MB in the end (delta: 63.8MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * TraceAbstraction took 32212.61ms. Allocated memory was 159.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 62.8MB in the beginning and 947.9MB in the end (delta: -885.2MB). Peak memory consumption was 629.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 877]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 878]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 887]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 879]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 880]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 882]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 881]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 883]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 884]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 885]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 891]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 892]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 902]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 893]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 903]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 904]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 894]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 896]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 895]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 897]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 898]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 899]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 900]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 908]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 909]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 910]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 911]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 912]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 913]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 919]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - 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.1s, OverallIterations: 27, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 20.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5148 SdHoareTripleChecker+Valid, 7.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4098 mSDsluCounter, 862 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 560 mSDsCounter, 466 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15938 IncrementalHoareTripleChecker+Invalid, 16404 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 466 mSolverCounterUnsat, 302 mSDtfsCounter, 15938 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1367 GetRequests, 1212 SyntacticMatches, 16 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1439occurred in iteration=26, InterpolantAutomatonStates: 140, 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.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 2037 NumberOfCodeBlocks, 2014 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 2428 ConstructedInterpolants, 0 QuantifiedInterpolants, 17148 SizeOfPredicates, 6 NumberOfNonLiveVariables, 5294 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 45 InterpolantComputations, 22 PerfectInterpolantSequences, 471/1528 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 - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-02-05 10:37:46,530 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 Result: TRUE