./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.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/arithmetic_prog_ok.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fced0e87 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.2023-12-19_14-39-08.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-wip.fs.extract-columns-fced0e8-m [2024-01-31 16:12:27,540 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 16:12:27,587 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 16:12:27,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 16:12:27,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 16:12:27,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 16:12:27,617 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 16:12:27,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 16:12:27,618 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 16:12:27,621 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 16:12:27,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 16:12:27,622 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 16:12:27,623 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 16:12:27,624 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 16:12:27,624 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 16:12:27,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 16:12:27,625 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 16:12:27,625 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 16:12:27,625 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 16:12:27,625 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 16:12:27,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 16:12:27,626 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 16:12:27,626 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 16:12:27,626 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 16:12:27,626 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 16:12:27,626 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 16:12:27,627 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 16:12:27,627 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 16:12:27,627 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 16:12:27,627 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 16:12:27,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 16:12:27,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 16:12:27,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:12:27,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 16:12:27,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 16:12:27,629 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 16:12:27,629 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 16:12:27,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 16:12:27,630 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 16:12:27,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 16:12:27,630 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 16:12:27,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 16:12:27,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 16:12:27,630 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-31 16:12:27,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 16:12:27,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 16:12:27,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 16:12:27,848 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 16:12:27,849 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 16:12:27,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/arithmetic_prog_ok.yml/witness.yml [2024-01-31 16:12:27,980 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 16:12:27,980 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 16:12:27,982 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-01-31 16:12:29,136 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 16:12:29,295 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 16:12:29,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_ok.i [2024-01-31 16:12:29,307 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ee1e06aa/1a7da9006b6941869b6de525ba5909db/FLAG397531608 [2024-01-31 16:12:29,320 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ee1e06aa/1a7da9006b6941869b6de525ba5909db [2024-01-31 16:12:29,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 16:12:29,321 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 16:12:29,322 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 16:12:29,322 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 16:12:29,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 16:12:29,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:12:27" (1/2) ... [2024-01-31 16:12:29,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d41085b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:12:29, skipping insertion in model container [2024-01-31 16:12:29,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:12:27" (1/2) ... [2024-01-31 16:12:29,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@66b405b6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:12:29, skipping insertion in model container [2024-01-31 16:12:29,333 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:12:29" (2/2) ... [2024-01-31 16:12:29,334 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d41085b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:12:29, skipping insertion in model container [2024-01-31 16:12:29,334 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:12:29" (2/2) ... [2024-01-31 16:12:29,334 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 16:12:29,422 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 16:12:29,423 INFO L98 nessWitnessExtractor]: Location invariant before [L885-L885] ((unsigned long )arg == 0UL) && ((0 == i && i == 0) || (1 <= i && i <= 3)) [2024-01-31 16:12:29,423 INFO L98 nessWitnessExtractor]: Location invariant before [L884-L884] ((unsigned long )arg == 0UL) && ((0 == i && i == 0) || (1 <= i && i <= 3)) [2024-01-31 16:12:29,424 INFO L98 nessWitnessExtractor]: Location invariant before [L902-L902] (j == 4) && ((unsigned long )arg == 0UL) [2024-01-31 16:12:29,452 INFO L98 nessWitnessExtractor]: Location invariant before [L879-L879] ((unsigned long )arg == 0UL) && ((1 <= i && i <= 3) || (0 == i && i == 0)) [2024-01-31 16:12:29,453 INFO L98 nessWitnessExtractor]: Loop invariant at [L878-L878] ((unsigned long )arg == 0UL) && ((1 <= i && i <= 4) || (0 == i && i == 0)) [2024-01-31 16:12:29,453 INFO L98 nessWitnessExtractor]: Location invariant before [L883-L883] ((num == 1) && ((unsigned long )arg == 0UL)) && ((0 == i && i == 0) || (1 <= i && i <= 3)) [2024-01-31 16:12:29,453 INFO L98 nessWitnessExtractor]: Location invariant before [L909-L909] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-01-31 16:12:29,453 INFO L98 nessWitnessExtractor]: Location invariant before [L911-L911] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-01-31 16:12:29,453 INFO L98 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-01-31 16:12:29,453 INFO L98 nessWitnessExtractor]: Location invariant before [L913-L913] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-01-31 16:12:29,453 INFO L98 nessWitnessExtractor]: Location invariant before [L898-L898] ((num == 0) && ((unsigned long )arg == 0UL)) && ((0 == j && j == 0) || (1 <= j && j <= 3)) [2024-01-31 16:12:29,454 INFO L98 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-01-31 16:12:29,454 INFO L98 nessWitnessExtractor]: Location invariant before [L882-L882] ((num == 0) && ((unsigned long )arg == 0UL)) && ((0 == i && i == 0) || (1 <= i && i <= 3)) [2024-01-31 16:12:29,454 INFO L98 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-01-31 16:12:29,454 INFO L98 nessWitnessExtractor]: Location invariant before [L908-L908] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-01-31 16:12:29,454 INFO L98 nessWitnessExtractor]: Loop invariant at [L892-L892] ((unsigned long )arg == 0UL) && ((0 == j && j == 0) || (1 <= j && j <= 4)) [2024-01-31 16:12:29,454 INFO L98 nessWitnessExtractor]: Location invariant before [L904-L904] (j == 4) && ((unsigned long )arg == 0UL) [2024-01-31 16:12:29,454 INFO L98 nessWitnessExtractor]: Location invariant before [L903-L903] (j == 4) && ((unsigned long )arg == 0UL) [2024-01-31 16:12:29,454 INFO L98 nessWitnessExtractor]: Location invariant before [L900-L900] ((unsigned long )arg == 0UL) && ((0 == j && j == 0) || (1 <= j && j <= 3)) [2024-01-31 16:12:29,455 INFO L98 nessWitnessExtractor]: Location invariant before [L897-L897] ((num == 1) && ((unsigned long )arg == 0UL)) && ((0 == j && j == 0) || (1 <= j && j <= 3)) [2024-01-31 16:12:29,455 INFO L98 nessWitnessExtractor]: Location invariant before [L896-L896] ((num == 1) && ((unsigned long )arg == 0UL)) && ((0 == j && j == 0) || (1 <= j && j <= 3)) [2024-01-31 16:12:29,455 INFO L98 nessWitnessExtractor]: Location invariant before [L912-L912] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-01-31 16:12:29,455 INFO L98 nessWitnessExtractor]: Location invariant before [L899-L899] ((unsigned long )arg == 0UL) && ((0 == j && j == 0) || (1 <= j && j <= 3)) [2024-01-31 16:12:29,455 INFO L98 nessWitnessExtractor]: Location invariant before [L891-L891] (unsigned long )arg == 0UL [2024-01-31 16:12:29,456 INFO L98 nessWitnessExtractor]: Location invariant before [L910-L910] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-01-31 16:12:29,456 INFO L98 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-01-31 16:12:29,456 INFO L98 nessWitnessExtractor]: Location invariant before [L893-L893] ((unsigned long )arg == 0UL) && ((0 == j && j == 0) || (1 <= j && j <= 3)) [2024-01-31 16:12:29,456 INFO L98 nessWitnessExtractor]: Location invariant before [L887-L887] (i == 4) && ((unsigned long )arg == 0UL) [2024-01-31 16:12:29,456 INFO L98 nessWitnessExtractor]: Location invariant before [L877-L877] (unsigned long )arg == 0UL [2024-01-31 16:12:29,510 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 16:12:29,812 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-01-31 16:12:29,823 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:12:29,848 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-01-31 16:12:30,014 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_ok.i[39757,39770] [2024-01-31 16:12:30,015 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:12:30,066 INFO L208 MainTranslator]: Completed translation [2024-01-31 16:12:30,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:12:30 WrapperNode [2024-01-31 16:12:30,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 16:12:30,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 16:12:30,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 16:12:30,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 16:12:30,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:12:30" (1/1) ... [2024-01-31 16:12:30,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:12:30" (1/1) ... [2024-01-31 16:12:30,126 INFO L138 Inliner]: procedures = 244, calls = 54, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 86 [2024-01-31 16:12:30,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 16:12:30,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 16:12:30,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 16:12:30,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 16:12:30,135 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:12:30" (1/1) ... [2024-01-31 16:12:30,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:12:30" (1/1) ... [2024-01-31 16:12:30,150 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:12:30" (1/1) ... [2024-01-31 16:12:30,171 INFO L175 MemorySlicer]: Split 31 memory accesses to 7 slices as follows [2, 2, 1, 8, 8, 8, 2]. 26 percent of accesses are in the largest equivalence class. The 27 initializations are split as follows [2, 0, 1, 8, 8, 8, 0]. The 2 writes are split as follows [0, 1, 0, 0, 0, 0, 1]. [2024-01-31 16:12:30,171 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:12:30" (1/1) ... [2024-01-31 16:12:30,171 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:12:30" (1/1) ... [2024-01-31 16:12:30,187 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:12:30" (1/1) ... [2024-01-31 16:12:30,190 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:12:30" (1/1) ... [2024-01-31 16:12:30,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:12:30" (1/1) ... [2024-01-31 16:12:30,193 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:12:30" (1/1) ... [2024-01-31 16:12:30,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 16:12:30,197 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 16:12:30,198 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 16:12:30,198 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 16:12:30,198 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:12:30" (1/1) ... [2024-01-31 16:12:30,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:12:30,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:12:30,277 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-31 16:12:30,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-31 16:12:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 16:12:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 16:12:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-01-31 16:12:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-01-31 16:12:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-01-31 16:12:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-01-31 16:12:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-01-31 16:12:30,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-01-31 16:12:30,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-01-31 16:12:30,335 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-31 16:12:30,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-31 16:12:30,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-31 16:12:30,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-31 16:12:30,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-31 16:12:30,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-31 16:12:30,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-01-31 16:12:30,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-01-31 16:12:30,336 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-31 16:12:30,336 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-31 16:12:30,336 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-31 16:12:30,336 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-31 16:12:30,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 16:12:30,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 16:12:30,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 16:12:30,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 16:12:30,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-31 16:12:30,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-01-31 16:12:30,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-01-31 16:12:30,337 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-31 16:12:30,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 16:12:30,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 16:12:30,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 16:12:30,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 16:12:30,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 16:12:30,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-31 16:12:30,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-01-31 16:12:30,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-01-31 16:12:30,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 16:12:30,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 16:12:30,341 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-31 16:12:30,513 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 16:12:30,515 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 16:12:30,908 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 16:12:30,908 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 16:12:31,081 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 16:12:31,082 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-31 16:12:31,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:12:31 BoogieIcfgContainer [2024-01-31 16:12:31,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 16:12:31,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 16:12:31,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 16:12:31,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 16:12:31,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:12:27" (1/4) ... [2024-01-31 16:12:31,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1151e6d0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 04:12:31, skipping insertion in model container [2024-01-31 16:12:31,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 04:12:29" (2/4) ... [2024-01-31 16:12:31,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1151e6d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:12:31, skipping insertion in model container [2024-01-31 16:12:31,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:12:30" (3/4) ... [2024-01-31 16:12:31,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1151e6d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:12:31, skipping insertion in model container [2024-01-31 16:12:31,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:12:31" (4/4) ... [2024-01-31 16:12:31,093 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_ok.i [2024-01-31 16:12:31,107 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 16:12:31,107 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-01-31 16:12:31,107 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 16:12:31,169 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-31 16:12:31,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 102 transitions, 218 flow [2024-01-31 16:12:31,237 INFO L124 PetriNetUnfolderBase]: 10/100 cut-off events. [2024-01-31 16:12:31,238 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-31 16:12:31,241 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-01-31 16:12:31,241 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 102 transitions, 218 flow [2024-01-31 16:12:31,244 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 96 transitions, 204 flow [2024-01-31 16:12:31,254 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 16:12:31,261 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;@9793cb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 16:12:31,261 INFO L358 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-01-31 16:12:31,303 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 16:12:31,303 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-31 16:12:31,303 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:12:31,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:31,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-31 16:12:31,304 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:12:31,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:31,308 INFO L85 PathProgramCache]: Analyzing trace with hash 13436, now seen corresponding path program 1 times [2024-01-31 16:12:31,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:31,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930239588] [2024-01-31 16:12:31,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:31,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:31,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:31,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:31,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930239588] [2024-01-31 16:12:31,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930239588] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:31,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:31,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:12:31,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20427920] [2024-01-31 16:12:31,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:31,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:12:31,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:31,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:12:31,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:12:31,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 102 [2024-01-31 16:12:31,640 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-01-31 16:12:31,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:31,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 102 [2024-01-31 16:12:31,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:31,905 INFO L124 PetriNetUnfolderBase]: 621/1788 cut-off events. [2024-01-31 16:12:31,905 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2024-01-31 16:12:31,910 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-01-31 16:12:31,918 INFO L140 encePairwiseOnDemand]: 87/102 looper letters, 51 selfloop transitions, 3 changer transitions 0/102 dead transitions. [2024-01-31 16:12:31,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 102 transitions, 330 flow [2024-01-31 16:12:31,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:12:31,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:12:31,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2024-01-31 16:12:31,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7287581699346405 [2024-01-31 16:12:31,929 INFO L175 Difference]: Start difference. First operand has 95 places, 96 transitions, 204 flow. Second operand 3 states and 223 transitions. [2024-01-31 16:12:31,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 102 transitions, 330 flow [2024-01-31 16:12:31,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 102 transitions, 318 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-31 16:12:31,935 INFO L231 Difference]: Finished difference. Result has 88 places, 88 transitions, 197 flow [2024-01-31 16:12:31,936 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-01-31 16:12:31,938 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -7 predicate places. [2024-01-31 16:12:31,939 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 88 transitions, 197 flow [2024-01-31 16:12:31,939 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-01-31 16:12:31,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:31,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:31,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 16:12:31,940 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:12:31,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:31,940 INFO L85 PathProgramCache]: Analyzing trace with hash -252263545, now seen corresponding path program 1 times [2024-01-31 16:12:31,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:31,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163372190] [2024-01-31 16:12:31,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:31,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:32,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:32,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:32,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163372190] [2024-01-31 16:12:32,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163372190] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:32,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:32,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:12:32,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64771517] [2024-01-31 16:12:32,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:32,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:12:32,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:32,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:12:32,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:12:32,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 102 [2024-01-31 16:12:32,104 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-01-31 16:12:32,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:32,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 102 [2024-01-31 16:12:32,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:32,292 INFO L124 PetriNetUnfolderBase]: 488/1602 cut-off events. [2024-01-31 16:12:32,292 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2024-01-31 16:12:32,295 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-01-31 16:12:32,300 INFO L140 encePairwiseOnDemand]: 99/102 looper letters, 44 selfloop transitions, 2 changer transitions 0/98 dead transitions. [2024-01-31 16:12:32,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 98 transitions, 313 flow [2024-01-31 16:12:32,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:12:32,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:12:32,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 293 transitions. [2024-01-31 16:12:32,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7181372549019608 [2024-01-31 16:12:32,303 INFO L175 Difference]: Start difference. First operand has 88 places, 88 transitions, 197 flow. Second operand 4 states and 293 transitions. [2024-01-31 16:12:32,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 98 transitions, 313 flow [2024-01-31 16:12:32,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 98 transitions, 309 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 16:12:32,305 INFO L231 Difference]: Finished difference. Result has 89 places, 87 transitions, 196 flow [2024-01-31 16:12:32,305 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-01-31 16:12:32,306 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -6 predicate places. [2024-01-31 16:12:32,306 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 87 transitions, 196 flow [2024-01-31 16:12:32,306 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-01-31 16:12:32,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:32,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:32,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 16:12:32,307 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:12:32,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:32,307 INFO L85 PathProgramCache]: Analyzing trace with hash 769765184, now seen corresponding path program 1 times [2024-01-31 16:12:32,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:32,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086733153] [2024-01-31 16:12:32,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:32,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:32,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:32,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:32,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086733153] [2024-01-31 16:12:32,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086733153] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:32,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:32,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 16:12:32,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573832109] [2024-01-31 16:12:32,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:32,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:12:32,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:32,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:12:32,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:12:32,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 102 [2024-01-31 16:12:32,393 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-01-31 16:12:32,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:32,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 102 [2024-01-31 16:12:32,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:32,611 INFO L124 PetriNetUnfolderBase]: 739/2168 cut-off events. [2024-01-31 16:12:32,611 INFO L125 PetriNetUnfolderBase]: For 124/131 co-relation queries the response was YES. [2024-01-31 16:12:32,614 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-01-31 16:12:32,620 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 60 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2024-01-31 16:12:32,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 109 transitions, 371 flow [2024-01-31 16:12:32,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:12:32,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:12:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2024-01-31 16:12:32,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7679738562091504 [2024-01-31 16:12:32,624 INFO L175 Difference]: Start difference. First operand has 89 places, 87 transitions, 196 flow. Second operand 3 states and 235 transitions. [2024-01-31 16:12:32,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 109 transitions, 371 flow [2024-01-31 16:12:32,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 109 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:12:32,628 INFO L231 Difference]: Finished difference. Result has 90 places, 88 transitions, 213 flow [2024-01-31 16:12:32,628 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-01-31 16:12:32,629 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -5 predicate places. [2024-01-31 16:12:32,629 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 88 transitions, 213 flow [2024-01-31 16:12:32,629 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-01-31 16:12:32,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:32,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:32,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 16:12:32,630 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:12:32,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:32,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1908828753, now seen corresponding path program 1 times [2024-01-31 16:12:32,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:32,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308345737] [2024-01-31 16:12:32,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:32,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:32,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:32,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:32,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308345737] [2024-01-31 16:12:32,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308345737] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:32,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:32,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:12:32,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524773374] [2024-01-31 16:12:32,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:32,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:12:32,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:32,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:12:32,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:12:32,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 102 [2024-01-31 16:12:32,763 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-01-31 16:12:32,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:32,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 102 [2024-01-31 16:12:32,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:32,941 INFO L124 PetriNetUnfolderBase]: 556/1754 cut-off events. [2024-01-31 16:12:32,941 INFO L125 PetriNetUnfolderBase]: For 208/251 co-relation queries the response was YES. [2024-01-31 16:12:32,944 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-01-31 16:12:32,950 INFO L140 encePairwiseOnDemand]: 99/102 looper letters, 59 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2024-01-31 16:12:32,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 112 transitions, 410 flow [2024-01-31 16:12:32,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:12:32,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:12:32,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 303 transitions. [2024-01-31 16:12:32,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7426470588235294 [2024-01-31 16:12:32,951 INFO L175 Difference]: Start difference. First operand has 90 places, 88 transitions, 213 flow. Second operand 4 states and 303 transitions. [2024-01-31 16:12:32,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 112 transitions, 410 flow [2024-01-31 16:12:32,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 112 transitions, 404 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 16:12:32,954 INFO L231 Difference]: Finished difference. Result has 91 places, 87 transitions, 213 flow [2024-01-31 16:12:32,954 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-01-31 16:12:32,955 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -4 predicate places. [2024-01-31 16:12:32,955 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 87 transitions, 213 flow [2024-01-31 16:12:32,955 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-01-31 16:12:32,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:32,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:32,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 16:12:32,956 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:12:32,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:32,956 INFO L85 PathProgramCache]: Analyzing trace with hash 955851321, now seen corresponding path program 1 times [2024-01-31 16:12:32,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:32,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491507311] [2024-01-31 16:12:32,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:32,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:32,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:32,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:32,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491507311] [2024-01-31 16:12:32,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491507311] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:32,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:32,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 16:12:32,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10306639] [2024-01-31 16:12:32,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:32,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:12:32,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:32,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:12:32,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:12:33,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 102 [2024-01-31 16:12:33,025 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-01-31 16:12:33,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:33,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 102 [2024-01-31 16:12:33,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:33,396 INFO L124 PetriNetUnfolderBase]: 884/2373 cut-off events. [2024-01-31 16:12:33,396 INFO L125 PetriNetUnfolderBase]: For 275/392 co-relation queries the response was YES. [2024-01-31 16:12:33,401 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-01-31 16:12:33,411 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 59 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2024-01-31 16:12:33,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 107 transitions, 385 flow [2024-01-31 16:12:33,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:12:33,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:12:33,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2024-01-31 16:12:33,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.761437908496732 [2024-01-31 16:12:33,413 INFO L175 Difference]: Start difference. First operand has 91 places, 87 transitions, 213 flow. Second operand 3 states and 233 transitions. [2024-01-31 16:12:33,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 107 transitions, 385 flow [2024-01-31 16:12:33,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 107 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:12:33,419 INFO L231 Difference]: Finished difference. Result has 92 places, 87 transitions, 226 flow [2024-01-31 16:12:33,419 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-01-31 16:12:33,422 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -3 predicate places. [2024-01-31 16:12:33,423 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 226 flow [2024-01-31 16:12:33,423 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-01-31 16:12:33,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:33,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:33,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-31 16:12:33,424 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:12:33,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:33,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2146100525, now seen corresponding path program 1 times [2024-01-31 16:12:33,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:33,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432892798] [2024-01-31 16:12:33,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:33,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:33,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:33,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:33,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432892798] [2024-01-31 16:12:33,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432892798] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:33,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:33,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:12:33,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006229573] [2024-01-31 16:12:33,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:33,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:12:33,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:33,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:12:33,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:12:33,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 102 [2024-01-31 16:12:33,596 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-01-31 16:12:33,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:33,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 102 [2024-01-31 16:12:33,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:34,166 INFO L124 PetriNetUnfolderBase]: 2878/6605 cut-off events. [2024-01-31 16:12:34,167 INFO L125 PetriNetUnfolderBase]: For 1350/1418 co-relation queries the response was YES. [2024-01-31 16:12:34,175 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-01-31 16:12:34,204 INFO L140 encePairwiseOnDemand]: 89/102 looper letters, 90 selfloop transitions, 8 changer transitions 0/133 dead transitions. [2024-01-31 16:12:34,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 133 transitions, 549 flow [2024-01-31 16:12:34,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:12:34,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:12:34,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 284 transitions. [2024-01-31 16:12:34,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.696078431372549 [2024-01-31 16:12:34,206 INFO L175 Difference]: Start difference. First operand has 92 places, 87 transitions, 226 flow. Second operand 4 states and 284 transitions. [2024-01-31 16:12:34,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 133 transitions, 549 flow [2024-01-31 16:12:34,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 133 transitions, 544 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 16:12:34,209 INFO L231 Difference]: Finished difference. Result has 97 places, 91 transitions, 286 flow [2024-01-31 16:12:34,210 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-01-31 16:12:34,210 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 2 predicate places. [2024-01-31 16:12:34,210 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 91 transitions, 286 flow [2024-01-31 16:12:34,211 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-01-31 16:12:34,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:34,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:34,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 16:12:34,211 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:12:34,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:34,212 INFO L85 PathProgramCache]: Analyzing trace with hash -26085961, now seen corresponding path program 1 times [2024-01-31 16:12:34,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:34,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013822343] [2024-01-31 16:12:34,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:34,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:34,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:34,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:34,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013822343] [2024-01-31 16:12:34,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013822343] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:34,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:34,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:12:34,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874920193] [2024-01-31 16:12:34,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:34,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:12:34,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:34,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:12:34,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:12:34,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 102 [2024-01-31 16:12:34,373 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-01-31 16:12:34,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:34,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 102 [2024-01-31 16:12:34,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:34,905 INFO L124 PetriNetUnfolderBase]: 2538/6185 cut-off events. [2024-01-31 16:12:34,906 INFO L125 PetriNetUnfolderBase]: For 2779/2903 co-relation queries the response was YES. [2024-01-31 16:12:34,917 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-01-31 16:12:34,935 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 90 selfloop transitions, 9 changer transitions 0/133 dead transitions. [2024-01-31 16:12:34,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 133 transitions, 611 flow [2024-01-31 16:12:34,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:12:34,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:12:34,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 276 transitions. [2024-01-31 16:12:34,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2024-01-31 16:12:34,937 INFO L175 Difference]: Start difference. First operand has 97 places, 91 transitions, 286 flow. Second operand 4 states and 276 transitions. [2024-01-31 16:12:34,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 133 transitions, 611 flow [2024-01-31 16:12:34,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 133 transitions, 608 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 16:12:34,943 INFO L231 Difference]: Finished difference. Result has 101 places, 93 transitions, 329 flow [2024-01-31 16:12:34,943 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-01-31 16:12:34,944 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 6 predicate places. [2024-01-31 16:12:34,944 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 93 transitions, 329 flow [2024-01-31 16:12:34,944 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-01-31 16:12:34,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:34,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:34,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 16:12:34,945 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:12:34,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:34,945 INFO L85 PathProgramCache]: Analyzing trace with hash -401931381, now seen corresponding path program 1 times [2024-01-31 16:12:34,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:34,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250051057] [2024-01-31 16:12:34,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:34,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:35,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:35,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:35,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250051057] [2024-01-31 16:12:35,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250051057] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:35,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:35,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 16:12:35,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907174143] [2024-01-31 16:12:35,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:35,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 16:12:35,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:35,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 16:12:35,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-31 16:12:35,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 102 [2024-01-31 16:12:35,216 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-01-31 16:12:35,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:35,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 102 [2024-01-31 16:12:35,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:35,931 INFO L124 PetriNetUnfolderBase]: 3275/7240 cut-off events. [2024-01-31 16:12:35,932 INFO L125 PetriNetUnfolderBase]: For 6038/6122 co-relation queries the response was YES. [2024-01-31 16:12:35,949 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-01-31 16:12:35,976 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 115 selfloop transitions, 12 changer transitions 0/159 dead transitions. [2024-01-31 16:12:35,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 159 transitions, 780 flow [2024-01-31 16:12:35,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:12:35,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:12:35,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 342 transitions. [2024-01-31 16:12:35,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6705882352941176 [2024-01-31 16:12:35,978 INFO L175 Difference]: Start difference. First operand has 101 places, 93 transitions, 329 flow. Second operand 5 states and 342 transitions. [2024-01-31 16:12:35,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 159 transitions, 780 flow [2024-01-31 16:12:35,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 159 transitions, 771 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 16:12:35,986 INFO L231 Difference]: Finished difference. Result has 105 places, 95 transitions, 363 flow [2024-01-31 16:12:35,986 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-01-31 16:12:35,987 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 10 predicate places. [2024-01-31 16:12:35,987 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 95 transitions, 363 flow [2024-01-31 16:12:35,987 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-01-31 16:12:35,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:35,988 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-01-31 16:12:35,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 16:12:35,988 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:12:35,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:35,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1887091080, now seen corresponding path program 1 times [2024-01-31 16:12:35,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:35,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133107884] [2024-01-31 16:12:35,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:35,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:36,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:36,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:36,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133107884] [2024-01-31 16:12:36,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133107884] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:12:36,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380296750] [2024-01-31 16:12:36,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:36,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:12:36,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:12:36,064 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-01-31 16:12:36,083 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-01-31 16:12:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:36,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-31 16:12:36,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:12:36,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:36,261 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 16:12:36,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:36,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380296750] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 16:12:36,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 16:12:36,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-01-31 16:12:36,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051586427] [2024-01-31 16:12:36,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 16:12:36,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:12:36,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:36,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:12:36,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:12:36,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 102 [2024-01-31 16:12:36,621 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-01-31 16:12:36,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:36,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 102 [2024-01-31 16:12:36,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:37,414 INFO L124 PetriNetUnfolderBase]: 3436/8189 cut-off events. [2024-01-31 16:12:37,414 INFO L125 PetriNetUnfolderBase]: For 4607/4727 co-relation queries the response was YES. [2024-01-31 16:12:37,436 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-01-31 16:12:37,463 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 121 selfloop transitions, 7 changer transitions 0/169 dead transitions. [2024-01-31 16:12:37,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 169 transitions, 839 flow [2024-01-31 16:12:37,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:12:37,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:12:37,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 425 transitions. [2024-01-31 16:12:37,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2024-01-31 16:12:37,466 INFO L175 Difference]: Start difference. First operand has 105 places, 95 transitions, 363 flow. Second operand 6 states and 425 transitions. [2024-01-31 16:12:37,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 169 transitions, 839 flow [2024-01-31 16:12:37,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 169 transitions, 813 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-31 16:12:37,472 INFO L231 Difference]: Finished difference. Result has 106 places, 93 transitions, 363 flow [2024-01-31 16:12:37,472 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-01-31 16:12:37,473 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 11 predicate places. [2024-01-31 16:12:37,473 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 93 transitions, 363 flow [2024-01-31 16:12:37,473 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-01-31 16:12:37,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:37,474 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:37,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-01-31 16:12:37,686 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-01-31 16:12:37,687 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:12:37,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:37,688 INFO L85 PathProgramCache]: Analyzing trace with hash -598033558, now seen corresponding path program 1 times [2024-01-31 16:12:37,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:37,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300722581] [2024-01-31 16:12:37,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:37,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:37,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:37,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:37,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300722581] [2024-01-31 16:12:37,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300722581] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:37,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:37,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:12:37,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260944757] [2024-01-31 16:12:37,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:37,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:12:37,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:37,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:12:37,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:12:37,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 102 [2024-01-31 16:12:37,760 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-01-31 16:12:37,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:37,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 102 [2024-01-31 16:12:37,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:38,025 INFO L124 PetriNetUnfolderBase]: 858/3069 cut-off events. [2024-01-31 16:12:38,025 INFO L125 PetriNetUnfolderBase]: For 2047/2080 co-relation queries the response was YES. [2024-01-31 16:12:38,033 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-01-31 16:12:38,040 INFO L140 encePairwiseOnDemand]: 94/102 looper letters, 54 selfloop transitions, 8 changer transitions 0/111 dead transitions. [2024-01-31 16:12:38,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 111 transitions, 564 flow [2024-01-31 16:12:38,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:12:38,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:12:38,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 241 transitions. [2024-01-31 16:12:38,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7875816993464052 [2024-01-31 16:12:38,042 INFO L175 Difference]: Start difference. First operand has 106 places, 93 transitions, 363 flow. Second operand 3 states and 241 transitions. [2024-01-31 16:12:38,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 111 transitions, 564 flow [2024-01-31 16:12:38,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 111 transitions, 540 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-01-31 16:12:38,048 INFO L231 Difference]: Finished difference. Result has 106 places, 91 transitions, 347 flow [2024-01-31 16:12:38,048 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-01-31 16:12:38,048 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 11 predicate places. [2024-01-31 16:12:38,048 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 91 transitions, 347 flow [2024-01-31 16:12:38,049 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-01-31 16:12:38,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:38,049 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-01-31 16:12:38,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-31 16:12:38,049 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:12:38,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:38,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1216540427, now seen corresponding path program 1 times [2024-01-31 16:12:38,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:38,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313477270] [2024-01-31 16:12:38,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:38,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:38,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:38,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:38,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313477270] [2024-01-31 16:12:38,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313477270] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:12:38,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120828080] [2024-01-31 16:12:38,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:38,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:12:38,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:12:38,177 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-01-31 16:12:38,240 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-01-31 16:12:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:38,327 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-31 16:12:38,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:12:38,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:38,435 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-31 16:12:38,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120828080] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:38,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-31 16:12:38,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-01-31 16:12:38,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720507374] [2024-01-31 16:12:38,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:38,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:12:38,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:38,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:12:38,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-01-31 16:12:38,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 102 [2024-01-31 16:12:38,551 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-01-31 16:12:38,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:38,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 102 [2024-01-31 16:12:38,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:38,958 INFO L124 PetriNetUnfolderBase]: 1631/3834 cut-off events. [2024-01-31 16:12:38,958 INFO L125 PetriNetUnfolderBase]: For 2268/2374 co-relation queries the response was YES. [2024-01-31 16:12:38,967 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-01-31 16:12:38,977 INFO L140 encePairwiseOnDemand]: 92/102 looper letters, 107 selfloop transitions, 14 changer transitions 1/152 dead transitions. [2024-01-31 16:12:38,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 152 transitions, 801 flow [2024-01-31 16:12:38,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:12:38,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:12:38,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 361 transitions. [2024-01-31 16:12:38,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5898692810457516 [2024-01-31 16:12:38,979 INFO L175 Difference]: Start difference. First operand has 106 places, 91 transitions, 347 flow. Second operand 6 states and 361 transitions. [2024-01-31 16:12:38,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 152 transitions, 801 flow [2024-01-31 16:12:38,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 152 transitions, 782 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 16:12:38,984 INFO L231 Difference]: Finished difference. Result has 112 places, 94 transitions, 420 flow [2024-01-31 16:12:38,985 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-01-31 16:12:38,985 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 17 predicate places. [2024-01-31 16:12:38,985 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 94 transitions, 420 flow [2024-01-31 16:12:38,986 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-01-31 16:12:38,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:38,986 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-01-31 16:12:39,018 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-01-31 16:12:39,197 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-01-31 16:12:39,197 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:12:39,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:39,198 INFO L85 PathProgramCache]: Analyzing trace with hash 2052610538, now seen corresponding path program 1 times [2024-01-31 16:12:39,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:39,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499018988] [2024-01-31 16:12:39,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:39,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:39,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:39,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:39,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499018988] [2024-01-31 16:12:39,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499018988] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:39,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:39,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:12:39,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725362950] [2024-01-31 16:12:39,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:39,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:12:39,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:39,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:12:39,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:12:39,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 102 [2024-01-31 16:12:39,366 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-01-31 16:12:39,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:39,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 102 [2024-01-31 16:12:39,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:39,684 INFO L124 PetriNetUnfolderBase]: 1214/3256 cut-off events. [2024-01-31 16:12:39,684 INFO L125 PetriNetUnfolderBase]: For 3832/3856 co-relation queries the response was YES. [2024-01-31 16:12:39,692 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-01-31 16:12:39,700 INFO L140 encePairwiseOnDemand]: 92/102 looper letters, 87 selfloop transitions, 12 changer transitions 0/132 dead transitions. [2024-01-31 16:12:39,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 132 transitions, 787 flow [2024-01-31 16:12:39,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:12:39,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:12:39,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 272 transitions. [2024-01-31 16:12:39,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-01-31 16:12:39,701 INFO L175 Difference]: Start difference. First operand has 112 places, 94 transitions, 420 flow. Second operand 4 states and 272 transitions. [2024-01-31 16:12:39,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 132 transitions, 787 flow [2024-01-31 16:12:39,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 132 transitions, 773 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:12:39,709 INFO L231 Difference]: Finished difference. Result has 115 places, 101 transitions, 515 flow [2024-01-31 16:12:39,709 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-01-31 16:12:39,710 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 20 predicate places. [2024-01-31 16:12:39,710 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 101 transitions, 515 flow [2024-01-31 16:12:39,710 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-01-31 16:12:39,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:39,710 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-01-31 16:12:39,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-31 16:12:39,711 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:12:39,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:39,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1150019684, now seen corresponding path program 2 times [2024-01-31 16:12:39,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:39,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8735109] [2024-01-31 16:12:39,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:39,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:39,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:39,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:39,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8735109] [2024-01-31 16:12:39,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8735109] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:39,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:39,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:12:39,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028578257] [2024-01-31 16:12:39,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:39,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:12:39,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:39,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:12:39,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:12:39,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 102 [2024-01-31 16:12:39,845 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-01-31 16:12:39,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:39,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 102 [2024-01-31 16:12:39,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:40,148 INFO L124 PetriNetUnfolderBase]: 1228/3328 cut-off events. [2024-01-31 16:12:40,149 INFO L125 PetriNetUnfolderBase]: For 4334/4362 co-relation queries the response was YES. [2024-01-31 16:12:40,158 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-01-31 16:12:40,167 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 88 selfloop transitions, 14 changer transitions 0/135 dead transitions. [2024-01-31 16:12:40,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 135 transitions, 869 flow [2024-01-31 16:12:40,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:12:40,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:12:40,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 270 transitions. [2024-01-31 16:12:40,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6617647058823529 [2024-01-31 16:12:40,168 INFO L175 Difference]: Start difference. First operand has 115 places, 101 transitions, 515 flow. Second operand 4 states and 270 transitions. [2024-01-31 16:12:40,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 135 transitions, 869 flow [2024-01-31 16:12:40,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 135 transitions, 861 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:12:40,178 INFO L231 Difference]: Finished difference. Result has 117 places, 104 transitions, 586 flow [2024-01-31 16:12:40,178 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-01-31 16:12:40,179 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 22 predicate places. [2024-01-31 16:12:40,179 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 104 transitions, 586 flow [2024-01-31 16:12:40,179 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-01-31 16:12:40,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:40,179 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-01-31 16:12:40,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-31 16:12:40,180 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:12:40,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:40,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1379422196, now seen corresponding path program 1 times [2024-01-31 16:12:40,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:40,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430177960] [2024-01-31 16:12:40,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:40,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:40,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:40,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:40,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:40,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430177960] [2024-01-31 16:12:40,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430177960] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:40,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:40,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 16:12:40,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983351122] [2024-01-31 16:12:40,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:40,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 16:12:40,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:40,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 16:12:40,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-31 16:12:40,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 102 [2024-01-31 16:12:40,335 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-01-31 16:12:40,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:40,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 102 [2024-01-31 16:12:40,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:40,737 INFO L124 PetriNetUnfolderBase]: 1337/3470 cut-off events. [2024-01-31 16:12:40,738 INFO L125 PetriNetUnfolderBase]: For 5180/5214 co-relation queries the response was YES. [2024-01-31 16:12:40,746 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-01-31 16:12:40,755 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 99 selfloop transitions, 17 changer transitions 0/145 dead transitions. [2024-01-31 16:12:40,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 145 transitions, 1010 flow [2024-01-31 16:12:40,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:12:40,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:12:40,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 311 transitions. [2024-01-31 16:12:40,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6098039215686275 [2024-01-31 16:12:40,756 INFO L175 Difference]: Start difference. First operand has 117 places, 104 transitions, 586 flow. Second operand 5 states and 311 transitions. [2024-01-31 16:12:40,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 145 transitions, 1010 flow [2024-01-31 16:12:40,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 145 transitions, 980 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-31 16:12:40,767 INFO L231 Difference]: Finished difference. Result has 121 places, 106 transitions, 634 flow [2024-01-31 16:12:40,768 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-01-31 16:12:40,768 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 26 predicate places. [2024-01-31 16:12:40,768 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 106 transitions, 634 flow [2024-01-31 16:12:40,769 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-01-31 16:12:40,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:40,769 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-01-31 16:12:40,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-31 16:12:40,769 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:12:40,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:40,770 INFO L85 PathProgramCache]: Analyzing trace with hash 2023645167, now seen corresponding path program 1 times [2024-01-31 16:12:40,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:40,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236534424] [2024-01-31 16:12:40,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:40,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:40,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:40,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:40,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236534424] [2024-01-31 16:12:40,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236534424] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:12:40,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046610892] [2024-01-31 16:12:40,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:40,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:12:40,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:12:40,878 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-01-31 16:12:40,912 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-01-31 16:12:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:41,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-31 16:12:41,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:12:41,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:41,068 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 16:12:41,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:41,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046610892] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 16:12:41,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 16:12:41,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-01-31 16:12:41,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246033020] [2024-01-31 16:12:41,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 16:12:41,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:12:41,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:41,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:12:41,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:12:41,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 102 [2024-01-31 16:12:41,333 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-01-31 16:12:41,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:41,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 102 [2024-01-31 16:12:41,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:41,792 INFO L124 PetriNetUnfolderBase]: 1511/3670 cut-off events. [2024-01-31 16:12:41,793 INFO L125 PetriNetUnfolderBase]: For 6048/6097 co-relation queries the response was YES. [2024-01-31 16:12:41,802 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-01-31 16:12:41,811 INFO L140 encePairwiseOnDemand]: 91/102 looper letters, 122 selfloop transitions, 10 changer transitions 0/169 dead transitions. [2024-01-31 16:12:41,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 169 transitions, 1158 flow [2024-01-31 16:12:41,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:12:41,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:12:41,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 403 transitions. [2024-01-31 16:12:41,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6584967320261438 [2024-01-31 16:12:41,813 INFO L175 Difference]: Start difference. First operand has 121 places, 106 transitions, 634 flow. Second operand 6 states and 403 transitions. [2024-01-31 16:12:41,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 169 transitions, 1158 flow [2024-01-31 16:12:41,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 169 transitions, 1126 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-31 16:12:41,823 INFO L231 Difference]: Finished difference. Result has 122 places, 104 transitions, 632 flow [2024-01-31 16:12:41,824 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-01-31 16:12:41,824 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 27 predicate places. [2024-01-31 16:12:41,824 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 104 transitions, 632 flow [2024-01-31 16:12:41,825 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-01-31 16:12:41,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:41,825 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-01-31 16:12:41,848 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-01-31 16:12:42,036 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-01-31 16:12:42,037 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:12:42,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:42,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1526654846, now seen corresponding path program 1 times [2024-01-31 16:12:42,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:42,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896793350] [2024-01-31 16:12:42,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:42,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:42,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:42,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:42,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896793350] [2024-01-31 16:12:42,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896793350] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:12:42,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198795225] [2024-01-31 16:12:42,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:42,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:12:42,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:12:42,180 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-01-31 16:12:42,220 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-01-31 16:12:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:42,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-31 16:12:42,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:12:42,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:42,459 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-31 16:12:42,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198795225] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:42,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-31 16:12:42,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-01-31 16:12:42,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129202149] [2024-01-31 16:12:42,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:42,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:12:42,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:42,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:12:42,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-01-31 16:12:42,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 102 [2024-01-31 16:12:42,551 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-01-31 16:12:42,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:42,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 102 [2024-01-31 16:12:42,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:43,131 INFO L124 PetriNetUnfolderBase]: 1946/4395 cut-off events. [2024-01-31 16:12:43,131 INFO L125 PetriNetUnfolderBase]: For 7252/7274 co-relation queries the response was YES. [2024-01-31 16:12:43,148 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-01-31 16:12:43,162 INFO L140 encePairwiseOnDemand]: 92/102 looper letters, 136 selfloop transitions, 20 changer transitions 0/182 dead transitions. [2024-01-31 16:12:43,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 182 transitions, 1284 flow [2024-01-31 16:12:43,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:12:43,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:12:43,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 372 transitions. [2024-01-31 16:12:43,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2024-01-31 16:12:43,164 INFO L175 Difference]: Start difference. First operand has 122 places, 104 transitions, 632 flow. Second operand 6 states and 372 transitions. [2024-01-31 16:12:43,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 182 transitions, 1284 flow [2024-01-31 16:12:43,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 182 transitions, 1256 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-01-31 16:12:43,178 INFO L231 Difference]: Finished difference. Result has 128 places, 110 transitions, 761 flow [2024-01-31 16:12:43,178 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-01-31 16:12:43,178 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 33 predicate places. [2024-01-31 16:12:43,179 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 110 transitions, 761 flow [2024-01-31 16:12:43,179 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-01-31 16:12:43,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:43,179 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-01-31 16:12:43,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-01-31 16:12:43,390 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-01-31 16:12:43,390 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:12:43,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:43,391 INFO L85 PathProgramCache]: Analyzing trace with hash -922523205, now seen corresponding path program 1 times [2024-01-31 16:12:43,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:43,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241052490] [2024-01-31 16:12:43,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:43,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:43,549 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:43,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:43,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241052490] [2024-01-31 16:12:43,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241052490] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:12:43,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201547531] [2024-01-31 16:12:43,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:43,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:12:43,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:12:43,551 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-01-31 16:12:43,558 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-01-31 16:12:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:43,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-31 16:12:43,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:12:43,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:43,802 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-31 16:12:43,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201547531] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:43,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-31 16:12:43,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-01-31 16:12:43,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878240413] [2024-01-31 16:12:43,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:43,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:12:43,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:43,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:12:43,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-01-31 16:12:43,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 102 [2024-01-31 16:12:43,935 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-01-31 16:12:43,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:43,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 102 [2024-01-31 16:12:43,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:44,454 INFO L124 PetriNetUnfolderBase]: 1837/4247 cut-off events. [2024-01-31 16:12:44,454 INFO L125 PetriNetUnfolderBase]: For 12184/12279 co-relation queries the response was YES. [2024-01-31 16:12:44,468 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-01-31 16:12:44,478 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 112 selfloop transitions, 27 changer transitions 3/170 dead transitions. [2024-01-31 16:12:44,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 170 transitions, 1366 flow [2024-01-31 16:12:44,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:12:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:12:44,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 349 transitions. [2024-01-31 16:12:44,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5702614379084967 [2024-01-31 16:12:44,480 INFO L175 Difference]: Start difference. First operand has 128 places, 110 transitions, 761 flow. Second operand 6 states and 349 transitions. [2024-01-31 16:12:44,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 170 transitions, 1366 flow [2024-01-31 16:12:44,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 170 transitions, 1322 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-01-31 16:12:44,496 INFO L231 Difference]: Finished difference. Result has 132 places, 117 transitions, 914 flow [2024-01-31 16:12:44,496 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-01-31 16:12:44,497 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 37 predicate places. [2024-01-31 16:12:44,497 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 117 transitions, 914 flow [2024-01-31 16:12:44,497 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-01-31 16:12:44,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:44,497 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-01-31 16:12:44,508 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-01-31 16:12:44,708 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-01-31 16:12:44,709 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:12:44,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:44,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1271598340, now seen corresponding path program 2 times [2024-01-31 16:12:44,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:44,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361471617] [2024-01-31 16:12:44,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:44,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:44,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:44,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:44,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361471617] [2024-01-31 16:12:44,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361471617] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:12:44,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444042926] [2024-01-31 16:12:44,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-31 16:12:44,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:12:44,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:12:44,828 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-01-31 16:12:44,851 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-01-31 16:12:44,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-31 16:12:44,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 16:12:44,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 5 conjunts are in the unsatisfiable core [2024-01-31 16:12:44,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:12:45,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:45,001 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-31 16:12:45,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444042926] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:45,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-31 16:12:45,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-01-31 16:12:45,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436663003] [2024-01-31 16:12:45,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:45,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 16:12:45,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:45,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 16:12:45,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-01-31 16:12:45,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 102 [2024-01-31 16:12:45,096 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-01-31 16:12:45,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:45,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 102 [2024-01-31 16:12:45,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:45,611 INFO L124 PetriNetUnfolderBase]: 2216/5062 cut-off events. [2024-01-31 16:12:45,612 INFO L125 PetriNetUnfolderBase]: For 12420/12466 co-relation queries the response was YES. [2024-01-31 16:12:45,630 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-01-31 16:12:45,643 INFO L140 encePairwiseOnDemand]: 90/102 looper letters, 122 selfloop transitions, 34 changer transitions 0/188 dead transitions. [2024-01-31 16:12:45,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 188 transitions, 1542 flow [2024-01-31 16:12:45,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:12:45,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:12:45,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 322 transitions. [2024-01-31 16:12:45,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6313725490196078 [2024-01-31 16:12:45,644 INFO L175 Difference]: Start difference. First operand has 132 places, 117 transitions, 914 flow. Second operand 5 states and 322 transitions. [2024-01-31 16:12:45,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 188 transitions, 1542 flow [2024-01-31 16:12:45,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 188 transitions, 1500 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-01-31 16:12:45,667 INFO L231 Difference]: Finished difference. Result has 133 places, 124 transitions, 1010 flow [2024-01-31 16:12:45,667 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-01-31 16:12:45,668 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 38 predicate places. [2024-01-31 16:12:45,668 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 124 transitions, 1010 flow [2024-01-31 16:12:45,668 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-01-31 16:12:45,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:45,668 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-01-31 16:12:45,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-01-31 16:12:45,879 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-01-31 16:12:45,880 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:12:45,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:45,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1045254400, now seen corresponding path program 1 times [2024-01-31 16:12:45,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:45,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145473619] [2024-01-31 16:12:45,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:45,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:46,070 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:46,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:46,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145473619] [2024-01-31 16:12:46,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145473619] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:12:46,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127270947] [2024-01-31 16:12:46,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:46,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:12:46,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:12:46,072 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-01-31 16:12:46,073 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-01-31 16:12:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:46,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-31 16:12:46,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:12:46,345 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:46,345 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-31 16:12:46,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127270947] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:46,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-31 16:12:46,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-01-31 16:12:46,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427107171] [2024-01-31 16:12:46,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:46,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 16:12:46,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:46,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 16:12:46,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-01-31 16:12:46,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 102 [2024-01-31 16:12:46,420 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-01-31 16:12:46,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:46,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 102 [2024-01-31 16:12:46,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:47,142 INFO L124 PetriNetUnfolderBase]: 2613/5744 cut-off events. [2024-01-31 16:12:47,143 INFO L125 PetriNetUnfolderBase]: For 16019/16067 co-relation queries the response was YES. [2024-01-31 16:12:47,169 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-01-31 16:12:47,186 INFO L140 encePairwiseOnDemand]: 91/102 looper letters, 163 selfloop transitions, 36 changer transitions 0/224 dead transitions. [2024-01-31 16:12:47,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 224 transitions, 1939 flow [2024-01-31 16:12:47,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 16:12:47,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 16:12:47,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 410 transitions. [2024-01-31 16:12:47,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5742296918767507 [2024-01-31 16:12:47,188 INFO L175 Difference]: Start difference. First operand has 133 places, 124 transitions, 1010 flow. Second operand 7 states and 410 transitions. [2024-01-31 16:12:47,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 224 transitions, 1939 flow [2024-01-31 16:12:47,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 224 transitions, 1907 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-31 16:12:47,217 INFO L231 Difference]: Finished difference. Result has 137 places, 130 transitions, 1161 flow [2024-01-31 16:12:47,217 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-01-31 16:12:47,217 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 42 predicate places. [2024-01-31 16:12:47,217 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 130 transitions, 1161 flow [2024-01-31 16:12:47,218 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-01-31 16:12:47,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:47,218 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-01-31 16:12:47,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-01-31 16:12:47,420 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-01-31 16:12:47,420 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:12:47,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:47,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1712565939, now seen corresponding path program 1 times [2024-01-31 16:12:47,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:47,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101133339] [2024-01-31 16:12:47,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:47,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:47,577 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-31 16:12:47,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:47,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101133339] [2024-01-31 16:12:47,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101133339] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:12:47,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367016319] [2024-01-31 16:12:47,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:47,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:12:47,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:12:47,579 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-01-31 16:12:47,604 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-01-31 16:12:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:47,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-31 16:12:47,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:12:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-31 16:12:47,871 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-31 16:12:47,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367016319] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:47,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-31 16:12:47,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-01-31 16:12:47,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654740174] [2024-01-31 16:12:47,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:47,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:12:47,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:47,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:12:47,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-01-31 16:12:47,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 102 [2024-01-31 16:12:47,945 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-01-31 16:12:47,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:47,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 102 [2024-01-31 16:12:47,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:48,485 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-01-31 16:12:48,486 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2024-01-31 16:12:48,486 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-01-31 16:12:48,486 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-01-31 16:12:48,486 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-01-31 16:12:48,491 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-01-31 16:12:48,492 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2024-01-31 16:12:48,492 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-01-31 16:12:48,492 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-01-31 16:12:48,492 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-01-31 16:12:48,498 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-01-31 16:12:48,498 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2024-01-31 16:12:48,498 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-01-31 16:12:48,498 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-01-31 16:12:48,499 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-01-31 16:12:48,504 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-01-31 16:12:48,504 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2024-01-31 16:12:48,505 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-01-31 16:12:48,505 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-01-31 16:12:48,505 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-01-31 16:12:48,632 INFO L124 PetriNetUnfolderBase]: 2621/6074 cut-off events. [2024-01-31 16:12:48,633 INFO L125 PetriNetUnfolderBase]: For 22574/22792 co-relation queries the response was YES. [2024-01-31 16:12:48,655 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-01-31 16:12:48,670 INFO L140 encePairwiseOnDemand]: 91/102 looper letters, 154 selfloop transitions, 25 changer transitions 0/209 dead transitions. [2024-01-31 16:12:48,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 209 transitions, 1988 flow [2024-01-31 16:12:48,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:12:48,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:12:48,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 366 transitions. [2024-01-31 16:12:48,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5980392156862745 [2024-01-31 16:12:48,672 INFO L175 Difference]: Start difference. First operand has 137 places, 130 transitions, 1161 flow. Second operand 6 states and 366 transitions. [2024-01-31 16:12:48,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 209 transitions, 1988 flow [2024-01-31 16:12:48,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 209 transitions, 1848 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-01-31 16:12:48,705 INFO L231 Difference]: Finished difference. Result has 137 places, 135 transitions, 1201 flow [2024-01-31 16:12:48,705 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-01-31 16:12:48,706 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 42 predicate places. [2024-01-31 16:12:48,706 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 135 transitions, 1201 flow [2024-01-31 16:12:48,706 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-01-31 16:12:48,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:48,706 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-01-31 16:12:48,718 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-01-31 16:12:48,918 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-01-31 16:12:48,918 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:12:48,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:48,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1255561007, now seen corresponding path program 2 times [2024-01-31 16:12:48,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:48,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121096877] [2024-01-31 16:12:48,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:48,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:49,048 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-31 16:12:49,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:49,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121096877] [2024-01-31 16:12:49,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121096877] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:12:49,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914452513] [2024-01-31 16:12:49,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-31 16:12:49,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:12:49,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:12:49,050 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-01-31 16:12:49,071 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-01-31 16:12:49,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-01-31 16:12:49,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 16:12:49,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 5 conjunts are in the unsatisfiable core [2024-01-31 16:12:49,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:12:49,247 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-31 16:12:49,247 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-31 16:12:49,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914452513] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:49,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-31 16:12:49,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-01-31 16:12:49,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735649487] [2024-01-31 16:12:49,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:49,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 16:12:49,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:49,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 16:12:49,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-01-31 16:12:49,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 102 [2024-01-31 16:12:49,343 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-01-31 16:12:49,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:49,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 102 [2024-01-31 16:12:49,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:49,882 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-01-31 16:12:49,882 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2024-01-31 16:12:49,882 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-01-31 16:12:49,882 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-01-31 16:12:49,882 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-01-31 16:12:49,888 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-01-31 16:12:49,889 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2024-01-31 16:12:49,889 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-01-31 16:12:49,889 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-01-31 16:12:49,889 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-01-31 16:12:50,025 INFO L124 PetriNetUnfolderBase]: 2525/6055 cut-off events. [2024-01-31 16:12:50,025 INFO L125 PetriNetUnfolderBase]: For 21807/22005 co-relation queries the response was YES. [2024-01-31 16:12:50,045 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-01-31 16:12:50,059 INFO L140 encePairwiseOnDemand]: 90/102 looper letters, 117 selfloop transitions, 35 changer transitions 0/187 dead transitions. [2024-01-31 16:12:50,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 187 transitions, 1768 flow [2024-01-31 16:12:50,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:12:50,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:12:50,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 308 transitions. [2024-01-31 16:12:50,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6039215686274509 [2024-01-31 16:12:50,061 INFO L175 Difference]: Start difference. First operand has 137 places, 135 transitions, 1201 flow. Second operand 5 states and 308 transitions. [2024-01-31 16:12:50,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 187 transitions, 1768 flow [2024-01-31 16:12:50,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 187 transitions, 1652 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-01-31 16:12:50,087 INFO L231 Difference]: Finished difference. Result has 133 places, 139 transitions, 1235 flow [2024-01-31 16:12:50,087 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-01-31 16:12:50,088 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 38 predicate places. [2024-01-31 16:12:50,088 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 139 transitions, 1235 flow [2024-01-31 16:12:50,088 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-01-31 16:12:50,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:50,088 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-01-31 16:12:50,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-01-31 16:12:50,299 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-01-31 16:12:50,300 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:12:50,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:50,300 INFO L85 PathProgramCache]: Analyzing trace with hash -975730855, now seen corresponding path program 1 times [2024-01-31 16:12:50,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:50,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296575636] [2024-01-31 16:12:50,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:50,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:50,464 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:50,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:50,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296575636] [2024-01-31 16:12:50,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296575636] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:12:50,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658321515] [2024-01-31 16:12:50,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:50,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:12:50,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:12:50,466 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-01-31 16:12:50,498 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-01-31 16:12:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:50,606 INFO L262 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-31 16:12:50,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:12:50,763 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:50,763 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-31 16:12:50,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658321515] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:50,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-31 16:12:50,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-01-31 16:12:50,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313833876] [2024-01-31 16:12:50,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:50,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 16:12:50,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:50,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 16:12:50,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-01-31 16:12:50,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 102 [2024-01-31 16:12:50,879 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-01-31 16:12:50,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:50,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 102 [2024-01-31 16:12:50,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:51,548 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-01-31 16:12:51,548 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2024-01-31 16:12:51,549 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-01-31 16:12:51,549 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-01-31 16:12:51,549 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-01-31 16:12:51,555 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-01-31 16:12:51,555 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2024-01-31 16:12:51,555 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-01-31 16:12:51,555 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-01-31 16:12:51,555 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-01-31 16:12:51,562 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-01-31 16:12:51,562 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2024-01-31 16:12:51,562 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-01-31 16:12:51,562 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-01-31 16:12:51,562 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-01-31 16:12:51,569 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-01-31 16:12:51,569 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2024-01-31 16:12:51,569 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-01-31 16:12:51,569 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-01-31 16:12:51,570 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-01-31 16:12:51,744 INFO L124 PetriNetUnfolderBase]: 3127/6918 cut-off events. [2024-01-31 16:12:51,744 INFO L125 PetriNetUnfolderBase]: For 24103/24331 co-relation queries the response was YES. [2024-01-31 16:12:51,766 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-01-31 16:12:51,784 INFO L140 encePairwiseOnDemand]: 92/102 looper letters, 179 selfloop transitions, 32 changer transitions 1/239 dead transitions. [2024-01-31 16:12:51,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 239 transitions, 2299 flow [2024-01-31 16:12:51,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 16:12:51,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 16:12:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 394 transitions. [2024-01-31 16:12:51,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5518207282913166 [2024-01-31 16:12:51,786 INFO L175 Difference]: Start difference. First operand has 133 places, 139 transitions, 1235 flow. Second operand 7 states and 394 transitions. [2024-01-31 16:12:51,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 239 transitions, 2299 flow [2024-01-31 16:12:51,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 239 transitions, 2251 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-01-31 16:12:51,820 INFO L231 Difference]: Finished difference. Result has 136 places, 142 transitions, 1317 flow [2024-01-31 16:12:51,821 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-01-31 16:12:51,821 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 41 predicate places. [2024-01-31 16:12:51,821 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 142 transitions, 1317 flow [2024-01-31 16:12:51,822 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-01-31 16:12:51,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:51,822 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-01-31 16:12:51,834 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-01-31 16:12:52,034 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-01-31 16:12:52,034 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:12:52,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:52,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1262913583, now seen corresponding path program 1 times [2024-01-31 16:12:52,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:52,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263701605] [2024-01-31 16:12:52,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:52,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:52,164 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-01-31 16:12:52,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:52,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263701605] [2024-01-31 16:12:52,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263701605] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:52,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:52,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 16:12:52,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764290133] [2024-01-31 16:12:52,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:52,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:12:52,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:52,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:12:52,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:12:52,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 102 [2024-01-31 16:12:52,219 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-01-31 16:12:52,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:52,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 102 [2024-01-31 16:12:52,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:52,859 INFO L124 PetriNetUnfolderBase]: 2576/5938 cut-off events. [2024-01-31 16:12:52,860 INFO L125 PetriNetUnfolderBase]: For 25225/25419 co-relation queries the response was YES. [2024-01-31 16:12:52,880 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-01-31 16:12:52,898 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 137 selfloop transitions, 15 changer transitions 0/190 dead transitions. [2024-01-31 16:12:52,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 190 transitions, 1972 flow [2024-01-31 16:12:52,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:12:52,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:12:52,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 338 transitions. [2024-01-31 16:12:52,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6627450980392157 [2024-01-31 16:12:52,901 INFO L175 Difference]: Start difference. First operand has 136 places, 142 transitions, 1317 flow. Second operand 5 states and 338 transitions. [2024-01-31 16:12:52,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 190 transitions, 1972 flow [2024-01-31 16:12:52,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 190 transitions, 1866 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-01-31 16:12:52,930 INFO L231 Difference]: Finished difference. Result has 134 places, 141 transitions, 1273 flow [2024-01-31 16:12:52,930 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-01-31 16:12:52,930 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 39 predicate places. [2024-01-31 16:12:52,930 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 141 transitions, 1273 flow [2024-01-31 16:12:52,931 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-01-31 16:12:52,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:52,931 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-01-31 16:12:52,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-01-31 16:12:52,931 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:12:52,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:52,932 INFO L85 PathProgramCache]: Analyzing trace with hash -591614232, now seen corresponding path program 1 times [2024-01-31 16:12:52,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:52,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836292132] [2024-01-31 16:12:52,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:52,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:53,054 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-01-31 16:12:53,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:53,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836292132] [2024-01-31 16:12:53,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836292132] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:53,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:53,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 16:12:53,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567704467] [2024-01-31 16:12:53,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:53,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:12:53,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:53,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:12:53,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:12:53,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 102 [2024-01-31 16:12:53,099 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-01-31 16:12:53,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:53,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 102 [2024-01-31 16:12:53,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:53,609 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-01-31 16:12:53,610 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2024-01-31 16:12:53,610 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-01-31 16:12:53,610 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-01-31 16:12:53,610 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-01-31 16:12:53,616 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-01-31 16:12:53,616 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2024-01-31 16:12:53,616 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-01-31 16:12:53,616 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-01-31 16:12:53,616 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-01-31 16:12:53,621 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-01-31 16:12:53,621 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2024-01-31 16:12:53,621 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-01-31 16:12:53,622 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-01-31 16:12:53,622 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-01-31 16:12:53,627 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-01-31 16:12:53,627 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2024-01-31 16:12:53,627 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-01-31 16:12:53,627 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-01-31 16:12:53,627 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-01-31 16:12:53,751 INFO L124 PetriNetUnfolderBase]: 2451/5656 cut-off events. [2024-01-31 16:12:53,751 INFO L125 PetriNetUnfolderBase]: For 24934/25228 co-relation queries the response was YES. [2024-01-31 16:12:53,773 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-01-31 16:12:53,788 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 120 selfloop transitions, 16 changer transitions 0/178 dead transitions. [2024-01-31 16:12:53,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 178 transitions, 1826 flow [2024-01-31 16:12:53,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:12:53,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:12:53,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 325 transitions. [2024-01-31 16:12:53,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6372549019607843 [2024-01-31 16:12:53,790 INFO L175 Difference]: Start difference. First operand has 134 places, 141 transitions, 1273 flow. Second operand 5 states and 325 transitions. [2024-01-31 16:12:53,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 178 transitions, 1826 flow [2024-01-31 16:12:53,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 178 transitions, 1762 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-01-31 16:12:53,823 INFO L231 Difference]: Finished difference. Result has 131 places, 138 transitions, 1253 flow [2024-01-31 16:12:53,824 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-01-31 16:12:53,824 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 36 predicate places. [2024-01-31 16:12:53,824 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 138 transitions, 1253 flow [2024-01-31 16:12:53,825 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-01-31 16:12:53,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:53,825 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-01-31 16:12:53,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-01-31 16:12:53,825 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:12:53,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:53,826 INFO L85 PathProgramCache]: Analyzing trace with hash 191862386, now seen corresponding path program 1 times [2024-01-31 16:12:53,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:53,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719806789] [2024-01-31 16:12:53,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:53,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:53,957 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 8 proven. 75 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-01-31 16:12:53,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:53,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719806789] [2024-01-31 16:12:53,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719806789] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:12:53,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858477564] [2024-01-31 16:12:53,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:53,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:12:53,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:12:53,959 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-01-31 16:12:53,981 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-01-31 16:12:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:54,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 5 conjunts are in the unsatisfiable core [2024-01-31 16:12:54,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:12:54,230 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 8 proven. 75 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-01-31 16:12:54,230 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 16:12:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 8 proven. 75 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-01-31 16:12:54,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858477564] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 16:12:54,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 16:12:54,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-01-31 16:12:54,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460086164] [2024-01-31 16:12:54,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 16:12:54,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 16:12:54,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:54,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 16:12:54,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-01-31 16:12:54,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 102 [2024-01-31 16:12:54,397 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-01-31 16:12:54,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:54,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 102 [2024-01-31 16:12:54,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:55,276 INFO L124 PetriNetUnfolderBase]: 2945/6675 cut-off events. [2024-01-31 16:12:55,277 INFO L125 PetriNetUnfolderBase]: For 27475/27667 co-relation queries the response was YES. [2024-01-31 16:12:55,310 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-01-31 16:12:55,332 INFO L140 encePairwiseOnDemand]: 98/102 looper letters, 216 selfloop transitions, 15 changer transitions 0/266 dead transitions. [2024-01-31 16:12:55,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 266 transitions, 2748 flow [2024-01-31 16:12:55,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:12:55,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:12:55,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 456 transitions. [2024-01-31 16:12:55,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7450980392156863 [2024-01-31 16:12:55,334 INFO L175 Difference]: Start difference. First operand has 131 places, 138 transitions, 1253 flow. Second operand 6 states and 456 transitions. [2024-01-31 16:12:55,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 266 transitions, 2748 flow [2024-01-31 16:12:55,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 266 transitions, 2682 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-01-31 16:12:55,463 INFO L231 Difference]: Finished difference. Result has 134 places, 143 transitions, 1332 flow [2024-01-31 16:12:55,463 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-01-31 16:12:55,463 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 39 predicate places. [2024-01-31 16:12:55,463 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 143 transitions, 1332 flow [2024-01-31 16:12:55,464 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-01-31 16:12:55,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:55,464 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-01-31 16:12:55,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-01-31 16:12:55,676 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-01-31 16:12:55,677 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:12:55,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:55,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1609983700, now seen corresponding path program 2 times [2024-01-31 16:12:55,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:55,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271833705] [2024-01-31 16:12:55,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:55,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:55,825 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 46 proven. 82 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-31 16:12:55,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:55,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271833705] [2024-01-31 16:12:55,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271833705] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:12:55,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292835969] [2024-01-31 16:12:55,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-31 16:12:55,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:12:55,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:12:55,841 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-01-31 16:12:55,859 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-01-31 16:12:56,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-31 16:12:56,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 16:12:56,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 5 conjunts are in the unsatisfiable core [2024-01-31 16:12:56,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:12:56,106 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 46 proven. 82 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-31 16:12:56,106 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 16:12:56,189 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 46 proven. 82 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-31 16:12:56,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292835969] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 16:12:56,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 16:12:56,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-01-31 16:12:56,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280747017] [2024-01-31 16:12:56,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 16:12:56,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 16:12:56,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:56,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 16:12:56,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-01-31 16:12:56,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 102 [2024-01-31 16:12:56,270 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-01-31 16:12:56,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:56,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 102 [2024-01-31 16:12:56,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:56,976 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-01-31 16:12:56,976 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2024-01-31 16:12:56,976 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-01-31 16:12:56,976 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-01-31 16:12:56,977 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-01-31 16:12:56,984 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-01-31 16:12:56,985 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2024-01-31 16:12:56,985 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-01-31 16:12:56,985 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-01-31 16:12:56,985 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-01-31 16:12:56,990 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-01-31 16:12:56,990 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2024-01-31 16:12:56,990 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-01-31 16:12:56,991 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-01-31 16:12:56,991 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-01-31 16:12:56,997 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-01-31 16:12:56,997 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-01-31 16:12:56,997 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-01-31 16:12:56,997 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-01-31 16:12:56,997 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-01-31 16:12:57,144 INFO L124 PetriNetUnfolderBase]: 2996/6979 cut-off events. [2024-01-31 16:12:57,144 INFO L125 PetriNetUnfolderBase]: For 33737/34097 co-relation queries the response was YES. [2024-01-31 16:12:57,172 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-01-31 16:12:57,193 INFO L140 encePairwiseOnDemand]: 98/102 looper letters, 213 selfloop transitions, 16 changer transitions 0/273 dead transitions. [2024-01-31 16:12:57,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 273 transitions, 2924 flow [2024-01-31 16:12:57,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:12:57,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:12:57,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 452 transitions. [2024-01-31 16:12:57,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.738562091503268 [2024-01-31 16:12:57,195 INFO L175 Difference]: Start difference. First operand has 134 places, 143 transitions, 1332 flow. Second operand 6 states and 452 transitions. [2024-01-31 16:12:57,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 273 transitions, 2924 flow [2024-01-31 16:12:57,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 273 transitions, 2904 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:12:57,230 INFO L231 Difference]: Finished difference. Result has 139 places, 148 transitions, 1439 flow [2024-01-31 16:12:57,230 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-01-31 16:12:57,231 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 44 predicate places. [2024-01-31 16:12:57,231 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 148 transitions, 1439 flow [2024-01-31 16:12:57,231 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-01-31 16:12:57,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:57,232 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-01-31 16:12:57,244 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-01-31 16:12:57,444 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-01-31 16:12:57,444 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:12:57,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:57,445 INFO L85 PathProgramCache]: Analyzing trace with hash -982179963, now seen corresponding path program 3 times [2024-01-31 16:12:57,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:57,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765629817] [2024-01-31 16:12:57,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:57,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:57,920 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 4 proven. 163 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-01-31 16:12:57,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:57,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765629817] [2024-01-31 16:12:57,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765629817] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:12:57,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029019087] [2024-01-31 16:12:57,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-31 16:12:57,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:12:57,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:12:57,922 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-01-31 16:12:57,937 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-01-31 16:12:58,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-01-31 16:12:58,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 16:12:58,164 INFO L262 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 23 conjunts are in the unsatisfiable core [2024-01-31 16:12:58,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:12:58,449 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-31 16:12:58,450 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 16:12:59,107 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-31 16:12:59,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029019087] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 16:12:59,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 16:12:59,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 33 [2024-01-31 16:12:59,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733231299] [2024-01-31 16:12:59,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 16:12:59,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-01-31 16:12:59,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:59,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-01-31 16:12:59,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2024-01-31 16:13:01,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 102 [2024-01-31 16:13:01,573 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-01-31 16:13:01,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:13:01,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 102 [2024-01-31 16:13:01,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:13:03,327 INFO L124 PetriNetUnfolderBase]: 2780/6639 cut-off events. [2024-01-31 16:13:03,328 INFO L125 PetriNetUnfolderBase]: For 34148/34468 co-relation queries the response was YES. [2024-01-31 16:13:03,347 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-01-31 16:13:03,351 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 0 selfloop transitions, 0 changer transitions 309/309 dead transitions. [2024-01-31 16:13:03,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 309 transitions, 3225 flow [2024-01-31 16:13:03,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-01-31 16:13:03,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-01-31 16:13:03,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 777 transitions. [2024-01-31 16:13:03,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6348039215686274 [2024-01-31 16:13:03,353 INFO L175 Difference]: Start difference. First operand has 139 places, 148 transitions, 1439 flow. Second operand 12 states and 777 transitions. [2024-01-31 16:13:03,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 309 transitions, 3225 flow [2024-01-31 16:13:03,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 309 transitions, 3209 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-31 16:13:03,387 INFO L231 Difference]: Finished difference. Result has 145 places, 0 transitions, 0 flow [2024-01-31 16:13:03,387 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-01-31 16:13:03,387 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 50 predicate places. [2024-01-31 16:13:03,387 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 0 transitions, 0 flow [2024-01-31 16:13:03,388 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-01-31 16:13:03,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 55 remaining) [2024-01-31 16:13:03,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 55 remaining) [2024-01-31 16:13:03,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 55 remaining) [2024-01-31 16:13:03,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 55 remaining) [2024-01-31 16:13:03,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 55 remaining) [2024-01-31 16:13:03,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 55 remaining) [2024-01-31 16:13:03,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 55 remaining) [2024-01-31 16:13:03,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 55 remaining) [2024-01-31 16:13:03,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 55 remaining) [2024-01-31 16:13:03,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 55 remaining) [2024-01-31 16:13:03,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 55 remaining) [2024-01-31 16:13:03,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 55 remaining) [2024-01-31 16:13:03,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 55 remaining) [2024-01-31 16:13:03,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 55 remaining) [2024-01-31 16:13:03,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 55 remaining) [2024-01-31 16:13:03,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 55 remaining) [2024-01-31 16:13:03,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 55 remaining) [2024-01-31 16:13:03,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 55 remaining) [2024-01-31 16:13:03,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 55 remaining) [2024-01-31 16:13:03,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 55 remaining) [2024-01-31 16:13:03,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 55 remaining) [2024-01-31 16:13:03,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 55 remaining) [2024-01-31 16:13:03,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 55 remaining) [2024-01-31 16:13:03,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 55 remaining) [2024-01-31 16:13:03,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 55 remaining) [2024-01-31 16:13:03,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 55 remaining) [2024-01-31 16:13:03,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 55 remaining) [2024-01-31 16:13:03,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 55 remaining) [2024-01-31 16:13:03,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 55 remaining) [2024-01-31 16:13:03,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (25 of 55 remaining) [2024-01-31 16:13:03,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 55 remaining) [2024-01-31 16:13:03,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 55 remaining) [2024-01-31 16:13:03,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 55 remaining) [2024-01-31 16:13:03,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 55 remaining) [2024-01-31 16:13:03,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 55 remaining) [2024-01-31 16:13:03,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 55 remaining) [2024-01-31 16:13:03,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 55 remaining) [2024-01-31 16:13:03,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 55 remaining) [2024-01-31 16:13:03,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 55 remaining) [2024-01-31 16:13:03,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 55 remaining) [2024-01-31 16:13:03,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 55 remaining) [2024-01-31 16:13:03,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 55 remaining) [2024-01-31 16:13:03,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 55 remaining) [2024-01-31 16:13:03,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 55 remaining) [2024-01-31 16:13:03,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 55 remaining) [2024-01-31 16:13:03,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 55 remaining) [2024-01-31 16:13:03,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 55 remaining) [2024-01-31 16:13:03,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 55 remaining) [2024-01-31 16:13:03,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 55 remaining) [2024-01-31 16:13:03,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 55 remaining) [2024-01-31 16:13:03,397 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 55 remaining) [2024-01-31 16:13:03,397 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 55 remaining) [2024-01-31 16:13:03,397 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 55 remaining) [2024-01-31 16:13:03,397 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 55 remaining) [2024-01-31 16:13:03,397 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 55 remaining) [2024-01-31 16:13:03,412 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-01-31 16:13:03,610 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-01-31 16:13:03,610 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-01-31 16:13:03,614 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-31 16:13:03,614 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-31 16:13:03,617 INFO L503 ceAbstractionStarter]: Automizer considered 29 witness invariants [2024-01-31 16:13:03,617 INFO L504 ceAbstractionStarter]: WitnessConsidered=29 [2024-01-31 16:13:03,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 04:13:03 BasicIcfg [2024-01-31 16:13:03,618 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-31 16:13:03,618 INFO L158 Benchmark]: Toolchain (without parser) took 34297.22ms. Allocated memory was 140.5MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 63.2MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 217.2MB. Max. memory is 16.1GB. [2024-01-31 16:13:03,619 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 113.2MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 16:13:03,619 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 140.5MB. Free memory is still 111.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 16:13:03,619 INFO L158 Benchmark]: CACSL2BoogieTranslator took 744.54ms. Allocated memory is still 140.5MB. Free memory was 63.0MB in the beginning and 79.9MB in the end (delta: -16.9MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2024-01-31 16:13:03,619 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.34ms. Allocated memory is still 140.5MB. Free memory was 79.3MB in the beginning and 77.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-31 16:13:03,619 INFO L158 Benchmark]: Boogie Preprocessor took 69.76ms. Allocated memory is still 140.5MB. Free memory was 77.2MB in the beginning and 72.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-31 16:13:03,620 INFO L158 Benchmark]: RCFGBuilder took 886.26ms. Allocated memory is still 140.5MB. Free memory was 72.9MB in the beginning and 70.8MB in the end (delta: 2.2MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2024-01-31 16:13:03,620 INFO L158 Benchmark]: TraceAbstraction took 32532.29ms. Allocated memory was 140.5MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 69.9MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 222.2MB. Max. memory is 16.1GB. [2024-01-31 16:13:03,621 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 113.2MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 140.5MB. Free memory is still 111.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 744.54ms. Allocated memory is still 140.5MB. Free memory was 63.0MB in the beginning and 79.9MB in the end (delta: -16.9MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.34ms. Allocated memory is still 140.5MB. Free memory was 79.3MB in the beginning and 77.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.76ms. Allocated memory is still 140.5MB. Free memory was 77.2MB in the beginning and 72.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 886.26ms. Allocated memory is still 140.5MB. Free memory was 72.9MB in the beginning and 70.8MB in the end (delta: 2.2MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. * TraceAbstraction took 32532.29ms. Allocated memory was 140.5MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 69.9MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 222.2MB. 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.4s, OverallIterations: 27, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 21.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5148 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4098 mSDsluCounter, 862 SdHoareTripleChecker+Invalid, 6.5s 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.3s SsaConstructionTime, 0.8s 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-01-31 16:13:03,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE