./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_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/circular_buffer_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/circular_buffer_ok.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/circular_buffer_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,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 16:12:27,482 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,487 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 16:12:27,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 16:12:27,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 16:12:27,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 16:12:27,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 16:12:27,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 16:12:27,516 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 16:12:27,516 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 16:12:27,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 16:12:27,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 16:12:27,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 16:12:27,518 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 16:12:27,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 16:12:27,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 16:12:27,518 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 16:12:27,518 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 16:12:27,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 16:12:27,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 16:12:27,519 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 16:12:27,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 16:12:27,519 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 16:12:27,519 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 16:12:27,520 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 16:12:27,520 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 16:12:27,520 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 16:12:27,520 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 16:12:27,520 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 16:12:27,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 16:12:27,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 16:12:27,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:12:27,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 16:12:27,522 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 16:12:27,522 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 16:12:27,522 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 16:12:27,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 16:12:27,522 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 16:12:27,522 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 16:12:27,523 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 16:12:27,523 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 16:12:27,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 16:12:27,523 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,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 16:12:27,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 16:12:27,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 16:12:27,760 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 16:12:27,760 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 16:12:27,761 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/circular_buffer_ok.yml/witness.yml [2024-01-31 16:12:27,899 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 16:12:27,899 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 16:12:27,900 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2024-01-31 16:12:29,052 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 16:12:29,232 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 16:12:29,236 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2024-01-31 16:12:29,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29689c4a2/3612100212bd447597d53be79c538d2d/FLAGb00af71a5 [2024-01-31 16:12:29,262 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29689c4a2/3612100212bd447597d53be79c538d2d [2024-01-31 16:12:29,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 16:12:29,264 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 16:12:29,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 16:12:29,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 16:12:29,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 16:12:29,271 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,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4837bfed 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,271 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,273 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6c5e26b1 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,273 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,273 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4837bfed 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,273 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,274 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 16:12:29,430 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 16:12:29,431 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] (((0 <= value) && (value <= 6)) && (receive == (_Bool)1)) && (send == (_Bool)0 || send == (_Bool)1) [2024-01-31 16:12:29,431 INFO L98 nessWitnessExtractor]: Loop invariant at [L725-L725] (unsigned long )arg == 0UL [2024-01-31 16:12:29,432 INFO L98 nessWitnessExtractor]: Location invariant before [L750-L750] (((((((-128 <= value) && (0 <= value)) && (value <= 6)) && (value <= 127)) && (receive == (_Bool)1)) && ((unsigned long )arg == 0UL)) && (send == (_Bool)0 || send == (_Bool)1)) && (((((i == 3 || i == 2) || i == 1) || (0 == i && i == 0)) || (5 <= i && i <= 6)) || i == 4) [2024-01-31 16:12:29,432 INFO L98 nessWitnessExtractor]: Location invariant before [L727-L727] ((unsigned long )arg == 0UL) && (((((i == 4 || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) || (5 <= i && i <= 6)) [2024-01-31 16:12:29,432 INFO L98 nessWitnessExtractor]: Location invariant before [L696-L696] (((0 <= value) && (value <= 6)) && (receive == (_Bool)1)) && (send == (_Bool)0 || send == (_Bool)1) [2024-01-31 16:12:29,432 INFO L98 nessWitnessExtractor]: Location invariant before [L738-L738] (i == 7) && ((unsigned long )arg == 0UL) [2024-01-31 16:12:29,432 INFO L98 nessWitnessExtractor]: Location invariant before [L733-L733] (((send == (_Bool)1) && ((unsigned long )arg == 0UL)) && (receive == (_Bool)0 || receive == (_Bool)1)) && ((((((value == 3 && i == 3) || (value == 2 && i == 2)) || (value == 1 && i == 1)) || ((0 == i && value == 0) && i == 0)) || (((5 <= value && 5 <= i) && value <= 6) && i <= 6)) || (value == 4 && i == 4)) [2024-01-31 16:12:29,432 INFO L98 nessWitnessExtractor]: Loop invariant at [L743-L743] (unsigned long )arg == 0UL [2024-01-31 16:12:29,432 INFO L98 nessWitnessExtractor]: Location invariant before [L761-L761] ((send == (_Bool)0) && (receive == (_Bool)0)) && (value == 0) [2024-01-31 16:12:29,433 INFO L98 nessWitnessExtractor]: Location invariant after [L731-L731] (((((0 <= value) && (value <= 6)) && (send == (_Bool)1)) && ((unsigned long )arg == 0UL)) && (receive == (_Bool)0 || receive == (_Bool)1)) && (((((i == 4 || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) || (5 <= i && i <= 6)) [2024-01-31 16:12:29,433 INFO L98 nessWitnessExtractor]: Location invariant before [L720-L720] (((((0 <= value) && (0 <= b)) && (value <= 6)) && (b <= 6)) && (send == (_Bool)1)) && (receive == (_Bool)0 || receive == (_Bool)1) [2024-01-31 16:12:29,433 INFO L98 nessWitnessExtractor]: Location invariant before [L734-L734] (((send == (_Bool)0) && ((unsigned long )arg == 0UL)) && (receive == (_Bool)0 || receive == (_Bool)1)) && ((((((value == 3 && i == 3) || (value == 2 && i == 2)) || (value == 1 && i == 1)) || ((0 == i && value == 0) && i == 0)) || (((5 <= value && 5 <= i) && value <= 6) && i <= 6)) || (value == 4 && i == 4)) [2024-01-31 16:12:29,433 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] ((((10 == max) && (send == (_Bool)0)) && (receive == (_Bool)0)) && (value == 0)) && (max == 10) [2024-01-31 16:12:29,433 INFO L98 nessWitnessExtractor]: Location invariant before [L732-L732] (((((0 <= value) && (value <= 6)) && (send == (_Bool)1)) && ((unsigned long )arg == 0UL)) && (receive == (_Bool)0 || receive == (_Bool)1)) && (((((i == 3 || i == 2) || i == 1) || (0 == i && i == 0)) || (5 <= i && i <= 6)) || i == 4) [2024-01-31 16:12:29,433 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] (((((0 <= value) && (0 <= b)) && (value <= 6)) && (b <= 6)) && (send == (_Bool)1)) && (receive == (_Bool)0 || receive == (_Bool)1) [2024-01-31 16:12:29,433 INFO L98 nessWitnessExtractor]: Location invariant before [L749-L749] (((((0 <= value) && (value <= 6)) && (receive == (_Bool)1)) && ((unsigned long )arg == 0UL)) && (send == (_Bool)0 || send == (_Bool)1)) && (((((i == 4 || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) || (5 <= i && i <= 6)) [2024-01-31 16:12:29,434 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] (((0 <= value) && (value <= 6)) && (receive == (_Bool)1)) && (send == (_Bool)0 || send == (_Bool)1) [2024-01-31 16:12:29,434 INFO L98 nessWitnessExtractor]: Location invariant before [L718-L718] (((((0 <= value) && (0 <= b)) && (value <= 6)) && (b <= 6)) && (send == (_Bool)1)) && (receive == (_Bool)0 || receive == (_Bool)1) [2024-01-31 16:12:29,434 INFO L98 nessWitnessExtractor]: Location invariant before [L759-L759] ((send == (_Bool)0) && (receive == (_Bool)0)) && (value == 0) [2024-01-31 16:12:29,434 INFO L98 nessWitnessExtractor]: Location invariant before [L730-L730] (((((0 <= value) && (value <= 6)) && (send == (_Bool)1)) && ((unsigned long )arg == 0UL)) && (receive == (_Bool)0 || receive == (_Bool)1)) && ((((((((((i == 4 || i == 3) || i == 3) || i == 2) || i == 2) || i == 1) || i == 1) || (0 == i && i == 0)) || (0 == i && i == 0)) || (5 <= i && i <= 6)) || (5 <= i && i <= 6)) [2024-01-31 16:12:29,434 INFO L98 nessWitnessExtractor]: Location invariant before [L748-L748] (((((0 <= value) && (value <= 6)) && (receive == (_Bool)1)) && ((unsigned long )arg == 0UL)) && (send == (_Bool)0 || send == (_Bool)1)) && ((((((((((i == 4 || i == 3) || i == 3) || i == 2) || i == 2) || i == 1) || i == 1) || (0 == i && i == 0)) || (0 == i && i == 0)) || (5 <= i && i <= 6)) || (5 <= i && i <= 6)) [2024-01-31 16:12:29,435 INFO L98 nessWitnessExtractor]: Location invariant before [L755-L755] (i == 7) && ((unsigned long )arg == 0UL) [2024-01-31 16:12:29,435 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] ((((10 == max) && (send == (_Bool)0)) && (receive == (_Bool)0)) && (value == 0)) && (max == 10) [2024-01-31 16:12:29,435 INFO L98 nessWitnessExtractor]: Location invariant before [L763-L763] ((send == (_Bool)1) && (receive == (_Bool)0)) && (value == 0) [2024-01-31 16:12:29,435 INFO L98 nessWitnessExtractor]: Location invariant before [L746-L746] (((((0 <= value) && (value <= 6)) && ((unsigned long )arg == 0UL)) && (send == (_Bool)0 || send == (_Bool)1)) && (receive == (_Bool)0 || receive == (_Bool)1)) && (((((i == 4 || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) || (5 <= i && i <= 6)) [2024-01-31 16:12:29,435 INFO L98 nessWitnessExtractor]: Location invariant before [L736-L736] (((((0 <= value) && (value <= 6)) && (send == (_Bool)0)) && ((unsigned long )arg == 0UL)) && (receive == (_Bool)0 || receive == (_Bool)1)) && (((((i == 3 || i == 2) || i == 1) || (0 == i && i == 0)) || (5 <= i && i <= 6)) || i == 4) [2024-01-31 16:12:29,435 INFO L98 nessWitnessExtractor]: Location invariant before [L762-L762] ((send == (_Bool)1) && (receive == (_Bool)0)) && (value == 0) [2024-01-31 16:12:29,435 INFO L98 nessWitnessExtractor]: Location invariant before [L753-L753] (((((0 <= value) && (value <= 6)) && (receive == (_Bool)0)) && ((unsigned long )arg == 0UL)) && (send == (_Bool)0 || send == (_Bool)1)) && (((((i == 3 || i == 2) || i == 1) || (0 == i && i == 0)) || (5 <= i && i <= 6)) || i == 4) [2024-01-31 16:12:29,435 INFO L98 nessWitnessExtractor]: Location invariant before [L751-L751] (((((((-128 <= value) && (0 <= value)) && (value <= 6)) && (value <= 127)) && (receive == (_Bool)0)) && ((unsigned long )arg == 0UL)) && (send == (_Bool)0 || send == (_Bool)1)) && (((((i == 3 || i == 2) || i == 1) || (0 == i && i == 0)) || (5 <= i && i <= 6)) || i == 4) [2024-01-31 16:12:29,436 INFO L98 nessWitnessExtractor]: Location invariant before [L760-L760] ((send == (_Bool)0) && (receive == (_Bool)0)) && (value == 0) [2024-01-31 16:12:29,436 INFO L98 nessWitnessExtractor]: Location invariant before [L713-L713] (((((0 <= value) && (0 <= b)) && (value <= 6)) && (b <= 6)) && (send == (_Bool)1)) && (receive == (_Bool)0 || receive == (_Bool)1) [2024-01-31 16:12:29,436 INFO L98 nessWitnessExtractor]: Location invariant before [L745-L745] ((unsigned long )arg == 0UL) && (((((i == 4 || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) || (5 <= i && i <= 6)) [2024-01-31 16:12:29,436 INFO L98 nessWitnessExtractor]: Location invariant before [L728-L728] (((((0 <= value) && (value <= 6)) && ((unsigned long )arg == 0UL)) && (send == (_Bool)0 || send == (_Bool)1)) && (receive == (_Bool)0 || receive == (_Bool)1)) && (((((i == 4 || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) || (5 <= i && i <= 6)) [2024-01-31 16:12:29,436 INFO L98 nessWitnessExtractor]: Location invariant after [L749-L749] (((((0 <= value) && (value <= 6)) && (receive == (_Bool)1)) && ((unsigned long )arg == 0UL)) && (send == (_Bool)0 || send == (_Bool)1)) && (((((i == 4 || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) || (5 <= i && i <= 6)) [2024-01-31 16:12:29,436 INFO L98 nessWitnessExtractor]: Location invariant before [L711-L711] (((((0 <= value) && (0 <= b)) && (value <= 6)) && (b <= 6)) && (send == (_Bool)1)) && (receive == (_Bool)0 || receive == (_Bool)1) [2024-01-31 16:12:29,437 INFO L98 nessWitnessExtractor]: Location invariant before [L731-L731] (((((0 <= value) && (value <= 6)) && (send == (_Bool)1)) && ((unsigned long )arg == 0UL)) && (receive == (_Bool)0 || receive == (_Bool)1)) && (((((i == 4 || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) || (5 <= i && i <= 6)) [2024-01-31 16:12:29,437 INFO L98 nessWitnessExtractor]: Location invariant before [L703-L703] (((0 <= value) && (value <= 6)) && (receive == (_Bool)1)) && (send == (_Bool)0 || send == (_Bool)1) [2024-01-31 16:12:29,437 INFO L98 nessWitnessExtractor]: Location invariant before [L710-L710] (((((0 <= value) && (0 <= b)) && (value <= 6)) && (b <= 6)) && (send == (_Bool)1)) && (receive == (_Bool)0 || receive == (_Bool)1) [2024-01-31 16:12:29,476 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 16:12:29,749 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/circular_buffer_ok.i[30451,30464] [2024-01-31 16:12:29,755 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/circular_buffer_ok.i[30681,30694] [2024-01-31 16:12:29,761 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/circular_buffer_ok.i[30979,30992] [2024-01-31 16:12:29,787 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:12:29,795 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 [2024-01-31 16:12:29,881 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/circular_buffer_ok.i[30451,30464] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-31 16:12:29,900 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/circular_buffer_ok.i[30681,30694] 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:29,916 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/circular_buffer_ok.i[30979,30992] 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:29,934 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:12:29,983 INFO L208 MainTranslator]: Completed translation [2024-01-31 16:12:29,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:12:29 WrapperNode [2024-01-31 16:12:29,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 16:12:29,984 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 16:12:29,984 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 16:12:29,984 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 16:12:29,989 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:29" (1/1) ... [2024-01-31 16:12:30,004 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:29" (1/1) ... [2024-01-31 16:12:30,037 INFO L138 Inliner]: procedures = 169, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 184 [2024-01-31 16:12:30,038 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 16:12:30,038 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 16:12:30,048 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 16:12:30,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 16:12:30,056 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:29" (1/1) ... [2024-01-31 16:12:30,057 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:29" (1/1) ... [2024-01-31 16:12:30,070 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:29" (1/1) ... [2024-01-31 16:12:30,093 INFO L175 MemorySlicer]: Split 18 memory accesses to 6 slices as follows [2, 1, 2, 2, 3, 8]. 44 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 0, 0, 0, 8]. The 4 writes are split as follows [0, 0, 1, 1, 2, 0]. [2024-01-31 16:12:30,093 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:29" (1/1) ... [2024-01-31 16:12:30,093 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:29" (1/1) ... [2024-01-31 16:12:30,110 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:29" (1/1) ... [2024-01-31 16:12:30,122 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:29" (1/1) ... [2024-01-31 16:12:30,124 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:29" (1/1) ... [2024-01-31 16:12:30,125 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:29" (1/1) ... [2024-01-31 16:12:30,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 16:12:30,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 16:12:30,132 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 16:12:30,133 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 16:12:30,134 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:12:29" (1/1) ... [2024-01-31 16:12:30,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:12:30,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:12:30,205 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,208 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,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-31 16:12:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-31 16:12:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-31 16:12:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-31 16:12:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-31 16:12:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-01-31 16:12:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-01-31 16:12:30,235 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-01-31 16:12:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-01-31 16:12:30,236 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-01-31 16:12:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 16:12:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 16:12:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 16:12:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 16:12:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-31 16:12:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-01-31 16:12:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-31 16:12:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 16:12:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 16:12:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 16:12:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-01-31 16:12:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-01-31 16:12:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-01-31 16:12:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-01-31 16:12:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-01-31 16:12:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-01-31 16:12:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 16:12:30,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 16:12:30,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 16:12:30,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 16:12:30,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-31 16:12:30,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-01-31 16:12:30,239 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-31 16:12:30,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 16:12:30,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 16:12:30,241 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,410 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 16:12:30,413 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 16:12:30,886 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 16:12:30,887 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 16:12:31,011 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 16:12:31,012 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-01-31 16:12:31,012 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,012 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 16:12:31,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 16:12:31,014 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 16:12:31,016 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 16:12:31,016 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,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76558bdd 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,017 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,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76558bdd 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,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:12:29" (3/4) ... [2024-01-31 16:12:31,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76558bdd 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,018 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,018 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2024-01-31 16:12:31,031 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 16:12:31,031 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2024-01-31 16:12:31,031 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 16:12:31,098 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-31 16:12:31,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 119 transitions, 252 flow [2024-01-31 16:12:31,153 INFO L124 PetriNetUnfolderBase]: 9/117 cut-off events. [2024-01-31 16:12:31,153 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-31 16:12:31,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 117 events. 9/117 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 387 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2024-01-31 16:12:31,156 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 119 transitions, 252 flow [2024-01-31 16:12:31,159 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 115 transitions, 239 flow [2024-01-31 16:12:31,166 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 16:12:31,171 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;@7afafb0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 16:12:31,171 INFO L358 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2024-01-31 16:12:31,173 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 16:12:31,173 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-31 16:12:31,173 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:12:31,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:31,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-31 16:12:31,174 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-31 16:12:31,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:31,178 INFO L85 PathProgramCache]: Analyzing trace with hash 14762, now seen corresponding path program 1 times [2024-01-31 16:12:31,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:31,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264238911] [2024-01-31 16:12:31,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:31,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:31,448 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,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:31,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264238911] [2024-01-31 16:12:31,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264238911] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:31,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:31,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:12:31,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314007350] [2024-01-31 16:12:31,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:31,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:12:31,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:31,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:12:31,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:12:31,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 119 [2024-01-31 16:12:31,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 115 transitions, 239 flow. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:12:31,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:31,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 119 [2024-01-31 16:12:31,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:31,962 INFO L124 PetriNetUnfolderBase]: 1348/3201 cut-off events. [2024-01-31 16:12:31,963 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2024-01-31 16:12:31,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5438 conditions, 3201 events. 1348/3201 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 23454 event pairs, 1104 based on Foata normal form. 118/3013 useless extension candidates. Maximal degree in co-relation 5216. Up to 2169 conditions per place. [2024-01-31 16:12:31,979 INFO L140 encePairwiseOnDemand]: 111/119 looper letters, 53 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2024-01-31 16:12:31,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 109 transitions, 337 flow [2024-01-31 16:12:31,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:12:31,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:12:31,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2024-01-31 16:12:31,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6414565826330533 [2024-01-31 16:12:31,990 INFO L175 Difference]: Start difference. First operand has 113 places, 115 transitions, 239 flow. Second operand 3 states and 229 transitions. [2024-01-31 16:12:31,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 109 transitions, 337 flow [2024-01-31 16:12:31,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 109 transitions, 332 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-31 16:12:31,995 INFO L231 Difference]: Finished difference. Result has 109 places, 109 transitions, 226 flow [2024-01-31 16:12:31,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=109, PETRI_TRANSITIONS=109} [2024-01-31 16:12:31,998 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, -4 predicate places. [2024-01-31 16:12:31,998 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 109 transitions, 226 flow [2024-01-31 16:12:31,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:12:31,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:31,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-31 16:12:31,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 16:12:31,999 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-31 16:12:31,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:31,999 INFO L85 PathProgramCache]: Analyzing trace with hash 14201882, now seen corresponding path program 1 times [2024-01-31 16:12:31,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:31,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918375065] [2024-01-31 16:12:31,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:32,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:32,123 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,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:32,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918375065] [2024-01-31 16:12:32,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918375065] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:32,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:32,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:12:32,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882712273] [2024-01-31 16:12:32,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:32,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 16:12:32,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:32,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 16:12:32,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-31 16:12:32,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 119 [2024-01-31 16:12:32,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 109 transitions, 226 flow. Second operand has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:12:32,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:32,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 119 [2024-01-31 16:12:32,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:32,881 INFO L124 PetriNetUnfolderBase]: 2428/5764 cut-off events. [2024-01-31 16:12:32,881 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-01-31 16:12:32,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9706 conditions, 5764 events. 2428/5764 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 43853 event pairs, 946 based on Foata normal form. 0/5235 useless extension candidates. Maximal degree in co-relation 9689. Up to 2015 conditions per place. [2024-01-31 16:12:32,904 INFO L140 encePairwiseOnDemand]: 112/119 looper letters, 92 selfloop transitions, 5 changer transitions 0/149 dead transitions. [2024-01-31 16:12:32,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 149 transitions, 503 flow [2024-01-31 16:12:32,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:12:32,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:12:32,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 369 transitions. [2024-01-31 16:12:32,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6201680672268908 [2024-01-31 16:12:32,907 INFO L175 Difference]: Start difference. First operand has 109 places, 109 transitions, 226 flow. Second operand 5 states and 369 transitions. [2024-01-31 16:12:32,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 149 transitions, 503 flow [2024-01-31 16:12:32,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 149 transitions, 499 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:12:32,909 INFO L231 Difference]: Finished difference. Result has 110 places, 108 transitions, 234 flow [2024-01-31 16:12:32,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=234, PETRI_PLACES=110, PETRI_TRANSITIONS=108} [2024-01-31 16:12:32,910 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, -3 predicate places. [2024-01-31 16:12:32,910 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 108 transitions, 234 flow [2024-01-31 16:12:32,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:12:32,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:32,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:32,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 16:12:32,911 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-31 16:12:32,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:32,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2113029320, now seen corresponding path program 1 times [2024-01-31 16:12:32,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:32,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177877154] [2024-01-31 16:12:32,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:32,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:33,030 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,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:33,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177877154] [2024-01-31 16:12:33,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177877154] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:33,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:33,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:12:33,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022630909] [2024-01-31 16:12:33,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:33,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 16:12:33,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:33,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 16:12:33,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-31 16:12:33,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 119 [2024-01-31 16:12:33,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 108 transitions, 234 flow. Second operand has 5 states, 5 states have (on average 58.4) internal successors, (292), 5 states have internal predecessors, (292), 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,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:33,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 119 [2024-01-31 16:12:33,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:33,551 INFO L124 PetriNetUnfolderBase]: 1546/3941 cut-off events. [2024-01-31 16:12:33,551 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-01-31 16:12:33,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6598 conditions, 3941 events. 1546/3941 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 28836 event pairs, 668 based on Foata normal form. 16/3470 useless extension candidates. Maximal degree in co-relation 6045. Up to 1829 conditions per place. [2024-01-31 16:12:33,566 INFO L140 encePairwiseOnDemand]: 112/119 looper letters, 78 selfloop transitions, 3 changer transitions 0/131 dead transitions. [2024-01-31 16:12:33,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 131 transitions, 445 flow [2024-01-31 16:12:33,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:12:33,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:12:33,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 313 transitions. [2024-01-31 16:12:33,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.657563025210084 [2024-01-31 16:12:33,568 INFO L175 Difference]: Start difference. First operand has 110 places, 108 transitions, 234 flow. Second operand 4 states and 313 transitions. [2024-01-31 16:12:33,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 131 transitions, 445 flow [2024-01-31 16:12:33,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 131 transitions, 437 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-31 16:12:33,572 INFO L231 Difference]: Finished difference. Result has 109 places, 106 transitions, 234 flow [2024-01-31 16:12:33,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=109, PETRI_TRANSITIONS=106} [2024-01-31 16:12:33,573 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, -4 predicate places. [2024-01-31 16:12:33,573 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 106 transitions, 234 flow [2024-01-31 16:12:33,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.4) internal successors, (292), 5 states have internal predecessors, (292), 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,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:33,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:33,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 16:12:33,574 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-31 16:12:33,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:33,574 INFO L85 PathProgramCache]: Analyzing trace with hash 45591602, now seen corresponding path program 1 times [2024-01-31 16:12:33,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:33,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503041481] [2024-01-31 16:12:33,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:33,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:33,689 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,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:33,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503041481] [2024-01-31 16:12:33,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503041481] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:33,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:33,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:12:33,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476160014] [2024-01-31 16:12:33,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:33,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:12:33,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:33,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:12:33,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:12:33,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 119 [2024-01-31 16:12:33,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 106 transitions, 234 flow. Second operand has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 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,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:33,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 119 [2024-01-31 16:12:33,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:34,003 INFO L124 PetriNetUnfolderBase]: 1227/3396 cut-off events. [2024-01-31 16:12:34,003 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-01-31 16:12:34,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5540 conditions, 3396 events. 1227/3396 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 25438 event pairs, 358 based on Foata normal form. 0/2893 useless extension candidates. Maximal degree in co-relation 5101. Up to 1937 conditions per place. [2024-01-31 16:12:34,017 INFO L140 encePairwiseOnDemand]: 116/119 looper letters, 57 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2024-01-31 16:12:34,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 115 transitions, 372 flow [2024-01-31 16:12:34,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:12:34,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:12:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 319 transitions. [2024-01-31 16:12:34,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6701680672268907 [2024-01-31 16:12:34,018 INFO L175 Difference]: Start difference. First operand has 109 places, 106 transitions, 234 flow. Second operand 4 states and 319 transitions. [2024-01-31 16:12:34,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 115 transitions, 372 flow [2024-01-31 16:12:34,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 115 transitions, 366 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-31 16:12:34,020 INFO L231 Difference]: Finished difference. Result has 108 places, 105 transitions, 230 flow [2024-01-31 16:12:34,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=108, PETRI_TRANSITIONS=105} [2024-01-31 16:12:34,021 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, -5 predicate places. [2024-01-31 16:12:34,021 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 105 transitions, 230 flow [2024-01-31 16:12:34,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 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,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:34,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:34,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 16:12:34,022 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-31 16:12:34,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:34,023 INFO L85 PathProgramCache]: Analyzing trace with hash 861998963, now seen corresponding path program 1 times [2024-01-31 16:12:34,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:34,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865477049] [2024-01-31 16:12:34,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:34,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:34,088 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,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:34,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865477049] [2024-01-31 16:12:34,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865477049] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:34,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:34,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:12:34,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233173644] [2024-01-31 16:12:34,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:34,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:12:34,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:34,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:12:34,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:12:34,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 119 [2024-01-31 16:12:34,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 105 transitions, 230 flow. Second operand has 4 states, 4 states have (on average 68.25) internal successors, (273), 4 states have internal predecessors, (273), 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,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:34,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 119 [2024-01-31 16:12:34,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:34,409 INFO L124 PetriNetUnfolderBase]: 1116/2984 cut-off events. [2024-01-31 16:12:34,409 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-01-31 16:12:34,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4982 conditions, 2984 events. 1116/2984 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 21310 event pairs, 27 based on Foata normal form. 0/2586 useless extension candidates. Maximal degree in co-relation 4840. Up to 1603 conditions per place. [2024-01-31 16:12:34,419 INFO L140 encePairwiseOnDemand]: 116/119 looper letters, 88 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2024-01-31 16:12:34,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 145 transitions, 505 flow [2024-01-31 16:12:34,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:12:34,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:12:34,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 348 transitions. [2024-01-31 16:12:34,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7310924369747899 [2024-01-31 16:12:34,421 INFO L175 Difference]: Start difference. First operand has 108 places, 105 transitions, 230 flow. Second operand 4 states and 348 transitions. [2024-01-31 16:12:34,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 145 transitions, 505 flow [2024-01-31 16:12:34,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 145 transitions, 500 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:12:34,423 INFO L231 Difference]: Finished difference. Result has 108 places, 104 transitions, 229 flow [2024-01-31 16:12:34,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=229, PETRI_PLACES=108, PETRI_TRANSITIONS=104} [2024-01-31 16:12:34,424 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, -5 predicate places. [2024-01-31 16:12:34,424 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 104 transitions, 229 flow [2024-01-31 16:12:34,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.25) internal successors, (273), 4 states have internal predecessors, (273), 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,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:34,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:34,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-31 16:12:34,425 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-31 16:12:34,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:34,425 INFO L85 PathProgramCache]: Analyzing trace with hash 863874229, now seen corresponding path program 1 times [2024-01-31 16:12:34,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:34,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253809345] [2024-01-31 16:12:34,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:34,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:34,457 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,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:34,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253809345] [2024-01-31 16:12:34,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253809345] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:34,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:34,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 16:12:34,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239855276] [2024-01-31 16:12:34,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:34,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:12:34,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:34,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:12:34,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:12:34,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 119 [2024-01-31 16:12:34,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 104 transitions, 229 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:34,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:34,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 119 [2024-01-31 16:12:34,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:34,857 INFO L124 PetriNetUnfolderBase]: 1338/3660 cut-off events. [2024-01-31 16:12:34,858 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2024-01-31 16:12:34,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6096 conditions, 3660 events. 1338/3660 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 27864 event pairs, 549 based on Foata normal form. 32/3140 useless extension candidates. Maximal degree in co-relation 5768. Up to 1477 conditions per place. [2024-01-31 16:12:34,872 INFO L140 encePairwiseOnDemand]: 115/119 looper letters, 80 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2024-01-31 16:12:34,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 136 transitions, 463 flow [2024-01-31 16:12:34,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:12:34,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:12:34,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 276 transitions. [2024-01-31 16:12:34,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.773109243697479 [2024-01-31 16:12:34,873 INFO L175 Difference]: Start difference. First operand has 108 places, 104 transitions, 229 flow. Second operand 3 states and 276 transitions. [2024-01-31 16:12:34,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 136 transitions, 463 flow [2024-01-31 16:12:34,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 136 transitions, 457 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:12:34,876 INFO L231 Difference]: Finished difference. Result has 109 places, 105 transitions, 240 flow [2024-01-31 16:12:34,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=109, PETRI_TRANSITIONS=105} [2024-01-31 16:12:34,877 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, -4 predicate places. [2024-01-31 16:12:34,877 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 105 transitions, 240 flow [2024-01-31 16:12:34,877 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:34,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:34,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:34,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 16:12:34,878 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-31 16:12:34,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:34,878 INFO L85 PathProgramCache]: Analyzing trace with hash -547665354, now seen corresponding path program 1 times [2024-01-31 16:12:34,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:34,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754388500] [2024-01-31 16:12:34,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:34,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:34,912 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,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:34,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754388500] [2024-01-31 16:12:34,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754388500] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:34,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:34,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 16:12:34,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869442213] [2024-01-31 16:12:34,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:34,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:12:34,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:34,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:12:34,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:12:34,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 119 [2024-01-31 16:12:34,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 105 transitions, 240 flow. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:34,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 119 [2024-01-31 16:12:34,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:35,416 INFO L124 PetriNetUnfolderBase]: 2223/6079 cut-off events. [2024-01-31 16:12:35,417 INFO L125 PetriNetUnfolderBase]: For 218/244 co-relation queries the response was YES. [2024-01-31 16:12:35,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10214 conditions, 6079 events. 2223/6079 cut-off events. For 218/244 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 51538 event pairs, 1161 based on Foata normal form. 124/5357 useless extension candidates. Maximal degree in co-relation 9821. Up to 2262 conditions per place. [2024-01-31 16:12:35,441 INFO L140 encePairwiseOnDemand]: 115/119 looper letters, 84 selfloop transitions, 2 changer transitions 0/140 dead transitions. [2024-01-31 16:12:35,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 140 transitions, 499 flow [2024-01-31 16:12:35,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:12:35,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:12:35,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 276 transitions. [2024-01-31 16:12:35,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.773109243697479 [2024-01-31 16:12:35,442 INFO L175 Difference]: Start difference. First operand has 109 places, 105 transitions, 240 flow. Second operand 3 states and 276 transitions. [2024-01-31 16:12:35,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 140 transitions, 499 flow [2024-01-31 16:12:35,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 140 transitions, 495 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 16:12:35,445 INFO L231 Difference]: Finished difference. Result has 111 places, 106 transitions, 252 flow [2024-01-31 16:12:35,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=111, PETRI_TRANSITIONS=106} [2024-01-31 16:12:35,446 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, -2 predicate places. [2024-01-31 16:12:35,446 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 106 transitions, 252 flow [2024-01-31 16:12:35,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:35,446 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:35,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 16:12:35,447 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-31 16:12:35,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:35,447 INFO L85 PathProgramCache]: Analyzing trace with hash 233672635, now seen corresponding path program 1 times [2024-01-31 16:12:35,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:35,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464897368] [2024-01-31 16:12:35,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:35,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:35,577 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,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:35,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464897368] [2024-01-31 16:12:35,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464897368] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:35,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:35,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 16:12:35,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887633273] [2024-01-31 16:12:35,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:35,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:12:35,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:35,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:12:35,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:12:35,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 119 [2024-01-31 16:12:35,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 106 transitions, 252 flow. Second operand has 6 states, 6 states have (on average 49.166666666666664) internal successors, (295), 6 states have internal predecessors, (295), 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,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:35,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 119 [2024-01-31 16:12:35,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:37,502 INFO L124 PetriNetUnfolderBase]: 7671/16687 cut-off events. [2024-01-31 16:12:37,502 INFO L125 PetriNetUnfolderBase]: For 1641/1771 co-relation queries the response was YES. [2024-01-31 16:12:37,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31547 conditions, 16687 events. 7671/16687 cut-off events. For 1641/1771 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 140844 event pairs, 953 based on Foata normal form. 198/15623 useless extension candidates. Maximal degree in co-relation 30956. Up to 4929 conditions per place. [2024-01-31 16:12:37,588 INFO L140 encePairwiseOnDemand]: 100/119 looper letters, 197 selfloop transitions, 12 changer transitions 0/248 dead transitions. [2024-01-31 16:12:37,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 248 transitions, 1032 flow [2024-01-31 16:12:37,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:12:37,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:12:37,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 494 transitions. [2024-01-31 16:12:37,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6918767507002801 [2024-01-31 16:12:37,590 INFO L175 Difference]: Start difference. First operand has 111 places, 106 transitions, 252 flow. Second operand 6 states and 494 transitions. [2024-01-31 16:12:37,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 248 transitions, 1032 flow [2024-01-31 16:12:37,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 248 transitions, 1022 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 16:12:37,594 INFO L231 Difference]: Finished difference. Result has 119 places, 115 transitions, 353 flow [2024-01-31 16:12:37,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=353, PETRI_PLACES=119, PETRI_TRANSITIONS=115} [2024-01-31 16:12:37,595 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, 6 predicate places. [2024-01-31 16:12:37,595 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 115 transitions, 353 flow [2024-01-31 16:12:37,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.166666666666664) internal successors, (295), 6 states have internal predecessors, (295), 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,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:37,596 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:37,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 16:12:37,596 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-31 16:12:37,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:37,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1082802254, now seen corresponding path program 1 times [2024-01-31 16:12:37,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:37,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391434202] [2024-01-31 16:12:37,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:37,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:37,805 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,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:37,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391434202] [2024-01-31 16:12:37,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391434202] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:37,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:37,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 16:12:37,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046854662] [2024-01-31 16:12:37,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:37,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:12:37,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:37,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:12:37,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:12:38,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 119 [2024-01-31 16:12:38,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 115 transitions, 353 flow. Second operand has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 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,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:38,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 119 [2024-01-31 16:12:38,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:39,812 INFO L124 PetriNetUnfolderBase]: 7780/17552 cut-off events. [2024-01-31 16:12:39,813 INFO L125 PetriNetUnfolderBase]: For 4641/4721 co-relation queries the response was YES. [2024-01-31 16:12:39,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36430 conditions, 17552 events. 7780/17552 cut-off events. For 4641/4721 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 154741 event pairs, 2967 based on Foata normal form. 56/16761 useless extension candidates. Maximal degree in co-relation 35805. Up to 11434 conditions per place. [2024-01-31 16:12:39,892 INFO L140 encePairwiseOnDemand]: 112/119 looper letters, 116 selfloop transitions, 6 changer transitions 0/163 dead transitions. [2024-01-31 16:12:39,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 163 transitions, 728 flow [2024-01-31 16:12:39,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:12:39,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:12:39,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 358 transitions. [2024-01-31 16:12:39,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6016806722689075 [2024-01-31 16:12:39,894 INFO L175 Difference]: Start difference. First operand has 119 places, 115 transitions, 353 flow. Second operand 5 states and 358 transitions. [2024-01-31 16:12:39,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 163 transitions, 728 flow [2024-01-31 16:12:39,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 163 transitions, 724 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-01-31 16:12:39,899 INFO L231 Difference]: Finished difference. Result has 125 places, 118 transitions, 389 flow [2024-01-31 16:12:39,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=389, PETRI_PLACES=125, PETRI_TRANSITIONS=118} [2024-01-31 16:12:39,900 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, 12 predicate places. [2024-01-31 16:12:39,900 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 118 transitions, 389 flow [2024-01-31 16:12:39,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 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,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:39,901 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:39,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-31 16:12:39,901 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-31 16:12:39,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:39,907 INFO L85 PathProgramCache]: Analyzing trace with hash -799959365, now seen corresponding path program 1 times [2024-01-31 16:12:39,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:39,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551928379] [2024-01-31 16:12:39,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:39,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:40,136 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,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:40,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551928379] [2024-01-31 16:12:40,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551928379] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:40,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:40,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 16:12:40,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778986083] [2024-01-31 16:12:40,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:40,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 16:12:40,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:40,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 16:12:40,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-01-31 16:12:40,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 119 [2024-01-31 16:12:40,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 118 transitions, 389 flow. Second operand has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 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,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:40,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 119 [2024-01-31 16:12:40,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:42,033 INFO L124 PetriNetUnfolderBase]: 7949/16843 cut-off events. [2024-01-31 16:12:42,033 INFO L125 PetriNetUnfolderBase]: For 5707/5899 co-relation queries the response was YES. [2024-01-31 16:12:42,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36525 conditions, 16843 events. 7949/16843 cut-off events. For 5707/5899 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 139660 event pairs, 825 based on Foata normal form. 0/15045 useless extension candidates. Maximal degree in co-relation 35883. Up to 4949 conditions per place. [2024-01-31 16:12:42,096 INFO L140 encePairwiseOnDemand]: 102/119 looper letters, 214 selfloop transitions, 14 changer transitions 0/267 dead transitions. [2024-01-31 16:12:42,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 267 transitions, 1288 flow [2024-01-31 16:12:42,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 16:12:42,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 16:12:42,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 558 transitions. [2024-01-31 16:12:42,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6698679471788715 [2024-01-31 16:12:42,098 INFO L175 Difference]: Start difference. First operand has 125 places, 118 transitions, 389 flow. Second operand 7 states and 558 transitions. [2024-01-31 16:12:42,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 267 transitions, 1288 flow [2024-01-31 16:12:42,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 267 transitions, 1280 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-31 16:12:42,104 INFO L231 Difference]: Finished difference. Result has 130 places, 120 transitions, 437 flow [2024-01-31 16:12:42,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=437, PETRI_PLACES=130, PETRI_TRANSITIONS=120} [2024-01-31 16:12:42,105 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, 17 predicate places. [2024-01-31 16:12:42,105 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 120 transitions, 437 flow [2024-01-31 16:12:42,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 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,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:42,105 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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:42,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-31 16:12:42,106 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-31 16:12:42,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:42,106 INFO L85 PathProgramCache]: Analyzing trace with hash 447462712, now seen corresponding path program 1 times [2024-01-31 16:12:42,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:42,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163627060] [2024-01-31 16:12:42,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:42,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:42,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:42,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:42,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163627060] [2024-01-31 16:12:42,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163627060] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:12:42,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080461862] [2024-01-31 16:12:42,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:42,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:12:42,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:12:42,269 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:42,270 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:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:42,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-31 16:12:42,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:12:42,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:42,467 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 16:12:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:42,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080461862] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 16:12:42,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 16:12:42,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2024-01-31 16:12:42,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629260192] [2024-01-31 16:12:42,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 16:12:42,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-31 16:12:42,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:42,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-31 16:12:42,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-01-31 16:12:42,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 119 [2024-01-31 16:12:42,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 120 transitions, 437 flow. Second operand has 8 states, 8 states have (on average 63.375) internal successors, (507), 8 states have internal predecessors, (507), 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,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:42,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 119 [2024-01-31 16:12:42,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:45,604 INFO L124 PetriNetUnfolderBase]: 10612/24434 cut-off events. [2024-01-31 16:12:45,604 INFO L125 PetriNetUnfolderBase]: For 8321/8789 co-relation queries the response was YES. [2024-01-31 16:12:45,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52405 conditions, 24434 events. 10612/24434 cut-off events. For 8321/8789 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 227152 event pairs, 1795 based on Foata normal form. 816/23687 useless extension candidates. Maximal degree in co-relation 51562. Up to 3950 conditions per place. [2024-01-31 16:12:45,708 INFO L140 encePairwiseOnDemand]: 114/119 looper letters, 267 selfloop transitions, 8 changer transitions 0/325 dead transitions. [2024-01-31 16:12:45,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 325 transitions, 1824 flow [2024-01-31 16:12:45,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 16:12:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 16:12:45,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 629 transitions. [2024-01-31 16:12:45,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7551020408163265 [2024-01-31 16:12:45,710 INFO L175 Difference]: Start difference. First operand has 130 places, 120 transitions, 437 flow. Second operand 7 states and 629 transitions. [2024-01-31 16:12:45,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 325 transitions, 1824 flow [2024-01-31 16:12:45,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 325 transitions, 1716 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-01-31 16:12:45,726 INFO L231 Difference]: Finished difference. Result has 134 places, 122 transitions, 451 flow [2024-01-31 16:12:45,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=451, PETRI_PLACES=134, PETRI_TRANSITIONS=122} [2024-01-31 16:12:45,727 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, 21 predicate places. [2024-01-31 16:12:45,727 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 122 transitions, 451 flow [2024-01-31 16:12:45,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 63.375) internal successors, (507), 8 states have internal predecessors, (507), 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,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:45,727 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] [2024-01-31 16:12:45,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-01-31 16:12:45,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-01-31 16:12:45,938 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-31 16:12:45,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:45,939 INFO L85 PathProgramCache]: Analyzing trace with hash 190700748, now seen corresponding path program 1 times [2024-01-31 16:12:45,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:45,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329958205] [2024-01-31 16:12:45,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:45,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:46,034 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:46,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:46,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329958205] [2024-01-31 16:12:46,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329958205] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:46,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:46,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 16:12:46,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749624388] [2024-01-31 16:12:46,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:46,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 16:12:46,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:46,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 16:12:46,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-31 16:12:46,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 119 [2024-01-31 16:12:46,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 122 transitions, 451 flow. Second operand has 5 states, 5 states have (on average 66.4) internal successors, (332), 5 states have internal predecessors, (332), 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,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:46,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 119 [2024-01-31 16:12:46,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:48,517 INFO L124 PetriNetUnfolderBase]: 9408/24451 cut-off events. [2024-01-31 16:12:48,517 INFO L125 PetriNetUnfolderBase]: For 8081/8211 co-relation queries the response was YES. [2024-01-31 16:12:48,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50470 conditions, 24451 events. 9408/24451 cut-off events. For 8081/8211 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 247969 event pairs, 3585 based on Foata normal form. 34/22830 useless extension candidates. Maximal degree in co-relation 49746. Up to 14319 conditions per place. [2024-01-31 16:12:48,641 INFO L140 encePairwiseOnDemand]: 114/119 looper letters, 80 selfloop transitions, 4 changer transitions 0/138 dead transitions. [2024-01-31 16:12:48,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 138 transitions, 697 flow [2024-01-31 16:12:48,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:12:48,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:12:48,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 444 transitions. [2024-01-31 16:12:48,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6218487394957983 [2024-01-31 16:12:48,643 INFO L175 Difference]: Start difference. First operand has 134 places, 122 transitions, 451 flow. Second operand 6 states and 444 transitions. [2024-01-31 16:12:48,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 138 transitions, 697 flow [2024-01-31 16:12:48,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 138 transitions, 674 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-01-31 16:12:48,662 INFO L231 Difference]: Finished difference. Result has 138 places, 123 transitions, 453 flow [2024-01-31 16:12:48,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=453, PETRI_PLACES=138, PETRI_TRANSITIONS=123} [2024-01-31 16:12:48,663 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, 25 predicate places. [2024-01-31 16:12:48,663 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 123 transitions, 453 flow [2024-01-31 16:12:48,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.4) internal successors, (332), 5 states have internal predecessors, (332), 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,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:48,664 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] [2024-01-31 16:12:48,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-31 16:12:48,664 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-31 16:12:48,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:48,664 INFO L85 PathProgramCache]: Analyzing trace with hash 160192714, now seen corresponding path program 1 times [2024-01-31 16:12:48,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:48,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358156432] [2024-01-31 16:12:48,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:48,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:48,678 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-01-31 16:12:48,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [706863868] [2024-01-31 16:12:48,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:48,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:12:48,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:12:48,680 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:48,710 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:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:48,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjunts are in the unsatisfiable core [2024-01-31 16:12:48,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:12:48,911 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:48,913 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-31 16:12:48,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:48,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358156432] [2024-01-31 16:12:48,913 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-01-31 16:12:48,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706863868] [2024-01-31 16:12:48,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706863868] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:48,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:48,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 16:12:48,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692986350] [2024-01-31 16:12:48,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:48,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:12:48,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:48,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:12:48,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:12:48,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 119 [2024-01-31 16:12:48,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 123 transitions, 453 flow. Second operand has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 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,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:48,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 119 [2024-01-31 16:12:48,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:51,432 INFO L124 PetriNetUnfolderBase]: 8919/23001 cut-off events. [2024-01-31 16:12:51,433 INFO L125 PetriNetUnfolderBase]: For 6264/6394 co-relation queries the response was YES. [2024-01-31 16:12:51,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47809 conditions, 23001 events. 8919/23001 cut-off events. For 6264/6394 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 230911 event pairs, 3214 based on Foata normal form. 0/21300 useless extension candidates. Maximal degree in co-relation 47088. Up to 13429 conditions per place. [2024-01-31 16:12:51,558 INFO L140 encePairwiseOnDemand]: 116/119 looper letters, 95 selfloop transitions, 2 changer transitions 0/150 dead transitions. [2024-01-31 16:12:51,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 150 transitions, 775 flow [2024-01-31 16:12:51,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:12:51,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:12:51,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 328 transitions. [2024-01-31 16:12:51,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6890756302521008 [2024-01-31 16:12:51,561 INFO L175 Difference]: Start difference. First operand has 138 places, 123 transitions, 453 flow. Second operand 4 states and 328 transitions. [2024-01-31 16:12:51,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 150 transitions, 775 flow [2024-01-31 16:12:51,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 150 transitions, 770 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-31 16:12:51,583 INFO L231 Difference]: Finished difference. Result has 137 places, 122 transitions, 453 flow [2024-01-31 16:12:51,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=453, PETRI_PLACES=137, PETRI_TRANSITIONS=122} [2024-01-31 16:12:51,584 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, 24 predicate places. [2024-01-31 16:12:51,584 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 122 transitions, 453 flow [2024-01-31 16:12:51,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 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,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:51,585 INFO L208 CegarLoopForPetriNet]: trace histogram [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,602 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:51,800 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,SelfDestructingSolverStorable12 [2024-01-31 16:12:51,803 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-31 16:12:51,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:51,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1216227828, now seen corresponding path program 1 times [2024-01-31 16:12:51,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:51,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734684673] [2024-01-31 16:12:51,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:51,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:52,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:52,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734684673] [2024-01-31 16:12:52,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734684673] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:12:52,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508003697] [2024-01-31 16:12:52,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:52,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:12:52,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:12:52,092 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:52,113 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:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:52,213 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 12 conjunts are in the unsatisfiable core [2024-01-31 16:12:52,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:12:52,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:52,546 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 16:12:53,473 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:53,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508003697] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 16:12:53,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 16:12:53,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2024-01-31 16:12:53,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649072036] [2024-01-31 16:12:53,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 16:12:53,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-01-31 16:12:53,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:53,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-01-31 16:12:53,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2024-01-31 16:12:54,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 119 [2024-01-31 16:12:54,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 122 transitions, 453 flow. Second operand has 19 states, 19 states have (on average 47.63157894736842) internal successors, (905), 19 states have internal predecessors, (905), 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,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:54,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 119 [2024-01-31 16:12:54,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:13:02,572 INFO L124 PetriNetUnfolderBase]: 33019/67089 cut-off events. [2024-01-31 16:13:02,572 INFO L125 PetriNetUnfolderBase]: For 25213/25887 co-relation queries the response was YES. [2024-01-31 16:13:02,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154397 conditions, 67089 events. 33019/67089 cut-off events. For 25213/25887 co-relation queries the response was YES. Maximal size of possible extension queue 989. Compared 640619 event pairs, 2289 based on Foata normal form. 2678/67819 useless extension candidates. Maximal degree in co-relation 153455. Up to 10026 conditions per place. [2024-01-31 16:13:03,059 INFO L140 encePairwiseOnDemand]: 89/119 looper letters, 504 selfloop transitions, 106 changer transitions 0/645 dead transitions. [2024-01-31 16:13:03,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 645 transitions, 3450 flow [2024-01-31 16:13:03,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-01-31 16:13:03,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-01-31 16:13:03,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1673 transitions. [2024-01-31 16:13:03,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5623529411764706 [2024-01-31 16:13:03,064 INFO L175 Difference]: Start difference. First operand has 137 places, 122 transitions, 453 flow. Second operand 25 states and 1673 transitions. [2024-01-31 16:13:03,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 645 transitions, 3450 flow [2024-01-31 16:13:03,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 645 transitions, 3443 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 16:13:03,259 INFO L231 Difference]: Finished difference. Result has 180 places, 216 transitions, 1484 flow [2024-01-31 16:13:03,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1484, PETRI_PLACES=180, PETRI_TRANSITIONS=216} [2024-01-31 16:13:03,260 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, 67 predicate places. [2024-01-31 16:13:03,260 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 216 transitions, 1484 flow [2024-01-31 16:13:03,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 47.63157894736842) internal successors, (905), 19 states have internal predecessors, (905), 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,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:13:03,261 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] [2024-01-31 16:13:03,271 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:13:03,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:13:03,472 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-31 16:13:03,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:13:03,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1174297973, now seen corresponding path program 1 times [2024-01-31 16:13:03,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:13:03,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917625948] [2024-01-31 16:13:03,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:13:03,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:13:03,491 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-01-31 16:13:03,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [82883524] [2024-01-31 16:13:03,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:13:03,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:13:03,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:13:03,504 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:13:03,505 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:13:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:13:03,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-31 16:13:03,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:13:03,617 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:13:03,617 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-31 16:13:03,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:13:03,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917625948] [2024-01-31 16:13:03,617 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-01-31 16:13:03,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82883524] [2024-01-31 16:13:03,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82883524] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:13:03,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:13:03,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 16:13:03,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139122299] [2024-01-31 16:13:03,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:13:03,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 16:13:03,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:13:03,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 16:13:03,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-31 16:13:03,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 119 [2024-01-31 16:13:03,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 216 transitions, 1484 flow. Second operand has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 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,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:13:03,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 119 [2024-01-31 16:13:03,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:13:09,536 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([592] L753-->L753-3: Formula: (and (= |v_#pthreadsMutex_35| (store |v_#pthreadsMutex_36| |v_~#m~0.base_53| (store (select |v_#pthreadsMutex_36| |v_~#m~0.base_53|) |v_~#m~0.offset_53| 0))) (= |v_t2Thread1of1ForFork0_#t~nondet10#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_36|, ~#m~0.base=|v_~#m~0.base_53|, ~#m~0.offset=|v_~#m~0.offset_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_35|, ~#m~0.base=|v_~#m~0.base_53|, ~#m~0.offset=|v_~#m~0.offset_53|, t2Thread1of1ForFork0_#t~nondet10#1=|v_t2Thread1of1ForFork0_#t~nondet10#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~nondet10#1][83], [Black: 125#(= ~value~0 0), Black: 133#(and (= ~send~0 1) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0)), 56#L764-4true, Black: 255#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 187#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 331#(and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0)), Black: 149#(and (= |t1Thread1of1ForFork1_~i~0#1| 0) (= (* 4294967296 (div (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|) 4294967296)) (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|))), 615#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~receive~0 256) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), Black: 340#(and (= ~next~0 0) (= ~buffer_size~0 10)), Black: 153#(and (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), 19#L753-3true, 188#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (<= |t2Thread1of1ForFork0_~i~1#1| 6) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 157#(= ~value~0 0), Black: 160#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= (* 4294967296 (div (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|) 4294967296)) (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|)) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 158#(and (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 344#true, Black: 451#(and (<= 0 ~value~0) (= (mod ~send~0 256) 1)), Black: 170#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), 339#(= ~buffer_size~0 10), Black: 617#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), Black: 428#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* 256 (div ~receive~0 256)) ~receive~0) (<= |t2Thread1of1ForFork0_~i~1#1| 6) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 169#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), 159#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 577#(or (and (<= 0 ~value~0) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1))) (< 6 ~value~0)), Black: 455#(and (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= (mod ~receive~0 256) 0)), Black: 516#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), 146#(and (= |t2Thread1of1ForFork0_#in~arg#1.base| 0) (= |t2Thread1of1ForFork0_#in~arg#1.offset| 0) (= |t2Thread1of1ForFork0_~arg#1.offset| 0) (= |t2Thread1of1ForFork0_~arg#1.base| 0)), Black: 599#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~send~0 256) 1) (= ~value~0 0)), Black: 609#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|))), 17#insertLogElement_returnLabel#1true, Black: 487#(and (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6) (= 0 |t2Thread1of1ForFork0_~i~1#1|)), 140#(and (= |t1Thread1of1ForFork1_#in~arg#1.base| 0) (= |t1Thread1of1ForFork1_~arg#1.offset| 0) (= |t1Thread1of1ForFork1_#in~arg#1.offset| 0) (= |t1Thread1of1ForFork1_~arg#1.base| 0)), Black: 500#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6)), Black: 427#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 603#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6)), Black: 181#(and (= |t1Thread1of1ForFork1_insertLogElement_~b#1| 0) (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), t2Thread1of1ForFork0InUse, Black: 611#(and (or (and (not (= (mod ~receive~0 256) 1)) (not (= (mod ~receive~0 256) 0))) (< 6 ~value~0) (and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|)))) (<= 0 ~value~0) (= (mod ~send~0 256) 1)), Black: 613#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~receive~0 256) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6)), Black: 178#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 601#(and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 471#(and (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (<= (mod ~receive~0 256) 0)), 413#(exists ((v_z_3 Int) (v_y_3 Int)) (and (<= (+ v_z_3 (* v_y_3 4294967296) 1) (mod ~buffer_size~0 4294967296)) (<= v_z_3 4294967294) (<= 0 v_z_3) (= ~next~0 (mod (+ v_z_3 1) (mod ~buffer_size~0 4294967296))) (<= 0 (+ v_z_3 (* v_y_3 4294967296))))), Black: 532#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|))), Black: 605#(and (or (and (not (= (mod ~receive~0 256) 1)) (not (= (mod ~receive~0 256) 0))) (< 6 ~value~0) (and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|)))) (or (and (<= 0 ~value~0) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1))) (< 6 ~value~0))), 728#(and (= |t1Thread1of1ForFork1_~i~0#1| |t1Thread1of1ForFork1_insertLogElement_#res#1|) (= |t1Thread1of1ForFork1_insertLogElement_~b#1| |t1Thread1of1ForFork1_~i~0#1|)), Black: 607#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6))]) [2024-01-31 16:13:09,538 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-01-31 16:13:09,538 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-01-31 16:13:09,538 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-01-31 16:13:09,539 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-01-31 16:13:09,609 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([592] L753-->L753-3: Formula: (and (= |v_#pthreadsMutex_35| (store |v_#pthreadsMutex_36| |v_~#m~0.base_53| (store (select |v_#pthreadsMutex_36| |v_~#m~0.base_53|) |v_~#m~0.offset_53| 0))) (= |v_t2Thread1of1ForFork0_#t~nondet10#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_36|, ~#m~0.base=|v_~#m~0.base_53|, ~#m~0.offset=|v_~#m~0.offset_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_35|, ~#m~0.base=|v_~#m~0.base_53|, ~#m~0.offset=|v_~#m~0.offset_53|, t2Thread1of1ForFork0_#t~nondet10#1=|v_t2Thread1of1ForFork0_#t~nondet10#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~nondet10#1][83], [Black: 125#(= ~value~0 0), Black: 133#(and (= ~send~0 1) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0)), Black: 255#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 187#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 331#(and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0)), 69#L765-1true, Black: 149#(and (= |t1Thread1of1ForFork1_~i~0#1| 0) (= (* 4294967296 (div (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|) 4294967296)) (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|))), Black: 340#(and (= ~next~0 0) (= ~buffer_size~0 10)), 615#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~receive~0 256) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), Black: 153#(and (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), 19#L753-3true, 188#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (<= |t2Thread1of1ForFork0_~i~1#1| 6) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 157#(= ~value~0 0), Black: 160#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= (* 4294967296 (div (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|) 4294967296)) (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|)) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 344#true, Black: 158#(and (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 451#(and (<= 0 ~value~0) (= (mod ~send~0 256) 1)), Black: 617#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), Black: 170#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), 339#(= ~buffer_size~0 10), 159#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 428#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* 256 (div ~receive~0 256)) ~receive~0) (<= |t2Thread1of1ForFork0_~i~1#1| 6) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 169#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 577#(or (and (<= 0 ~value~0) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1))) (< 6 ~value~0)), Black: 455#(and (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= (mod ~receive~0 256) 0)), Black: 516#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), 146#(and (= |t2Thread1of1ForFork0_#in~arg#1.base| 0) (= |t2Thread1of1ForFork0_#in~arg#1.offset| 0) (= |t2Thread1of1ForFork0_~arg#1.offset| 0) (= |t2Thread1of1ForFork0_~arg#1.base| 0)), Black: 599#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~send~0 256) 1) (= ~value~0 0)), 17#insertLogElement_returnLabel#1true, Black: 609#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|))), Black: 487#(and (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6) (= 0 |t2Thread1of1ForFork0_~i~1#1|)), Black: 500#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6)), 140#(and (= |t1Thread1of1ForFork1_#in~arg#1.base| 0) (= |t1Thread1of1ForFork1_~arg#1.offset| 0) (= |t1Thread1of1ForFork1_#in~arg#1.offset| 0) (= |t1Thread1of1ForFork1_~arg#1.base| 0)), Black: 427#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 603#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6)), Black: 181#(and (= |t1Thread1of1ForFork1_insertLogElement_~b#1| 0) (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), t2Thread1of1ForFork0InUse, Black: 611#(and (or (and (not (= (mod ~receive~0 256) 1)) (not (= (mod ~receive~0 256) 0))) (< 6 ~value~0) (and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|)))) (<= 0 ~value~0) (= (mod ~send~0 256) 1)), Black: 178#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 613#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~receive~0 256) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6)), Black: 601#(and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 471#(and (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (<= (mod ~receive~0 256) 0)), Black: 532#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|))), 413#(exists ((v_z_3 Int) (v_y_3 Int)) (and (<= (+ v_z_3 (* v_y_3 4294967296) 1) (mod ~buffer_size~0 4294967296)) (<= v_z_3 4294967294) (<= 0 v_z_3) (= ~next~0 (mod (+ v_z_3 1) (mod ~buffer_size~0 4294967296))) (<= 0 (+ v_z_3 (* v_y_3 4294967296))))), Black: 605#(and (or (and (not (= (mod ~receive~0 256) 1)) (not (= (mod ~receive~0 256) 0))) (< 6 ~value~0) (and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|)))) (or (and (<= 0 ~value~0) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1))) (< 6 ~value~0))), Black: 607#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6)), 728#(and (= |t1Thread1of1ForFork1_~i~0#1| |t1Thread1of1ForFork1_insertLogElement_#res#1|) (= |t1Thread1of1ForFork1_insertLogElement_~b#1| |t1Thread1of1ForFork1_~i~0#1|))]) [2024-01-31 16:13:09,610 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-01-31 16:13:09,610 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-01-31 16:13:09,610 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-01-31 16:13:09,610 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-01-31 16:13:09,680 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([592] L753-->L753-3: Formula: (and (= |v_#pthreadsMutex_35| (store |v_#pthreadsMutex_36| |v_~#m~0.base_53| (store (select |v_#pthreadsMutex_36| |v_~#m~0.base_53|) |v_~#m~0.offset_53| 0))) (= |v_t2Thread1of1ForFork0_#t~nondet10#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_36|, ~#m~0.base=|v_~#m~0.base_53|, ~#m~0.offset=|v_~#m~0.offset_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_35|, ~#m~0.base=|v_~#m~0.base_53|, ~#m~0.offset=|v_~#m~0.offset_53|, t2Thread1of1ForFork0_#t~nondet10#1=|v_t2Thread1of1ForFork0_#t~nondet10#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~nondet10#1][89], [Black: 125#(= ~value~0 0), Black: 133#(and (= ~send~0 1) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0)), 32#L730-7true, 56#L764-4true, Black: 255#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 187#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 331#(and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0)), Black: 149#(and (= |t1Thread1of1ForFork1_~i~0#1| 0) (= (* 4294967296 (div (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|) 4294967296)) (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|))), 730#(and (= |t1Thread1of1ForFork1_~i~0#1| |t1Thread1of1ForFork1_insertLogElement_#res#1|) (= |t1Thread1of1ForFork1_~i~0#1| |t1Thread1of1ForFork1_#t~ret5#1|)), 615#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~receive~0 256) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), Black: 340#(and (= ~next~0 0) (= ~buffer_size~0 10)), Black: 153#(and (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), 19#L753-3true, 188#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (<= |t2Thread1of1ForFork0_~i~1#1| 6) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 157#(= ~value~0 0), Black: 160#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= (* 4294967296 (div (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|) 4294967296)) (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|)) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 158#(and (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 344#true, Black: 451#(and (<= 0 ~value~0) (= (mod ~send~0 256) 1)), Black: 170#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), 339#(= ~buffer_size~0 10), Black: 617#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), Black: 428#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* 256 (div ~receive~0 256)) ~receive~0) (<= |t2Thread1of1ForFork0_~i~1#1| 6) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 169#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), 159#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 577#(or (and (<= 0 ~value~0) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1))) (< 6 ~value~0)), Black: 455#(and (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= (mod ~receive~0 256) 0)), Black: 516#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), 146#(and (= |t2Thread1of1ForFork0_#in~arg#1.base| 0) (= |t2Thread1of1ForFork0_#in~arg#1.offset| 0) (= |t2Thread1of1ForFork0_~arg#1.offset| 0) (= |t2Thread1of1ForFork0_~arg#1.base| 0)), Black: 599#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~send~0 256) 1) (= ~value~0 0)), Black: 609#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|))), Black: 487#(and (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6) (= 0 |t2Thread1of1ForFork0_~i~1#1|)), 140#(and (= |t1Thread1of1ForFork1_#in~arg#1.base| 0) (= |t1Thread1of1ForFork1_~arg#1.offset| 0) (= |t1Thread1of1ForFork1_#in~arg#1.offset| 0) (= |t1Thread1of1ForFork1_~arg#1.base| 0)), Black: 500#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6)), Black: 427#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 603#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6)), Black: 181#(and (= |t1Thread1of1ForFork1_insertLogElement_~b#1| 0) (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), t2Thread1of1ForFork0InUse, Black: 611#(and (or (and (not (= (mod ~receive~0 256) 1)) (not (= (mod ~receive~0 256) 0))) (< 6 ~value~0) (and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|)))) (<= 0 ~value~0) (= (mod ~send~0 256) 1)), Black: 613#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~receive~0 256) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6)), Black: 178#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 601#(and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 471#(and (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (<= (mod ~receive~0 256) 0)), 413#(exists ((v_z_3 Int) (v_y_3 Int)) (and (<= (+ v_z_3 (* v_y_3 4294967296) 1) (mod ~buffer_size~0 4294967296)) (<= v_z_3 4294967294) (<= 0 v_z_3) (= ~next~0 (mod (+ v_z_3 1) (mod ~buffer_size~0 4294967296))) (<= 0 (+ v_z_3 (* v_y_3 4294967296))))), Black: 532#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|))), Black: 605#(and (or (and (not (= (mod ~receive~0 256) 1)) (not (= (mod ~receive~0 256) 0))) (< 6 ~value~0) (and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|)))) (or (and (<= 0 ~value~0) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1))) (< 6 ~value~0))), Black: 607#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6))]) [2024-01-31 16:13:09,680 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-01-31 16:13:09,680 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-01-31 16:13:09,680 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-01-31 16:13:09,680 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-01-31 16:13:09,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([592] L753-->L753-3: Formula: (and (= |v_#pthreadsMutex_35| (store |v_#pthreadsMutex_36| |v_~#m~0.base_53| (store (select |v_#pthreadsMutex_36| |v_~#m~0.base_53|) |v_~#m~0.offset_53| 0))) (= |v_t2Thread1of1ForFork0_#t~nondet10#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_36|, ~#m~0.base=|v_~#m~0.base_53|, ~#m~0.offset=|v_~#m~0.offset_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_35|, ~#m~0.base=|v_~#m~0.base_53|, ~#m~0.offset=|v_~#m~0.offset_53|, t2Thread1of1ForFork0_#t~nondet10#1=|v_t2Thread1of1ForFork0_#t~nondet10#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~nondet10#1][89], [Black: 125#(= ~value~0 0), Black: 133#(and (= ~send~0 1) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0)), 32#L730-7true, Black: 255#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 187#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 331#(and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0)), 69#L765-1true, Black: 149#(and (= |t1Thread1of1ForFork1_~i~0#1| 0) (= (* 4294967296 (div (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|) 4294967296)) (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|))), 730#(and (= |t1Thread1of1ForFork1_~i~0#1| |t1Thread1of1ForFork1_insertLogElement_#res#1|) (= |t1Thread1of1ForFork1_~i~0#1| |t1Thread1of1ForFork1_#t~ret5#1|)), Black: 340#(and (= ~next~0 0) (= ~buffer_size~0 10)), 615#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~receive~0 256) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), Black: 153#(and (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), 19#L753-3true, 188#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (<= |t2Thread1of1ForFork0_~i~1#1| 6) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 157#(= ~value~0 0), Black: 160#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= (* 4294967296 (div (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|) 4294967296)) (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|)) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 344#true, Black: 158#(and (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 451#(and (<= 0 ~value~0) (= (mod ~send~0 256) 1)), Black: 617#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), Black: 170#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), 339#(= ~buffer_size~0 10), 159#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 428#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* 256 (div ~receive~0 256)) ~receive~0) (<= |t2Thread1of1ForFork0_~i~1#1| 6) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 169#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 577#(or (and (<= 0 ~value~0) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1))) (< 6 ~value~0)), Black: 455#(and (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= (mod ~receive~0 256) 0)), Black: 516#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), 146#(and (= |t2Thread1of1ForFork0_#in~arg#1.base| 0) (= |t2Thread1of1ForFork0_#in~arg#1.offset| 0) (= |t2Thread1of1ForFork0_~arg#1.offset| 0) (= |t2Thread1of1ForFork0_~arg#1.base| 0)), Black: 599#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~send~0 256) 1) (= ~value~0 0)), Black: 609#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|))), Black: 487#(and (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6) (= 0 |t2Thread1of1ForFork0_~i~1#1|)), Black: 500#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6)), 140#(and (= |t1Thread1of1ForFork1_#in~arg#1.base| 0) (= |t1Thread1of1ForFork1_~arg#1.offset| 0) (= |t1Thread1of1ForFork1_#in~arg#1.offset| 0) (= |t1Thread1of1ForFork1_~arg#1.base| 0)), Black: 427#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 603#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6)), Black: 181#(and (= |t1Thread1of1ForFork1_insertLogElement_~b#1| 0) (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), t2Thread1of1ForFork0InUse, Black: 611#(and (or (and (not (= (mod ~receive~0 256) 1)) (not (= (mod ~receive~0 256) 0))) (< 6 ~value~0) (and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|)))) (<= 0 ~value~0) (= (mod ~send~0 256) 1)), Black: 178#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 613#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~receive~0 256) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6)), Black: 601#(and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 471#(and (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (<= (mod ~receive~0 256) 0)), Black: 532#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|))), 413#(exists ((v_z_3 Int) (v_y_3 Int)) (and (<= (+ v_z_3 (* v_y_3 4294967296) 1) (mod ~buffer_size~0 4294967296)) (<= v_z_3 4294967294) (<= 0 v_z_3) (= ~next~0 (mod (+ v_z_3 1) (mod ~buffer_size~0 4294967296))) (<= 0 (+ v_z_3 (* v_y_3 4294967296))))), Black: 605#(and (or (and (not (= (mod ~receive~0 256) 1)) (not (= (mod ~receive~0 256) 0))) (< 6 ~value~0) (and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|)))) (or (and (<= 0 ~value~0) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1))) (< 6 ~value~0))), Black: 607#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6))]) [2024-01-31 16:13:09,741 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2024-01-31 16:13:09,741 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-01-31 16:13:09,742 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-01-31 16:13:09,742 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-01-31 16:13:10,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([592] L753-->L753-3: Formula: (and (= |v_#pthreadsMutex_35| (store |v_#pthreadsMutex_36| |v_~#m~0.base_53| (store (select |v_#pthreadsMutex_36| |v_~#m~0.base_53|) |v_~#m~0.offset_53| 0))) (= |v_t2Thread1of1ForFork0_#t~nondet10#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_36|, ~#m~0.base=|v_~#m~0.base_53|, ~#m~0.offset=|v_~#m~0.offset_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_35|, ~#m~0.base=|v_~#m~0.base_53|, ~#m~0.offset=|v_~#m~0.offset_53|, t2Thread1of1ForFork0_#t~nondet10#1=|v_t2Thread1of1ForFork0_#t~nondet10#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~nondet10#1][90], [Black: 125#(= ~value~0 0), Black: 133#(and (= ~send~0 1) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0)), 56#L764-4true, Black: 255#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 187#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 331#(and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0)), Black: 149#(and (= |t1Thread1of1ForFork1_~i~0#1| 0) (= (* 4294967296 (div (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|) 4294967296)) (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|))), 615#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~receive~0 256) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), Black: 340#(and (= ~next~0 0) (= ~buffer_size~0 10)), Black: 153#(and (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), 716#(= |t1Thread1of1ForFork1_~i~0#1| |t1Thread1of1ForFork1_insertLogElement_#res#1|), 19#L753-3true, 58#L730-11true, 188#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (<= |t2Thread1of1ForFork0_~i~1#1| 6) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 157#(= ~value~0 0), Black: 160#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= (* 4294967296 (div (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|) 4294967296)) (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|)) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 158#(and (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 344#true, Black: 451#(and (<= 0 ~value~0) (= (mod ~send~0 256) 1)), Black: 170#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), 339#(= ~buffer_size~0 10), Black: 617#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), Black: 428#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* 256 (div ~receive~0 256)) ~receive~0) (<= |t2Thread1of1ForFork0_~i~1#1| 6) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 169#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), 159#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 577#(or (and (<= 0 ~value~0) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1))) (< 6 ~value~0)), Black: 455#(and (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= (mod ~receive~0 256) 0)), Black: 516#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), 146#(and (= |t2Thread1of1ForFork0_#in~arg#1.base| 0) (= |t2Thread1of1ForFork0_#in~arg#1.offset| 0) (= |t2Thread1of1ForFork0_~arg#1.offset| 0) (= |t2Thread1of1ForFork0_~arg#1.base| 0)), Black: 599#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~send~0 256) 1) (= ~value~0 0)), Black: 609#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|))), Black: 487#(and (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6) (= 0 |t2Thread1of1ForFork0_~i~1#1|)), 140#(and (= |t1Thread1of1ForFork1_#in~arg#1.base| 0) (= |t1Thread1of1ForFork1_~arg#1.offset| 0) (= |t1Thread1of1ForFork1_#in~arg#1.offset| 0) (= |t1Thread1of1ForFork1_~arg#1.base| 0)), Black: 500#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6)), Black: 427#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 603#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6)), Black: 181#(and (= |t1Thread1of1ForFork1_insertLogElement_~b#1| 0) (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), t2Thread1of1ForFork0InUse, Black: 611#(and (or (and (not (= (mod ~receive~0 256) 1)) (not (= (mod ~receive~0 256) 0))) (< 6 ~value~0) (and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|)))) (<= 0 ~value~0) (= (mod ~send~0 256) 1)), Black: 613#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~receive~0 256) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6)), Black: 178#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 601#(and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 471#(and (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (<= (mod ~receive~0 256) 0)), 413#(exists ((v_z_3 Int) (v_y_3 Int)) (and (<= (+ v_z_3 (* v_y_3 4294967296) 1) (mod ~buffer_size~0 4294967296)) (<= v_z_3 4294967294) (<= 0 v_z_3) (= ~next~0 (mod (+ v_z_3 1) (mod ~buffer_size~0 4294967296))) (<= 0 (+ v_z_3 (* v_y_3 4294967296))))), Black: 532#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|))), Black: 605#(and (or (and (not (= (mod ~receive~0 256) 1)) (not (= (mod ~receive~0 256) 0))) (< 6 ~value~0) (and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|)))) (or (and (<= 0 ~value~0) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1))) (< 6 ~value~0))), Black: 607#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6))]) [2024-01-31 16:13:10,029 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2024-01-31 16:13:10,029 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-01-31 16:13:10,029 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-01-31 16:13:10,030 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-01-31 16:13:10,113 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([592] L753-->L753-3: Formula: (and (= |v_#pthreadsMutex_35| (store |v_#pthreadsMutex_36| |v_~#m~0.base_53| (store (select |v_#pthreadsMutex_36| |v_~#m~0.base_53|) |v_~#m~0.offset_53| 0))) (= |v_t2Thread1of1ForFork0_#t~nondet10#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_36|, ~#m~0.base=|v_~#m~0.base_53|, ~#m~0.offset=|v_~#m~0.offset_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_35|, ~#m~0.base=|v_~#m~0.base_53|, ~#m~0.offset=|v_~#m~0.offset_53|, t2Thread1of1ForFork0_#t~nondet10#1=|v_t2Thread1of1ForFork0_#t~nondet10#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~nondet10#1][90], [Black: 125#(= ~value~0 0), Black: 133#(and (= ~send~0 1) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0)), Black: 255#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 187#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 331#(and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0)), 69#L765-1true, Black: 149#(and (= |t1Thread1of1ForFork1_~i~0#1| 0) (= (* 4294967296 (div (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|) 4294967296)) (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|))), Black: 340#(and (= ~next~0 0) (= ~buffer_size~0 10)), 615#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~receive~0 256) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), Black: 153#(and (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), 716#(= |t1Thread1of1ForFork1_~i~0#1| |t1Thread1of1ForFork1_insertLogElement_#res#1|), 19#L753-3true, 58#L730-11true, 188#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (<= |t2Thread1of1ForFork0_~i~1#1| 6) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 157#(= ~value~0 0), Black: 160#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= (* 4294967296 (div (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|) 4294967296)) (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|)) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 344#true, Black: 158#(and (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 451#(and (<= 0 ~value~0) (= (mod ~send~0 256) 1)), Black: 617#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), Black: 170#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), 339#(= ~buffer_size~0 10), 159#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 428#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* 256 (div ~receive~0 256)) ~receive~0) (<= |t2Thread1of1ForFork0_~i~1#1| 6) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 169#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 577#(or (and (<= 0 ~value~0) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1))) (< 6 ~value~0)), Black: 455#(and (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= (mod ~receive~0 256) 0)), Black: 516#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), 146#(and (= |t2Thread1of1ForFork0_#in~arg#1.base| 0) (= |t2Thread1of1ForFork0_#in~arg#1.offset| 0) (= |t2Thread1of1ForFork0_~arg#1.offset| 0) (= |t2Thread1of1ForFork0_~arg#1.base| 0)), Black: 599#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~send~0 256) 1) (= ~value~0 0)), Black: 609#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|))), Black: 487#(and (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6) (= 0 |t2Thread1of1ForFork0_~i~1#1|)), Black: 500#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6)), 140#(and (= |t1Thread1of1ForFork1_#in~arg#1.base| 0) (= |t1Thread1of1ForFork1_~arg#1.offset| 0) (= |t1Thread1of1ForFork1_#in~arg#1.offset| 0) (= |t1Thread1of1ForFork1_~arg#1.base| 0)), Black: 427#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 603#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6)), Black: 181#(and (= |t1Thread1of1ForFork1_insertLogElement_~b#1| 0) (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), t2Thread1of1ForFork0InUse, Black: 611#(and (or (and (not (= (mod ~receive~0 256) 1)) (not (= (mod ~receive~0 256) 0))) (< 6 ~value~0) (and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|)))) (<= 0 ~value~0) (= (mod ~send~0 256) 1)), Black: 178#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 613#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~receive~0 256) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6)), Black: 601#(and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 471#(and (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (<= (mod ~receive~0 256) 0)), Black: 532#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|))), 413#(exists ((v_z_3 Int) (v_y_3 Int)) (and (<= (+ v_z_3 (* v_y_3 4294967296) 1) (mod ~buffer_size~0 4294967296)) (<= v_z_3 4294967294) (<= 0 v_z_3) (= ~next~0 (mod (+ v_z_3 1) (mod ~buffer_size~0 4294967296))) (<= 0 (+ v_z_3 (* v_y_3 4294967296))))), Black: 605#(and (or (and (not (= (mod ~receive~0 256) 1)) (not (= (mod ~receive~0 256) 0))) (< 6 ~value~0) (and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|)))) (or (and (<= 0 ~value~0) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1))) (< 6 ~value~0))), Black: 607#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6))]) [2024-01-31 16:13:10,114 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2024-01-31 16:13:10,114 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-01-31 16:13:10,114 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-01-31 16:13:10,114 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-01-31 16:13:10,829 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([592] L753-->L753-3: Formula: (and (= |v_#pthreadsMutex_35| (store |v_#pthreadsMutex_36| |v_~#m~0.base_53| (store (select |v_#pthreadsMutex_36| |v_~#m~0.base_53|) |v_~#m~0.offset_53| 0))) (= |v_t2Thread1of1ForFork0_#t~nondet10#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_36|, ~#m~0.base=|v_~#m~0.base_53|, ~#m~0.offset=|v_~#m~0.offset_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_35|, ~#m~0.base=|v_~#m~0.base_53|, ~#m~0.offset=|v_~#m~0.offset_53|, t2Thread1of1ForFork0_#t~nondet10#1=|v_t2Thread1of1ForFork0_#t~nondet10#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~nondet10#1][83], [Black: 125#(= ~value~0 0), Black: 133#(and (= ~send~0 1) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0)), 56#L764-4true, Black: 255#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 187#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 331#(and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0)), Black: 149#(and (= |t1Thread1of1ForFork1_~i~0#1| 0) (= (* 4294967296 (div (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|) 4294967296)) (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|))), Black: 340#(and (= ~next~0 0) (= ~buffer_size~0 10)), 615#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~receive~0 256) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), Black: 153#(and (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), 19#L753-3true, 188#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (<= |t2Thread1of1ForFork0_~i~1#1| 6) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 157#(= ~value~0 0), Black: 160#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= (* 4294967296 (div (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|) 4294967296)) (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|)) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 158#(and (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 344#true, Black: 451#(and (<= 0 ~value~0) (= (mod ~send~0 256) 1)), Black: 170#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), 339#(= ~buffer_size~0 10), Black: 617#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), 159#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 428#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* 256 (div ~receive~0 256)) ~receive~0) (<= |t2Thread1of1ForFork0_~i~1#1| 6) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 169#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 577#(or (and (<= 0 ~value~0) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1))) (< 6 ~value~0)), Black: 455#(and (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= (mod ~receive~0 256) 0)), Black: 516#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), 146#(and (= |t2Thread1of1ForFork0_#in~arg#1.base| 0) (= |t2Thread1of1ForFork0_#in~arg#1.offset| 0) (= |t2Thread1of1ForFork0_~arg#1.offset| 0) (= |t2Thread1of1ForFork0_~arg#1.base| 0)), Black: 599#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~send~0 256) 1) (= ~value~0 0)), Black: 609#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|))), 17#insertLogElement_returnLabel#1true, Black: 487#(and (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6) (= 0 |t2Thread1of1ForFork0_~i~1#1|)), 140#(and (= |t1Thread1of1ForFork1_#in~arg#1.base| 0) (= |t1Thread1of1ForFork1_~arg#1.offset| 0) (= |t1Thread1of1ForFork1_#in~arg#1.offset| 0) (= |t1Thread1of1ForFork1_~arg#1.base| 0)), Black: 500#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6)), Black: 427#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 603#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6)), Black: 181#(and (= |t1Thread1of1ForFork1_insertLogElement_~b#1| 0) (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 611#(and (or (and (not (= (mod ~receive~0 256) 1)) (not (= (mod ~receive~0 256) 0))) (< 6 ~value~0) (and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|)))) (<= 0 ~value~0) (= (mod ~send~0 256) 1)), t2Thread1of1ForFork0InUse, Black: 613#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~receive~0 256) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6)), Black: 178#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 601#(and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 471#(and (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (<= (mod ~receive~0 256) 0)), 413#(exists ((v_z_3 Int) (v_y_3 Int)) (and (<= (+ v_z_3 (* v_y_3 4294967296) 1) (mod ~buffer_size~0 4294967296)) (<= v_z_3 4294967294) (<= 0 v_z_3) (= ~next~0 (mod (+ v_z_3 1) (mod ~buffer_size~0 4294967296))) (<= 0 (+ v_z_3 (* v_y_3 4294967296))))), Black: 532#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|))), Black: 605#(and (or (and (not (= (mod ~receive~0 256) 1)) (not (= (mod ~receive~0 256) 0))) (< 6 ~value~0) (and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|)))) (or (and (<= 0 ~value~0) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1))) (< 6 ~value~0))), 728#(and (= |t1Thread1of1ForFork1_~i~0#1| |t1Thread1of1ForFork1_insertLogElement_#res#1|) (= |t1Thread1of1ForFork1_insertLogElement_~b#1| |t1Thread1of1ForFork1_~i~0#1|)), Black: 607#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6))]) [2024-01-31 16:13:10,829 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2024-01-31 16:13:10,830 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-01-31 16:13:10,830 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-01-31 16:13:10,830 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-01-31 16:13:10,830 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-01-31 16:13:10,836 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([592] L753-->L753-3: Formula: (and (= |v_#pthreadsMutex_35| (store |v_#pthreadsMutex_36| |v_~#m~0.base_53| (store (select |v_#pthreadsMutex_36| |v_~#m~0.base_53|) |v_~#m~0.offset_53| 0))) (= |v_t2Thread1of1ForFork0_#t~nondet10#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_36|, ~#m~0.base=|v_~#m~0.base_53|, ~#m~0.offset=|v_~#m~0.offset_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_35|, ~#m~0.base=|v_~#m~0.base_53|, ~#m~0.offset=|v_~#m~0.offset_53|, t2Thread1of1ForFork0_#t~nondet10#1=|v_t2Thread1of1ForFork0_#t~nondet10#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~nondet10#1][89], [Black: 125#(= ~value~0 0), 32#L730-7true, Black: 133#(and (= ~send~0 1) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0)), 56#L764-4true, Black: 255#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 187#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 331#(and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0)), 730#(and (= |t1Thread1of1ForFork1_~i~0#1| |t1Thread1of1ForFork1_insertLogElement_#res#1|) (= |t1Thread1of1ForFork1_~i~0#1| |t1Thread1of1ForFork1_#t~ret5#1|)), Black: 149#(and (= |t1Thread1of1ForFork1_~i~0#1| 0) (= (* 4294967296 (div (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|) 4294967296)) (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|))), Black: 340#(and (= ~next~0 0) (= ~buffer_size~0 10)), 615#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~receive~0 256) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), Black: 153#(and (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), 19#L753-3true, 188#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (<= |t2Thread1of1ForFork0_~i~1#1| 6) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 157#(= ~value~0 0), Black: 160#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= (* 4294967296 (div (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|) 4294967296)) (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|)) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 158#(and (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 344#true, Black: 451#(and (<= 0 ~value~0) (= (mod ~send~0 256) 1)), Black: 170#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), 339#(= ~buffer_size~0 10), Black: 617#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), 159#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 428#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* 256 (div ~receive~0 256)) ~receive~0) (<= |t2Thread1of1ForFork0_~i~1#1| 6) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 169#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 577#(or (and (<= 0 ~value~0) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1))) (< 6 ~value~0)), Black: 455#(and (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= (mod ~receive~0 256) 0)), Black: 516#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), 146#(and (= |t2Thread1of1ForFork0_#in~arg#1.base| 0) (= |t2Thread1of1ForFork0_#in~arg#1.offset| 0) (= |t2Thread1of1ForFork0_~arg#1.offset| 0) (= |t2Thread1of1ForFork0_~arg#1.base| 0)), Black: 599#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~send~0 256) 1) (= ~value~0 0)), Black: 609#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|))), Black: 487#(and (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6) (= 0 |t2Thread1of1ForFork0_~i~1#1|)), 140#(and (= |t1Thread1of1ForFork1_#in~arg#1.base| 0) (= |t1Thread1of1ForFork1_~arg#1.offset| 0) (= |t1Thread1of1ForFork1_#in~arg#1.offset| 0) (= |t1Thread1of1ForFork1_~arg#1.base| 0)), Black: 500#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6)), Black: 427#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 603#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6)), Black: 181#(and (= |t1Thread1of1ForFork1_insertLogElement_~b#1| 0) (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 611#(and (or (and (not (= (mod ~receive~0 256) 1)) (not (= (mod ~receive~0 256) 0))) (< 6 ~value~0) (and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|)))) (<= 0 ~value~0) (= (mod ~send~0 256) 1)), t2Thread1of1ForFork0InUse, Black: 613#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~receive~0 256) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6)), Black: 178#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 601#(and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 471#(and (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (<= (mod ~receive~0 256) 0)), 413#(exists ((v_z_3 Int) (v_y_3 Int)) (and (<= (+ v_z_3 (* v_y_3 4294967296) 1) (mod ~buffer_size~0 4294967296)) (<= v_z_3 4294967294) (<= 0 v_z_3) (= ~next~0 (mod (+ v_z_3 1) (mod ~buffer_size~0 4294967296))) (<= 0 (+ v_z_3 (* v_y_3 4294967296))))), Black: 532#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|))), Black: 605#(and (or (and (not (= (mod ~receive~0 256) 1)) (not (= (mod ~receive~0 256) 0))) (< 6 ~value~0) (and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|)))) (or (and (<= 0 ~value~0) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1))) (< 6 ~value~0))), Black: 607#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6))]) [2024-01-31 16:13:10,837 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2024-01-31 16:13:10,837 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-01-31 16:13:10,837 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-01-31 16:13:10,837 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-01-31 16:13:10,837 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-01-31 16:13:10,879 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([592] L753-->L753-3: Formula: (and (= |v_#pthreadsMutex_35| (store |v_#pthreadsMutex_36| |v_~#m~0.base_53| (store (select |v_#pthreadsMutex_36| |v_~#m~0.base_53|) |v_~#m~0.offset_53| 0))) (= |v_t2Thread1of1ForFork0_#t~nondet10#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_36|, ~#m~0.base=|v_~#m~0.base_53|, ~#m~0.offset=|v_~#m~0.offset_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_35|, ~#m~0.base=|v_~#m~0.base_53|, ~#m~0.offset=|v_~#m~0.offset_53|, t2Thread1of1ForFork0_#t~nondet10#1=|v_t2Thread1of1ForFork0_#t~nondet10#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~nondet10#1][83], [Black: 125#(= ~value~0 0), Black: 133#(and (= ~send~0 1) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0)), Black: 255#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 187#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 331#(and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0)), 69#L765-1true, Black: 149#(and (= |t1Thread1of1ForFork1_~i~0#1| 0) (= (* 4294967296 (div (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|) 4294967296)) (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|))), Black: 340#(and (= ~next~0 0) (= ~buffer_size~0 10)), 615#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~receive~0 256) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), Black: 153#(and (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), 19#L753-3true, 188#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (<= |t2Thread1of1ForFork0_~i~1#1| 6) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 157#(= ~value~0 0), Black: 160#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= (* 4294967296 (div (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|) 4294967296)) (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|)) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 158#(and (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 344#true, Black: 451#(and (<= 0 ~value~0) (= (mod ~send~0 256) 1)), Black: 617#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), Black: 170#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), 339#(= ~buffer_size~0 10), Black: 428#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* 256 (div ~receive~0 256)) ~receive~0) (<= |t2Thread1of1ForFork0_~i~1#1| 6) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 169#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), 159#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 577#(or (and (<= 0 ~value~0) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1))) (< 6 ~value~0)), Black: 455#(and (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= (mod ~receive~0 256) 0)), Black: 516#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), 146#(and (= |t2Thread1of1ForFork0_#in~arg#1.base| 0) (= |t2Thread1of1ForFork0_#in~arg#1.offset| 0) (= |t2Thread1of1ForFork0_~arg#1.offset| 0) (= |t2Thread1of1ForFork0_~arg#1.base| 0)), Black: 599#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~send~0 256) 1) (= ~value~0 0)), 17#insertLogElement_returnLabel#1true, Black: 609#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|))), Black: 487#(and (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6) (= 0 |t2Thread1of1ForFork0_~i~1#1|)), Black: 500#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6)), 140#(and (= |t1Thread1of1ForFork1_#in~arg#1.base| 0) (= |t1Thread1of1ForFork1_~arg#1.offset| 0) (= |t1Thread1of1ForFork1_#in~arg#1.offset| 0) (= |t1Thread1of1ForFork1_~arg#1.base| 0)), Black: 427#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 603#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6)), Black: 181#(and (= |t1Thread1of1ForFork1_insertLogElement_~b#1| 0) (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 611#(and (or (and (not (= (mod ~receive~0 256) 1)) (not (= (mod ~receive~0 256) 0))) (< 6 ~value~0) (and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|)))) (<= 0 ~value~0) (= (mod ~send~0 256) 1)), t2Thread1of1ForFork0InUse, Black: 178#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 613#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~receive~0 256) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6)), Black: 601#(and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 471#(and (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (<= (mod ~receive~0 256) 0)), Black: 532#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|))), 413#(exists ((v_z_3 Int) (v_y_3 Int)) (and (<= (+ v_z_3 (* v_y_3 4294967296) 1) (mod ~buffer_size~0 4294967296)) (<= v_z_3 4294967294) (<= 0 v_z_3) (= ~next~0 (mod (+ v_z_3 1) (mod ~buffer_size~0 4294967296))) (<= 0 (+ v_z_3 (* v_y_3 4294967296))))), Black: 605#(and (or (and (not (= (mod ~receive~0 256) 1)) (not (= (mod ~receive~0 256) 0))) (< 6 ~value~0) (and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|)))) (or (and (<= 0 ~value~0) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1))) (< 6 ~value~0))), 728#(and (= |t1Thread1of1ForFork1_~i~0#1| |t1Thread1of1ForFork1_insertLogElement_#res#1|) (= |t1Thread1of1ForFork1_insertLogElement_~b#1| |t1Thread1of1ForFork1_~i~0#1|)), Black: 607#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6))]) [2024-01-31 16:13:10,880 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2024-01-31 16:13:10,880 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-01-31 16:13:10,880 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-01-31 16:13:10,880 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-01-31 16:13:10,880 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-01-31 16:13:10,885 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([592] L753-->L753-3: Formula: (and (= |v_#pthreadsMutex_35| (store |v_#pthreadsMutex_36| |v_~#m~0.base_53| (store (select |v_#pthreadsMutex_36| |v_~#m~0.base_53|) |v_~#m~0.offset_53| 0))) (= |v_t2Thread1of1ForFork0_#t~nondet10#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_36|, ~#m~0.base=|v_~#m~0.base_53|, ~#m~0.offset=|v_~#m~0.offset_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_35|, ~#m~0.base=|v_~#m~0.base_53|, ~#m~0.offset=|v_~#m~0.offset_53|, t2Thread1of1ForFork0_#t~nondet10#1=|v_t2Thread1of1ForFork0_#t~nondet10#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~nondet10#1][89], [Black: 125#(= ~value~0 0), 32#L730-7true, Black: 133#(and (= ~send~0 1) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0)), Black: 255#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 187#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 331#(and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0)), 69#L765-1true, 730#(and (= |t1Thread1of1ForFork1_~i~0#1| |t1Thread1of1ForFork1_insertLogElement_#res#1|) (= |t1Thread1of1ForFork1_~i~0#1| |t1Thread1of1ForFork1_#t~ret5#1|)), Black: 149#(and (= |t1Thread1of1ForFork1_~i~0#1| 0) (= (* 4294967296 (div (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|) 4294967296)) (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|))), Black: 340#(and (= ~next~0 0) (= ~buffer_size~0 10)), 615#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~receive~0 256) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), Black: 153#(and (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), 19#L753-3true, 188#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (<= |t2Thread1of1ForFork0_~i~1#1| 6) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 157#(= ~value~0 0), Black: 160#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= (* 4294967296 (div (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|) 4294967296)) (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|)) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 158#(and (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 344#true, Black: 451#(and (<= 0 ~value~0) (= (mod ~send~0 256) 1)), Black: 617#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), Black: 170#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), 339#(= ~buffer_size~0 10), Black: 428#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* 256 (div ~receive~0 256)) ~receive~0) (<= |t2Thread1of1ForFork0_~i~1#1| 6) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 169#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), 159#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 577#(or (and (<= 0 ~value~0) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1))) (< 6 ~value~0)), Black: 455#(and (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= (mod ~receive~0 256) 0)), Black: 516#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), 146#(and (= |t2Thread1of1ForFork0_#in~arg#1.base| 0) (= |t2Thread1of1ForFork0_#in~arg#1.offset| 0) (= |t2Thread1of1ForFork0_~arg#1.offset| 0) (= |t2Thread1of1ForFork0_~arg#1.base| 0)), Black: 599#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~send~0 256) 1) (= ~value~0 0)), Black: 609#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|))), Black: 487#(and (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6) (= 0 |t2Thread1of1ForFork0_~i~1#1|)), Black: 500#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6)), 140#(and (= |t1Thread1of1ForFork1_#in~arg#1.base| 0) (= |t1Thread1of1ForFork1_~arg#1.offset| 0) (= |t1Thread1of1ForFork1_#in~arg#1.offset| 0) (= |t1Thread1of1ForFork1_~arg#1.base| 0)), Black: 427#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 603#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6)), Black: 611#(and (or (and (not (= (mod ~receive~0 256) 1)) (not (= (mod ~receive~0 256) 0))) (< 6 ~value~0) (and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|)))) (<= 0 ~value~0) (= (mod ~send~0 256) 1)), Black: 181#(and (= |t1Thread1of1ForFork1_insertLogElement_~b#1| 0) (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), t2Thread1of1ForFork0InUse, Black: 178#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 613#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~receive~0 256) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6)), Black: 601#(and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 471#(and (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (<= (mod ~receive~0 256) 0)), Black: 532#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|))), 413#(exists ((v_z_3 Int) (v_y_3 Int)) (and (<= (+ v_z_3 (* v_y_3 4294967296) 1) (mod ~buffer_size~0 4294967296)) (<= v_z_3 4294967294) (<= 0 v_z_3) (= ~next~0 (mod (+ v_z_3 1) (mod ~buffer_size~0 4294967296))) (<= 0 (+ v_z_3 (* v_y_3 4294967296))))), Black: 605#(and (or (and (not (= (mod ~receive~0 256) 1)) (not (= (mod ~receive~0 256) 0))) (< 6 ~value~0) (and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|)))) (or (and (<= 0 ~value~0) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1))) (< 6 ~value~0))), Black: 607#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6))]) [2024-01-31 16:13:10,886 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-01-31 16:13:10,886 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-01-31 16:13:10,886 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-01-31 16:13:10,886 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-01-31 16:13:10,886 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-01-31 16:13:11,241 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([592] L753-->L753-3: Formula: (and (= |v_#pthreadsMutex_35| (store |v_#pthreadsMutex_36| |v_~#m~0.base_53| (store (select |v_#pthreadsMutex_36| |v_~#m~0.base_53|) |v_~#m~0.offset_53| 0))) (= |v_t2Thread1of1ForFork0_#t~nondet10#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_36|, ~#m~0.base=|v_~#m~0.base_53|, ~#m~0.offset=|v_~#m~0.offset_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_35|, ~#m~0.base=|v_~#m~0.base_53|, ~#m~0.offset=|v_~#m~0.offset_53|, t2Thread1of1ForFork0_#t~nondet10#1=|v_t2Thread1of1ForFork0_#t~nondet10#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~nondet10#1][90], [Black: 125#(= ~value~0 0), Black: 133#(and (= ~send~0 1) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0)), 56#L764-4true, Black: 255#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 187#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 331#(and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0)), Black: 149#(and (= |t1Thread1of1ForFork1_~i~0#1| 0) (= (* 4294967296 (div (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|) 4294967296)) (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|))), Black: 340#(and (= ~next~0 0) (= ~buffer_size~0 10)), 615#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~receive~0 256) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), Black: 153#(and (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), 58#L730-11true, 19#L753-3true, 716#(= |t1Thread1of1ForFork1_~i~0#1| |t1Thread1of1ForFork1_insertLogElement_#res#1|), 188#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (<= |t2Thread1of1ForFork0_~i~1#1| 6) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 157#(= ~value~0 0), Black: 160#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= (* 4294967296 (div (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|) 4294967296)) (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|)) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 158#(and (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 344#true, Black: 451#(and (<= 0 ~value~0) (= (mod ~send~0 256) 1)), Black: 170#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), 339#(= ~buffer_size~0 10), Black: 617#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), Black: 428#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* 256 (div ~receive~0 256)) ~receive~0) (<= |t2Thread1of1ForFork0_~i~1#1| 6) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 169#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), 159#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 577#(or (and (<= 0 ~value~0) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1))) (< 6 ~value~0)), Black: 455#(and (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= (mod ~receive~0 256) 0)), Black: 516#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), 146#(and (= |t2Thread1of1ForFork0_#in~arg#1.base| 0) (= |t2Thread1of1ForFork0_#in~arg#1.offset| 0) (= |t2Thread1of1ForFork0_~arg#1.offset| 0) (= |t2Thread1of1ForFork0_~arg#1.base| 0)), Black: 599#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~send~0 256) 1) (= ~value~0 0)), Black: 609#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|))), Black: 487#(and (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6) (= 0 |t2Thread1of1ForFork0_~i~1#1|)), 140#(and (= |t1Thread1of1ForFork1_#in~arg#1.base| 0) (= |t1Thread1of1ForFork1_~arg#1.offset| 0) (= |t1Thread1of1ForFork1_#in~arg#1.offset| 0) (= |t1Thread1of1ForFork1_~arg#1.base| 0)), Black: 500#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6)), Black: 427#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 603#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6)), Black: 181#(and (= |t1Thread1of1ForFork1_insertLogElement_~b#1| 0) (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 611#(and (or (and (not (= (mod ~receive~0 256) 1)) (not (= (mod ~receive~0 256) 0))) (< 6 ~value~0) (and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|)))) (<= 0 ~value~0) (= (mod ~send~0 256) 1)), t2Thread1of1ForFork0InUse, Black: 613#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~receive~0 256) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6)), Black: 178#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 601#(and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 471#(and (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (<= (mod ~receive~0 256) 0)), 413#(exists ((v_z_3 Int) (v_y_3 Int)) (and (<= (+ v_z_3 (* v_y_3 4294967296) 1) (mod ~buffer_size~0 4294967296)) (<= v_z_3 4294967294) (<= 0 v_z_3) (= ~next~0 (mod (+ v_z_3 1) (mod ~buffer_size~0 4294967296))) (<= 0 (+ v_z_3 (* v_y_3 4294967296))))), Black: 532#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|))), Black: 605#(and (or (and (not (= (mod ~receive~0 256) 1)) (not (= (mod ~receive~0 256) 0))) (< 6 ~value~0) (and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|)))) (or (and (<= 0 ~value~0) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1))) (< 6 ~value~0))), Black: 607#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6))]) [2024-01-31 16:13:11,241 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-01-31 16:13:11,241 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-01-31 16:13:11,242 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-01-31 16:13:11,242 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-01-31 16:13:11,243 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-01-31 16:13:11,276 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([592] L753-->L753-3: Formula: (and (= |v_#pthreadsMutex_35| (store |v_#pthreadsMutex_36| |v_~#m~0.base_53| (store (select |v_#pthreadsMutex_36| |v_~#m~0.base_53|) |v_~#m~0.offset_53| 0))) (= |v_t2Thread1of1ForFork0_#t~nondet10#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_36|, ~#m~0.base=|v_~#m~0.base_53|, ~#m~0.offset=|v_~#m~0.offset_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_35|, ~#m~0.base=|v_~#m~0.base_53|, ~#m~0.offset=|v_~#m~0.offset_53|, t2Thread1of1ForFork0_#t~nondet10#1=|v_t2Thread1of1ForFork0_#t~nondet10#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~nondet10#1][90], [Black: 125#(= ~value~0 0), Black: 133#(and (= ~send~0 1) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0)), Black: 255#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 187#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 331#(and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0)), 69#L765-1true, Black: 149#(and (= |t1Thread1of1ForFork1_~i~0#1| 0) (= (* 4294967296 (div (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|) 4294967296)) (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|))), Black: 340#(and (= ~next~0 0) (= ~buffer_size~0 10)), 615#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~receive~0 256) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), Black: 153#(and (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), 58#L730-11true, 19#L753-3true, 716#(= |t1Thread1of1ForFork1_~i~0#1| |t1Thread1of1ForFork1_insertLogElement_#res#1|), 188#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (<= |t2Thread1of1ForFork0_~i~1#1| 6) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|))), Black: 157#(= ~value~0 0), Black: 160#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= (* 4294967296 (div (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|) 4294967296)) (+ |t1Thread1of1ForFork1_~arg#1.offset| |t1Thread1of1ForFork1_~arg#1.base|)) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 158#(and (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 344#true, Black: 451#(and (<= 0 ~value~0) (= (mod ~send~0 256) 1)), Black: 617#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), Black: 170#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), 339#(= ~buffer_size~0 10), 159#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 428#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* 256 (div ~receive~0 256)) ~receive~0) (<= |t2Thread1of1ForFork0_~i~1#1| 6) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 169#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 577#(or (and (<= 0 ~value~0) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1))) (< 6 ~value~0)), Black: 455#(and (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= (mod ~receive~0 256) 0)), Black: 516#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 6) (<= 5 |t2Thread1of1ForFork0_~i~1#1|)) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|))), 146#(and (= |t2Thread1of1ForFork0_#in~arg#1.base| 0) (= |t2Thread1of1ForFork0_#in~arg#1.offset| 0) (= |t2Thread1of1ForFork0_~arg#1.offset| 0) (= |t2Thread1of1ForFork0_~arg#1.base| 0)), Black: 599#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~send~0 256) 1) (= ~value~0 0)), Black: 609#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|))), Black: 487#(and (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6) (= 0 |t2Thread1of1ForFork0_~i~1#1|)), Black: 500#(and (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod ~receive~0 256) 0) (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6)), 140#(and (= |t1Thread1of1ForFork1_#in~arg#1.base| 0) (= |t1Thread1of1ForFork1_~arg#1.offset| 0) (= |t1Thread1of1ForFork1_#in~arg#1.offset| 0) (= |t1Thread1of1ForFork1_~arg#1.base| 0)), Black: 427#(and (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= (* (div (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 4294967296) (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|)) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 603#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6)), Black: 611#(and (or (and (not (= (mod ~receive~0 256) 1)) (not (= (mod ~receive~0 256) 0))) (< 6 ~value~0) (and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|)))) (<= 0 ~value~0) (= (mod ~send~0 256) 1)), Black: 181#(and (= |t1Thread1of1ForFork1_insertLogElement_~b#1| 0) (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), t2Thread1of1ForFork0InUse, Black: 178#(and (= (* 256 (div ~receive~0 256)) ~receive~0) (= |t1Thread1of1ForFork1_~i~0#1| 0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 613#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (mod ~receive~0 256) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (<= ~value~0 6)), Black: 601#(and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (= (* 256 (div ~receive~0 256)) ~receive~0) (= ~value~0 0) (= ~send~0 (+ (* 256 (div ~send~0 256)) 1))), Black: 471#(and (<= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (= (mod ~send~0 256) 1) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (<= (mod ~receive~0 256) 0)), Black: 532#(and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1)) (<= ~value~0 6) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|))), 413#(exists ((v_z_3 Int) (v_y_3 Int)) (and (<= (+ v_z_3 (* v_y_3 4294967296) 1) (mod ~buffer_size~0 4294967296)) (<= v_z_3 4294967294) (<= 0 v_z_3) (= ~next~0 (mod (+ v_z_3 1) (mod ~buffer_size~0 4294967296))) (<= 0 (+ v_z_3 (* v_y_3 4294967296))))), Black: 605#(and (or (and (not (= (mod ~receive~0 256) 1)) (not (= (mod ~receive~0 256) 0))) (< 6 ~value~0) (and (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= (+ 1 |t2Thread1of1ForFork0_~i~1#1|) 0) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (and (<= |t2Thread1of1ForFork0_~i~1#1| 5) (<= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= 0 |t2Thread1of1ForFork0_~i~1#1|)))) (or (and (<= 0 ~value~0) (or (= (mod ~send~0 256) 0) (= (mod ~send~0 256) 1))) (< 6 ~value~0))), Black: 607#(and (or (= 1 |t2Thread1of1ForFork0_~i~1#1|) (= 3 |t2Thread1of1ForFork0_~i~1#1|) (= 5 |t2Thread1of1ForFork0_~i~1#1|) (= 2 |t2Thread1of1ForFork0_~i~1#1|) (= 0 |t2Thread1of1ForFork0_~i~1#1|) (= 4 |t2Thread1of1ForFork0_~i~1#1|)) (= (mod (+ |t2Thread1of1ForFork0_~arg#1.base| |t2Thread1of1ForFork0_~arg#1.offset|) 4294967296) 0) (<= 0 ~value~0) (or (= (mod ~receive~0 256) 1) (= (mod ~receive~0 256) 0)) (= (mod ~send~0 256) 1) (<= ~value~0 6))]) [2024-01-31 16:13:11,277 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2024-01-31 16:13:11,277 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-01-31 16:13:11,290 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-01-31 16:13:11,290 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-01-31 16:13:11,290 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-01-31 16:13:11,772 INFO L124 PetriNetUnfolderBase]: 20387/53653 cut-off events. [2024-01-31 16:13:11,773 INFO L125 PetriNetUnfolderBase]: For 118969/120490 co-relation queries the response was YES. [2024-01-31 16:13:12,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155161 conditions, 53653 events. 20387/53653 cut-off events. For 118969/120490 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 619554 event pairs, 7607 based on Foata normal form. 92/51009 useless extension candidates. Maximal degree in co-relation 154194. Up to 14724 conditions per place. [2024-01-31 16:13:12,438 INFO L140 encePairwiseOnDemand]: 113/119 looper letters, 321 selfloop transitions, 19 changer transitions 0/423 dead transitions. [2024-01-31 16:13:12,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 423 transitions, 3737 flow [2024-01-31 16:13:12,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:13:12,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:13:12,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 528 transitions. [2024-01-31 16:13:12,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7394957983193278 [2024-01-31 16:13:12,441 INFO L175 Difference]: Start difference. First operand has 180 places, 216 transitions, 1484 flow. Second operand 6 states and 528 transitions. [2024-01-31 16:13:12,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 423 transitions, 3737 flow [2024-01-31 16:13:12,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 423 transitions, 3655 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-01-31 16:13:12,691 INFO L231 Difference]: Finished difference. Result has 182 places, 219 transitions, 1504 flow [2024-01-31 16:13:12,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=1444, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1504, PETRI_PLACES=182, PETRI_TRANSITIONS=219} [2024-01-31 16:13:12,692 INFO L281 CegarLoopForPetriNet]: 113 programPoint places, 69 predicate places. [2024-01-31 16:13:12,692 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 219 transitions, 1504 flow [2024-01-31 16:13:12,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 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:12,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:13:12,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:13:12,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-01-31 16:13:12,904 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,SelfDestructingSolverStorable14 [2024-01-31 16:13:12,904 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err15ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-31 16:13:12,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:13:12,904 INFO L85 PathProgramCache]: Analyzing trace with hash 2043467620, now seen corresponding path program 1 times [2024-01-31 16:13:12,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:13:12,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207851200] [2024-01-31 16:13:12,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:13:12,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:13:12,917 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-01-31 16:13:12,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [17947271] [2024-01-31 16:13:12,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:13:12,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:13:12,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:13:12,929 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:13:12,950 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:13:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:13:13,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 12 conjunts are in the unsatisfiable core [2024-01-31 16:13:13,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:13:13,376 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:13:13,376 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-31 16:13:13,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:13:13,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207851200] [2024-01-31 16:13:13,376 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-01-31 16:13:13,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17947271] [2024-01-31 16:13:13,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17947271] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:13:13,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:13:13,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 16:13:13,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771001706] [2024-01-31 16:13:13,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:13:13,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:13:13,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:13:13,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:13:13,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:13:13,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 119 [2024-01-31 16:13:13,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 219 transitions, 1504 flow. Second operand has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 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:13,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:13:13,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 119 [2024-01-31 16:13:13,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand