./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/read_write_lock-1.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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-atomic/read_write_lock-1.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/read_write_lock-1.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-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 00:51:50,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 00:51:50,169 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 00:51:50,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 00:51:50,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 00:51:50,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 00:51:50,220 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 00:51:50,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 00:51:50,222 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 00:51:50,227 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 00:51:50,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 00:51:50,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 00:51:50,229 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 00:51:50,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 00:51:50,231 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 00:51:50,231 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 00:51:50,231 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 00:51:50,232 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 00:51:50,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 00:51:50,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 00:51:50,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 00:51:50,233 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 00:51:50,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 00:51:50,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 00:51:50,234 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 00:51:50,234 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 00:51:50,234 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 00:51:50,234 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 00:51:50,235 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 00:51:50,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 00:51:50,236 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 00:51:50,236 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 00:51:50,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 00:51:50,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 00:51:50,237 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 00:51:50,237 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 00:51:50,238 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 00:51:50,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 00:51:50,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 00:51:50,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 00:51:50,238 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 00:51:50,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 00:51:50,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 00:51:50,239 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-06-28 00:51:50,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 00:51:50,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 00:51:50,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 00:51:50,493 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 00:51:50,494 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 00:51:50,495 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i [2024-06-28 00:51:51,642 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 00:51:51,902 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 00:51:51,903 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i [2024-06-28 00:51:51,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/441faef4e/c33099bb7ccf4e93b62698814a47f984/FLAG024c72339 [2024-06-28 00:51:51,931 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/441faef4e/c33099bb7ccf4e93b62698814a47f984 [2024-06-28 00:51:51,933 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 00:51:51,933 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 00:51:51,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/read_write_lock-1.yml/witness.yml [2024-06-28 00:51:52,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 00:51:52,078 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 00:51:52,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 00:51:52,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 00:51:52,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 00:51:52,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 12:51:51" (1/2) ... [2024-06-28 00:51:52,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4838efbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:51:52, skipping insertion in model container [2024-06-28 00:51:52,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 12:51:51" (1/2) ... [2024-06-28 00:51:52,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@25492644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:51:52, skipping insertion in model container [2024-06-28 00:51:52,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:51:52" (2/2) ... [2024-06-28 00:51:52,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4838efbe and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:51:52, skipping insertion in model container [2024-06-28 00:51:52,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:51:52" (2/2) ... [2024-06-28 00:51:52,090 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 00:51:52,131 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 00:51:52,133 INFO L97 edCorrectnessWitness]: Location invariant before [L747-L747] (((! multithreaded || (x == 0 || x == 3)) && (! multithreaded || (y == 0 || y == 3))) && (! multithreaded || ((w == 0 || w == 1) && (y == 0 || y == 3)))) && (! multithreaded || (w == 0 || w == 1)) [2024-06-28 00:51:52,133 INFO L97 edCorrectnessWitness]: Location invariant before [L749-L749] (((! multithreaded || (x == 0 || x == 3)) && (! multithreaded || (y == 0 || y == 3))) && (! multithreaded || ((w == 0 || w == 1) && (y == 0 || y == 3)))) && (! multithreaded || (w == 0 || w == 1)) [2024-06-28 00:51:52,133 INFO L97 edCorrectnessWitness]: Location invariant before [L748-L748] (((! multithreaded || (x == 0 || x == 3)) && (! multithreaded || (y == 0 || y == 3))) && (! multithreaded || ((w == 0 || w == 1) && (y == 0 || y == 3)))) && (! multithreaded || (w == 0 || w == 1)) [2024-06-28 00:51:52,134 INFO L97 edCorrectnessWitness]: Location invariant before [L746-L746] (((! multithreaded || (x == 0 || x == 3)) && (! multithreaded || (y == 0 || y == 3))) && (! multithreaded || ((w == 0 || w == 1) && (y == 0 || y == 3)))) && (! multithreaded || (w == 0 || w == 1)) [2024-06-28 00:51:52,134 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 00:51:52,135 INFO L106 edCorrectnessWitness]: ghost_update [L745-L745] multithreaded = 1; [2024-06-28 00:51:52,186 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 00:51:52,570 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i[31246,31259] [2024-06-28 00:51:52,584 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 00:51:52,598 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 00:51:52,670 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i[31246,31259] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 00:51:52,690 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 00:51:52,730 INFO L206 MainTranslator]: Completed translation [2024-06-28 00:51:52,731 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:51:52 WrapperNode [2024-06-28 00:51:52,731 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 00:51:52,732 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 00:51:52,733 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 00:51:52,733 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 00:51:52,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:51:52" (1/1) ... [2024-06-28 00:51:52,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:51:52" (1/1) ... [2024-06-28 00:51:52,806 INFO L138 Inliner]: procedures = 173, calls = 25, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 96 [2024-06-28 00:51:52,806 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 00:51:52,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 00:51:52,807 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 00:51:52,807 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 00:51:52,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:51:52" (1/1) ... [2024-06-28 00:51:52,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:51:52" (1/1) ... [2024-06-28 00:51:52,818 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:51:52" (1/1) ... [2024-06-28 00:51:52,847 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-28 00:51:52,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:51:52" (1/1) ... [2024-06-28 00:51:52,853 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:51:52" (1/1) ... [2024-06-28 00:51:52,858 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:51:52" (1/1) ... [2024-06-28 00:51:52,866 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:51:52" (1/1) ... [2024-06-28 00:51:52,868 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:51:52" (1/1) ... [2024-06-28 00:51:52,874 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:51:52" (1/1) ... [2024-06-28 00:51:52,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 00:51:52,877 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 00:51:52,885 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 00:51:52,885 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 00:51:52,886 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:51:52" (1/1) ... [2024-06-28 00:51:52,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 00:51:52,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 00:51:52,926 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-06-28 00:51:52,953 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-06-28 00:51:52,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 00:51:52,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 00:51:52,967 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-06-28 00:51:52,967 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-06-28 00:51:52,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 00:51:52,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 00:51:52,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 00:51:52,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 00:51:52,968 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-06-28 00:51:52,969 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-06-28 00:51:52,970 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 00:51:53,144 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 00:51:53,146 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 00:51:53,300 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 00:51:53,300 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 00:51:53,438 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 00:51:53,442 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 00:51:53,443 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 12:51:53 BoogieIcfgContainer [2024-06-28 00:51:53,443 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 00:51:53,446 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 00:51:53,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 00:51:53,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 00:51:53,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 12:51:51" (1/4) ... [2024-06-28 00:51:53,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8ebea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 12:51:53, skipping insertion in model container [2024-06-28 00:51:53,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:51:52" (2/4) ... [2024-06-28 00:51:53,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8ebea0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 12:51:53, skipping insertion in model container [2024-06-28 00:51:53,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:51:52" (3/4) ... [2024-06-28 00:51:53,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8ebea0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 12:51:53, skipping insertion in model container [2024-06-28 00:51:53,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 12:51:53" (4/4) ... [2024-06-28 00:51:53,454 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-1.i [2024-06-28 00:51:53,470 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 00:51:53,470 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-28 00:51:53,470 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 00:51:53,541 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-06-28 00:51:53,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 61 transitions, 150 flow [2024-06-28 00:51:53,625 INFO L124 PetriNetUnfolderBase]: 2/57 cut-off events. [2024-06-28 00:51:53,628 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-28 00:51:53,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 57 events. 2/57 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 113 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-06-28 00:51:53,633 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 61 transitions, 150 flow [2024-06-28 00:51:53,639 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 55 transitions, 131 flow [2024-06-28 00:51:53,656 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 00:51:53,665 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;@17fa206, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 00:51:53,665 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-06-28 00:51:53,672 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 00:51:53,672 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 00:51:53,672 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 00:51:53,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:53,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 00:51:53,673 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 00:51:53,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:53,679 INFO L85 PathProgramCache]: Analyzing trace with hash 227999800, now seen corresponding path program 1 times [2024-06-28 00:51:53,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:53,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868093397] [2024-06-28 00:51:53,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:53,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:53,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:51:53,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:53,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868093397] [2024-06-28 00:51:53,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868093397] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:53,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:53,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 00:51:54,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569547500] [2024-06-28 00:51:54,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:54,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 00:51:54,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:54,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 00:51:54,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 00:51:54,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 61 [2024-06-28 00:51:54,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-06-28 00:51:54,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:54,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 61 [2024-06-28 00:51:54,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:55,397 INFO L124 PetriNetUnfolderBase]: 6296/10598 cut-off events. [2024-06-28 00:51:55,397 INFO L125 PetriNetUnfolderBase]: For 571/571 co-relation queries the response was YES. [2024-06-28 00:51:55,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19707 conditions, 10598 events. 6296/10598 cut-off events. For 571/571 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 75418 event pairs, 3409 based on Foata normal form. 571/10543 useless extension candidates. Maximal degree in co-relation 19455. Up to 8612 conditions per place. [2024-06-28 00:51:55,490 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 48 selfloop transitions, 5 changer transitions 0/71 dead transitions. [2024-06-28 00:51:55,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 71 transitions, 278 flow [2024-06-28 00:51:55,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 00:51:55,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 00:51:55,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2024-06-28 00:51:55,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6830601092896175 [2024-06-28 00:51:55,505 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 131 flow. Second operand 3 states and 125 transitions. [2024-06-28 00:51:55,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 71 transitions, 278 flow [2024-06-28 00:51:55,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 71 transitions, 260 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-28 00:51:55,520 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 153 flow [2024-06-28 00:51:55,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2024-06-28 00:51:55,526 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -4 predicate places. [2024-06-28 00:51:55,526 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 153 flow [2024-06-28 00:51:55,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-06-28 00:51:55,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:55,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:55,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 00:51:55,528 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 00:51:55,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:55,528 INFO L85 PathProgramCache]: Analyzing trace with hash 64528567, now seen corresponding path program 1 times [2024-06-28 00:51:55,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:55,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763312372] [2024-06-28 00:51:55,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:55,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:55,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:51:55,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:55,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763312372] [2024-06-28 00:51:55,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763312372] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:55,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:55,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 00:51:55,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254870137] [2024-06-28 00:51:55,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:55,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 00:51:55,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:55,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 00:51:55,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-28 00:51:55,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2024-06-28 00:51:55,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-06-28 00:51:55,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:55,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2024-06-28 00:51:55,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:57,051 INFO L124 PetriNetUnfolderBase]: 9720/15654 cut-off events. [2024-06-28 00:51:57,051 INFO L125 PetriNetUnfolderBase]: For 2416/2416 co-relation queries the response was YES. [2024-06-28 00:51:57,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32721 conditions, 15654 events. 9720/15654 cut-off events. For 2416/2416 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 109643 event pairs, 4998 based on Foata normal form. 115/15092 useless extension candidates. Maximal degree in co-relation 18344. Up to 13080 conditions per place. [2024-06-28 00:51:57,158 INFO L140 encePairwiseOnDemand]: 48/61 looper letters, 62 selfloop transitions, 9 changer transitions 0/87 dead transitions. [2024-06-28 00:51:57,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 87 transitions, 367 flow [2024-06-28 00:51:57,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 00:51:57,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 00:51:57,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2024-06-28 00:51:57,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6516393442622951 [2024-06-28 00:51:57,168 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 153 flow. Second operand 4 states and 159 transitions. [2024-06-28 00:51:57,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 87 transitions, 367 flow [2024-06-28 00:51:57,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 87 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 00:51:57,172 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 208 flow [2024-06-28 00:51:57,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2024-06-28 00:51:57,173 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2024-06-28 00:51:57,173 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 208 flow [2024-06-28 00:51:57,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-06-28 00:51:57,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:57,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:57,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 00:51:57,177 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 00:51:57,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:57,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2000387290, now seen corresponding path program 1 times [2024-06-28 00:51:57,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:57,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127983100] [2024-06-28 00:51:57,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:57,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:57,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:51:57,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:57,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127983100] [2024-06-28 00:51:57,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127983100] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:57,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:57,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 00:51:57,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673875378] [2024-06-28 00:51:57,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:57,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 00:51:57,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:57,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 00:51:57,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 00:51:57,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2024-06-28 00:51:57,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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-06-28 00:51:57,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:57,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2024-06-28 00:51:57,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:58,464 INFO L124 PetriNetUnfolderBase]: 8895/14684 cut-off events. [2024-06-28 00:51:58,464 INFO L125 PetriNetUnfolderBase]: For 6916/6916 co-relation queries the response was YES. [2024-06-28 00:51:58,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35504 conditions, 14684 events. 8895/14684 cut-off events. For 6916/6916 co-relation queries the response was YES. Maximal size of possible extension queue 596. Compared 105383 event pairs, 2926 based on Foata normal form. 351/14259 useless extension candidates. Maximal degree in co-relation 15211. Up to 9886 conditions per place. [2024-06-28 00:51:58,557 INFO L140 encePairwiseOnDemand]: 46/61 looper letters, 85 selfloop transitions, 21 changer transitions 0/122 dead transitions. [2024-06-28 00:51:58,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 122 transitions, 616 flow [2024-06-28 00:51:58,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:51:58,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:51:58,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 208 transitions. [2024-06-28 00:51:58,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6819672131147541 [2024-06-28 00:51:58,560 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 208 flow. Second operand 5 states and 208 transitions. [2024-06-28 00:51:58,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 122 transitions, 616 flow [2024-06-28 00:51:58,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 122 transitions, 600 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-28 00:51:58,568 INFO L231 Difference]: Finished difference. Result has 70 places, 73 transitions, 361 flow [2024-06-28 00:51:58,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=361, PETRI_PLACES=70, PETRI_TRANSITIONS=73} [2024-06-28 00:51:58,569 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 4 predicate places. [2024-06-28 00:51:58,569 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 73 transitions, 361 flow [2024-06-28 00:51:58,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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-06-28 00:51:58,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:58,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:58,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 00:51:58,570 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 00:51:58,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:58,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1237753606, now seen corresponding path program 1 times [2024-06-28 00:51:58,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:58,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030290477] [2024-06-28 00:51:58,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:58,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:58,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:51:58,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:58,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030290477] [2024-06-28 00:51:58,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030290477] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:58,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:58,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 00:51:58,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543503357] [2024-06-28 00:51:58,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:58,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 00:51:58,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:58,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 00:51:58,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 00:51:58,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2024-06-28 00:51:58,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 73 transitions, 361 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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-06-28 00:51:58,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:58,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2024-06-28 00:51:58,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:59,977 INFO L124 PetriNetUnfolderBase]: 8681/14294 cut-off events. [2024-06-28 00:51:59,977 INFO L125 PetriNetUnfolderBase]: For 19961/19970 co-relation queries the response was YES. [2024-06-28 00:52:00,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43032 conditions, 14294 events. 8681/14294 cut-off events. For 19961/19970 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 102118 event pairs, 2545 based on Foata normal form. 110/13677 useless extension candidates. Maximal degree in co-relation 18972. Up to 9856 conditions per place. [2024-06-28 00:52:00,089 INFO L140 encePairwiseOnDemand]: 48/61 looper letters, 84 selfloop transitions, 17 changer transitions 0/117 dead transitions. [2024-06-28 00:52:00,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 117 transitions, 694 flow [2024-06-28 00:52:00,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:52:00,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:52:00,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 201 transitions. [2024-06-28 00:52:00,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.659016393442623 [2024-06-28 00:52:00,091 INFO L175 Difference]: Start difference. First operand has 70 places, 73 transitions, 361 flow. Second operand 5 states and 201 transitions. [2024-06-28 00:52:00,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 117 transitions, 694 flow [2024-06-28 00:52:00,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 117 transitions, 686 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-28 00:52:00,100 INFO L231 Difference]: Finished difference. Result has 74 places, 72 transitions, 391 flow [2024-06-28 00:52:00,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=391, PETRI_PLACES=74, PETRI_TRANSITIONS=72} [2024-06-28 00:52:00,101 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 8 predicate places. [2024-06-28 00:52:00,101 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 72 transitions, 391 flow [2024-06-28 00:52:00,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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-06-28 00:52:00,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:52:00,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:52:00,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 00:52:00,102 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 00:52:00,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:52:00,103 INFO L85 PathProgramCache]: Analyzing trace with hash 775134886, now seen corresponding path program 1 times [2024-06-28 00:52:00,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:52:00,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424488781] [2024-06-28 00:52:00,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:52:00,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:52:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:52:00,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:52:00,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:52:00,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424488781] [2024-06-28 00:52:00,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424488781] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:52:00,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:52:00,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 00:52:00,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789396431] [2024-06-28 00:52:00,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:52:00,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 00:52:00,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:52:00,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 00:52:00,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-06-28 00:52:00,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 61 [2024-06-28 00:52:00,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 72 transitions, 391 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-06-28 00:52:00,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:52:00,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 61 [2024-06-28 00:52:00,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:52:01,291 INFO L124 PetriNetUnfolderBase]: 9070/15325 cut-off events. [2024-06-28 00:52:01,291 INFO L125 PetriNetUnfolderBase]: For 27690/27704 co-relation queries the response was YES. [2024-06-28 00:52:01,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47637 conditions, 15325 events. 9070/15325 cut-off events. For 27690/27704 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 114348 event pairs, 3522 based on Foata normal form. 38/14497 useless extension candidates. Maximal degree in co-relation 29724. Up to 11846 conditions per place. [2024-06-28 00:52:01,421 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 88 selfloop transitions, 17 changer transitions 0/124 dead transitions. [2024-06-28 00:52:01,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 124 transitions, 835 flow [2024-06-28 00:52:01,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:52:01,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:52:01,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2024-06-28 00:52:01,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.592896174863388 [2024-06-28 00:52:01,423 INFO L175 Difference]: Start difference. First operand has 74 places, 72 transitions, 391 flow. Second operand 6 states and 217 transitions. [2024-06-28 00:52:01,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 124 transitions, 835 flow [2024-06-28 00:52:01,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 124 transitions, 793 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-28 00:52:01,458 INFO L231 Difference]: Finished difference. Result has 78 places, 85 transitions, 522 flow [2024-06-28 00:52:01,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=522, PETRI_PLACES=78, PETRI_TRANSITIONS=85} [2024-06-28 00:52:01,461 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 12 predicate places. [2024-06-28 00:52:01,462 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 85 transitions, 522 flow [2024-06-28 00:52:01,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-06-28 00:52:01,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:52:01,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:52:01,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 00:52:01,463 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 00:52:01,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:52:01,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1296879087, now seen corresponding path program 1 times [2024-06-28 00:52:01,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:52:01,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177659772] [2024-06-28 00:52:01,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:52:01,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:52:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:52:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:52:01,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:52:01,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177659772] [2024-06-28 00:52:01,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177659772] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:52:01,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:52:01,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:52:01,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481017026] [2024-06-28 00:52:01,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:52:01,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:52:01,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:52:01,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:52:01,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:52:01,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 61 [2024-06-28 00:52:01,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 85 transitions, 522 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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-06-28 00:52:01,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:52:01,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 61 [2024-06-28 00:52:01,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:52:02,796 INFO L124 PetriNetUnfolderBase]: 9891/16440 cut-off events. [2024-06-28 00:52:02,797 INFO L125 PetriNetUnfolderBase]: For 36698/36701 co-relation queries the response was YES. [2024-06-28 00:52:02,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52055 conditions, 16440 events. 9891/16440 cut-off events. For 36698/36701 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 120830 event pairs, 3411 based on Foata normal form. 477/16131 useless extension candidates. Maximal degree in co-relation 48621. Up to 12218 conditions per place. [2024-06-28 00:52:02,908 INFO L140 encePairwiseOnDemand]: 48/61 looper letters, 123 selfloop transitions, 25 changer transitions 0/163 dead transitions. [2024-06-28 00:52:02,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 163 transitions, 1132 flow [2024-06-28 00:52:02,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:52:02,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:52:02,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 243 transitions. [2024-06-28 00:52:02,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6639344262295082 [2024-06-28 00:52:02,910 INFO L175 Difference]: Start difference. First operand has 78 places, 85 transitions, 522 flow. Second operand 6 states and 243 transitions. [2024-06-28 00:52:02,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 163 transitions, 1132 flow [2024-06-28 00:52:02,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 163 transitions, 1122 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-06-28 00:52:02,950 INFO L231 Difference]: Finished difference. Result has 86 places, 97 transitions, 711 flow [2024-06-28 00:52:02,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=711, PETRI_PLACES=86, PETRI_TRANSITIONS=97} [2024-06-28 00:52:02,951 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 20 predicate places. [2024-06-28 00:52:02,951 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 97 transitions, 711 flow [2024-06-28 00:52:02,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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-06-28 00:52:02,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:52:02,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:52:02,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 00:52:02,952 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 00:52:02,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:52:02,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1900249181, now seen corresponding path program 2 times [2024-06-28 00:52:02,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:52:02,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830688917] [2024-06-28 00:52:02,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:52:02,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:52:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:52:03,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-06-28 00:52:03,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:52:03,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830688917] [2024-06-28 00:52:03,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830688917] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:52:03,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:52:03,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:52:03,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623173260] [2024-06-28 00:52:03,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:52:03,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:52:03,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:52:03,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:52:03,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:52:03,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 61 [2024-06-28 00:52:03,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 97 transitions, 711 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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-06-28 00:52:03,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:52:03,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 61 [2024-06-28 00:52:03,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:52:04,292 INFO L124 PetriNetUnfolderBase]: 10092/16941 cut-off events. [2024-06-28 00:52:04,292 INFO L125 PetriNetUnfolderBase]: For 59030/59046 co-relation queries the response was YES. [2024-06-28 00:52:04,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60164 conditions, 16941 events. 10092/16941 cut-off events. For 59030/59046 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 126698 event pairs, 3613 based on Foata normal form. 57/16161 useless extension candidates. Maximal degree in co-relation 55699. Up to 12335 conditions per place. [2024-06-28 00:52:04,380 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 122 selfloop transitions, 29 changer transitions 0/166 dead transitions. [2024-06-28 00:52:04,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 166 transitions, 1340 flow [2024-06-28 00:52:04,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:52:04,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:52:04,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 231 transitions. [2024-06-28 00:52:04,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6311475409836066 [2024-06-28 00:52:04,382 INFO L175 Difference]: Start difference. First operand has 86 places, 97 transitions, 711 flow. Second operand 6 states and 231 transitions. [2024-06-28 00:52:04,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 166 transitions, 1340 flow [2024-06-28 00:52:04,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 166 transitions, 1309 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-06-28 00:52:04,460 INFO L231 Difference]: Finished difference. Result has 92 places, 105 transitions, 850 flow [2024-06-28 00:52:04,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=850, PETRI_PLACES=92, PETRI_TRANSITIONS=105} [2024-06-28 00:52:04,461 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 26 predicate places. [2024-06-28 00:52:04,461 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 105 transitions, 850 flow [2024-06-28 00:52:04,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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-06-28 00:52:04,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:52:04,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:52:04,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 00:52:04,462 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 00:52:04,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:52:04,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1875343781, now seen corresponding path program 3 times [2024-06-28 00:52:04,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:52:04,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896758205] [2024-06-28 00:52:04,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:52:04,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:52:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:52:04,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:52:04,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:52:04,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896758205] [2024-06-28 00:52:04,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896758205] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:52:04,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:52:04,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:52:04,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5673753] [2024-06-28 00:52:04,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:52:04,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:52:04,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:52:04,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:52:04,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:52:04,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 61 [2024-06-28 00:52:04,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 105 transitions, 850 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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-06-28 00:52:04,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:52:04,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 61 [2024-06-28 00:52:04,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:52:05,606 INFO L124 PetriNetUnfolderBase]: 10125/17261 cut-off events. [2024-06-28 00:52:05,606 INFO L125 PetriNetUnfolderBase]: For 67553/67560 co-relation queries the response was YES. [2024-06-28 00:52:05,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62759 conditions, 17261 events. 10125/17261 cut-off events. For 67553/67560 co-relation queries the response was YES. Maximal size of possible extension queue 736. Compared 131674 event pairs, 3413 based on Foata normal form. 51/16457 useless extension candidates. Maximal degree in co-relation 57907. Up to 12362 conditions per place. [2024-06-28 00:52:05,737 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 118 selfloop transitions, 44 changer transitions 0/177 dead transitions. [2024-06-28 00:52:05,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 177 transitions, 1469 flow [2024-06-28 00:52:05,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:52:05,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:52:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 283 transitions. [2024-06-28 00:52:05,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5799180327868853 [2024-06-28 00:52:05,739 INFO L175 Difference]: Start difference. First operand has 92 places, 105 transitions, 850 flow. Second operand 8 states and 283 transitions. [2024-06-28 00:52:05,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 177 transitions, 1469 flow [2024-06-28 00:52:05,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 177 transitions, 1396 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-06-28 00:52:05,884 INFO L231 Difference]: Finished difference. Result has 98 places, 114 transitions, 983 flow [2024-06-28 00:52:05,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=983, PETRI_PLACES=98, PETRI_TRANSITIONS=114} [2024-06-28 00:52:05,885 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 32 predicate places. [2024-06-28 00:52:05,885 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 114 transitions, 983 flow [2024-06-28 00:52:05,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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-06-28 00:52:05,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:52:05,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:52:05,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 00:52:05,886 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 00:52:05,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:52:05,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1109068771, now seen corresponding path program 1 times [2024-06-28 00:52:05,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:52:05,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624741389] [2024-06-28 00:52:05,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:52:05,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:52:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:52:05,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:52:05,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:52:05,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624741389] [2024-06-28 00:52:05,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624741389] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:52:05,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:52:05,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:52:05,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856292326] [2024-06-28 00:52:05,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:52:05,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:52:05,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:52:05,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:52:05,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:52:05,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 61 [2024-06-28 00:52:05,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 114 transitions, 983 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 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-06-28 00:52:05,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:52:06,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 61 [2024-06-28 00:52:06,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:52:09,923 INFO L124 PetriNetUnfolderBase]: 27214/44473 cut-off events. [2024-06-28 00:52:09,924 INFO L125 PetriNetUnfolderBase]: For 218213/223234 co-relation queries the response was YES. [2024-06-28 00:52:10,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163456 conditions, 44473 events. 27214/44473 cut-off events. For 218213/223234 co-relation queries the response was YES. Maximal size of possible extension queue 2067. Compared 380458 event pairs, 4419 based on Foata normal form. 88/41086 useless extension candidates. Maximal degree in co-relation 142119. Up to 13025 conditions per place. [2024-06-28 00:52:10,335 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 212 selfloop transitions, 105 changer transitions 0/335 dead transitions. [2024-06-28 00:52:10,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 335 transitions, 3148 flow [2024-06-28 00:52:10,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:52:10,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:52:10,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 439 transitions. [2024-06-28 00:52:10,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65424739195231 [2024-06-28 00:52:10,338 INFO L175 Difference]: Start difference. First operand has 98 places, 114 transitions, 983 flow. Second operand 11 states and 439 transitions. [2024-06-28 00:52:10,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 335 transitions, 3148 flow [2024-06-28 00:52:10,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 335 transitions, 3031 flow, removed 24 selfloop flow, removed 3 redundant places. [2024-06-28 00:52:10,655 INFO L231 Difference]: Finished difference. Result has 113 places, 185 transitions, 2002 flow [2024-06-28 00:52:10,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2002, PETRI_PLACES=113, PETRI_TRANSITIONS=185} [2024-06-28 00:52:10,656 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 47 predicate places. [2024-06-28 00:52:10,657 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 185 transitions, 2002 flow [2024-06-28 00:52:10,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 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-06-28 00:52:10,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:52:10,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:52:10,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 00:52:10,658 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 00:52:10,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:52:10,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1549410096, now seen corresponding path program 1 times [2024-06-28 00:52:10,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:52:10,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298287503] [2024-06-28 00:52:10,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:52:10,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:52:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:52:10,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:52:10,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:52:10,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298287503] [2024-06-28 00:52:10,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298287503] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:52:10,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:52:10,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 00:52:10,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292690976] [2024-06-28 00:52:10,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:52:10,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 00:52:10,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:52:10,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 00:52:10,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 00:52:10,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:52:10,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 185 transitions, 2002 flow. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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-06-28 00:52:10,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:52:10,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:52:10,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:52:12,554 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L721-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork3_#res#1.base_1| 0) (= |v_writerThread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{writerThread1of1ForFork3_#res#1.base=|v_writerThread1of1ForFork3_#res#1.base_1|, writerThread1of1ForFork3_#res#1.offset=|v_writerThread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork3_#res#1.base, writerThread1of1ForFork3_#res#1.offset][101], [readerThread1of1ForFork1InUse, 107#true, Black: 137#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 84#true, Black: 77#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 82#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 165#true, Black: 88#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 98#true, Black: 86#(= ~y~0 0), 19#L740true, Black: 87#(and (= ~w~0 1) (= ~y~0 0)), Black: 146#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 139#true, Black: 154#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 141#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 148#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 96#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 152#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 150#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 14#writerEXITtrue, 3#writerEXITtrue, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), 52#L740true, Black: 111#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= ~w~0 1)), 12#L748-5true, 144#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-28 00:52:12,555 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-06-28 00:52:12,555 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-28 00:52:12,555 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-28 00:52:12,555 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-28 00:52:12,601 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L721-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork3_#res#1.base_1| 0) (= |v_writerThread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{writerThread1of1ForFork3_#res#1.base=|v_writerThread1of1ForFork3_#res#1.base_1|, writerThread1of1ForFork3_#res#1.offset=|v_writerThread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork3_#res#1.base, writerThread1of1ForFork3_#res#1.offset][101], [42#L721true, readerThread1of1ForFork1InUse, 107#true, Black: 137#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 84#true, Black: 77#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 82#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 165#true, Black: 88#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 98#true, Black: 86#(= ~y~0 0), Black: 87#(and (= ~w~0 1) (= ~y~0 0)), 19#L740true, Black: 146#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 139#true, Black: 154#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 141#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 96#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 148#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 152#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 150#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 14#writerEXITtrue, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), 52#L740true, Black: 111#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= ~w~0 1)), 144#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-28 00:52:12,601 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-28 00:52:12,601 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-28 00:52:12,601 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-28 00:52:12,601 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-28 00:52:12,611 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L721-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork3_#res#1.base_1| 0) (= |v_writerThread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{writerThread1of1ForFork3_#res#1.base=|v_writerThread1of1ForFork3_#res#1.base_1|, writerThread1of1ForFork3_#res#1.offset=|v_writerThread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork3_#res#1.base, writerThread1of1ForFork3_#res#1.offset][101], [readerThread1of1ForFork1InUse, 107#true, Black: 137#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 84#true, Black: 77#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 82#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 165#true, Black: 88#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 98#true, Black: 86#(= ~y~0 0), 19#L740true, Black: 87#(and (= ~w~0 1) (= ~y~0 0)), Black: 146#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 139#true, Black: 154#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 141#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 148#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 96#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 152#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 150#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 14#writerEXITtrue, 3#writerEXITtrue, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), 52#L740true, 5#L749true, Black: 111#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= ~w~0 1)), 144#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-28 00:52:12,611 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-28 00:52:12,611 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-28 00:52:12,611 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-28 00:52:12,611 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-28 00:52:12,612 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L721-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork3_#res#1.base_1| 0) (= |v_writerThread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{writerThread1of1ForFork3_#res#1.base=|v_writerThread1of1ForFork3_#res#1.base_1|, writerThread1of1ForFork3_#res#1.offset=|v_writerThread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork3_#res#1.base, writerThread1of1ForFork3_#res#1.offset][101], [readerThread1of1ForFork1InUse, 107#true, Black: 137#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 84#true, Black: 77#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 82#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 165#true, Black: 88#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 98#true, Black: 86#(= ~y~0 0), 19#L740true, Black: 87#(and (= ~w~0 1) (= ~y~0 0)), Black: 146#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 139#true, Black: 154#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 141#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 148#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 96#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 152#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 150#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 14#writerEXITtrue, 3#writerEXITtrue, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 111#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= ~w~0 1)), 12#L748-5true, 28#readerEXITtrue, 144#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-28 00:52:12,612 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-28 00:52:12,612 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-28 00:52:12,612 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-28 00:52:12,612 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-28 00:52:12,612 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L721-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork3_#res#1.base_1| 0) (= |v_writerThread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{writerThread1of1ForFork3_#res#1.base=|v_writerThread1of1ForFork3_#res#1.base_1|, writerThread1of1ForFork3_#res#1.offset=|v_writerThread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork3_#res#1.base, writerThread1of1ForFork3_#res#1.offset][101], [readerThread1of1ForFork1InUse, 107#true, Black: 137#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 84#true, Black: 77#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 82#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 165#true, Black: 88#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 98#true, Black: 86#(= ~y~0 0), 46#readerEXITtrue, Black: 87#(and (= ~w~0 1) (= ~y~0 0)), Black: 146#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 139#true, Black: 154#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 141#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 96#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 148#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 152#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 150#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 14#writerEXITtrue, 3#writerEXITtrue, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), 52#L740true, Black: 111#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= ~w~0 1)), 12#L748-5true, 144#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-28 00:52:12,612 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-28 00:52:12,612 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-28 00:52:12,612 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-28 00:52:12,612 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-28 00:52:12,626 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L721-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork3_#res#1.base_1| 0) (= |v_writerThread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{writerThread1of1ForFork3_#res#1.base=|v_writerThread1of1ForFork3_#res#1.base_1|, writerThread1of1ForFork3_#res#1.offset=|v_writerThread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork3_#res#1.base, writerThread1of1ForFork3_#res#1.offset][101], [readerThread1of1ForFork1InUse, 107#true, 84#true, Black: 137#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 77#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 82#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 165#true, Black: 88#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 98#true, Black: 86#(= ~y~0 0), 19#L740true, Black: 87#(and (= ~w~0 1) (= ~y~0 0)), Black: 146#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 139#true, Black: 154#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 141#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 96#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 148#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 152#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 150#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 14#writerEXITtrue, 3#writerEXITtrue, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), 52#L740true, Black: 111#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= ~w~0 1)), 144#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-28 00:52:12,627 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,627 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,627 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,627 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,639 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L721-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork3_#res#1.base_1| 0) (= |v_writerThread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{writerThread1of1ForFork3_#res#1.base=|v_writerThread1of1ForFork3_#res#1.base_1|, writerThread1of1ForFork3_#res#1.offset=|v_writerThread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork3_#res#1.base, writerThread1of1ForFork3_#res#1.offset][101], [42#L721true, readerThread1of1ForFork1InUse, 107#true, 84#true, Black: 137#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 77#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 82#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 165#true, Black: 88#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 98#true, Black: 86#(= ~y~0 0), Black: 87#(and (= ~w~0 1) (= ~y~0 0)), 19#L740true, Black: 146#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 139#true, Black: 154#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 141#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 148#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 96#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 152#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 150#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 14#writerEXITtrue, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 111#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= ~w~0 1)), 28#readerEXITtrue, 144#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-28 00:52:12,640 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,640 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,640 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,640 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,640 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L721-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork3_#res#1.base_1| 0) (= |v_writerThread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{writerThread1of1ForFork3_#res#1.base=|v_writerThread1of1ForFork3_#res#1.base_1|, writerThread1of1ForFork3_#res#1.offset=|v_writerThread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork3_#res#1.base, writerThread1of1ForFork3_#res#1.offset][101], [42#L721true, readerThread1of1ForFork1InUse, 107#true, Black: 137#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 84#true, Black: 77#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 82#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 165#true, Black: 88#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 46#readerEXITtrue, 98#true, Black: 86#(= ~y~0 0), Black: 87#(and (= ~w~0 1) (= ~y~0 0)), Black: 146#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 139#true, Black: 154#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 141#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 96#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 148#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 152#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 150#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 14#writerEXITtrue, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), 52#L740true, Black: 111#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= ~w~0 1)), 144#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-28 00:52:12,640 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,640 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,641 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,641 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,646 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L721-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork3_#res#1.base_1| 0) (= |v_writerThread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{writerThread1of1ForFork3_#res#1.base=|v_writerThread1of1ForFork3_#res#1.base_1|, writerThread1of1ForFork3_#res#1.offset=|v_writerThread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork3_#res#1.base, writerThread1of1ForFork3_#res#1.offset][101], [readerThread1of1ForFork1InUse, 107#true, Black: 137#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 84#true, Black: 77#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 82#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 165#true, Black: 88#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 98#true, Black: 86#(= ~y~0 0), 19#L740true, Black: 87#(and (= ~w~0 1) (= ~y~0 0)), Black: 146#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 139#true, Black: 154#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 141#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 148#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 96#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 152#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 150#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 14#writerEXITtrue, 3#writerEXITtrue, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), 5#L749true, Black: 111#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= ~w~0 1)), 28#readerEXITtrue, 144#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-28 00:52:12,647 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,647 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,647 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,647 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,647 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([240] L721-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork3_#res#1.base_1| 0) (= |v_writerThread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{writerThread1of1ForFork3_#res#1.base=|v_writerThread1of1ForFork3_#res#1.base_1|, writerThread1of1ForFork3_#res#1.offset=|v_writerThread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork3_#res#1.base, writerThread1of1ForFork3_#res#1.offset][101], [readerThread1of1ForFork1InUse, 107#true, Black: 137#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 84#true, Black: 77#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 82#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 165#true, Black: 88#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 98#true, Black: 86#(= ~y~0 0), Black: 87#(and (= ~w~0 1) (= ~y~0 0)), 19#L740true, Black: 146#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 139#true, Black: 154#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 141#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 96#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 148#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 152#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 150#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 14#writerEXITtrue, 3#writerEXITtrue, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), 52#L740true, Black: 111#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= ~w~0 1)), 144#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-28 00:52:12,647 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,647 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,647 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,647 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,647 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,648 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L721-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork3_#res#1.base_1| 0) (= |v_writerThread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{writerThread1of1ForFork3_#res#1.base=|v_writerThread1of1ForFork3_#res#1.base_1|, writerThread1of1ForFork3_#res#1.offset=|v_writerThread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork3_#res#1.base, writerThread1of1ForFork3_#res#1.offset][101], [readerThread1of1ForFork1InUse, 107#true, Black: 137#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 84#true, Black: 77#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 82#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 165#true, Black: 88#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 98#true, Black: 86#(= ~y~0 0), 46#readerEXITtrue, Black: 87#(and (= ~w~0 1) (= ~y~0 0)), Black: 146#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 139#true, Black: 154#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 141#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 96#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 148#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 152#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 150#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 14#writerEXITtrue, 3#writerEXITtrue, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), 52#L740true, 5#L749true, Black: 111#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= ~w~0 1)), 144#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-28 00:52:12,648 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,648 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,648 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,648 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,648 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L721-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork3_#res#1.base_1| 0) (= |v_writerThread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{writerThread1of1ForFork3_#res#1.base=|v_writerThread1of1ForFork3_#res#1.base_1|, writerThread1of1ForFork3_#res#1.offset=|v_writerThread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork3_#res#1.base, writerThread1of1ForFork3_#res#1.offset][101], [readerThread1of1ForFork1InUse, 107#true, Black: 137#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 84#true, Black: 77#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 82#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 165#true, Black: 88#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 98#true, Black: 86#(= ~y~0 0), 46#readerEXITtrue, Black: 87#(and (= ~w~0 1) (= ~y~0 0)), Black: 146#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 139#true, Black: 154#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 141#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 96#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 148#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 152#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 150#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 14#writerEXITtrue, 3#writerEXITtrue, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 111#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= ~w~0 1)), 12#L748-5true, 28#readerEXITtrue, 144#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-28 00:52:12,648 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,648 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,648 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,648 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-28 00:52:12,657 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L721-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork3_#res#1.base_1| 0) (= |v_writerThread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{writerThread1of1ForFork3_#res#1.base=|v_writerThread1of1ForFork3_#res#1.base_1|, writerThread1of1ForFork3_#res#1.offset=|v_writerThread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork3_#res#1.base, writerThread1of1ForFork3_#res#1.offset][101], [readerThread1of1ForFork1InUse, 107#true, 84#true, Black: 137#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 77#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 82#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 165#true, Black: 88#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 98#true, Black: 86#(= ~y~0 0), 19#L740true, Black: 87#(and (= ~w~0 1) (= ~y~0 0)), Black: 146#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 139#true, Black: 154#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 141#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 96#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 148#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 152#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 150#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 14#writerEXITtrue, 3#writerEXITtrue, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 111#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= ~w~0 1)), 28#readerEXITtrue, 144#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-28 00:52:12,657 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,657 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,657 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,657 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,658 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L721-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork3_#res#1.base_1| 0) (= |v_writerThread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{writerThread1of1ForFork3_#res#1.base=|v_writerThread1of1ForFork3_#res#1.base_1|, writerThread1of1ForFork3_#res#1.offset=|v_writerThread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork3_#res#1.base, writerThread1of1ForFork3_#res#1.offset][101], [readerThread1of1ForFork1InUse, 107#true, 84#true, Black: 137#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 77#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 82#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 165#true, Black: 88#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 46#readerEXITtrue, 98#true, Black: 86#(= ~y~0 0), Black: 87#(and (= ~w~0 1) (= ~y~0 0)), Black: 146#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 139#true, Black: 154#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 141#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 96#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 148#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 152#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 150#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 14#writerEXITtrue, 3#writerEXITtrue, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), 52#L740true, Black: 111#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= ~w~0 1)), 144#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-28 00:52:12,658 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,658 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,658 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,658 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,666 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L721-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork3_#res#1.base_1| 0) (= |v_writerThread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{writerThread1of1ForFork3_#res#1.base=|v_writerThread1of1ForFork3_#res#1.base_1|, writerThread1of1ForFork3_#res#1.offset=|v_writerThread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork3_#res#1.base, writerThread1of1ForFork3_#res#1.offset][101], [42#L721true, readerThread1of1ForFork1InUse, 107#true, 84#true, Black: 137#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 77#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 82#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 165#true, Black: 88#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 98#true, Black: 86#(= ~y~0 0), 46#readerEXITtrue, Black: 87#(and (= ~w~0 1) (= ~y~0 0)), Black: 146#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 139#true, Black: 154#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 141#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 148#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 96#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 152#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 150#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 14#writerEXITtrue, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 111#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= ~w~0 1)), 28#readerEXITtrue, 144#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-28 00:52:12,666 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,666 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,666 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,666 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,670 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L721-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork3_#res#1.base_1| 0) (= |v_writerThread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{writerThread1of1ForFork3_#res#1.base=|v_writerThread1of1ForFork3_#res#1.base_1|, writerThread1of1ForFork3_#res#1.offset=|v_writerThread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork3_#res#1.base, writerThread1of1ForFork3_#res#1.offset][101], [60#L749-2true, readerThread1of1ForFork1InUse, 107#true, Black: 137#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 84#true, Black: 77#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 82#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 165#true, Black: 88#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 98#true, Black: 86#(= ~y~0 0), 19#L740true, Black: 87#(and (= ~w~0 1) (= ~y~0 0)), Black: 146#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 139#true, Black: 154#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 141#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 148#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 96#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 152#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 150#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 14#writerEXITtrue, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), 52#L740true, Black: 111#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= ~w~0 1)), 144#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-28 00:52:12,670 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,670 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,670 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,670 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,671 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([240] L721-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork3_#res#1.base_1| 0) (= |v_writerThread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{writerThread1of1ForFork3_#res#1.base=|v_writerThread1of1ForFork3_#res#1.base_1|, writerThread1of1ForFork3_#res#1.offset=|v_writerThread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork3_#res#1.base, writerThread1of1ForFork3_#res#1.offset][101], [readerThread1of1ForFork1InUse, 107#true, Black: 137#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 84#true, Black: 77#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 82#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 165#true, Black: 88#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 98#true, Black: 86#(= ~y~0 0), Black: 87#(and (= ~w~0 1) (= ~y~0 0)), 19#L740true, Black: 146#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 139#true, Black: 154#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 141#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 96#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 148#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 152#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 150#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 14#writerEXITtrue, 3#writerEXITtrue, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 111#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= ~w~0 1)), 28#readerEXITtrue, 144#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-28 00:52:12,671 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,671 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,671 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,671 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,671 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,672 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L721-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork3_#res#1.base_1| 0) (= |v_writerThread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{writerThread1of1ForFork3_#res#1.base=|v_writerThread1of1ForFork3_#res#1.base_1|, writerThread1of1ForFork3_#res#1.offset=|v_writerThread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork3_#res#1.base, writerThread1of1ForFork3_#res#1.offset][101], [readerThread1of1ForFork1InUse, 107#true, Black: 137#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 84#true, Black: 77#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 82#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 165#true, Black: 88#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 98#true, Black: 86#(= ~y~0 0), 46#readerEXITtrue, Black: 87#(and (= ~w~0 1) (= ~y~0 0)), Black: 146#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 139#true, Black: 154#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 141#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 96#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 148#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 152#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 150#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 14#writerEXITtrue, 3#writerEXITtrue, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), 5#L749true, Black: 111#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= ~w~0 1)), 28#readerEXITtrue, 144#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-28 00:52:12,672 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,672 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,672 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,672 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,672 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([240] L721-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork3_#res#1.base_1| 0) (= |v_writerThread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{writerThread1of1ForFork3_#res#1.base=|v_writerThread1of1ForFork3_#res#1.base_1|, writerThread1of1ForFork3_#res#1.offset=|v_writerThread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork3_#res#1.base, writerThread1of1ForFork3_#res#1.offset][101], [readerThread1of1ForFork1InUse, 107#true, Black: 137#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 84#true, Black: 77#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 82#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 165#true, Black: 88#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 98#true, Black: 86#(= ~y~0 0), 46#readerEXITtrue, Black: 87#(and (= ~w~0 1) (= ~y~0 0)), Black: 146#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 139#true, Black: 154#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 141#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 96#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 148#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 152#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 150#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 14#writerEXITtrue, 3#writerEXITtrue, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), 52#L740true, Black: 111#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= ~w~0 1)), 144#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-28 00:52:12,673 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,673 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,673 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,673 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,673 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-28 00:52:12,678 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L721-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork3_#res#1.base_1| 0) (= |v_writerThread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{writerThread1of1ForFork3_#res#1.base=|v_writerThread1of1ForFork3_#res#1.base_1|, writerThread1of1ForFork3_#res#1.offset=|v_writerThread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork3_#res#1.base, writerThread1of1ForFork3_#res#1.offset][101], [readerThread1of1ForFork1InUse, 107#true, 84#true, Black: 137#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 77#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 82#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 165#true, Black: 88#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 98#true, Black: 86#(= ~y~0 0), 46#readerEXITtrue, Black: 87#(and (= ~w~0 1) (= ~y~0 0)), Black: 146#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 139#true, Black: 154#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 141#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 96#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 148#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 152#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 150#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 14#writerEXITtrue, 3#writerEXITtrue, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 111#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= ~w~0 1)), 28#readerEXITtrue, 144#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-28 00:52:12,678 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-06-28 00:52:12,678 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-28 00:52:12,678 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-28 00:52:12,678 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-28 00:52:12,686 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L721-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork3_#res#1.base_1| 0) (= |v_writerThread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{writerThread1of1ForFork3_#res#1.base=|v_writerThread1of1ForFork3_#res#1.base_1|, writerThread1of1ForFork3_#res#1.offset=|v_writerThread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork3_#res#1.base, writerThread1of1ForFork3_#res#1.offset][101], [60#L749-2true, readerThread1of1ForFork1InUse, 107#true, Black: 137#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 84#true, Black: 77#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 82#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 165#true, Black: 88#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 98#true, Black: 86#(= ~y~0 0), 19#L740true, Black: 87#(and (= ~w~0 1) (= ~y~0 0)), Black: 146#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 139#true, Black: 154#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 141#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 148#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 96#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 152#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 150#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 14#writerEXITtrue, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 111#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= ~w~0 1)), 28#readerEXITtrue, 144#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-28 00:52:12,686 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-06-28 00:52:12,686 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-28 00:52:12,687 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-28 00:52:12,687 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-28 00:52:12,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L721-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork3_#res#1.base_1| 0) (= |v_writerThread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{writerThread1of1ForFork3_#res#1.base=|v_writerThread1of1ForFork3_#res#1.base_1|, writerThread1of1ForFork3_#res#1.offset=|v_writerThread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork3_#res#1.base, writerThread1of1ForFork3_#res#1.offset][101], [60#L749-2true, readerThread1of1ForFork1InUse, 107#true, Black: 137#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 84#true, Black: 77#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 82#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 165#true, Black: 88#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 98#true, Black: 86#(= ~y~0 0), 46#readerEXITtrue, Black: 87#(and (= ~w~0 1) (= ~y~0 0)), Black: 146#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 139#true, Black: 154#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 141#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 96#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 148#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 152#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 150#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 14#writerEXITtrue, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), 52#L740true, Black: 111#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= ~w~0 1)), 144#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-28 00:52:12,687 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-06-28 00:52:12,687 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-28 00:52:12,687 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-28 00:52:12,688 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-28 00:52:12,688 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([240] L721-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork3_#res#1.base_1| 0) (= |v_writerThread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{writerThread1of1ForFork3_#res#1.base=|v_writerThread1of1ForFork3_#res#1.base_1|, writerThread1of1ForFork3_#res#1.offset=|v_writerThread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork3_#res#1.base, writerThread1of1ForFork3_#res#1.offset][101], [readerThread1of1ForFork1InUse, 107#true, Black: 137#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 84#true, Black: 77#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 82#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 165#true, Black: 88#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 98#true, Black: 86#(= ~y~0 0), 46#readerEXITtrue, Black: 87#(and (= ~w~0 1) (= ~y~0 0)), Black: 146#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 139#true, Black: 154#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 141#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 96#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 148#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 152#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 150#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 14#writerEXITtrue, 3#writerEXITtrue, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 111#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= ~w~0 1)), 28#readerEXITtrue, 144#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-28 00:52:12,688 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-06-28 00:52:12,688 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-28 00:52:12,688 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-28 00:52:12,688 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-28 00:52:12,689 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-28 00:52:12,694 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L721-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork3_#res#1.base_1| 0) (= |v_writerThread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{writerThread1of1ForFork3_#res#1.base=|v_writerThread1of1ForFork3_#res#1.base_1|, writerThread1of1ForFork3_#res#1.offset=|v_writerThread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork3_#res#1.base, writerThread1of1ForFork3_#res#1.offset][101], [60#L749-2true, readerThread1of1ForFork1InUse, 107#true, Black: 137#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 84#true, Black: 77#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 82#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 165#true, Black: 88#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 98#true, Black: 86#(= ~y~0 0), 46#readerEXITtrue, Black: 87#(and (= ~w~0 1) (= ~y~0 0)), Black: 146#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 139#true, Black: 154#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 141#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 96#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 148#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 152#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 150#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 14#writerEXITtrue, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 111#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= ~w~0 1)), 28#readerEXITtrue, 144#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-28 00:52:12,694 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-06-28 00:52:12,694 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-06-28 00:52:12,695 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-06-28 00:52:12,695 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-06-28 00:52:12,695 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L721-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork3_#res#1.base_1| 0) (= |v_writerThread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{writerThread1of1ForFork3_#res#1.base=|v_writerThread1of1ForFork3_#res#1.base_1|, writerThread1of1ForFork3_#res#1.offset=|v_writerThread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork3_#res#1.base, writerThread1of1ForFork3_#res#1.offset][101], [readerThread1of1ForFork1InUse, 107#true, Black: 137#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 84#true, Black: 77#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 82#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 165#true, Black: 88#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 98#true, Black: 86#(= ~y~0 0), 19#L740true, Black: 87#(and (= ~w~0 1) (= ~y~0 0)), Black: 146#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 139#true, Black: 154#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 141#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 148#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 96#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 152#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 150#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 14#writerEXITtrue, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), 36#L750true, Black: 111#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= ~w~0 1)), 144#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-28 00:52:12,695 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-06-28 00:52:12,695 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-06-28 00:52:12,695 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-06-28 00:52:12,696 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-06-28 00:52:12,699 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L721-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork3_#res#1.base_1| 0) (= |v_writerThread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{writerThread1of1ForFork3_#res#1.base=|v_writerThread1of1ForFork3_#res#1.base_1|, writerThread1of1ForFork3_#res#1.offset=|v_writerThread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork3_#res#1.base, writerThread1of1ForFork3_#res#1.offset][101], [readerThread1of1ForFork1InUse, 107#true, Black: 137#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), 84#true, Black: 77#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 82#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 165#true, Black: 88#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 98#true, Black: 86#(= ~y~0 0), 46#readerEXITtrue, Black: 87#(and (= ~w~0 1) (= ~y~0 0)), Black: 146#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 139#true, Black: 154#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 141#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 96#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), Black: 148#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 152#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 150#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), 14#writerEXITtrue, Black: 101#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), 36#L750true, Black: 111#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 114#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0)), Black: 110#(and (= ~x~0 0) (= ~w~0 1)), 144#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 122#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1)), Black: 125#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 1) (= ~y~0 0))]) [2024-06-28 00:52:12,699 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-06-28 00:52:12,699 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-06-28 00:52:12,699 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-06-28 00:52:12,699 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-06-28 00:52:12,701 INFO L124 PetriNetUnfolderBase]: 9814/19629 cut-off events. [2024-06-28 00:52:12,701 INFO L125 PetriNetUnfolderBase]: For 128675/131128 co-relation queries the response was YES. [2024-06-28 00:52:12,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76283 conditions, 19629 events. 9814/19629 cut-off events. For 128675/131128 co-relation queries the response was YES. Maximal size of possible extension queue 1248. Compared 192452 event pairs, 3576 based on Foata normal form. 571/18783 useless extension candidates. Maximal degree in co-relation 68161. Up to 6030 conditions per place. [2024-06-28 00:52:12,857 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 64 selfloop transitions, 15 changer transitions 0/180 dead transitions. [2024-06-28 00:52:12,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 180 transitions, 1712 flow [2024-06-28 00:52:12,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 00:52:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 00:52:12,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 191 transitions. [2024-06-28 00:52:12,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7827868852459017 [2024-06-28 00:52:12,859 INFO L175 Difference]: Start difference. First operand has 113 places, 185 transitions, 2002 flow. Second operand 4 states and 191 transitions. [2024-06-28 00:52:12,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 180 transitions, 1712 flow [2024-06-28 00:52:13,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 180 transitions, 1607 flow, removed 34 selfloop flow, removed 4 redundant places. [2024-06-28 00:52:13,306 INFO L231 Difference]: Finished difference. Result has 115 places, 146 transitions, 1435 flow [2024-06-28 00:52:13,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1285, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1435, PETRI_PLACES=115, PETRI_TRANSITIONS=146} [2024-06-28 00:52:13,307 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 49 predicate places. [2024-06-28 00:52:13,307 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 146 transitions, 1435 flow [2024-06-28 00:52:13,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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-06-28 00:52:13,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:52:13,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:52:13,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 00:52:13,308 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 00:52:13,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:52:13,308 INFO L85 PathProgramCache]: Analyzing trace with hash 348733348, now seen corresponding path program 1 times [2024-06-28 00:52:13,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:52:13,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998883651] [2024-06-28 00:52:13,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:52:13,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:52:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:52:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:52:13,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:52:13,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998883651] [2024-06-28 00:52:13,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998883651] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:52:13,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:52:13,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:52:13,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834982745] [2024-06-28 00:52:13,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:52:13,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:52:13,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:52:13,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:52:13,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:52:13,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 61 [2024-06-28 00:52:13,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 146 transitions, 1435 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-06-28 00:52:13,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:52:13,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 61 [2024-06-28 00:52:13,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:52:16,827 INFO L124 PetriNetUnfolderBase]: 21088/34784 cut-off events. [2024-06-28 00:52:16,827 INFO L125 PetriNetUnfolderBase]: For 228526/228935 co-relation queries the response was YES. [2024-06-28 00:52:16,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142826 conditions, 34784 events. 21088/34784 cut-off events. For 228526/228935 co-relation queries the response was YES. Maximal size of possible extension queue 1665. Compared 286017 event pairs, 2889 based on Foata normal form. 481/34481 useless extension candidates. Maximal degree in co-relation 129064. Up to 11945 conditions per place. [2024-06-28 00:52:17,095 INFO L140 encePairwiseOnDemand]: 47/61 looper letters, 205 selfloop transitions, 59 changer transitions 0/284 dead transitions. [2024-06-28 00:52:17,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 284 transitions, 3057 flow [2024-06-28 00:52:17,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:52:17,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:52:17,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 266 transitions. [2024-06-28 00:52:17,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.726775956284153 [2024-06-28 00:52:17,098 INFO L175 Difference]: Start difference. First operand has 115 places, 146 transitions, 1435 flow. Second operand 6 states and 266 transitions. [2024-06-28 00:52:17,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 284 transitions, 3057 flow [2024-06-28 00:52:18,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 284 transitions, 3037 flow, removed 10 selfloop flow, removed 0 redundant places. [2024-06-28 00:52:18,392 INFO L231 Difference]: Finished difference. Result has 124 places, 166 transitions, 2013 flow [2024-06-28 00:52:18,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1427, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2013, PETRI_PLACES=124, PETRI_TRANSITIONS=166} [2024-06-28 00:52:18,393 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 58 predicate places. [2024-06-28 00:52:18,393 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 166 transitions, 2013 flow [2024-06-28 00:52:18,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-06-28 00:52:18,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:52:18,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:52:18,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 00:52:18,393 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 00:52:18,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:52:18,394 INFO L85 PathProgramCache]: Analyzing trace with hash -26628535, now seen corresponding path program 1 times [2024-06-28 00:52:18,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:52:18,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741890050] [2024-06-28 00:52:18,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:52:18,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:52:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:52:18,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:52:18,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:52:18,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741890050] [2024-06-28 00:52:18,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741890050] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:52:18,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:52:18,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 00:52:18,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344278193] [2024-06-28 00:52:18,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:52:18,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 00:52:18,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:52:18,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 00:52:18,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 00:52:18,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2024-06-28 00:52:18,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 166 transitions, 2013 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-06-28 00:52:18,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:52:18,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2024-06-28 00:52:18,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:52:21,926 INFO L124 PetriNetUnfolderBase]: 20002/34123 cut-off events. [2024-06-28 00:52:21,926 INFO L125 PetriNetUnfolderBase]: For 261280/261967 co-relation queries the response was YES. [2024-06-28 00:52:22,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149474 conditions, 34123 events. 20002/34123 cut-off events. For 261280/261967 co-relation queries the response was YES. Maximal size of possible extension queue 1719. Compared 291096 event pairs, 7936 based on Foata normal form. 172/33314 useless extension candidates. Maximal degree in co-relation 135143. Up to 27012 conditions per place. [2024-06-28 00:52:22,542 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 172 selfloop transitions, 12 changer transitions 0/209 dead transitions. [2024-06-28 00:52:22,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 209 transitions, 2600 flow [2024-06-28 00:52:22,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:52:22,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:52:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2024-06-28 00:52:22,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6262295081967213 [2024-06-28 00:52:22,544 INFO L175 Difference]: Start difference. First operand has 124 places, 166 transitions, 2013 flow. Second operand 5 states and 191 transitions. [2024-06-28 00:52:22,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 209 transitions, 2600 flow [2024-06-28 00:52:23,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 209 transitions, 2468 flow, removed 50 selfloop flow, removed 1 redundant places. [2024-06-28 00:52:23,944 INFO L231 Difference]: Finished difference. Result has 128 places, 168 transitions, 1939 flow [2024-06-28 00:52:23,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1881, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1939, PETRI_PLACES=128, PETRI_TRANSITIONS=168} [2024-06-28 00:52:23,944 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 62 predicate places. [2024-06-28 00:52:23,945 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 168 transitions, 1939 flow [2024-06-28 00:52:23,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-06-28 00:52:23,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:52:23,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:52:23,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 00:52:23,945 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 00:52:23,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:52:23,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1908298733, now seen corresponding path program 1 times [2024-06-28 00:52:23,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:52:23,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235693492] [2024-06-28 00:52:23,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:52:23,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:52:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:52:24,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:52:24,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:52:24,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235693492] [2024-06-28 00:52:24,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235693492] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:52:24,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:52:24,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 00:52:24,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895037244] [2024-06-28 00:52:24,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:52:24,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 00:52:24,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:52:24,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 00:52:24,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-06-28 00:52:24,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 61 [2024-06-28 00:52:24,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 168 transitions, 1939 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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-06-28 00:52:24,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:52:24,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 61 [2024-06-28 00:52:24,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:52:27,483 INFO L124 PetriNetUnfolderBase]: 18238/31820 cut-off events. [2024-06-28 00:52:27,483 INFO L125 PetriNetUnfolderBase]: For 239765/240746 co-relation queries the response was YES. [2024-06-28 00:52:27,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138115 conditions, 31820 events. 18238/31820 cut-off events. For 239765/240746 co-relation queries the response was YES. Maximal size of possible extension queue 1674. Compared 280302 event pairs, 7954 based on Foata normal form. 235/30952 useless extension candidates. Maximal degree in co-relation 125088. Up to 24854 conditions per place. [2024-06-28 00:52:27,829 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 165 selfloop transitions, 19 changer transitions 0/216 dead transitions. [2024-06-28 00:52:27,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 216 transitions, 2556 flow [2024-06-28 00:52:27,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:52:27,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:52:27,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2024-06-28 00:52:27,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5819672131147541 [2024-06-28 00:52:27,831 INFO L175 Difference]: Start difference. First operand has 128 places, 168 transitions, 1939 flow. Second operand 6 states and 213 transitions. [2024-06-28 00:52:27,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 216 transitions, 2556 flow [2024-06-28 00:52:28,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 216 transitions, 2506 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-28 00:52:28,888 INFO L231 Difference]: Finished difference. Result has 131 places, 173 transitions, 1995 flow [2024-06-28 00:52:28,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1891, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1995, PETRI_PLACES=131, PETRI_TRANSITIONS=173} [2024-06-28 00:52:28,889 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 65 predicate places. [2024-06-28 00:52:28,889 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 173 transitions, 1995 flow [2024-06-28 00:52:28,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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-06-28 00:52:28,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:52:28,890 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-06-28 00:52:28,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 00:52:28,890 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 00:52:28,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:52:28,891 INFO L85 PathProgramCache]: Analyzing trace with hash -897143688, now seen corresponding path program 1 times [2024-06-28 00:52:28,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:52:28,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119885147] [2024-06-28 00:52:28,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:52:28,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:52:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:52:28,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:52:28,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:52:28,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119885147] [2024-06-28 00:52:28,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119885147] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:52:28,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:52:28,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:52:28,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008881854] [2024-06-28 00:52:28,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:52:28,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:52:28,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:52:28,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:52:28,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:52:29,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 61 [2024-06-28 00:52:29,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 173 transitions, 1995 flow. Second operand has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 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-06-28 00:52:29,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:52:29,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 61 [2024-06-28 00:52:29,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:52:33,970 INFO L124 PetriNetUnfolderBase]: 25538/42340 cut-off events. [2024-06-28 00:52:33,971 INFO L125 PetriNetUnfolderBase]: For 317457/318080 co-relation queries the response was YES. [2024-06-28 00:52:34,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181735 conditions, 42340 events. 25538/42340 cut-off events. For 317457/318080 co-relation queries the response was YES. Maximal size of possible extension queue 2251. Compared 358471 event pairs, 6152 based on Foata normal form. 400/41781 useless extension candidates. Maximal degree in co-relation 163948. Up to 19810 conditions per place. [2024-06-28 00:52:34,308 INFO L140 encePairwiseOnDemand]: 47/61 looper letters, 288 selfloop transitions, 81 changer transitions 0/391 dead transitions. [2024-06-28 00:52:34,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 391 transitions, 4093 flow [2024-06-28 00:52:34,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-28 00:52:34,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-28 00:52:34,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 548 transitions. [2024-06-28 00:52:34,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5989071038251366 [2024-06-28 00:52:34,310 INFO L175 Difference]: Start difference. First operand has 131 places, 173 transitions, 1995 flow. Second operand 15 states and 548 transitions. [2024-06-28 00:52:34,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 391 transitions, 4093 flow [2024-06-28 00:52:35,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 391 transitions, 4063 flow, removed 15 selfloop flow, removed 0 redundant places. [2024-06-28 00:52:35,700 INFO L231 Difference]: Finished difference. Result has 149 places, 193 transitions, 2551 flow [2024-06-28 00:52:35,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1965, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2551, PETRI_PLACES=149, PETRI_TRANSITIONS=193} [2024-06-28 00:52:35,701 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 83 predicate places. [2024-06-28 00:52:35,701 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 193 transitions, 2551 flow [2024-06-28 00:52:35,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 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-06-28 00:52:35,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:52:35,701 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] [2024-06-28 00:52:35,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 00:52:35,701 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 00:52:35,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:52:35,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1188110676, now seen corresponding path program 1 times [2024-06-28 00:52:35,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:52:35,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992938261] [2024-06-28 00:52:35,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:52:35,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:52:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:52:35,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:52:35,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:52:35,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992938261] [2024-06-28 00:52:35,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992938261] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:52:35,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:52:35,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:52:35,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066829073] [2024-06-28 00:52:35,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:52:35,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:52:35,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:52:35,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:52:35,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:52:35,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 61 [2024-06-28 00:52:35,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 193 transitions, 2551 flow. Second operand has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 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-06-28 00:52:35,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:52:35,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 61 [2024-06-28 00:52:35,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:52:41,416 INFO L124 PetriNetUnfolderBase]: 27176/45589 cut-off events. [2024-06-28 00:52:41,416 INFO L125 PetriNetUnfolderBase]: For 406124/407093 co-relation queries the response was YES. [2024-06-28 00:52:41,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205597 conditions, 45589 events. 27176/45589 cut-off events. For 406124/407093 co-relation queries the response was YES. Maximal size of possible extension queue 2496. Compared 397427 event pairs, 6111 based on Foata normal form. 460/45050 useless extension candidates. Maximal degree in co-relation 186135. Up to 19810 conditions per place. [2024-06-28 00:52:41,841 INFO L140 encePairwiseOnDemand]: 48/61 looper letters, 276 selfloop transitions, 77 changer transitions 2/377 dead transitions. [2024-06-28 00:52:41,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 377 transitions, 4622 flow [2024-06-28 00:52:41,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:52:41,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:52:41,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 450 transitions. [2024-06-28 00:52:41,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6147540983606558 [2024-06-28 00:52:41,843 INFO L175 Difference]: Start difference. First operand has 149 places, 193 transitions, 2551 flow. Second operand 12 states and 450 transitions. [2024-06-28 00:52:41,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 377 transitions, 4622 flow [2024-06-28 00:52:44,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 377 transitions, 4437 flow, removed 46 selfloop flow, removed 9 redundant places. [2024-06-28 00:52:44,441 INFO L231 Difference]: Finished difference. Result has 153 places, 210 transitions, 2876 flow [2024-06-28 00:52:44,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2380, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2876, PETRI_PLACES=153, PETRI_TRANSITIONS=210} [2024-06-28 00:52:44,442 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 87 predicate places. [2024-06-28 00:52:44,442 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 210 transitions, 2876 flow [2024-06-28 00:52:44,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 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-06-28 00:52:44,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:52:44,442 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] [2024-06-28 00:52:44,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 00:52:44,443 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 00:52:44,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:52:44,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1273955403, now seen corresponding path program 1 times [2024-06-28 00:52:44,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:52:44,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914260120] [2024-06-28 00:52:44,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:52:44,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:52:44,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:52:44,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:52:44,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:52:44,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914260120] [2024-06-28 00:52:44,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914260120] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:52:44,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:52:44,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:52:44,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432736485] [2024-06-28 00:52:44,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:52:44,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:52:44,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:52:44,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:52:44,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:52:44,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 61 [2024-06-28 00:52:44,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 210 transitions, 2876 flow. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 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-06-28 00:52:44,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:52:44,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 61 [2024-06-28 00:52:44,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand