./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8fab2e995569cc819974baee7d52d8d4bdabd2a2896c83fb3b8d07b44f394c5b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:26:54,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:26:54,734 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:26:54,739 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:26:54,741 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:26:54,764 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:26:54,765 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:26:54,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:26:54,766 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:26:54,767 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:26:54,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:26:54,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:26:54,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:26:54,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:26:54,770 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:26:54,770 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:26:54,771 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:26:54,771 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:26:54,771 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:26:54,771 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:26:54,771 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:26:54,773 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:26:54,773 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:26:54,775 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:26:54,775 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:26:54,775 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:26:54,776 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:26:54,776 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:26:54,776 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:26:54,776 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:26:54,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:26:54,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:26:54,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:26:54,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:26:54,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:26:54,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:26:54,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:26:54,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:26:54,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:26:54,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:26:54,778 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:26:54,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:26:54,780 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-clean/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.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8fab2e995569cc819974baee7d52d8d4bdabd2a2896c83fb3b8d07b44f394c5b [2024-10-11 19:26:54,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:26:54,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:26:54,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:26:54,996 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:26:54,996 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:26:54,997 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-1.i [2024-10-11 19:26:56,301 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:26:56,461 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:26:56,462 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-1.i [2024-10-11 19:26:56,471 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c011ac7f7/f41668bfff8b4e5c9eab13535507472c/FLAG323f3c275 [2024-10-11 19:26:56,482 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c011ac7f7/f41668bfff8b4e5c9eab13535507472c [2024-10-11 19:26:56,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:26:56,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:26:56,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:26:56,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:26:56,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:26:56,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:26:56" (1/1) ... [2024-10-11 19:26:56,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76e9522c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:56, skipping insertion in model container [2024-10-11 19:26:56,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:26:56" (1/1) ... [2024-10-11 19:26:56,521 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:26:56,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:26:56,811 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:26:56,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:26:56,885 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:26:56,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:56 WrapperNode [2024-10-11 19:26:56,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:26:56,886 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:26:56,886 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:26:56,887 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:26:56,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:56" (1/1) ... [2024-10-11 19:26:56,908 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:56" (1/1) ... [2024-10-11 19:26:56,945 INFO L138 Inliner]: procedures = 173, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-10-11 19:26:56,945 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:26:56,946 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:26:56,946 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:26:56,946 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:26:56,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:56" (1/1) ... [2024-10-11 19:26:56,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:56" (1/1) ... [2024-10-11 19:26:56,959 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:56" (1/1) ... [2024-10-11 19:26:56,989 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-10-11 19:26:56,993 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:56" (1/1) ... [2024-10-11 19:26:56,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:56" (1/1) ... [2024-10-11 19:26:56,996 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:56" (1/1) ... [2024-10-11 19:26:57,000 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:56" (1/1) ... [2024-10-11 19:26:57,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:56" (1/1) ... [2024-10-11 19:26:57,009 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:56" (1/1) ... [2024-10-11 19:26:57,010 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:26:57,011 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:26:57,011 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:26:57,011 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:26:57,012 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:56" (1/1) ... [2024-10-11 19:26:57,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:26:57,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:26:57,056 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:26:57,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:26:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 19:26:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:26:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-10-11 19:26:57,118 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-10-11 19:26:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 19:26:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 19:26:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:26:57,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:26:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-10-11 19:26:57,119 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-10-11 19:26:57,121 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 19:26:57,296 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:26:57,304 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:26:57,495 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 19:26:57,495 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:26:57,637 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:26:57,638 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 19:26:57,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:26:57 BoogieIcfgContainer [2024-10-11 19:26:57,639 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:26:57,642 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:26:57,643 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:26:57,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:26:57,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:26:56" (1/3) ... [2024-10-11 19:26:57,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125923f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:26:57, skipping insertion in model container [2024-10-11 19:26:57,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:56" (2/3) ... [2024-10-11 19:26:57,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125923f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:26:57, skipping insertion in model container [2024-10-11 19:26:57,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:26:57" (3/3) ... [2024-10-11 19:26:57,652 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-1.i [2024-10-11 19:26:57,673 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:26:57,674 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 19:26:57,674 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 19:26:57,760 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-11 19:26:57,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 60 transitions, 148 flow [2024-10-11 19:26:57,866 INFO L124 PetriNetUnfolderBase]: 4/56 cut-off events. [2024-10-11 19:26:57,870 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 19:26:57,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 56 events. 4/56 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 118 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2024-10-11 19:26:57,878 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 60 transitions, 148 flow [2024-10-11 19:26:57,881 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 55 transitions, 134 flow [2024-10-11 19:26:57,888 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:26:57,894 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@30889435, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:26:57,894 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 19:26:57,903 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:26:57,903 INFO L124 PetriNetUnfolderBase]: 2/38 cut-off events. [2024-10-11 19:26:57,903 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 19:26:57,903 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:57,904 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:57,904 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-11 19:26:57,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:57,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1469700157, now seen corresponding path program 1 times [2024-10-11 19:26:57,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:26:57,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769349510] [2024-10-11 19:26:57,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:57,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:26:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:58,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:58,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:26:58,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769349510] [2024-10-11 19:26:58,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769349510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:26:58,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:26:58,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:26:58,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276908679] [2024-10-11 19:26:58,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:26:58,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:26:58,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:26:58,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:26:58,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:26:58,242 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 60 [2024-10-11 19:26:58,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 134 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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-10-11 19:26:58,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:58,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 60 [2024-10-11 19:26:58,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:27:00,381 INFO L124 PetriNetUnfolderBase]: 17416/27744 cut-off events. [2024-10-11 19:27:00,381 INFO L125 PetriNetUnfolderBase]: For 2582/2582 co-relation queries the response was YES. [2024-10-11 19:27:00,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53453 conditions, 27744 events. 17416/27744 cut-off events. For 2582/2582 co-relation queries the response was YES. Maximal size of possible extension queue 1326. Compared 219018 event pairs, 1959 based on Foata normal form. 2832/30001 useless extension candidates. Maximal degree in co-relation 46845. Up to 7302 conditions per place. [2024-10-11 19:27:00,514 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 173 selfloop transitions, 29 changer transitions 0/216 dead transitions. [2024-10-11 19:27:00,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 216 transitions, 950 flow [2024-10-11 19:27:00,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 19:27:00,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 19:27:00,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 447 transitions. [2024-10-11 19:27:00,527 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6772727272727272 [2024-10-11 19:27:00,529 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 134 flow. Second operand 11 states and 447 transitions. [2024-10-11 19:27:00,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 216 transitions, 950 flow [2024-10-11 19:27:00,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 216 transitions, 874 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-11 19:27:00,557 INFO L231 Difference]: Finished difference. Result has 72 places, 80 transitions, 308 flow [2024-10-11 19:27:00,558 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=308, PETRI_PLACES=72, PETRI_TRANSITIONS=80} [2024-10-11 19:27:00,564 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 8 predicate places. [2024-10-11 19:27:00,567 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 80 transitions, 308 flow [2024-10-11 19:27:00,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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-10-11 19:27:00,567 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:27:00,568 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:27:00,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 19:27:00,568 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-11 19:27:00,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:27:00,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1448217602, now seen corresponding path program 1 times [2024-10-11 19:27:00,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:27:00,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582914582] [2024-10-11 19:27:00,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:27:00,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:27:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:27:00,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:27:00,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:27:00,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582914582] [2024-10-11 19:27:00,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582914582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:27:00,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:27:00,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:27:00,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192150185] [2024-10-11 19:27:00,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:27:00,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:27:00,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:27:00,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:27:00,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:27:00,653 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2024-10-11 19:27:00,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 80 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-10-11 19:27:00,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:27:00,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2024-10-11 19:27:00,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:27:01,797 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 8#L748-4true, 59#L721true, 16#L16true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 28#L721true, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:01,797 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-11 19:27:01,797 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-11 19:27:01,798 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-11 19:27:01,798 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-11 19:27:01,837 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 8#L748-4true, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 16#L16true, 50#L740true, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:01,837 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-11 19:27:01,837 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-11 19:27:01,837 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-11 19:27:01,837 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-11 19:27:01,848 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 16#L16true, 6#L749true, 50#L740true, 28#L721true, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:01,848 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-11 19:27:01,848 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-11 19:27:01,848 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-11 19:27:01,848 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-11 19:27:01,849 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 8#L748-4true, 16#L16true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 15#writerEXITtrue, 28#L721true, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:01,849 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-11 19:27:01,850 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-11 19:27:01,850 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-11 19:27:01,850 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-11 19:27:01,850 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 24#L740true, 8#L748-4true, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 28#L721true, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:01,851 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-11 19:27:01,851 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-11 19:27:01,851 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-11 19:27:01,851 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-11 19:27:01,963 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 16#L16true, 6#L749true, 50#L740true, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:01,964 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-11 19:27:01,964 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-11 19:27:01,964 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-11 19:27:01,964 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-11 19:27:01,965 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 8#L748-4true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 16#L16true, 50#L740true, 15#writerEXITtrue, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:01,965 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-11 19:27:01,965 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-11 19:27:01,965 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-11 19:27:01,965 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-11 19:27:01,966 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 24#L740true, 8#L748-4true, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:01,970 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-11 19:27:01,970 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-11 19:27:01,970 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-11 19:27:01,971 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-11 19:27:01,987 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 16#L16true, 6#L749true, 50#L740true, 15#writerEXITtrue, 28#L721true, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:01,988 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-11 19:27:01,988 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-11 19:27:01,988 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-11 19:27:01,988 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-11 19:27:01,989 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 24#L740true, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 6#L749true, 50#L740true, 28#L721true, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:01,989 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-11 19:27:01,989 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-11 19:27:01,989 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-11 19:27:01,989 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-11 19:27:01,991 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 24#L740true, 8#L748-4true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 15#writerEXITtrue, 28#L721true, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:01,991 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-11 19:27:01,991 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-11 19:27:01,991 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-11 19:27:01,991 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-11 19:27:01,992 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 8#L748-4true, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 28#L721true, 98#true, Black: 72#true, 45#readerEXITtrue, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:01,992 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-11 19:27:01,992 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-11 19:27:01,992 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-11 19:27:01,992 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-11 19:27:02,017 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 16#L16true, 6#L749true, 50#L740true, 15#writerEXITtrue, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:02,017 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,017 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,017 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,018 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,018 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 16#L16true, 50#L740true, 54#L749-1true, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:02,019 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,019 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,019 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,019 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,019 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 24#L740true, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 6#L749true, 50#L740true, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:02,019 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,019 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,020 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,020 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,021 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 24#L740true, 8#L748-4true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 15#writerEXITtrue, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:02,021 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,021 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,022 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,022 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,022 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 8#L748-4true, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), 45#readerEXITtrue, Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:02,022 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,023 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,023 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,023 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,033 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 24#L740true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 6#L749true, 50#L740true, 15#writerEXITtrue, 28#L721true, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:02,034 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,034 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,034 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,034 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 6#L749true, 50#L740true, 28#L721true, 98#true, Black: 72#true, 45#readerEXITtrue, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:02,035 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,035 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,035 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,035 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,036 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 8#L748-4true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 15#writerEXITtrue, 28#L721true, 98#true, Black: 72#true, 45#readerEXITtrue, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:02,036 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,036 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,037 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,037 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-11 19:27:02,052 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 16#L16true, 50#L740true, 54#L749-1true, 15#writerEXITtrue, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:02,052 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-11 19:27:02,052 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-11 19:27:02,052 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-11 19:27:02,053 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-11 19:27:02,053 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 24#L740true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 6#L749true, 50#L740true, 15#writerEXITtrue, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:02,053 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-11 19:27:02,053 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-11 19:27:02,053 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-11 19:27:02,053 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-11 19:27:02,054 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 24#L740true, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 54#L749-1true, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:02,054 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-11 19:27:02,055 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-11 19:27:02,055 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-11 19:27:02,055 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-11 19:27:02,055 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 6#L749true, 50#L740true, 98#true, Black: 72#true, 45#readerEXITtrue, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:02,055 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-11 19:27:02,055 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-11 19:27:02,055 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-11 19:27:02,055 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-11 19:27:02,057 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 8#L748-4true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 15#writerEXITtrue, Black: 72#true, 98#true, 45#readerEXITtrue, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:02,057 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-11 19:27:02,057 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-11 19:27:02,057 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-11 19:27:02,057 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-11 19:27:02,066 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 6#L749true, 50#L740true, 15#writerEXITtrue, 28#L721true, 98#true, Black: 72#true, 45#readerEXITtrue, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:02,066 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-11 19:27:02,066 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-11 19:27:02,066 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-11 19:27:02,066 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-11 19:27:02,074 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 24#L740true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 54#L749-1true, 15#writerEXITtrue, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:02,074 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-10-11 19:27:02,074 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-11 19:27:02,074 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-11 19:27:02,075 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-11 19:27:02,075 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 6#L749true, 50#L740true, 15#writerEXITtrue, 98#true, Black: 72#true, 45#readerEXITtrue, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:02,075 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-10-11 19:27:02,075 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-11 19:27:02,075 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-11 19:27:02,075 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-11 19:27:02,076 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 54#L749-1true, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), 45#readerEXITtrue, Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:02,076 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-10-11 19:27:02,076 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-11 19:27:02,076 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-11 19:27:02,076 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-11 19:27:02,086 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 54#L749-1true, 15#writerEXITtrue, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), 45#readerEXITtrue, Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-11 19:27:02,086 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-10-11 19:27:02,087 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-11 19:27:02,087 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-11 19:27:02,087 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-11 19:27:02,098 INFO L124 PetriNetUnfolderBase]: 11121/19209 cut-off events. [2024-10-11 19:27:02,098 INFO L125 PetriNetUnfolderBase]: For 6118/6479 co-relation queries the response was YES. [2024-10-11 19:27:02,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40057 conditions, 19209 events. 11121/19209 cut-off events. For 6118/6479 co-relation queries the response was YES. Maximal size of possible extension queue 1143. Compared 163292 event pairs, 4352 based on Foata normal form. 1102/19533 useless extension candidates. Maximal degree in co-relation 30319. Up to 8376 conditions per place. [2024-10-11 19:27:02,207 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 44 selfloop transitions, 4 changer transitions 0/99 dead transitions. [2024-10-11 19:27:02,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 99 transitions, 453 flow [2024-10-11 19:27:02,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:27:02,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:27:02,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2024-10-11 19:27:02,208 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2024-10-11 19:27:02,208 INFO L175 Difference]: Start difference. First operand has 72 places, 80 transitions, 308 flow. Second operand 3 states and 130 transitions. [2024-10-11 19:27:02,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 99 transitions, 453 flow [2024-10-11 19:27:02,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 99 transitions, 453 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 19:27:02,282 INFO L231 Difference]: Finished difference. Result has 75 places, 80 transitions, 324 flow [2024-10-11 19:27:02,282 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=75, PETRI_TRANSITIONS=80} [2024-10-11 19:27:02,283 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 11 predicate places. [2024-10-11 19:27:02,283 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 324 flow [2024-10-11 19:27:02,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-10-11 19:27:02,283 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:27:02,283 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:27:02,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 19:27:02,284 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-11 19:27:02,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:27:02,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1448682112, now seen corresponding path program 2 times [2024-10-11 19:27:02,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:27:02,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387673590] [2024-10-11 19:27:02,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:27:02,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:27:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:27:02,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:27:02,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:27:02,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387673590] [2024-10-11 19:27:02,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387673590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:27:02,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:27:02,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:27:02,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379396733] [2024-10-11 19:27:02,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:27:02,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:27:02,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:27:02,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:27:02,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:27:02,341 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2024-10-11 19:27:02,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 324 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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-10-11 19:27:02,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:27:02,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2024-10-11 19:27:02,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:27:03,205 INFO L124 PetriNetUnfolderBase]: 6415/12244 cut-off events. [2024-10-11 19:27:03,206 INFO L125 PetriNetUnfolderBase]: For 6169/6306 co-relation queries the response was YES. [2024-10-11 19:27:03,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26891 conditions, 12244 events. 6415/12244 cut-off events. For 6169/6306 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 106466 event pairs, 1785 based on Foata normal form. 305/12221 useless extension candidates. Maximal degree in co-relation 21047. Up to 4096 conditions per place. [2024-10-11 19:27:03,290 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 61 selfloop transitions, 9 changer transitions 0/123 dead transitions. [2024-10-11 19:27:03,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 123 transitions, 587 flow [2024-10-11 19:27:03,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:27:03,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:27:03,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2024-10-11 19:27:03,293 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7666666666666667 [2024-10-11 19:27:03,293 INFO L175 Difference]: Start difference. First operand has 75 places, 80 transitions, 324 flow. Second operand 4 states and 184 transitions. [2024-10-11 19:27:03,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 123 transitions, 587 flow [2024-10-11 19:27:03,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 123 transitions, 575 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:27:03,523 INFO L231 Difference]: Finished difference. Result has 79 places, 88 transitions, 390 flow [2024-10-11 19:27:03,523 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=390, PETRI_PLACES=79, PETRI_TRANSITIONS=88} [2024-10-11 19:27:03,524 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 15 predicate places. [2024-10-11 19:27:03,524 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 88 transitions, 390 flow [2024-10-11 19:27:03,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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-10-11 19:27:03,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:27:03,524 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:27:03,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 19:27:03,525 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-11 19:27:03,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:27:03,525 INFO L85 PathProgramCache]: Analyzing trace with hash 694497925, now seen corresponding path program 1 times [2024-10-11 19:27:03,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:27:03,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634391582] [2024-10-11 19:27:03,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:27:03,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:27:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:27:03,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:27:03,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:27:03,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634391582] [2024-10-11 19:27:03,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634391582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:27:03,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:27:03,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:27:03,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631633979] [2024-10-11 19:27:03,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:27:03,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:27:03,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:27:03,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:27:03,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:27:03,616 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 60 [2024-10-11 19:27:03,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 88 transitions, 390 flow. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 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-10-11 19:27:03,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:27:03,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 60 [2024-10-11 19:27:03,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:27:05,323 INFO L124 PetriNetUnfolderBase]: 14821/23959 cut-off events. [2024-10-11 19:27:05,323 INFO L125 PetriNetUnfolderBase]: For 21829/22268 co-relation queries the response was YES. [2024-10-11 19:27:05,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61630 conditions, 23959 events. 14821/23959 cut-off events. For 21829/22268 co-relation queries the response was YES. Maximal size of possible extension queue 1212. Compared 180380 event pairs, 2430 based on Foata normal form. 378/24039 useless extension candidates. Maximal degree in co-relation 52329. Up to 5430 conditions per place. [2024-10-11 19:27:05,416 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 203 selfloop transitions, 63 changer transitions 0/286 dead transitions. [2024-10-11 19:27:05,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 286 transitions, 1786 flow [2024-10-11 19:27:05,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 19:27:05,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 19:27:05,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 410 transitions. [2024-10-11 19:27:05,418 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2024-10-11 19:27:05,418 INFO L175 Difference]: Start difference. First operand has 79 places, 88 transitions, 390 flow. Second operand 11 states and 410 transitions. [2024-10-11 19:27:05,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 286 transitions, 1786 flow [2024-10-11 19:27:05,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 286 transitions, 1786 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 19:27:05,597 INFO L231 Difference]: Finished difference. Result has 97 places, 141 transitions, 950 flow [2024-10-11 19:27:05,597 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=950, PETRI_PLACES=97, PETRI_TRANSITIONS=141} [2024-10-11 19:27:05,598 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 33 predicate places. [2024-10-11 19:27:05,598 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 141 transitions, 950 flow [2024-10-11 19:27:05,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 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-10-11 19:27:05,598 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:27:05,598 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:27:05,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 19:27:05,599 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-11 19:27:05,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:27:05,599 INFO L85 PathProgramCache]: Analyzing trace with hash -179792158, now seen corresponding path program 1 times [2024-10-11 19:27:05,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:27:05,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988722024] [2024-10-11 19:27:05,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:27:05,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:27:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:27:05,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:27:05,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:27:05,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988722024] [2024-10-11 19:27:05,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988722024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:27:05,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:27:05,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:27:05,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293937118] [2024-10-11 19:27:05,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:27:05,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:27:05,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:27:05,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:27:05,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:27:05,678 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 60 [2024-10-11 19:27:05,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 141 transitions, 950 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-10-11 19:27:05,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:27:05,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 60 [2024-10-11 19:27:05,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:27:07,717 INFO L124 PetriNetUnfolderBase]: 14830/23804 cut-off events. [2024-10-11 19:27:07,717 INFO L125 PetriNetUnfolderBase]: For 37865/38088 co-relation queries the response was YES. [2024-10-11 19:27:07,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71421 conditions, 23804 events. 14830/23804 cut-off events. For 37865/38088 co-relation queries the response was YES. Maximal size of possible extension queue 1163. Compared 177318 event pairs, 2456 based on Foata normal form. 322/24019 useless extension candidates. Maximal degree in co-relation 62631. Up to 6361 conditions per place. [2024-10-11 19:27:07,966 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 182 selfloop transitions, 76 changer transitions 0/278 dead transitions. [2024-10-11 19:27:07,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 278 transitions, 2129 flow [2024-10-11 19:27:07,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 19:27:07,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 19:27:07,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 365 transitions. [2024-10-11 19:27:07,973 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2024-10-11 19:27:07,973 INFO L175 Difference]: Start difference. First operand has 97 places, 141 transitions, 950 flow. Second operand 10 states and 365 transitions. [2024-10-11 19:27:07,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 278 transitions, 2129 flow [2024-10-11 19:27:08,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 278 transitions, 2127 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-10-11 19:27:08,659 INFO L231 Difference]: Finished difference. Result has 111 places, 158 transitions, 1347 flow [2024-10-11 19:27:08,659 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1347, PETRI_PLACES=111, PETRI_TRANSITIONS=158} [2024-10-11 19:27:08,660 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 47 predicate places. [2024-10-11 19:27:08,660 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 158 transitions, 1347 flow [2024-10-11 19:27:08,660 INFO L472 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-10-11 19:27:08,660 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:27:08,661 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:27:08,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 19:27:08,661 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-11 19:27:08,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:27:08,662 INFO L85 PathProgramCache]: Analyzing trace with hash -906541507, now seen corresponding path program 1 times [2024-10-11 19:27:08,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:27:08,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251410915] [2024-10-11 19:27:08,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:27:08,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:27:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:27:08,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:27:08,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:27:08,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251410915] [2024-10-11 19:27:08,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251410915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:27:08,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:27:08,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:27:08,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516140341] [2024-10-11 19:27:08,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:27:08,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:27:08,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:27:08,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:27:08,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:27:08,760 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 60 [2024-10-11 19:27:08,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 158 transitions, 1347 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-10-11 19:27:08,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:27:08,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 60 [2024-10-11 19:27:08,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:27:10,485 INFO L124 PetriNetUnfolderBase]: 14937/23884 cut-off events. [2024-10-11 19:27:10,485 INFO L125 PetriNetUnfolderBase]: For 56713/57082 co-relation queries the response was YES. [2024-10-11 19:27:10,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75545 conditions, 23884 events. 14937/23884 cut-off events. For 56713/57082 co-relation queries the response was YES. Maximal size of possible extension queue 1142. Compared 175227 event pairs, 2302 based on Foata normal form. 464/24238 useless extension candidates. Maximal degree in co-relation 67993. Up to 6137 conditions per place. [2024-10-11 19:27:10,880 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 195 selfloop transitions, 86 changer transitions 0/307 dead transitions. [2024-10-11 19:27:10,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 307 transitions, 2643 flow [2024-10-11 19:27:10,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 19:27:10,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 19:27:10,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 375 transitions. [2024-10-11 19:27:10,885 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-10-11 19:27:10,886 INFO L175 Difference]: Start difference. First operand has 111 places, 158 transitions, 1347 flow. Second operand 10 states and 375 transitions. [2024-10-11 19:27:10,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 307 transitions, 2643 flow [2024-10-11 19:27:11,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 307 transitions, 2634 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-10-11 19:27:11,564 INFO L231 Difference]: Finished difference. Result has 124 places, 176 transitions, 1816 flow [2024-10-11 19:27:11,564 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1816, PETRI_PLACES=124, PETRI_TRANSITIONS=176} [2024-10-11 19:27:11,565 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 60 predicate places. [2024-10-11 19:27:11,565 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 176 transitions, 1816 flow [2024-10-11 19:27:11,565 INFO L472 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-10-11 19:27:11,565 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:27:11,565 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:27:11,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 19:27:11,566 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-11 19:27:11,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:27:11,566 INFO L85 PathProgramCache]: Analyzing trace with hash 393231477, now seen corresponding path program 1 times [2024-10-11 19:27:11,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:27:11,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453992868] [2024-10-11 19:27:11,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:27:11,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:27:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:27:11,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:27:11,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:27:11,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453992868] [2024-10-11 19:27:11,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453992868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:27:11,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:27:11,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:27:11,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685530620] [2024-10-11 19:27:11,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:27:11,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:27:11,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:27:11,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:27:11,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:27:11,667 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2024-10-11 19:27:11,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 176 transitions, 1816 flow. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:27:11,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:27:11,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2024-10-11 19:27:11,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:27:12,994 INFO L124 PetriNetUnfolderBase]: 6885/13955 cut-off events. [2024-10-11 19:27:12,994 INFO L125 PetriNetUnfolderBase]: For 37349/38058 co-relation queries the response was YES. [2024-10-11 19:27:13,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43596 conditions, 13955 events. 6885/13955 cut-off events. For 37349/38058 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 128742 event pairs, 2013 based on Foata normal form. 694/14383 useless extension candidates. Maximal degree in co-relation 41861. Up to 3918 conditions per place. [2024-10-11 19:27:13,083 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 59 selfloop transitions, 15 changer transitions 0/185 dead transitions. [2024-10-11 19:27:13,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 185 transitions, 1594 flow [2024-10-11 19:27:13,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:27:13,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:27:13,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2024-10-11 19:27:13,087 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7133333333333334 [2024-10-11 19:27:13,087 INFO L175 Difference]: Start difference. First operand has 124 places, 176 transitions, 1816 flow. Second operand 5 states and 214 transitions. [2024-10-11 19:27:13,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 185 transitions, 1594 flow [2024-10-11 19:27:13,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 185 transitions, 1483 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-10-11 19:27:13,639 INFO L231 Difference]: Finished difference. Result has 122 places, 152 transitions, 1305 flow [2024-10-11 19:27:13,640 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1305, PETRI_PLACES=122, PETRI_TRANSITIONS=152} [2024-10-11 19:27:13,640 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 58 predicate places. [2024-10-11 19:27:13,642 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 152 transitions, 1305 flow [2024-10-11 19:27:13,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:27:13,642 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:27:13,642 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:27:13,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 19:27:13,643 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-11 19:27:13,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:27:13,643 INFO L85 PathProgramCache]: Analyzing trace with hash -941850979, now seen corresponding path program 2 times [2024-10-11 19:27:13,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:27:13,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381002070] [2024-10-11 19:27:13,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:27:13,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:27:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:27:13,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:27:13,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:27:13,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381002070] [2024-10-11 19:27:13,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381002070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:27:13,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:27:13,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:27:13,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684607428] [2024-10-11 19:27:13,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:27:13,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:27:13,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:27:13,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:27:13,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:27:13,703 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2024-10-11 19:27:13,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 152 transitions, 1305 flow. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:27:13,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:27:13,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2024-10-11 19:27:13,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:27:14,498 INFO L124 PetriNetUnfolderBase]: 4904/10164 cut-off events. [2024-10-11 19:27:14,499 INFO L125 PetriNetUnfolderBase]: For 23182/23874 co-relation queries the response was YES. [2024-10-11 19:27:14,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32684 conditions, 10164 events. 4904/10164 cut-off events. For 23182/23874 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 88215 event pairs, 1234 based on Foata normal form. 483/10511 useless extension candidates. Maximal degree in co-relation 31964. Up to 2756 conditions per place. [2024-10-11 19:27:14,551 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 60 selfloop transitions, 17 changer transitions 0/148 dead transitions. [2024-10-11 19:27:14,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 148 transitions, 1120 flow [2024-10-11 19:27:14,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:27:14,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:27:14,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 215 transitions. [2024-10-11 19:27:14,552 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2024-10-11 19:27:14,552 INFO L175 Difference]: Start difference. First operand has 122 places, 152 transitions, 1305 flow. Second operand 5 states and 215 transitions. [2024-10-11 19:27:14,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 148 transitions, 1120 flow [2024-10-11 19:27:14,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 148 transitions, 976 flow, removed 12 selfloop flow, removed 19 redundant places. [2024-10-11 19:27:14,649 INFO L231 Difference]: Finished difference. Result has 101 places, 110 transitions, 765 flow [2024-10-11 19:27:14,649 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=765, PETRI_PLACES=101, PETRI_TRANSITIONS=110} [2024-10-11 19:27:14,650 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 37 predicate places. [2024-10-11 19:27:14,650 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 110 transitions, 765 flow [2024-10-11 19:27:14,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:27:14,650 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:27:14,650 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:27:14,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 19:27:14,650 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-11 19:27:14,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:27:14,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1167592489, now seen corresponding path program 1 times [2024-10-11 19:27:14,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:27:14,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174670251] [2024-10-11 19:27:14,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:27:14,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:27:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:27:14,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:27:14,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:27:14,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174670251] [2024-10-11 19:27:14,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174670251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:27:14,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:27:14,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:27:14,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075235880] [2024-10-11 19:27:14,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:27:14,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:27:14,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:27:14,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:27:14,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:27:14,696 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2024-10-11 19:27:14,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 110 transitions, 765 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 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-10-11 19:27:14,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:27:14,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2024-10-11 19:27:14,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:27:15,293 INFO L124 PetriNetUnfolderBase]: 4988/9509 cut-off events. [2024-10-11 19:27:15,293 INFO L125 PetriNetUnfolderBase]: For 23022/23711 co-relation queries the response was YES. [2024-10-11 19:27:15,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29371 conditions, 9509 events. 4988/9509 cut-off events. For 23022/23711 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 76412 event pairs, 4259 based on Foata normal form. 81/9252 useless extension candidates. Maximal degree in co-relation 7284. Up to 7282 conditions per place. [2024-10-11 19:27:15,328 INFO L140 encePairwiseOnDemand]: 58/60 looper letters, 0 selfloop transitions, 0 changer transitions 109/109 dead transitions. [2024-10-11 19:27:15,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 109 transitions, 841 flow [2024-10-11 19:27:15,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:27:15,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:27:15,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-10-11 19:27:15,330 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5944444444444444 [2024-10-11 19:27:15,330 INFO L175 Difference]: Start difference. First operand has 101 places, 110 transitions, 765 flow. Second operand 3 states and 107 transitions. [2024-10-11 19:27:15,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 109 transitions, 841 flow [2024-10-11 19:27:15,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 109 transitions, 819 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-10-11 19:27:15,358 INFO L231 Difference]: Finished difference. Result has 100 places, 0 transitions, 0 flow [2024-10-11 19:27:15,358 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=100, PETRI_TRANSITIONS=0} [2024-10-11 19:27:15,359 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 36 predicate places. [2024-10-11 19:27:15,359 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 0 transitions, 0 flow [2024-10-11 19:27:15,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 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-10-11 19:27:15,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-10-11 19:27:15,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-10-11 19:27:15,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 8 remaining) [2024-10-11 19:27:15,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-10-11 19:27:15,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-10-11 19:27:15,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-10-11 19:27:15,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2024-10-11 19:27:15,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-10-11 19:27:15,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 19:27:15,363 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2024-10-11 19:27:15,367 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 19:27:15,367 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 19:27:15,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:27:15 BasicIcfg [2024-10-11 19:27:15,371 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 19:27:15,375 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 19:27:15,375 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 19:27:15,375 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 19:27:15,376 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:26:57" (3/4) ... [2024-10-11 19:27:15,377 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 19:27:15,379 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reader [2024-10-11 19:27:15,379 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure writer [2024-10-11 19:27:15,386 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 42 nodes and edges [2024-10-11 19:27:15,386 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-11 19:27:15,386 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 19:27:15,386 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 19:27:15,452 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 19:27:15,453 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 19:27:15,453 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 19:27:15,453 INFO L158 Benchmark]: Toolchain (without parser) took 18965.58ms. Allocated memory was 136.3MB in the beginning and 11.0GB in the end (delta: 10.8GB). Free memory was 80.6MB in the beginning and 9.9GB in the end (delta: -9.8GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-10-11 19:27:15,453 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 136.3MB. Free memory is still 96.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:27:15,454 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.74ms. Allocated memory is still 136.3MB. Free memory was 80.3MB in the beginning and 58.1MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 19:27:15,454 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.05ms. Allocated memory is still 136.3MB. Free memory was 57.8MB in the beginning and 106.5MB in the end (delta: -48.7MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2024-10-11 19:27:15,454 INFO L158 Benchmark]: Boogie Preprocessor took 64.58ms. Allocated memory was 136.3MB in the beginning and 222.3MB in the end (delta: 86.0MB). Free memory was 106.5MB in the beginning and 194.2MB in the end (delta: -87.7MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. [2024-10-11 19:27:15,454 INFO L158 Benchmark]: RCFGBuilder took 627.84ms. Allocated memory is still 222.3MB. Free memory was 194.2MB in the beginning and 171.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 19:27:15,455 INFO L158 Benchmark]: TraceAbstraction took 17728.79ms. Allocated memory was 222.3MB in the beginning and 11.0GB in the end (delta: 10.8GB). Free memory was 170.1MB in the beginning and 9.9GB in the end (delta: -9.7GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-10-11 19:27:15,455 INFO L158 Benchmark]: Witness Printer took 77.53ms. Allocated memory is still 11.0GB. Free memory was 9.9GB in the beginning and 9.9GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 19:27:15,456 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 136.3MB. Free memory is still 96.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.74ms. Allocated memory is still 136.3MB. Free memory was 80.3MB in the beginning and 58.1MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.05ms. Allocated memory is still 136.3MB. Free memory was 57.8MB in the beginning and 106.5MB in the end (delta: -48.7MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.58ms. Allocated memory was 136.3MB in the beginning and 222.3MB in the end (delta: 86.0MB). Free memory was 106.5MB in the beginning and 194.2MB in the end (delta: -87.7MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. * RCFGBuilder took 627.84ms. Allocated memory is still 222.3MB. Free memory was 194.2MB in the beginning and 171.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 17728.79ms. Allocated memory was 222.3MB in the beginning and 11.0GB in the end (delta: 10.8GB). Free memory was 170.1MB in the beginning and 9.9GB in the end (delta: -9.7GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 77.53ms. Allocated memory is still 11.0GB. Free memory was 9.9GB in the beginning and 9.9GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 743]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 81 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 16.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 782 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 744 mSDsluCounter, 166 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 105 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2105 IncrementalHoareTripleChecker+Invalid, 2146 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 61 mSDtfsCounter, 2105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1816occurred in iteration=6, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 412 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 19:27:15,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE