/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 15:27:58,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 15:27:58,512 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 15:27:58,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 15:27:58,517 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 15:27:58,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 15:27:58,549 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 15:27:58,553 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 15:27:58,554 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 15:27:58,558 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 15:27:58,558 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 15:27:58,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 15:27:58,559 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 15:27:58,560 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 15:27:58,560 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 15:27:58,560 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 15:27:58,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 15:27:58,561 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 15:27:58,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 15:27:58,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 15:27:58,561 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 15:27:58,562 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 15:27:58,562 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 15:27:58,563 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 15:27:58,563 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 15:27:58,563 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 15:27:58,564 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 15:27:58,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:27:58,564 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 15:27:58,564 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 15:27:58,565 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 15:27:58,565 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 15:27:58,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 15:27:58,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 15:27:58,566 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 15:27:58,566 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 15:27:58,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 15:27:58,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 15:27:58,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 15:27:58,881 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 15:27:58,881 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 15:27:58,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2023-08-26 15:28:00,063 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 15:28:00,406 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 15:28:00,407 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2023-08-26 15:28:00,425 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39e363fc2/617682a4a8324969ace1c172c30b6046/FLAG374cd369f [2023-08-26 15:28:00,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39e363fc2/617682a4a8324969ace1c172c30b6046 [2023-08-26 15:28:00,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 15:28:00,656 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 15:28:00,657 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 15:28:00,657 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 15:28:00,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 15:28:00,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:28:00" (1/1) ... [2023-08-26 15:28:00,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6062d8c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:28:00, skipping insertion in model container [2023-08-26 15:28:00,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:28:00" (1/1) ... [2023-08-26 15:28:00,708 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 15:28:00,828 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-26 15:28:01,191 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:28:01,204 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 15:28:01,221 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-26 15:28:01,231 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [250] [2023-08-26 15:28:01,232 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [250] [2023-08-26 15:28:01,246 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile long [805] [2023-08-26 15:28:01,246 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [806] [2023-08-26 15:28:01,246 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile long [807] [2023-08-26 15:28:01,246 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [809] [2023-08-26 15:28:01,248 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [814] [2023-08-26 15:28:01,248 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [815] [2023-08-26 15:28:01,250 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [827] [2023-08-26 15:28:01,256 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [843] [2023-08-26 15:28:01,260 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [899] [2023-08-26 15:28:01,265 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1054] [2023-08-26 15:28:01,269 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1078] [2023-08-26 15:28:01,270 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:28:01,334 WARN L669 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:28:01,341 INFO L206 MainTranslator]: Completed translation [2023-08-26 15:28:01,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:28:01 WrapperNode [2023-08-26 15:28:01,343 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 15:28:01,344 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 15:28:01,344 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 15:28:01,344 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 15:28:01,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:28:01" (1/1) ... [2023-08-26 15:28:01,383 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:28:01" (1/1) ... [2023-08-26 15:28:01,426 INFO L138 Inliner]: procedures = 310, calls = 77, calls flagged for inlining = 17, calls inlined = 12, statements flattened = 218 [2023-08-26 15:28:01,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 15:28:01,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 15:28:01,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 15:28:01,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 15:28:01,435 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:28:01" (1/1) ... [2023-08-26 15:28:01,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:28:01" (1/1) ... [2023-08-26 15:28:01,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:28:01" (1/1) ... [2023-08-26 15:28:01,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:28:01" (1/1) ... [2023-08-26 15:28:01,470 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:28:01" (1/1) ... [2023-08-26 15:28:01,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:28:01" (1/1) ... [2023-08-26 15:28:01,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:28:01" (1/1) ... [2023-08-26 15:28:01,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:28:01" (1/1) ... [2023-08-26 15:28:01,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 15:28:01,480 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 15:28:01,481 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 15:28:01,481 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 15:28:01,481 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:28:01" (1/1) ... [2023-08-26 15:28:01,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:28:01,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 15:28:01,526 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 15:28:01,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 15:28:01,563 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2023-08-26 15:28:01,563 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2023-08-26 15:28:01,563 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2023-08-26 15:28:01,563 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2023-08-26 15:28:01,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 15:28:01,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 15:28:01,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 15:28:01,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 15:28:01,564 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 15:28:01,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 15:28:01,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 15:28:01,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 15:28:01,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 15:28:01,566 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 15:28:01,741 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 15:28:01,743 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 15:28:02,150 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 15:28:02,158 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 15:28:02,158 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-26 15:28:02,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:28:02 BoogieIcfgContainer [2023-08-26 15:28:02,161 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 15:28:02,162 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 15:28:02,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 15:28:02,180 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 15:28:02,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:28:00" (1/3) ... [2023-08-26 15:28:02,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a5d8c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:28:02, skipping insertion in model container [2023-08-26 15:28:02,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:28:01" (2/3) ... [2023-08-26 15:28:02,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a5d8c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:28:02, skipping insertion in model container [2023-08-26 15:28:02,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:28:02" (3/3) ... [2023-08-26 15:28:02,183 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2023-08-26 15:28:02,203 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 15:28:02,203 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2023-08-26 15:28:02,203 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 15:28:02,341 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-26 15:28:02,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 282 places, 296 transitions, 608 flow [2023-08-26 15:28:02,546 INFO L124 PetriNetUnfolderBase]: 21/294 cut-off events. [2023-08-26 15:28:02,546 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 15:28:02,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 294 events. 21/294 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 900 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 240. Up to 2 conditions per place. [2023-08-26 15:28:02,556 INFO L82 GeneralOperation]: Start removeDead. Operand has 282 places, 296 transitions, 608 flow [2023-08-26 15:28:02,566 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 270 places, 284 transitions, 577 flow [2023-08-26 15:28:02,568 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 15:28:02,579 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 270 places, 284 transitions, 577 flow [2023-08-26 15:28:02,581 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 270 places, 284 transitions, 577 flow [2023-08-26 15:28:02,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 270 places, 284 transitions, 577 flow [2023-08-26 15:28:02,638 INFO L124 PetriNetUnfolderBase]: 21/284 cut-off events. [2023-08-26 15:28:02,638 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 15:28:02,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 284 events. 21/284 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 829 event pairs, 0 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 240. Up to 2 conditions per place. [2023-08-26 15:28:02,659 INFO L119 LiptonReduction]: Number of co-enabled transitions 33772 [2023-08-26 15:28:10,934 INFO L134 LiptonReduction]: Checked pairs total: 89972 [2023-08-26 15:28:10,935 INFO L136 LiptonReduction]: Total number of compositions: 307 [2023-08-26 15:28:10,948 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 15:28:10,953 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@307320f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 15:28:10,953 INFO L358 AbstractCegarLoop]: Starting to check reachability of 98 error locations. [2023-08-26 15:28:10,954 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 15:28:10,954 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 15:28:10,955 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:28:10,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:28:10,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 15:28:10,955 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reader_twoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-08-26 15:28:10,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:28:10,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1191, now seen corresponding path program 1 times [2023-08-26 15:28:10,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:28:10,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829813311] [2023-08-26 15:28:10,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:28:10,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:28:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:28:11,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:28:11,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:28:11,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829813311] [2023-08-26 15:28:11,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829813311] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:28:11,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:28:11,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 15:28:11,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209251271] [2023-08-26 15:28:11,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:28:11,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 15:28:11,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:28:11,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 15:28:11,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 15:28:11,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 603 [2023-08-26 15:28:11,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 114 transitions, 237 flow. Second operand has 2 states, 2 states have (on average 278.5) internal successors, (557), 2 states have internal predecessors, (557), 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) [2023-08-26 15:28:11,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:28:11,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 603 [2023-08-26 15:28:11,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:28:11,945 INFO L124 PetriNetUnfolderBase]: 4050/6982 cut-off events. [2023-08-26 15:28:11,946 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-08-26 15:28:11,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12750 conditions, 6982 events. 4050/6982 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 50030 event pairs, 2770 based on Foata normal form. 515/4057 useless extension candidates. Maximal degree in co-relation 12630. Up to 5699 conditions per place. [2023-08-26 15:28:11,995 INFO L140 encePairwiseOnDemand]: 585/603 looper letters, 56 selfloop transitions, 0 changer transitions 0/96 dead transitions. [2023-08-26 15:28:11,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 96 transitions, 313 flow [2023-08-26 15:28:11,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 15:28:11,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 15:28:12,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 630 transitions. [2023-08-26 15:28:12,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5223880597014925 [2023-08-26 15:28:12,014 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 630 transitions. [2023-08-26 15:28:12,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 630 transitions. [2023-08-26 15:28:12,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:28:12,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 630 transitions. [2023-08-26 15:28:12,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 315.0) internal successors, (630), 2 states have internal predecessors, (630), 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) [2023-08-26 15:28:12,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 603.0) internal successors, (1809), 3 states have internal predecessors, (1809), 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) [2023-08-26 15:28:12,032 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 603.0) internal successors, (1809), 3 states have internal predecessors, (1809), 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) [2023-08-26 15:28:12,034 INFO L175 Difference]: Start difference. First operand has 111 places, 114 transitions, 237 flow. Second operand 2 states and 630 transitions. [2023-08-26 15:28:12,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 96 transitions, 313 flow [2023-08-26 15:28:12,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 96 transitions, 308 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 15:28:12,040 INFO L231 Difference]: Finished difference. Result has 94 places, 96 transitions, 196 flow [2023-08-26 15:28:12,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=603, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=196, PETRI_PLACES=94, PETRI_TRANSITIONS=96} [2023-08-26 15:28:12,045 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, -17 predicate places. [2023-08-26 15:28:12,045 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 96 transitions, 196 flow [2023-08-26 15:28:12,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 278.5) internal successors, (557), 2 states have internal predecessors, (557), 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) [2023-08-26 15:28:12,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:28:12,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 15:28:12,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 15:28:12,046 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reader_twoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-08-26 15:28:12,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:28:12,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1179961, now seen corresponding path program 1 times [2023-08-26 15:28:12,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:28:12,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333410378] [2023-08-26 15:28:12,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:28:12,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:28:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:28:12,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:28:12,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:28:12,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333410378] [2023-08-26 15:28:12,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333410378] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:28:12,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:28:12,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:28:12,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671192272] [2023-08-26 15:28:12,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:28:12,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:28:12,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:28:12,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:28:12,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:28:12,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 603 [2023-08-26 15:28:12,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 96 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 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) [2023-08-26 15:28:12,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:28:12,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 603 [2023-08-26 15:28:12,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:28:14,754 INFO L124 PetriNetUnfolderBase]: 17234/27911 cut-off events. [2023-08-26 15:28:14,754 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:28:14,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53152 conditions, 27911 events. 17234/27911 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 193363 event pairs, 280 based on Foata normal form. 0/14325 useless extension candidates. Maximal degree in co-relation 53149. Up to 24569 conditions per place. [2023-08-26 15:28:14,923 INFO L140 encePairwiseOnDemand]: 600/603 looper letters, 112 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2023-08-26 15:28:14,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 135 transitions, 504 flow [2023-08-26 15:28:14,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:28:14,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:28:14,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 745 transitions. [2023-08-26 15:28:14,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41182974018794916 [2023-08-26 15:28:14,926 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 745 transitions. [2023-08-26 15:28:14,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 745 transitions. [2023-08-26 15:28:14,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:28:14,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 745 transitions. [2023-08-26 15:28:14,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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) [2023-08-26 15:28:14,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 603.0) internal successors, (2412), 4 states have internal predecessors, (2412), 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) [2023-08-26 15:28:14,933 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 603.0) internal successors, (2412), 4 states have internal predecessors, (2412), 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) [2023-08-26 15:28:14,933 INFO L175 Difference]: Start difference. First operand has 94 places, 96 transitions, 196 flow. Second operand 3 states and 745 transitions. [2023-08-26 15:28:14,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 135 transitions, 504 flow [2023-08-26 15:28:14,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 135 transitions, 504 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:28:14,937 INFO L231 Difference]: Finished difference. Result has 97 places, 96 transitions, 204 flow [2023-08-26 15:28:14,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=603, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=97, PETRI_TRANSITIONS=96} [2023-08-26 15:28:14,938 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, -14 predicate places. [2023-08-26 15:28:14,938 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 96 transitions, 204 flow [2023-08-26 15:28:14,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 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) [2023-08-26 15:28:14,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:28:14,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 15:28:14,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 15:28:14,939 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reader_twoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-08-26 15:28:14,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:28:14,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1179960, now seen corresponding path program 1 times [2023-08-26 15:28:14,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:28:14,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472497592] [2023-08-26 15:28:14,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:28:14,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:28:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:28:15,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:28:15,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:28:15,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472497592] [2023-08-26 15:28:15,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472497592] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:28:15,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:28:15,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:28:15,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999479160] [2023-08-26 15:28:15,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:28:15,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:28:15,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:28:15,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:28:15,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:28:15,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 603 [2023-08-26 15:28:15,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 96 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 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) [2023-08-26 15:28:15,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:28:15,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 603 [2023-08-26 15:28:15,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:28:17,320 INFO L124 PetriNetUnfolderBase]: 19949/29550 cut-off events. [2023-08-26 15:28:17,320 INFO L125 PetriNetUnfolderBase]: For 328/328 co-relation queries the response was YES. [2023-08-26 15:28:17,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58700 conditions, 29550 events. 19949/29550 cut-off events. For 328/328 co-relation queries the response was YES. Maximal size of possible extension queue 1396. Compared 193025 event pairs, 15263 based on Foata normal form. 0/13798 useless extension candidates. Maximal degree in co-relation 58695. Up to 27189 conditions per place. [2023-08-26 15:28:17,489 INFO L140 encePairwiseOnDemand]: 597/603 looper letters, 113 selfloop transitions, 4 changer transitions 0/138 dead transitions. [2023-08-26 15:28:17,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 138 transitions, 527 flow [2023-08-26 15:28:17,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:28:17,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:28:17,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 737 transitions. [2023-08-26 15:28:17,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2023-08-26 15:28:17,493 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 737 transitions. [2023-08-26 15:28:17,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 737 transitions. [2023-08-26 15:28:17,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:28:17,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 737 transitions. [2023-08-26 15:28:17,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 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) [2023-08-26 15:28:17,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 603.0) internal successors, (2412), 4 states have internal predecessors, (2412), 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) [2023-08-26 15:28:17,499 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 603.0) internal successors, (2412), 4 states have internal predecessors, (2412), 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) [2023-08-26 15:28:17,499 INFO L175 Difference]: Start difference. First operand has 97 places, 96 transitions, 204 flow. Second operand 3 states and 737 transitions. [2023-08-26 15:28:17,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 138 transitions, 527 flow [2023-08-26 15:28:17,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 138 transitions, 523 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:28:17,506 INFO L231 Difference]: Finished difference. Result has 99 places, 98 transitions, 228 flow [2023-08-26 15:28:17,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=603, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=99, PETRI_TRANSITIONS=98} [2023-08-26 15:28:17,508 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, -12 predicate places. [2023-08-26 15:28:17,511 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 98 transitions, 228 flow [2023-08-26 15:28:17,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 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) [2023-08-26 15:28:17,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:28:17,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 15:28:17,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 15:28:17,513 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reader_twoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-08-26 15:28:17,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:28:17,514 INFO L85 PathProgramCache]: Analyzing trace with hash 36580070, now seen corresponding path program 1 times [2023-08-26 15:28:17,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:28:17,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360936536] [2023-08-26 15:28:17,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:28:17,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:28:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:28:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:28:17,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:28:17,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360936536] [2023-08-26 15:28:17,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360936536] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:28:17,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:28:17,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:28:17,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514656204] [2023-08-26 15:28:17,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:28:17,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:28:17,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:28:17,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:28:17,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:28:17,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 603 [2023-08-26 15:28:17,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 98 transitions, 228 flow. Second operand has 5 states, 5 states have (on average 206.8) internal successors, (1034), 5 states have internal predecessors, (1034), 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) [2023-08-26 15:28:17,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:28:17,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 603 [2023-08-26 15:28:17,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:28:19,627 INFO L124 PetriNetUnfolderBase]: 17511/28522 cut-off events. [2023-08-26 15:28:19,627 INFO L125 PetriNetUnfolderBase]: For 950/950 co-relation queries the response was YES. [2023-08-26 15:28:19,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55246 conditions, 28522 events. 17511/28522 cut-off events. For 950/950 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 200188 event pairs, 525 based on Foata normal form. 58/15106 useless extension candidates. Maximal degree in co-relation 55240. Up to 25082 conditions per place. [2023-08-26 15:28:19,780 INFO L140 encePairwiseOnDemand]: 599/603 looper letters, 111 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2023-08-26 15:28:19,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 134 transitions, 528 flow [2023-08-26 15:28:19,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:28:19,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:28:19,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 937 transitions. [2023-08-26 15:28:19,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3884742951907131 [2023-08-26 15:28:19,788 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 937 transitions. [2023-08-26 15:28:19,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 937 transitions. [2023-08-26 15:28:19,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:28:19,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 937 transitions. [2023-08-26 15:28:19,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 234.25) internal successors, (937), 4 states have internal predecessors, (937), 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) [2023-08-26 15:28:19,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 603.0) internal successors, (3015), 5 states have internal predecessors, (3015), 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) [2023-08-26 15:28:19,797 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 603.0) internal successors, (3015), 5 states have internal predecessors, (3015), 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) [2023-08-26 15:28:19,797 INFO L175 Difference]: Start difference. First operand has 99 places, 98 transitions, 228 flow. Second operand 4 states and 937 transitions. [2023-08-26 15:28:19,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 134 transitions, 528 flow [2023-08-26 15:28:19,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 134 transitions, 518 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 15:28:19,839 INFO L231 Difference]: Finished difference. Result has 97 places, 96 transitions, 216 flow [2023-08-26 15:28:19,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=603, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=97, PETRI_TRANSITIONS=96} [2023-08-26 15:28:19,841 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, -14 predicate places. [2023-08-26 15:28:19,841 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 96 transitions, 216 flow [2023-08-26 15:28:19,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 206.8) internal successors, (1034), 5 states have internal predecessors, (1034), 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) [2023-08-26 15:28:19,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:28:19,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 15:28:19,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 15:28:19,842 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reader_twoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-08-26 15:28:19,843 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:28:19,843 INFO L85 PathProgramCache]: Analyzing trace with hash 793372917, now seen corresponding path program 1 times [2023-08-26 15:28:19,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:28:19,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461865108] [2023-08-26 15:28:19,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:28:19,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:28:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:28:19,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:28:19,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:28:19,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461865108] [2023-08-26 15:28:19,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461865108] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:28:19,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:28:19,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:28:19,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507025475] [2023-08-26 15:28:19,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:28:19,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:28:19,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:28:19,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:28:19,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:28:19,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 603 [2023-08-26 15:28:19,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 96 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 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) [2023-08-26 15:28:19,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:28:19,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 603 [2023-08-26 15:28:19,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:28:21,038 INFO L124 PetriNetUnfolderBase]: 6303/13308 cut-off events. [2023-08-26 15:28:21,038 INFO L125 PetriNetUnfolderBase]: For 226/226 co-relation queries the response was YES. [2023-08-26 15:28:21,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22524 conditions, 13308 events. 6303/13308 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 127178 event pairs, 2721 based on Foata normal form. 0/7047 useless extension candidates. Maximal degree in co-relation 22519. Up to 5701 conditions per place. [2023-08-26 15:28:21,116 INFO L140 encePairwiseOnDemand]: 598/603 looper letters, 96 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2023-08-26 15:28:21,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 138 transitions, 500 flow [2023-08-26 15:28:21,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:28:21,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:28:21,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 909 transitions. [2023-08-26 15:28:21,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5024875621890548 [2023-08-26 15:28:21,120 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 909 transitions. [2023-08-26 15:28:21,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 909 transitions. [2023-08-26 15:28:21,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:28:21,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 909 transitions. [2023-08-26 15:28:21,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 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) [2023-08-26 15:28:21,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 603.0) internal successors, (2412), 4 states have internal predecessors, (2412), 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) [2023-08-26 15:28:21,130 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 603.0) internal successors, (2412), 4 states have internal predecessors, (2412), 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) [2023-08-26 15:28:21,130 INFO L175 Difference]: Start difference. First operand has 97 places, 96 transitions, 216 flow. Second operand 3 states and 909 transitions. [2023-08-26 15:28:21,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 138 transitions, 500 flow [2023-08-26 15:28:21,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 138 transitions, 496 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:28:21,136 INFO L231 Difference]: Finished difference. Result has 98 places, 97 transitions, 229 flow [2023-08-26 15:28:21,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=603, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=229, PETRI_PLACES=98, PETRI_TRANSITIONS=97} [2023-08-26 15:28:21,138 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, -13 predicate places. [2023-08-26 15:28:21,138 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 97 transitions, 229 flow [2023-08-26 15:28:21,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 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) [2023-08-26 15:28:21,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:28:21,139 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:28:21,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 15:28:21,139 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reader_twoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-08-26 15:28:21,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:28:21,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1175242549, now seen corresponding path program 1 times [2023-08-26 15:28:21,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:28:21,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537274509] [2023-08-26 15:28:21,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:28:21,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:28:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:28:21,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:28:21,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:28:21,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537274509] [2023-08-26 15:28:21,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537274509] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:28:21,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:28:21,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:28:21,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041853314] [2023-08-26 15:28:21,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:28:21,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:28:21,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:28:21,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:28:21,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:28:21,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 603 [2023-08-26 15:28:21,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 97 transitions, 229 flow. Second operand has 5 states, 5 states have (on average 196.4) internal successors, (982), 5 states have internal predecessors, (982), 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) [2023-08-26 15:28:21,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:28:21,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 603 [2023-08-26 15:28:21,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:28:24,768 INFO L124 PetriNetUnfolderBase]: 35768/52149 cut-off events. [2023-08-26 15:28:24,768 INFO L125 PetriNetUnfolderBase]: For 2493/2573 co-relation queries the response was YES. [2023-08-26 15:28:24,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109356 conditions, 52149 events. 35768/52149 cut-off events. For 2493/2573 co-relation queries the response was YES. Maximal size of possible extension queue 2078. Compared 383583 event pairs, 562 based on Foata normal form. 0/25373 useless extension candidates. Maximal degree in co-relation 109350. Up to 44424 conditions per place. [2023-08-26 15:28:25,032 INFO L140 encePairwiseOnDemand]: 586/603 looper letters, 238 selfloop transitions, 14 changer transitions 0/267 dead transitions. [2023-08-26 15:28:25,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 267 transitions, 1111 flow [2023-08-26 15:28:25,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:28:25,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:28:25,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1430 transitions. [2023-08-26 15:28:25,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3952459922609176 [2023-08-26 15:28:25,037 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1430 transitions. [2023-08-26 15:28:25,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1430 transitions. [2023-08-26 15:28:25,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:28:25,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1430 transitions. [2023-08-26 15:28:25,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 238.33333333333334) internal successors, (1430), 6 states have internal predecessors, (1430), 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) [2023-08-26 15:28:25,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 603.0) internal successors, (4221), 7 states have internal predecessors, (4221), 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) [2023-08-26 15:28:25,048 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 603.0) internal successors, (4221), 7 states have internal predecessors, (4221), 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) [2023-08-26 15:28:25,049 INFO L175 Difference]: Start difference. First operand has 98 places, 97 transitions, 229 flow. Second operand 6 states and 1430 transitions. [2023-08-26 15:28:25,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 267 transitions, 1111 flow [2023-08-26 15:28:25,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 267 transitions, 1106 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 15:28:25,059 INFO L231 Difference]: Finished difference. Result has 107 places, 109 transitions, 357 flow [2023-08-26 15:28:25,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=603, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=357, PETRI_PLACES=107, PETRI_TRANSITIONS=109} [2023-08-26 15:28:25,060 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, -4 predicate places. [2023-08-26 15:28:25,060 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 109 transitions, 357 flow [2023-08-26 15:28:25,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 196.4) internal successors, (982), 5 states have internal predecessors, (982), 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) [2023-08-26 15:28:25,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:28:25,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:28:25,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 15:28:25,061 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting writer_fnErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reader_twoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-08-26 15:28:25,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:28:25,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1175343704, now seen corresponding path program 1 times [2023-08-26 15:28:25,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:28:25,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773308856] [2023-08-26 15:28:25,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:28:25,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:28:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:28:25,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:28:25,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:28:25,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773308856] [2023-08-26 15:28:25,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773308856] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:28:25,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:28:25,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:28:25,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576920039] [2023-08-26 15:28:25,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:28:25,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:28:25,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:28:25,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:28:25,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:28:25,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 603 [2023-08-26 15:28:25,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 109 transitions, 357 flow. Second operand has 6 states, 6 states have (on average 200.16666666666666) internal successors, (1201), 6 states have internal predecessors, (1201), 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) [2023-08-26 15:28:25,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:28:25,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 603 [2023-08-26 15:28:25,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:28:30,466 INFO L124 PetriNetUnfolderBase]: 48910/71166 cut-off events. [2023-08-26 15:28:30,466 INFO L125 PetriNetUnfolderBase]: For 21930/24012 co-relation queries the response was YES. [2023-08-26 15:28:30,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164809 conditions, 71166 events. 48910/71166 cut-off events. For 21930/24012 co-relation queries the response was YES. Maximal size of possible extension queue 2859. Compared 510490 event pairs, 38438 based on Foata normal form. 0/40215 useless extension candidates. Maximal degree in co-relation 164799. Up to 68900 conditions per place. [2023-08-26 15:28:30,810 INFO L140 encePairwiseOnDemand]: 593/603 looper letters, 174 selfloop transitions, 8 changer transitions 0/197 dead transitions. [2023-08-26 15:28:30,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 197 transitions, 1018 flow [2023-08-26 15:28:30,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:28:30,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:28:30,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1360 transitions. [2023-08-26 15:28:30,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37589828634604755 [2023-08-26 15:28:30,815 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1360 transitions. [2023-08-26 15:28:30,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1360 transitions. [2023-08-26 15:28:30,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:28:30,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1360 transitions. [2023-08-26 15:28:30,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 226.66666666666666) internal successors, (1360), 6 states have internal predecessors, (1360), 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) [2023-08-26 15:28:30,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 603.0) internal successors, (4221), 7 states have internal predecessors, (4221), 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) [2023-08-26 15:28:30,823 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 603.0) internal successors, (4221), 7 states have internal predecessors, (4221), 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) [2023-08-26 15:28:30,823 INFO L175 Difference]: Start difference. First operand has 107 places, 109 transitions, 357 flow. Second operand 6 states and 1360 transitions. [2023-08-26 15:28:30,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 197 transitions, 1018 flow [2023-08-26 15:28:31,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 197 transitions, 1018 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:28:31,020 INFO L231 Difference]: Finished difference. Result has 116 places, 115 transitions, 417 flow [2023-08-26 15:28:31,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=603, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=417, PETRI_PLACES=116, PETRI_TRANSITIONS=115} [2023-08-26 15:28:31,021 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, 5 predicate places. [2023-08-26 15:28:31,021 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 115 transitions, 417 flow [2023-08-26 15:28:31,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.16666666666666) internal successors, (1201), 6 states have internal predecessors, (1201), 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) [2023-08-26 15:28:31,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:28:31,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:28:31,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 15:28:31,022 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reader_twoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-08-26 15:28:31,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:28:31,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1175242548, now seen corresponding path program 1 times [2023-08-26 15:28:31,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:28:31,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364675716] [2023-08-26 15:28:31,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:28:31,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:28:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:28:31,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:28:31,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:28:31,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364675716] [2023-08-26 15:28:31,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364675716] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:28:31,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:28:31,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:28:31,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803065555] [2023-08-26 15:28:31,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:28:31,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:28:31,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:28:31,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:28:31,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:28:31,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 603 [2023-08-26 15:28:31,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 115 transitions, 417 flow. Second operand has 5 states, 5 states have (on average 200.4) internal successors, (1002), 5 states have internal predecessors, (1002), 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) [2023-08-26 15:28:31,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:28:31,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 603 [2023-08-26 15:28:31,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:28:35,448 INFO L124 PetriNetUnfolderBase]: 35774/52154 cut-off events. [2023-08-26 15:28:35,448 INFO L125 PetriNetUnfolderBase]: For 22868/24448 co-relation queries the response was YES. [2023-08-26 15:28:35,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128075 conditions, 52154 events. 35774/52154 cut-off events. For 22868/24448 co-relation queries the response was YES. Maximal size of possible extension queue 2097. Compared 360168 event pairs, 27908 based on Foata normal form. 130/37841 useless extension candidates. Maximal degree in co-relation 128060. Up to 50710 conditions per place. [2023-08-26 15:28:35,762 INFO L140 encePairwiseOnDemand]: 594/603 looper letters, 147 selfloop transitions, 13 changer transitions 0/175 dead transitions. [2023-08-26 15:28:35,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 175 transitions, 943 flow [2023-08-26 15:28:35,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:28:35,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:28:35,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1134 transitions. [2023-08-26 15:28:35,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3761194029850746 [2023-08-26 15:28:35,766 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1134 transitions. [2023-08-26 15:28:35,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1134 transitions. [2023-08-26 15:28:35,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:28:35,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1134 transitions. [2023-08-26 15:28:35,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 226.8) internal successors, (1134), 5 states have internal predecessors, (1134), 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) [2023-08-26 15:28:35,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 603.0) internal successors, (3618), 6 states have internal predecessors, (3618), 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) [2023-08-26 15:28:35,773 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 603.0) internal successors, (3618), 6 states have internal predecessors, (3618), 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) [2023-08-26 15:28:35,773 INFO L175 Difference]: Start difference. First operand has 116 places, 115 transitions, 417 flow. Second operand 5 states and 1134 transitions. [2023-08-26 15:28:35,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 175 transitions, 943 flow [2023-08-26 15:28:35,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 175 transitions, 932 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 15:28:35,856 INFO L231 Difference]: Finished difference. Result has 122 places, 123 transitions, 511 flow [2023-08-26 15:28:35,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=603, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=511, PETRI_PLACES=122, PETRI_TRANSITIONS=123} [2023-08-26 15:28:35,856 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, 11 predicate places. [2023-08-26 15:28:35,856 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 123 transitions, 511 flow [2023-08-26 15:28:35,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 200.4) internal successors, (1002), 5 states have internal predecessors, (1002), 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) [2023-08-26 15:28:35,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:28:35,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:28:35,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 15:28:35,857 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting writer_fnErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reader_twoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-08-26 15:28:35,858 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:28:35,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1175343705, now seen corresponding path program 1 times [2023-08-26 15:28:35,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:28:35,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075908065] [2023-08-26 15:28:35,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:28:35,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:28:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:28:35,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:28:35,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:28:35,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075908065] [2023-08-26 15:28:35,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075908065] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:28:35,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:28:35,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:28:35,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832682638] [2023-08-26 15:28:35,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:28:35,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:28:35,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:28:35,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:28:35,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:28:35,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 603 [2023-08-26 15:28:35,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 123 transitions, 511 flow. Second operand has 6 states, 6 states have (on average 196.16666666666666) internal successors, (1177), 6 states have internal predecessors, (1177), 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) [2023-08-26 15:28:35,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:28:35,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 603 [2023-08-26 15:28:35,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:28:39,493 INFO L124 PetriNetUnfolderBase]: 26708/39707 cut-off events. [2023-08-26 15:28:39,494 INFO L125 PetriNetUnfolderBase]: For 26405/26967 co-relation queries the response was YES. [2023-08-26 15:28:39,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106025 conditions, 39707 events. 26708/39707 cut-off events. For 26405/26967 co-relation queries the response was YES. Maximal size of possible extension queue 1510. Compared 295222 event pairs, 855 based on Foata normal form. 2/28162 useless extension candidates. Maximal degree in co-relation 106007. Up to 28050 conditions per place. [2023-08-26 15:28:39,799 INFO L140 encePairwiseOnDemand]: 585/603 looper letters, 286 selfloop transitions, 25 changer transitions 0/326 dead transitions. [2023-08-26 15:28:39,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 326 transitions, 1856 flow [2023-08-26 15:28:39,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:28:39,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:28:39,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1641 transitions. [2023-08-26 15:28:39,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38877043354655294 [2023-08-26 15:28:39,805 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1641 transitions. [2023-08-26 15:28:39,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1641 transitions. [2023-08-26 15:28:39,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:28:39,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1641 transitions. [2023-08-26 15:28:39,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 234.42857142857142) internal successors, (1641), 7 states have internal predecessors, (1641), 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) [2023-08-26 15:28:39,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 603.0) internal successors, (4824), 8 states have internal predecessors, (4824), 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) [2023-08-26 15:28:39,974 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 603.0) internal successors, (4824), 8 states have internal predecessors, (4824), 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) [2023-08-26 15:28:39,975 INFO L175 Difference]: Start difference. First operand has 122 places, 123 transitions, 511 flow. Second operand 7 states and 1641 transitions. [2023-08-26 15:28:39,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 326 transitions, 1856 flow [2023-08-26 15:28:40,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 326 transitions, 1845 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 15:28:40,098 INFO L231 Difference]: Finished difference. Result has 133 places, 141 transitions, 734 flow [2023-08-26 15:28:40,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=603, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=734, PETRI_PLACES=133, PETRI_TRANSITIONS=141} [2023-08-26 15:28:40,099 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, 22 predicate places. [2023-08-26 15:28:40,099 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 141 transitions, 734 flow [2023-08-26 15:28:40,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 196.16666666666666) internal successors, (1177), 6 states have internal predecessors, (1177), 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) [2023-08-26 15:28:40,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:28:40,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:28:40,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 15:28:40,100 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reader_twoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-08-26 15:28:40,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:28:40,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1722235911, now seen corresponding path program 1 times [2023-08-26 15:28:40,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:28:40,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865595486] [2023-08-26 15:28:40,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:28:40,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:28:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:28:40,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:28:40,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:28:40,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865595486] [2023-08-26 15:28:40,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865595486] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:28:40,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:28:40,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:28:40,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422861343] [2023-08-26 15:28:40,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:28:40,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:28:40,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:28:40,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:28:40,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:28:40,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 603 [2023-08-26 15:28:40,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 141 transitions, 734 flow. Second operand has 6 states, 6 states have (on average 174.33333333333334) internal successors, (1046), 6 states have internal predecessors, (1046), 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) [2023-08-26 15:28:40,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:28:40,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 603 [2023-08-26 15:28:40,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:28:49,417 INFO L124 PetriNetUnfolderBase]: 67608/99871 cut-off events. [2023-08-26 15:28:49,417 INFO L125 PetriNetUnfolderBase]: For 102285/109828 co-relation queries the response was YES. [2023-08-26 15:28:49,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285031 conditions, 99871 events. 67608/99871 cut-off events. For 102285/109828 co-relation queries the response was YES. Maximal size of possible extension queue 3237. Compared 770834 event pairs, 19243 based on Foata normal form. 5872/79237 useless extension candidates. Maximal degree in co-relation 285008. Up to 50066 conditions per place. [2023-08-26 15:28:50,245 INFO L140 encePairwiseOnDemand]: 593/603 looper letters, 347 selfloop transitions, 29 changer transitions 0/385 dead transitions. [2023-08-26 15:28:50,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 385 transitions, 2529 flow [2023-08-26 15:28:50,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 15:28:50,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 15:28:50,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1692 transitions. [2023-08-26 15:28:50,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35074626865671643 [2023-08-26 15:28:50,250 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1692 transitions. [2023-08-26 15:28:50,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1692 transitions. [2023-08-26 15:28:50,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:28:50,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1692 transitions. [2023-08-26 15:28:50,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 211.5) internal successors, (1692), 8 states have internal predecessors, (1692), 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) [2023-08-26 15:28:50,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 603.0) internal successors, (5427), 9 states have internal predecessors, (5427), 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) [2023-08-26 15:28:50,261 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 603.0) internal successors, (5427), 9 states have internal predecessors, (5427), 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) [2023-08-26 15:28:50,261 INFO L175 Difference]: Start difference. First operand has 133 places, 141 transitions, 734 flow. Second operand 8 states and 1692 transitions. [2023-08-26 15:28:50,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 385 transitions, 2529 flow [2023-08-26 15:28:50,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 385 transitions, 2515 flow, removed 7 selfloop flow, removed 0 redundant places. [2023-08-26 15:28:50,634 INFO L231 Difference]: Finished difference. Result has 144 places, 149 transitions, 923 flow [2023-08-26 15:28:50,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=603, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=923, PETRI_PLACES=144, PETRI_TRANSITIONS=149} [2023-08-26 15:28:50,635 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, 33 predicate places. [2023-08-26 15:28:50,635 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 149 transitions, 923 flow [2023-08-26 15:28:50,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 174.33333333333334) internal successors, (1046), 6 states have internal predecessors, (1046), 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) [2023-08-26 15:28:50,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:28:50,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:28:50,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 15:28:50,649 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting writer_fnErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reader_twoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-08-26 15:28:50,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:28:50,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1722337067, now seen corresponding path program 1 times [2023-08-26 15:28:50,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:28:50,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203919324] [2023-08-26 15:28:50,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:28:50,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:28:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:28:50,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:28:50,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:28:50,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203919324] [2023-08-26 15:28:50,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203919324] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:28:50,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:28:50,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:28:50,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663697045] [2023-08-26 15:28:50,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:28:50,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:28:50,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:28:50,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:28:50,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:28:50,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 603 [2023-08-26 15:28:50,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 149 transitions, 923 flow. Second operand has 7 states, 7 states have (on average 174.14285714285714) internal successors, (1219), 7 states have internal predecessors, (1219), 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) [2023-08-26 15:28:50,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:28:50,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 603 [2023-08-26 15:28:50,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:28:58,622 INFO L124 PetriNetUnfolderBase]: 49269/73404 cut-off events. [2023-08-26 15:28:58,622 INFO L125 PetriNetUnfolderBase]: For 123228/129234 co-relation queries the response was YES. [2023-08-26 15:28:58,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222927 conditions, 73404 events. 49269/73404 cut-off events. For 123228/129234 co-relation queries the response was YES. Maximal size of possible extension queue 2239. Compared 551788 event pairs, 13394 based on Foata normal form. 8637/62713 useless extension candidates. Maximal degree in co-relation 222899. Up to 49064 conditions per place. [2023-08-26 15:28:59,177 INFO L140 encePairwiseOnDemand]: 593/603 looper letters, 349 selfloop transitions, 26 changer transitions 0/384 dead transitions. [2023-08-26 15:28:59,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 384 transitions, 2723 flow [2023-08-26 15:28:59,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 15:28:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 15:28:59,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2038 transitions. [2023-08-26 15:28:59,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33797678275290216 [2023-08-26 15:28:59,183 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2038 transitions. [2023-08-26 15:28:59,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2038 transitions. [2023-08-26 15:28:59,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:28:59,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2038 transitions. [2023-08-26 15:28:59,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 203.8) internal successors, (2038), 10 states have internal predecessors, (2038), 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) [2023-08-26 15:28:59,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 603.0) internal successors, (6633), 11 states have internal predecessors, (6633), 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) [2023-08-26 15:28:59,194 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 603.0) internal successors, (6633), 11 states have internal predecessors, (6633), 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) [2023-08-26 15:28:59,194 INFO L175 Difference]: Start difference. First operand has 144 places, 149 transitions, 923 flow. Second operand 10 states and 2038 transitions. [2023-08-26 15:28:59,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 384 transitions, 2723 flow [2023-08-26 15:28:59,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 384 transitions, 2611 flow, removed 45 selfloop flow, removed 4 redundant places. [2023-08-26 15:29:00,080 INFO L231 Difference]: Finished difference. Result has 145 places, 145 transitions, 934 flow [2023-08-26 15:29:00,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=603, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=934, PETRI_PLACES=145, PETRI_TRANSITIONS=145} [2023-08-26 15:29:00,081 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, 34 predicate places. [2023-08-26 15:29:00,081 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 145 transitions, 934 flow [2023-08-26 15:29:00,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 174.14285714285714) internal successors, (1219), 7 states have internal predecessors, (1219), 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) [2023-08-26 15:29:00,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:29:00,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:29:00,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 15:29:00,081 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reader_twoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-08-26 15:29:00,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:29:00,082 INFO L85 PathProgramCache]: Analyzing trace with hash -2072761281, now seen corresponding path program 2 times [2023-08-26 15:29:00,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:29:00,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892080091] [2023-08-26 15:29:00,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:29:00,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:29:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:29:00,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:29:00,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:29:00,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892080091] [2023-08-26 15:29:00,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892080091] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:29:00,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:29:00,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:29:00,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865986634] [2023-08-26 15:29:00,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:29:00,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:29:00,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:29:00,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:29:00,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:29:00,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 603 [2023-08-26 15:29:00,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 145 transitions, 934 flow. Second operand has 6 states, 6 states have (on average 174.33333333333334) internal successors, (1046), 6 states have internal predecessors, (1046), 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) [2023-08-26 15:29:00,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:29:00,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 603 [2023-08-26 15:29:00,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:29:06,261 INFO L124 PetriNetUnfolderBase]: 43233/64786 cut-off events. [2023-08-26 15:29:06,262 INFO L125 PetriNetUnfolderBase]: For 119843/124799 co-relation queries the response was YES. [2023-08-26 15:29:06,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195999 conditions, 64786 events. 43233/64786 cut-off events. For 119843/124799 co-relation queries the response was YES. Maximal size of possible extension queue 2367. Compared 489833 event pairs, 8830 based on Foata normal form. 4058/52037 useless extension candidates. Maximal degree in co-relation 195973. Up to 47889 conditions per place. [2023-08-26 15:29:06,791 INFO L140 encePairwiseOnDemand]: 587/603 looper letters, 297 selfloop transitions, 31 changer transitions 0/337 dead transitions. [2023-08-26 15:29:06,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 337 transitions, 2372 flow [2023-08-26 15:29:06,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:29:06,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:29:06,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1486 transitions. [2023-08-26 15:29:06,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35204927742241177 [2023-08-26 15:29:06,795 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1486 transitions. [2023-08-26 15:29:06,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1486 transitions. [2023-08-26 15:29:06,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:29:06,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1486 transitions. [2023-08-26 15:29:06,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 212.28571428571428) internal successors, (1486), 7 states have internal predecessors, (1486), 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) [2023-08-26 15:29:06,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 603.0) internal successors, (4824), 8 states have internal predecessors, (4824), 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) [2023-08-26 15:29:06,803 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 603.0) internal successors, (4824), 8 states have internal predecessors, (4824), 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) [2023-08-26 15:29:06,803 INFO L175 Difference]: Start difference. First operand has 145 places, 145 transitions, 934 flow. Second operand 7 states and 1486 transitions. [2023-08-26 15:29:06,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 337 transitions, 2372 flow [2023-08-26 15:29:07,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 337 transitions, 2277 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-08-26 15:29:07,359 INFO L231 Difference]: Finished difference. Result has 146 places, 148 transitions, 1026 flow [2023-08-26 15:29:07,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=603, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1026, PETRI_PLACES=146, PETRI_TRANSITIONS=148} [2023-08-26 15:29:07,359 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, 35 predicate places. [2023-08-26 15:29:07,359 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 148 transitions, 1026 flow [2023-08-26 15:29:07,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 174.33333333333334) internal successors, (1046), 6 states have internal predecessors, (1046), 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) [2023-08-26 15:29:07,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:29:07,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:29:07,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 15:29:07,360 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reader_twoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-08-26 15:29:07,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:29:07,361 INFO L85 PathProgramCache]: Analyzing trace with hash 923655195, now seen corresponding path program 1 times [2023-08-26 15:29:07,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:29:07,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226969381] [2023-08-26 15:29:07,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:29:07,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:29:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:29:07,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:29:07,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:29:07,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226969381] [2023-08-26 15:29:07,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226969381] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:29:07,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:29:07,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 15:29:07,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49515712] [2023-08-26 15:29:07,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:29:07,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 15:29:07,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:29:07,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 15:29:07,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-26 15:29:07,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 603 [2023-08-26 15:29:07,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 148 transitions, 1026 flow. Second operand has 9 states, 9 states have (on average 169.11111111111111) internal successors, (1522), 9 states have internal predecessors, (1522), 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) [2023-08-26 15:29:07,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:29:07,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 603 [2023-08-26 15:29:07,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:29:16,599 INFO L124 PetriNetUnfolderBase]: 60268/88693 cut-off events. [2023-08-26 15:29:16,599 INFO L125 PetriNetUnfolderBase]: For 155180/156191 co-relation queries the response was YES. [2023-08-26 15:29:17,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267653 conditions, 88693 events. 60268/88693 cut-off events. For 155180/156191 co-relation queries the response was YES. Maximal size of possible extension queue 2109. Compared 632020 event pairs, 14009 based on Foata normal form. 1463/69727 useless extension candidates. Maximal degree in co-relation 267626. Up to 76311 conditions per place. [2023-08-26 15:29:17,251 INFO L140 encePairwiseOnDemand]: 584/603 looper letters, 485 selfloop transitions, 72 changer transitions 0/564 dead transitions. [2023-08-26 15:29:17,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 564 transitions, 4392 flow [2023-08-26 15:29:17,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 15:29:17,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 15:29:17,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1892 transitions. [2023-08-26 15:29:17,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3486272341993735 [2023-08-26 15:29:17,254 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1892 transitions. [2023-08-26 15:29:17,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1892 transitions. [2023-08-26 15:29:17,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:29:17,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1892 transitions. [2023-08-26 15:29:17,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 210.22222222222223) internal successors, (1892), 9 states have internal predecessors, (1892), 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) [2023-08-26 15:29:17,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 603.0) internal successors, (6030), 10 states have internal predecessors, (6030), 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) [2023-08-26 15:29:17,264 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 603.0) internal successors, (6030), 10 states have internal predecessors, (6030), 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) [2023-08-26 15:29:17,264 INFO L175 Difference]: Start difference. First operand has 146 places, 148 transitions, 1026 flow. Second operand 9 states and 1892 transitions. [2023-08-26 15:29:17,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 564 transitions, 4392 flow [2023-08-26 15:29:18,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 564 transitions, 4238 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-08-26 15:29:18,115 INFO L231 Difference]: Finished difference. Result has 156 places, 226 transitions, 1666 flow [2023-08-26 15:29:18,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=603, PETRI_DIFFERENCE_MINUEND_FLOW=964, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1666, PETRI_PLACES=156, PETRI_TRANSITIONS=226} [2023-08-26 15:29:18,116 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, 45 predicate places. [2023-08-26 15:29:18,116 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 226 transitions, 1666 flow [2023-08-26 15:29:18,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 169.11111111111111) internal successors, (1522), 9 states have internal predecessors, (1522), 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) [2023-08-26 15:29:18,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:29:18,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:29:18,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 15:29:18,117 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting writer_fnErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reader_twoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-08-26 15:29:18,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:29:18,117 INFO L85 PathProgramCache]: Analyzing trace with hash -2089945383, now seen corresponding path program 1 times [2023-08-26 15:29:18,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:29:18,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191625221] [2023-08-26 15:29:18,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:29:18,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:29:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:29:18,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:29:18,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:29:18,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191625221] [2023-08-26 15:29:18,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191625221] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:29:18,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:29:18,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 15:29:18,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519378081] [2023-08-26 15:29:18,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:29:18,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 15:29:18,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:29:18,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 15:29:18,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-08-26 15:29:18,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 603 [2023-08-26 15:29:18,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 226 transitions, 1666 flow. Second operand has 10 states, 10 states have (on average 169.0) internal successors, (1690), 10 states have internal predecessors, (1690), 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) [2023-08-26 15:29:18,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:29:18,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 603 [2023-08-26 15:29:18,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:29:29,454 INFO L124 PetriNetUnfolderBase]: 65812/97313 cut-off events. [2023-08-26 15:29:29,454 INFO L125 PetriNetUnfolderBase]: For 205952/206510 co-relation queries the response was YES. [2023-08-26 15:29:30,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331541 conditions, 97313 events. 65812/97313 cut-off events. For 205952/206510 co-relation queries the response was YES. Maximal size of possible extension queue 2341. Compared 704000 event pairs, 17115 based on Foata normal form. 2066/77158 useless extension candidates. Maximal degree in co-relation 331508. Up to 81256 conditions per place. [2023-08-26 15:29:30,583 INFO L140 encePairwiseOnDemand]: 586/603 looper letters, 567 selfloop transitions, 262 changer transitions 0/836 dead transitions. [2023-08-26 15:29:30,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 836 transitions, 7394 flow [2023-08-26 15:29:30,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 15:29:30,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 15:29:30,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2095 transitions. [2023-08-26 15:29:30,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3474295190713101 [2023-08-26 15:29:30,587 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2095 transitions. [2023-08-26 15:29:30,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2095 transitions. [2023-08-26 15:29:30,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:29:30,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2095 transitions. [2023-08-26 15:29:30,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 209.5) internal successors, (2095), 10 states have internal predecessors, (2095), 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) [2023-08-26 15:29:30,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 603.0) internal successors, (6633), 11 states have internal predecessors, (6633), 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) [2023-08-26 15:29:30,596 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 603.0) internal successors, (6633), 11 states have internal predecessors, (6633), 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) [2023-08-26 15:29:30,596 INFO L175 Difference]: Start difference. First operand has 156 places, 226 transitions, 1666 flow. Second operand 10 states and 2095 transitions. [2023-08-26 15:29:30,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 836 transitions, 7394 flow [2023-08-26 15:29:31,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 836 transitions, 7370 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-08-26 15:29:31,609 INFO L231 Difference]: Finished difference. Result has 172 places, 440 transitions, 3796 flow [2023-08-26 15:29:31,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=603, PETRI_DIFFERENCE_MINUEND_FLOW=1662, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3796, PETRI_PLACES=172, PETRI_TRANSITIONS=440} [2023-08-26 15:29:31,609 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, 61 predicate places. [2023-08-26 15:29:31,609 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 440 transitions, 3796 flow [2023-08-26 15:29:31,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.0) internal successors, (1690), 10 states have internal predecessors, (1690), 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) [2023-08-26 15:29:31,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:29:31,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:29:31,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 15:29:31,610 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting writer_fnErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reader_twoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-08-26 15:29:31,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:29:31,610 INFO L85 PathProgramCache]: Analyzing trace with hash -363788594, now seen corresponding path program 1 times [2023-08-26 15:29:31,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:29:31,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769173595] [2023-08-26 15:29:31,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:29:31,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:29:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:29:32,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:29:32,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:29:32,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769173595] [2023-08-26 15:29:32,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769173595] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:29:32,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:29:32,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-26 15:29:32,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906513522] [2023-08-26 15:29:32,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:29:32,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-26 15:29:32,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:29:32,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-26 15:29:32,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-08-26 15:29:32,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 603 [2023-08-26 15:29:32,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 440 transitions, 3796 flow. Second operand has 11 states, 11 states have (on average 146.0) internal successors, (1606), 11 states have internal predecessors, (1606), 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) [2023-08-26 15:29:32,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:29:32,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 603 [2023-08-26 15:29:32,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:29:47,201 INFO L124 PetriNetUnfolderBase]: 79055/117320 cut-off events. [2023-08-26 15:29:47,201 INFO L125 PetriNetUnfolderBase]: For 333382/333458 co-relation queries the response was YES. [2023-08-26 15:29:48,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447031 conditions, 117320 events. 79055/117320 cut-off events. For 333382/333458 co-relation queries the response was YES. Maximal size of possible extension queue 2704. Compared 865729 event pairs, 33872 based on Foata normal form. 1946/93158 useless extension candidates. Maximal degree in co-relation 446990. Up to 100157 conditions per place. [2023-08-26 15:29:48,489 INFO L140 encePairwiseOnDemand]: 583/603 looper letters, 782 selfloop transitions, 276 changer transitions 0/1059 dead transitions. [2023-08-26 15:29:48,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 1059 transitions, 11050 flow [2023-08-26 15:29:48,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-26 15:29:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-26 15:29:48,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2736 transitions. [2023-08-26 15:29:48,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2835820895522388 [2023-08-26 15:29:48,494 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2736 transitions. [2023-08-26 15:29:48,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2736 transitions. [2023-08-26 15:29:48,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:29:48,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2736 transitions. [2023-08-26 15:29:48,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 171.0) internal successors, (2736), 16 states have internal predecessors, (2736), 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) [2023-08-26 15:29:48,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 603.0) internal successors, (10251), 17 states have internal predecessors, (10251), 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) [2023-08-26 15:29:48,508 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 603.0) internal successors, (10251), 17 states have internal predecessors, (10251), 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) [2023-08-26 15:29:48,508 INFO L175 Difference]: Start difference. First operand has 172 places, 440 transitions, 3796 flow. Second operand 16 states and 2736 transitions. [2023-08-26 15:29:48,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 1059 transitions, 11050 flow [2023-08-26 15:29:50,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 1059 transitions, 11048 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-26 15:29:50,202 INFO L231 Difference]: Finished difference. Result has 198 places, 688 transitions, 7528 flow [2023-08-26 15:29:50,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=603, PETRI_DIFFERENCE_MINUEND_FLOW=3794, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=7528, PETRI_PLACES=198, PETRI_TRANSITIONS=688} [2023-08-26 15:29:50,202 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, 87 predicate places. [2023-08-26 15:29:50,202 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 688 transitions, 7528 flow [2023-08-26 15:29:50,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 146.0) internal successors, (1606), 11 states have internal predecessors, (1606), 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) [2023-08-26 15:29:50,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:29:50,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:29:50,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 15:29:50,203 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reader_twoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-08-26 15:29:50,203 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:29:50,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1431439908, now seen corresponding path program 1 times [2023-08-26 15:29:50,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:29:50,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741467557] [2023-08-26 15:29:50,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:29:50,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:29:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:29:50,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:29:50,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:29:50,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741467557] [2023-08-26 15:29:50,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741467557] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:29:50,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:29:50,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 15:29:50,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737625718] [2023-08-26 15:29:50,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:29:50,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 15:29:50,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:29:50,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 15:29:50,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-08-26 15:29:50,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 603 [2023-08-26 15:29:50,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 688 transitions, 7528 flow. Second operand has 10 states, 10 states have (on average 146.1) internal successors, (1461), 10 states have internal predecessors, (1461), 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) [2023-08-26 15:29:50,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:29:50,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 603 [2023-08-26 15:29:50,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:30:11,067 INFO L124 PetriNetUnfolderBase]: 84858/126210 cut-off events. [2023-08-26 15:30:11,067 INFO L125 PetriNetUnfolderBase]: For 508951/509016 co-relation queries the response was YES. [2023-08-26 15:30:12,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537220 conditions, 126210 events. 84858/126210 cut-off events. For 508951/509016 co-relation queries the response was YES. Maximal size of possible extension queue 2788. Compared 943845 event pairs, 36829 based on Foata normal form. 879/99415 useless extension candidates. Maximal degree in co-relation 537167. Up to 115888 conditions per place. [2023-08-26 15:30:12,939 INFO L140 encePairwiseOnDemand]: 584/603 looper letters, 1013 selfloop transitions, 419 changer transitions 0/1433 dead transitions. [2023-08-26 15:30:12,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 1433 transitions, 17644 flow [2023-08-26 15:30:12,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-26 15:30:12,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-26 15:30:12,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2568 transitions. [2023-08-26 15:30:12,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28391376451077943 [2023-08-26 15:30:12,945 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2568 transitions. [2023-08-26 15:30:12,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2568 transitions. [2023-08-26 15:30:12,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:30:12,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2568 transitions. [2023-08-26 15:30:12,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 171.2) internal successors, (2568), 15 states have internal predecessors, (2568), 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) [2023-08-26 15:30:12,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 603.0) internal successors, (9648), 16 states have internal predecessors, (9648), 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) [2023-08-26 15:30:12,974 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 603.0) internal successors, (9648), 16 states have internal predecessors, (9648), 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) [2023-08-26 15:30:12,974 INFO L175 Difference]: Start difference. First operand has 198 places, 688 transitions, 7528 flow. Second operand 15 states and 2568 transitions. [2023-08-26 15:30:12,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 1433 transitions, 17644 flow [2023-08-26 15:30:20,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 1433 transitions, 17419 flow, removed 111 selfloop flow, removed 1 redundant places. [2023-08-26 15:30:20,612 INFO L231 Difference]: Finished difference. Result has 222 places, 1046 transitions, 13720 flow [2023-08-26 15:30:20,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=603, PETRI_DIFFERENCE_MINUEND_FLOW=7435, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=688, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=13720, PETRI_PLACES=222, PETRI_TRANSITIONS=1046} [2023-08-26 15:30:20,613 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, 111 predicate places. [2023-08-26 15:30:20,614 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 1046 transitions, 13720 flow [2023-08-26 15:30:20,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 146.1) internal successors, (1461), 10 states have internal predecessors, (1461), 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) [2023-08-26 15:30:20,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:30:20,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:30:20,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 15:30:20,614 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting reader_twoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reader_twoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-08-26 15:30:20,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:30:20,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1574323927, now seen corresponding path program 1 times [2023-08-26 15:30:20,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:30:20,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716837657] [2023-08-26 15:30:20,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:30:20,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:30:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:30:20,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:30:20,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:30:20,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716837657] [2023-08-26 15:30:20,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716837657] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:30:20,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:30:20,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:30:20,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777743873] [2023-08-26 15:30:20,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:30:20,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:30:20,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:30:20,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:30:20,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:30:20,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 603 [2023-08-26 15:30:20,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 1046 transitions, 13720 flow. Second operand has 5 states, 5 states have (on average 202.8) internal successors, (1014), 5 states have internal predecessors, (1014), 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) [2023-08-26 15:30:20,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:30:20,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 603 [2023-08-26 15:30:20,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:30:38,282 INFO L124 PetriNetUnfolderBase]: 58324/90274 cut-off events. [2023-08-26 15:30:38,282 INFO L125 PetriNetUnfolderBase]: For 472260/488243 co-relation queries the response was YES. [2023-08-26 15:30:39,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412410 conditions, 90274 events. 58324/90274 cut-off events. For 472260/488243 co-relation queries the response was YES. Maximal size of possible extension queue 2723. Compared 720547 event pairs, 18960 based on Foata normal form. 35/68366 useless extension candidates. Maximal degree in co-relation 412345. Up to 65780 conditions per place. [2023-08-26 15:30:39,776 INFO L140 encePairwiseOnDemand]: 597/603 looper letters, 1029 selfloop transitions, 114 changer transitions 0/1159 dead transitions. [2023-08-26 15:30:39,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 1159 transitions, 17186 flow [2023-08-26 15:30:39,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:30:39,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:30:39,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1135 transitions. [2023-08-26 15:30:39,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37645107794361526 [2023-08-26 15:30:39,778 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1135 transitions. [2023-08-26 15:30:39,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1135 transitions. [2023-08-26 15:30:39,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:30:39,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1135 transitions. [2023-08-26 15:30:39,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 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) [2023-08-26 15:30:39,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 603.0) internal successors, (3618), 6 states have internal predecessors, (3618), 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) [2023-08-26 15:30:39,783 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 603.0) internal successors, (3618), 6 states have internal predecessors, (3618), 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) [2023-08-26 15:30:39,783 INFO L175 Difference]: Start difference. First operand has 222 places, 1046 transitions, 13720 flow. Second operand 5 states and 1135 transitions. [2023-08-26 15:30:39,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 1159 transitions, 17186 flow [2023-08-26 15:30:45,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 1159 transitions, 17014 flow, removed 86 selfloop flow, removed 0 redundant places. [2023-08-26 15:30:45,680 INFO L231 Difference]: Finished difference. Result has 224 places, 1044 transitions, 13804 flow [2023-08-26 15:30:45,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=603, PETRI_DIFFERENCE_MINUEND_FLOW=13576, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1044, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=930, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=13804, PETRI_PLACES=224, PETRI_TRANSITIONS=1044} [2023-08-26 15:30:45,681 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, 113 predicate places. [2023-08-26 15:30:45,681 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 1044 transitions, 13804 flow [2023-08-26 15:30:45,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 202.8) internal successors, (1014), 5 states have internal predecessors, (1014), 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) [2023-08-26 15:30:45,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:30:45,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:30:45,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 15:30:45,682 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting reader_twoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reader_twoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-08-26 15:30:45,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:30:45,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1574323926, now seen corresponding path program 1 times [2023-08-26 15:30:45,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:30:45,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963700041] [2023-08-26 15:30:45,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:30:45,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:30:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:30:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:30:45,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:30:45,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963700041] [2023-08-26 15:30:45,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963700041] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:30:45,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:30:45,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:30:45,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113135670] [2023-08-26 15:30:45,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:30:45,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:30:45,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:30:45,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:30:45,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:30:45,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 603 [2023-08-26 15:30:45,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 1044 transitions, 13804 flow. Second operand has 5 states, 5 states have (on average 174.8) internal successors, (874), 5 states have internal predecessors, (874), 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) [2023-08-26 15:30:45,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:30:45,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 603 [2023-08-26 15:30:45,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:31:02,925 INFO L124 PetriNetUnfolderBase]: 56982/87908 cut-off events. [2023-08-26 15:31:02,925 INFO L125 PetriNetUnfolderBase]: For 518154/531003 co-relation queries the response was YES. [2023-08-26 15:31:03,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414540 conditions, 87908 events. 56982/87908 cut-off events. For 518154/531003 co-relation queries the response was YES. Maximal size of possible extension queue 2339. Compared 682885 event pairs, 18846 based on Foata normal form. 38/69570 useless extension candidates. Maximal degree in co-relation 414474. Up to 61737 conditions per place. [2023-08-26 15:31:04,306 INFO L140 encePairwiseOnDemand]: 596/603 looper letters, 1037 selfloop transitions, 114 changer transitions 0/1160 dead transitions. [2023-08-26 15:31:04,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 1160 transitions, 17308 flow [2023-08-26 15:31:04,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:31:04,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:31:04,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1178 transitions. [2023-08-26 15:31:04,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3255942509673853 [2023-08-26 15:31:04,307 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1178 transitions. [2023-08-26 15:31:04,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1178 transitions. [2023-08-26 15:31:04,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:31:04,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1178 transitions. [2023-08-26 15:31:04,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 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) [2023-08-26 15:31:04,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 603.0) internal successors, (4221), 7 states have internal predecessors, (4221), 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) [2023-08-26 15:31:04,311 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 603.0) internal successors, (4221), 7 states have internal predecessors, (4221), 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) [2023-08-26 15:31:04,311 INFO L175 Difference]: Start difference. First operand has 224 places, 1044 transitions, 13804 flow. Second operand 6 states and 1178 transitions. [2023-08-26 15:31:04,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 1160 transitions, 17308 flow [2023-08-26 15:31:10,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 1160 transitions, 17080 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 15:31:10,574 INFO L231 Difference]: Finished difference. Result has 222 places, 1041 transitions, 13798 flow [2023-08-26 15:31:10,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=603, PETRI_DIFFERENCE_MINUEND_FLOW=13570, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1041, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=927, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=13798, PETRI_PLACES=222, PETRI_TRANSITIONS=1041} [2023-08-26 15:31:10,575 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, 111 predicate places. [2023-08-26 15:31:10,575 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 1041 transitions, 13798 flow [2023-08-26 15:31:10,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 174.8) internal successors, (874), 5 states have internal predecessors, (874), 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) [2023-08-26 15:31:10,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:31:10,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:31:10,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 15:31:10,575 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reader_twoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-08-26 15:31:10,576 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:31:10,576 INFO L85 PathProgramCache]: Analyzing trace with hash 526782781, now seen corresponding path program 1 times [2023-08-26 15:31:10,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:31:10,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485415331] [2023-08-26 15:31:10,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:31:10,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:31:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:31:10,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 15:31:10,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:31:10,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485415331] [2023-08-26 15:31:10,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485415331] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:31:10,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:31:10,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:31:10,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933425416] [2023-08-26 15:31:10,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:31:10,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:31:10,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:31:10,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:31:10,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:31:10,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 603 [2023-08-26 15:31:10,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 1041 transitions, 13798 flow. Second operand has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 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) [2023-08-26 15:31:10,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:31:10,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 603 [2023-08-26 15:31:10,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:31:26,063 INFO L124 PetriNetUnfolderBase]: 53231/82102 cut-off events. [2023-08-26 15:31:26,063 INFO L125 PetriNetUnfolderBase]: For 490610/505544 co-relation queries the response was YES. [2023-08-26 15:31:27,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 383437 conditions, 82102 events. 53231/82102 cut-off events. For 490610/505544 co-relation queries the response was YES. Maximal size of possible extension queue 2208. Compared 635024 event pairs, 16656 based on Foata normal form. 51/64059 useless extension candidates. Maximal degree in co-relation 383371. Up to 73601 conditions per place. [2023-08-26 15:31:27,452 INFO L140 encePairwiseOnDemand]: 599/603 looper letters, 1044 selfloop transitions, 54 changer transitions 0/1119 dead transitions. [2023-08-26 15:31:27,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 1119 transitions, 16646 flow [2023-08-26 15:31:27,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:31:27,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:31:27,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions. [2023-08-26 15:31:27,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4129353233830846 [2023-08-26 15:31:27,453 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 747 transitions. [2023-08-26 15:31:27,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 747 transitions. [2023-08-26 15:31:27,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:31:27,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 747 transitions. [2023-08-26 15:31:27,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 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) [2023-08-26 15:31:27,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 603.0) internal successors, (2412), 4 states have internal predecessors, (2412), 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) [2023-08-26 15:31:27,456 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 603.0) internal successors, (2412), 4 states have internal predecessors, (2412), 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) [2023-08-26 15:31:27,456 INFO L175 Difference]: Start difference. First operand has 222 places, 1041 transitions, 13798 flow. Second operand 3 states and 747 transitions. [2023-08-26 15:31:27,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 1119 transitions, 16646 flow [2023-08-26 15:31:33,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 1119 transitions, 16470 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 15:31:33,363 INFO L231 Difference]: Finished difference. Result has 222 places, 1042 transitions, 13854 flow [2023-08-26 15:31:33,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=603, PETRI_DIFFERENCE_MINUEND_FLOW=13630, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1041, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=987, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=13854, PETRI_PLACES=222, PETRI_TRANSITIONS=1042} [2023-08-26 15:31:33,364 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, 111 predicate places. [2023-08-26 15:31:33,364 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 1042 transitions, 13854 flow [2023-08-26 15:31:33,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 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) [2023-08-26 15:31:33,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:31:33,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:31:33,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 15:31:33,365 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reader_twoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, reader_twoErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-08-26 15:31:33,365 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:31:33,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1559401178, now seen corresponding path program 1 times [2023-08-26 15:31:33,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:31:33,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328159584] [2023-08-26 15:31:33,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:31:33,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:31:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:31:33,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:31:33,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:31:33,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328159584] [2023-08-26 15:31:33,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328159584] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:31:33,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:31:33,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:31:33,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010587474] [2023-08-26 15:31:33,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:31:33,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:31:33,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:31:33,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:31:33,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:31:33,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 603 [2023-08-26 15:31:33,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 1042 transitions, 13854 flow. Second operand has 3 states, 3 states have (on average 274.6666666666667) internal successors, (824), 3 states have internal predecessors, (824), 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) [2023-08-26 15:31:33,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:31:33,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 603 [2023-08-26 15:31:33,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:31:35,421 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1165] L816-1-->reader_twoErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (= |v_reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.offset_153| |v_reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.offset_151|) (= |v_reader_twoThread1of1ForFork0_ring_dequeue_#res#1_61| |v_reader_twoThread1of1ForFork0_~val~1#1_113|) (not (= 1 (select |v_#valid_417| |v_reader_twoThread1of1ForFork0_~#read~0#1.base_117|))) (< 0 |v_reader_twoThread1of1ForFork0_~val~1#1_113|) (= |v_reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1_79| |v_reader_twoThread1of1ForFork0_ring_dequeue_#res#1_61|) (<= (+ |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset_105| 4) (select |v_#length_392| |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_115|)) (= (select |v_#valid_417| |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_115|) 1) (= (store |v_#memory_int_388| |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_115| (store (select |v_#memory_int_388| |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_115|) |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset_105| (let ((.cse0 (+ |v_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1_92| 1))) (let ((.cse1 (mod .cse0 4))) (ite (and (< .cse0 0) (not (= .cse1 0))) (+ .cse1 (- 4)) .cse1))))) |v_#memory_int_387|) (= |v_reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.base_151| |v_reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.base_153|) (<= 0 |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset_105|) (<= |v_reader_twoThread1of1ForFork0_~val~1#1_113| 8)) InVars {reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.offset=|v_reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.offset_153|, reader_twoThread1of1ForFork0_~#read~0#1.base=|v_reader_twoThread1of1ForFork0_~#read~0#1.base_117|, reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset=|v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset_105|, #valid=|v_#valid_417|, reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1=|v_reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1_79|, #memory_int=|v_#memory_int_388|, #length=|v_#length_392|, reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1=|v_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1_92|, reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.base=|v_reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.base_153|, reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base=|v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_115|} OutVars{reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset=|v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset_105|, reader_twoThread1of1ForFork0_~val~1#1=|v_reader_twoThread1of1ForFork0_~val~1#1_113|, reader_twoThread1of1ForFork0_ring_dequeue_#res#1=|v_reader_twoThread1of1ForFork0_ring_dequeue_#res#1_61|, reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.offset=|v_reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.offset_151|, reader_twoThread1of1ForFork0_~#read~0#1.base=|v_reader_twoThread1of1ForFork0_~#read~0#1.base_117|, #valid=|v_#valid_417|, reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1=|v_reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1_79|, reader_twoThread1of1ForFork0_#t~ret23#1=|v_reader_twoThread1of1ForFork0_#t~ret23#1_51|, #memory_int=|v_#memory_int_387|, #length=|v_#length_392|, reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.base=|v_reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.base_151|, reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base=|v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_115|} AuxVars[] AssignedVars[reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.offset, reader_twoThread1of1ForFork0_~val~1#1, reader_twoThread1of1ForFork0_#t~ret23#1, #memory_int, reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1, reader_twoThread1of1ForFork0_ring_dequeue_#res#1, reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.base][351], [Black: 497#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 501#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select |#length| |writer_fnThread1of1ForFork1_~r~1#1.base|) 24) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 493#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (not (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 0)) (<= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (<= (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20) 0) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24)), Black: 511#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (<= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 0)), Black: 495#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (<= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 0)), Black: 381#(and (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24)), Black: 385#(and (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 492#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (not (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 0)) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| 0) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24)), Black: 505#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (not (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 0)) (= (select |#length| |writer_fnThread1of1ForFork1_~r~1#1.base|) 24) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (<= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (<= (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20) 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 387#(and (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24)), Black: 494#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (not (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 0)) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (<= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 0)), Black: 509#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (not (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 0)) (<= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (<= (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20) 0) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (<= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 0)), Black: 491#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24)), 366#(and (= (select |#valid| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 1) (= (select |#valid| |writer_fnThread1of1ForFork1_~r~1#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1) (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 1)), Black: 499#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select |#length| |writer_fnThread1of1ForFork1_~r~1#1.base|) 24) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), 455#true, 318#(and (= (select |#valid| |ULTIMATE.start_writer_fn_~r~1#1.base|) 1) (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1)), writer_fnThread1of1ForFork1InUse, Black: 411#(and (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (<= 24 (select |#length| |writer_fnThread1of1ForFork1_~r~1#1.base|)) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (<= 24 (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|)) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (<= 24 (select |#length| |ULTIMATE.start_main_~#r~3#1.base|))), 524#true, 285#true, 132#L810-1true, 428#true, Black: 537#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 526#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 529#(and (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 533#(and (<= |ULTIMATE.start_ring_enqueue_#t~mem6#1| 0) (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 545#(and (<= |ULTIMATE.start_ring_enqueue_#t~mem6#1| 0) (not (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 0)) (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 418#(and (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 1) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 293#true, Black: 535#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 547#(and (<= |ULTIMATE.start_ring_enqueue_#t~mem6#1| 0) (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 419#(and (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 530#(and (not (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 0)) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= |ULTIMATE.start_ring_enqueue_#t~mem4#1| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 532#(and (<= |ULTIMATE.start_ring_enqueue_#t~mem6#1| 0) (not (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 0)) (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 541#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 531#(and (not (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 0)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), 116#L810-1true, 303#(and (= |ULTIMATE.start_main_~#writer~0#1.offset| 0) (or (= (select |#length| |ULTIMATE.start_main_~#writer~0#1.base|) 4) (= 32 (select |#length| |ULTIMATE.start_main_~#writer~0#1.base|)))), 307#(= |ULTIMATE.start_writer_fn_~i~1#1| 0), Black: 440#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 310#true, Black: 314#(= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 1), Black: 442#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (<= 24 (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|)) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_ring_enqueue_#t~mem4#1| 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 316#(and (= (select |#valid| |ULTIMATE.start_writer_fn_~r~1#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1)), Black: 436#(and (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (<= (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 24) (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|)) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0)), Black: 444#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|)) (<= (+ (* (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 4) 24) (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|))), Black: 430#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 438#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 446#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (<= (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 24) (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|)) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), 376#(and (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1)), Black: 582#(and (<= (+ 4 |ULTIMATE.start_main_~#reader~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#reader~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#reader~0#1.offset| 1))), 588#(= |reader_twoThread1of1ForFork0_~i~2#1| 0), Black: 334#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select |#length| |writer_fnThread1of1ForFork1_~r~1#1.base|) 24) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0)), Black: 332#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0)), Black: 327#(and (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0)), 128#reader_twoErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 466#(and (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 474#(and (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (<= (+ (* 4 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) 24) (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|)) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 457#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 472#(and (<= 24 (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|)) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 344#(and (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0)), Black: 348#(and (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24)), Black: 464#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (<= (+ (* |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 4) 24) (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|)) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|)), Black: 468#(and (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), 485#true, Black: 476#(and (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (<= (+ (* |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 4) 24) (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|)) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 360#(= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 1), Black: 364#(and (= (select |#valid| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 1) (= (select |#valid| |writer_fnThread1of1ForFork1_~r~1#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1)), Black: 355#true, 580#true]) [2023-08-26 15:31:35,422 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-26 15:31:35,422 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 15:31:35,422 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 15:31:35,422 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-26 15:31:35,423 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1166] L816-1-->reader_twoErr13ASSERT_VIOLATIONASSERT: Formula: (and (= (store |v_#memory_int_392| |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_117| (store (select |v_#memory_int_392| |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_117|) |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset_107| (let ((.cse0 (+ |v_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1_96| 1))) (let ((.cse1 (mod .cse0 4))) (ite (and (< .cse0 0) (not (= .cse1 0))) (+ (- 4) .cse1) .cse1))))) |v_#memory_int_391|) (<= 0 |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset_107|) (<= (+ |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset_107| 4) (select |v_#length_394| |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_117|)) (= |v_reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1_81| |v_reader_twoThread1of1ForFork0_ring_dequeue_#res#1_63|) (= |v_reader_twoThread1of1ForFork0_ring_dequeue_#res#1_63| |v_reader_twoThread1of1ForFork0_~val~1#1_115|) (<= |v_reader_twoThread1of1ForFork0_~val~1#1_115| 2147483647) (= (select |v_#valid_419| |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_117|) 1) (< 8 |v_reader_twoThread1of1ForFork0_~val~1#1_115|)) InVars {reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset=|v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset_107|, reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1=|v_reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1_81|, #valid=|v_#valid_419|, #memory_int=|v_#memory_int_392|, #length=|v_#length_394|, reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1=|v_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1_96|, reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base=|v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_117|} OutVars{reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.offset=|v_reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.offset_157|, reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset=|v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset_107|, reader_twoThread1of1ForFork0_~val~1#1=|v_reader_twoThread1of1ForFork0_~val~1#1_115|, reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1=|v_reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1_81|, #valid=|v_#valid_419|, reader_twoThread1of1ForFork0_#t~ret23#1=|v_reader_twoThread1of1ForFork0_#t~ret23#1_53|, #memory_int=|v_#memory_int_391|, #length=|v_#length_394|, reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.base=|v_reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.base_157|, reader_twoThread1of1ForFork0_ring_dequeue_#res#1=|v_reader_twoThread1of1ForFork0_ring_dequeue_#res#1_63|, reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base=|v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_117|} AuxVars[] AssignedVars[reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.offset, reader_twoThread1of1ForFork0_~val~1#1, reader_twoThread1of1ForFork0_#t~ret23#1, #memory_int, reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1, reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.base, reader_twoThread1of1ForFork0_ring_dequeue_#res#1][352], [Black: 497#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 501#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select |#length| |writer_fnThread1of1ForFork1_~r~1#1.base|) 24) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 493#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (not (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 0)) (<= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (<= (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20) 0) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24)), Black: 511#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (<= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 0)), Black: 495#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (<= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 0)), Black: 381#(and (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24)), Black: 385#(and (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 492#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (not (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 0)) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| 0) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24)), Black: 505#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (not (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 0)) (= (select |#length| |writer_fnThread1of1ForFork1_~r~1#1.base|) 24) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (<= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (<= (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20) 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 387#(and (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24)), Black: 494#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (not (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 0)) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (<= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 0)), Black: 509#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (not (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 0)) (<= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (<= (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20) 0) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (<= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 0)), Black: 491#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24)), 366#(and (= (select |#valid| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 1) (= (select |#valid| |writer_fnThread1of1ForFork1_~r~1#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1) (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 1)), Black: 499#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select |#length| |writer_fnThread1of1ForFork1_~r~1#1.base|) 24) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), 455#true, 318#(and (= (select |#valid| |ULTIMATE.start_writer_fn_~r~1#1.base|) 1) (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1)), 45#reader_twoErr13ASSERT_VIOLATIONASSERTtrue, writer_fnThread1of1ForFork1InUse, Black: 411#(and (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (<= 24 (select |#length| |writer_fnThread1of1ForFork1_~r~1#1.base|)) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (<= 24 (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|)) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (<= 24 (select |#length| |ULTIMATE.start_main_~#r~3#1.base|))), 524#true, 285#true, 132#L810-1true, 428#true, Black: 537#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 526#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 529#(and (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 533#(and (<= |ULTIMATE.start_ring_enqueue_#t~mem6#1| 0) (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 545#(and (<= |ULTIMATE.start_ring_enqueue_#t~mem6#1| 0) (not (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 0)) (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 418#(and (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 1) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 293#true, Black: 535#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 547#(and (<= |ULTIMATE.start_ring_enqueue_#t~mem6#1| 0) (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 419#(and (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 530#(and (not (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 0)) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= |ULTIMATE.start_ring_enqueue_#t~mem4#1| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 532#(and (<= |ULTIMATE.start_ring_enqueue_#t~mem6#1| 0) (not (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 0)) (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 541#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 531#(and (not (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 0)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), 116#L810-1true, 303#(and (= |ULTIMATE.start_main_~#writer~0#1.offset| 0) (or (= (select |#length| |ULTIMATE.start_main_~#writer~0#1.base|) 4) (= 32 (select |#length| |ULTIMATE.start_main_~#writer~0#1.base|)))), 307#(= |ULTIMATE.start_writer_fn_~i~1#1| 0), Black: 440#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 310#true, Black: 314#(= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 1), Black: 442#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (<= 24 (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|)) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_ring_enqueue_#t~mem4#1| 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 316#(and (= (select |#valid| |ULTIMATE.start_writer_fn_~r~1#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1)), Black: 436#(and (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (<= (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 24) (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|)) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0)), Black: 444#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|)) (<= (+ (* (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 4) 24) (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|))), Black: 430#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 438#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 446#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (<= (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 24) (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|)) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), 376#(and (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1)), Black: 582#(and (<= (+ 4 |ULTIMATE.start_main_~#reader~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#reader~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#reader~0#1.offset| 1))), 588#(= |reader_twoThread1of1ForFork0_~i~2#1| 0), Black: 334#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select |#length| |writer_fnThread1of1ForFork1_~r~1#1.base|) 24) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0)), Black: 332#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0)), Black: 327#(and (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0)), Black: 466#(and (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 474#(and (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (<= (+ (* 4 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) 24) (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|)) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 457#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 472#(and (<= 24 (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|)) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 344#(and (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0)), Black: 348#(and (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24)), Black: 464#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (<= (+ (* |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 4) 24) (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|)) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|)), Black: 468#(and (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), 485#true, Black: 476#(and (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (<= (+ (* |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 4) 24) (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|)) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 360#(= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 1), Black: 364#(and (= (select |#valid| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 1) (= (select |#valid| |writer_fnThread1of1ForFork1_~r~1#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1)), Black: 355#true, 580#true]) [2023-08-26 15:31:35,423 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-26 15:31:35,423 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 15:31:35,423 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 15:31:35,423 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-26 15:31:35,424 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1167] L816-1-->reader_twoErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (and (let ((.cse0 (+ (* 4 |v_reader_twoThread1of1ForFork0_~val~1#1_117|) |v_reader_twoThread1of1ForFork0_~#read~0#1.offset_95|))) (or (< .cse0 4) (< (select |v_#length_396| |v_reader_twoThread1of1ForFork0_~#read~0#1.base_119|) .cse0))) (<= |v_reader_twoThread1of1ForFork0_~val~1#1_117| 8) (= |v_reader_twoThread1of1ForFork0_ring_dequeue_#res#1_65| |v_reader_twoThread1of1ForFork0_~val~1#1_117|) (<= (+ |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset_109| 4) (select |v_#length_396| |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_119|)) (<= 0 |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset_109|) (= |v_reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1_83| |v_reader_twoThread1of1ForFork0_ring_dequeue_#res#1_65|) (= (select |v_#valid_421| |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_119|) 1) (< 0 |v_reader_twoThread1of1ForFork0_~val~1#1_117|) (= |v_reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.offset_165| |v_reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.offset_163|) (= |v_reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.base_163| |v_reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.base_165|) (= (store |v_#memory_int_396| |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_119| (store (select |v_#memory_int_396| |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_119|) |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset_109| (let ((.cse2 (+ |v_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1_100| 1))) (let ((.cse1 (mod .cse2 4))) (ite (and (not (= .cse1 0)) (< .cse2 0)) (+ (- 4) .cse1) .cse1))))) |v_#memory_int_395|)) InVars {reader_twoThread1of1ForFork0_~#read~0#1.offset=|v_reader_twoThread1of1ForFork0_~#read~0#1.offset_95|, reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.offset=|v_reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.offset_165|, reader_twoThread1of1ForFork0_~#read~0#1.base=|v_reader_twoThread1of1ForFork0_~#read~0#1.base_119|, reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset=|v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset_109|, reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1=|v_reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1_83|, #valid=|v_#valid_421|, #memory_int=|v_#memory_int_396|, #length=|v_#length_396|, reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1=|v_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1_100|, reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.base=|v_reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.base_165|, reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base=|v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_119|} OutVars{reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset=|v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset_109|, reader_twoThread1of1ForFork0_~val~1#1=|v_reader_twoThread1of1ForFork0_~val~1#1_117|, reader_twoThread1of1ForFork0_ring_dequeue_#res#1=|v_reader_twoThread1of1ForFork0_ring_dequeue_#res#1_65|, reader_twoThread1of1ForFork0_~#read~0#1.offset=|v_reader_twoThread1of1ForFork0_~#read~0#1.offset_95|, reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.offset=|v_reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.offset_163|, reader_twoThread1of1ForFork0_~#read~0#1.base=|v_reader_twoThread1of1ForFork0_~#read~0#1.base_119|, reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1=|v_reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1_83|, #valid=|v_#valid_421|, reader_twoThread1of1ForFork0_#t~ret23#1=|v_reader_twoThread1of1ForFork0_#t~ret23#1_55|, #memory_int=|v_#memory_int_395|, #length=|v_#length_396|, reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.base=|v_reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.base_163|, reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base=|v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_119|} AuxVars[] AssignedVars[reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.offset, reader_twoThread1of1ForFork0_~val~1#1, reader_twoThread1of1ForFork0_#t~ret23#1, #memory_int, reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1, reader_twoThread1of1ForFork0_ring_dequeue_#res#1, reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.base][353], [Black: 497#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 501#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select |#length| |writer_fnThread1of1ForFork1_~r~1#1.base|) 24) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 493#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (not (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 0)) (<= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (<= (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20) 0) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24)), Black: 511#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (<= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 0)), Black: 495#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (<= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 0)), Black: 381#(and (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24)), Black: 385#(and (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 492#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (not (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 0)) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| 0) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24)), Black: 505#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (not (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 0)) (= (select |#length| |writer_fnThread1of1ForFork1_~r~1#1.base|) 24) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (<= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (<= (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20) 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 387#(and (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24)), Black: 494#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (not (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 0)) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (<= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 0)), Black: 509#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (not (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 0)) (<= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (<= (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20) 0) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (<= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 0)), Black: 491#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24)), 366#(and (= (select |#valid| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 1) (= (select |#valid| |writer_fnThread1of1ForFork1_~r~1#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1) (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 1)), Black: 499#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select |#length| |writer_fnThread1of1ForFork1_~r~1#1.base|) 24) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), 455#true, 318#(and (= (select |#valid| |ULTIMATE.start_writer_fn_~r~1#1.base|) 1) (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1)), writer_fnThread1of1ForFork1InUse, Black: 411#(and (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (<= 24 (select |#length| |writer_fnThread1of1ForFork1_~r~1#1.base|)) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (<= 24 (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|)) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (<= 24 (select |#length| |ULTIMATE.start_main_~#r~3#1.base|))), 524#true, 285#true, 132#L810-1true, 428#true, Black: 537#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 526#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 529#(and (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 533#(and (<= |ULTIMATE.start_ring_enqueue_#t~mem6#1| 0) (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 545#(and (<= |ULTIMATE.start_ring_enqueue_#t~mem6#1| 0) (not (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 0)) (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 418#(and (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 1) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 293#true, Black: 535#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 547#(and (<= |ULTIMATE.start_ring_enqueue_#t~mem6#1| 0) (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 419#(and (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 530#(and (not (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 0)) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= |ULTIMATE.start_ring_enqueue_#t~mem4#1| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 532#(and (<= |ULTIMATE.start_ring_enqueue_#t~mem6#1| 0) (not (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 0)) (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 541#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 531#(and (not (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 0)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), 116#L810-1true, 303#(and (= |ULTIMATE.start_main_~#writer~0#1.offset| 0) (or (= (select |#length| |ULTIMATE.start_main_~#writer~0#1.base|) 4) (= 32 (select |#length| |ULTIMATE.start_main_~#writer~0#1.base|)))), 307#(= |ULTIMATE.start_writer_fn_~i~1#1| 0), Black: 440#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 310#true, Black: 314#(= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 1), Black: 442#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (<= 24 (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|)) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_ring_enqueue_#t~mem4#1| 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 316#(and (= (select |#valid| |ULTIMATE.start_writer_fn_~r~1#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1)), Black: 436#(and (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (<= (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 24) (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|)) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0)), Black: 444#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|)) (<= (+ (* (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 4) 24) (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|))), Black: 430#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 438#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 446#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (<= (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 24) (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|)) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), 376#(and (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1)), Black: 582#(and (<= (+ 4 |ULTIMATE.start_main_~#reader~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#reader~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#reader~0#1.offset| 1))), 588#(= |reader_twoThread1of1ForFork0_~i~2#1| 0), Black: 334#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select |#length| |writer_fnThread1of1ForFork1_~r~1#1.base|) 24) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0)), Black: 332#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0)), Black: 327#(and (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0)), Black: 466#(and (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 474#(and (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (<= (+ (* 4 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) 24) (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|)) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 457#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 472#(and (<= 24 (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|)) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 344#(and (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0)), Black: 348#(and (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24)), Black: 464#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (<= (+ (* |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 4) 24) (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|)) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|)), 8#reader_twoErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 468#(and (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), 485#true, Black: 476#(and (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (<= (+ (* |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 4) 24) (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|)) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 360#(= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 1), Black: 364#(and (= (select |#valid| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 1) (= (select |#valid| |writer_fnThread1of1ForFork1_~r~1#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1)), Black: 355#true, 580#true]) [2023-08-26 15:31:35,424 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-26 15:31:35,424 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 15:31:35,424 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 15:31:35,424 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-26 15:31:35,425 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1151] L816-1-->L1060-3: Formula: (and (= |v_reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.offset_In_13| |v_reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.offset_Out_26|) (= |v_reader_twoThread1of1ForFork0_~val~1#1_Out_2| |v_reader_twoThread1of1ForFork0_ring_dequeue_#res#1_Out_2|) (<= (+ |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset_In_1| 4) (select |v_#length_In_7| |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_In_1|)) (= |v_reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.base_In_13| |v_reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.base_Out_26|) (= |v_reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1_In_1| |v_reader_twoThread1of1ForFork0_ring_dequeue_#res#1_Out_2|) (= |v_#memory_int_Out_2| (store |v_#memory_int_In_7| |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_In_1| (store (select |v_#memory_int_In_7| |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_In_1|) |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset_In_1| (let ((.cse1 (+ |v_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1_In_1| 1))) (let ((.cse0 (mod .cse1 4))) (ite (and (not (= .cse0 0)) (< .cse1 0)) (+ (- 4) .cse0) .cse0)))))) (<= |v_reader_twoThread1of1ForFork0_~val~1#1_Out_2| 2147483647) (= (select |v_#valid_In_7| |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_In_1|) 1) (<= 0 |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset_In_1|) (< 0 |v_reader_twoThread1of1ForFork0_~val~1#1_Out_2|)) InVars {reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.offset=|v_reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.offset_In_13|, reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset=|v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset_In_1|, reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1=|v_reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_7|, #length=|v_#length_In_7|, reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1=|v_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1_In_1|, reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.base=|v_reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.base_In_13|, reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base=|v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_In_1|} OutVars{reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset=|v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset_In_1|, reader_twoThread1of1ForFork0_~val~1#1=|v_reader_twoThread1of1ForFork0_~val~1#1_Out_2|, reader_twoThread1of1ForFork0_ring_dequeue_#res#1=|v_reader_twoThread1of1ForFork0_ring_dequeue_#res#1_Out_2|, reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.offset=|v_reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.offset_Out_26|, reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1=|v_reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1_In_1|, #valid=|v_#valid_In_7|, reader_twoThread1of1ForFork0_#t~ret23#1=|v_reader_twoThread1of1ForFork0_#t~ret23#1_Out_2|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.base=|v_reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.base_Out_26|, reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base=|v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_In_1|} AuxVars[] AssignedVars[reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.offset, reader_twoThread1of1ForFork0_~val~1#1, reader_twoThread1of1ForFork0_#t~ret23#1, #memory_int, reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1, reader_twoThread1of1ForFork0_ring_dequeue_#res#1, reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.base][354], [Black: 497#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 501#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select |#length| |writer_fnThread1of1ForFork1_~r~1#1.base|) 24) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 493#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (not (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 0)) (<= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (<= (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20) 0) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24)), Black: 511#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (<= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 0)), Black: 495#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (<= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 0)), Black: 381#(and (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24)), Black: 385#(and (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 492#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (not (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 0)) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| 0) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24)), Black: 505#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (not (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 0)) (= (select |#length| |writer_fnThread1of1ForFork1_~r~1#1.base|) 24) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (<= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (<= (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20) 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 387#(and (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24)), Black: 494#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (not (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 0)) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (<= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 0)), Black: 509#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (not (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 0)) (<= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (<= (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20) 0) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (<= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 0)), Black: 491#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24)), 366#(and (= (select |#valid| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 1) (= (select |#valid| |writer_fnThread1of1ForFork1_~r~1#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1) (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 1)), Black: 499#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select |#length| |writer_fnThread1of1ForFork1_~r~1#1.base|) 24) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), 455#true, 318#(and (= (select |#valid| |ULTIMATE.start_writer_fn_~r~1#1.base|) 1) (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1)), writer_fnThread1of1ForFork1InUse, Black: 411#(and (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (<= 24 (select |#length| |writer_fnThread1of1ForFork1_~r~1#1.base|)) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (<= 24 (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|)) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (<= 24 (select |#length| |ULTIMATE.start_main_~#r~3#1.base|))), 524#true, 285#true, 132#L810-1true, 428#true, Black: 537#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 526#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 529#(and (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 533#(and (<= |ULTIMATE.start_ring_enqueue_#t~mem6#1| 0) (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 545#(and (<= |ULTIMATE.start_ring_enqueue_#t~mem6#1| 0) (not (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 0)) (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 418#(and (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 1) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 293#true, Black: 535#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 547#(and (<= |ULTIMATE.start_ring_enqueue_#t~mem6#1| 0) (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 419#(and (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 530#(and (not (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 0)) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= |ULTIMATE.start_ring_enqueue_#t~mem4#1| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 532#(and (<= |ULTIMATE.start_ring_enqueue_#t~mem6#1| 0) (not (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 0)) (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 541#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 531#(and (not (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 0)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), 116#L810-1true, 303#(and (= |ULTIMATE.start_main_~#writer~0#1.offset| 0) (or (= (select |#length| |ULTIMATE.start_main_~#writer~0#1.base|) 4) (= 32 (select |#length| |ULTIMATE.start_main_~#writer~0#1.base|)))), 307#(= |ULTIMATE.start_writer_fn_~i~1#1| 0), Black: 440#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 310#true, Black: 314#(= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 1), Black: 442#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (<= 24 (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|)) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_ring_enqueue_#t~mem4#1| 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 316#(and (= (select |#valid| |ULTIMATE.start_writer_fn_~r~1#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1)), Black: 436#(and (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (<= (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 24) (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|)) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0)), Black: 444#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|)) (<= (+ (* (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 4) 24) (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|))), Black: 430#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 438#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 446#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (<= (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 24) (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|)) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), 376#(and (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1)), Black: 582#(and (<= (+ 4 |ULTIMATE.start_main_~#reader~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#reader~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#reader~0#1.offset| 1))), 183#L1060-3true, 588#(= |reader_twoThread1of1ForFork0_~i~2#1| 0), Black: 334#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select |#length| |writer_fnThread1of1ForFork1_~r~1#1.base|) 24) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0)), Black: 332#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0)), Black: 327#(and (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0)), Black: 466#(and (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 474#(and (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (<= (+ (* 4 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) 24) (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|)) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 457#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 472#(and (<= 24 (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|)) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 344#(and (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0)), Black: 348#(and (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24)), Black: 464#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (<= (+ (* |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 4) 24) (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|)) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|)), Black: 468#(and (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), 485#true, Black: 476#(and (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (<= (+ (* |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 4) 24) (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|)) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 360#(= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 1), Black: 364#(and (= (select |#valid| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 1) (= (select |#valid| |writer_fnThread1of1ForFork1_~r~1#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1)), Black: 355#true, 580#true]) [2023-08-26 15:31:35,425 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-26 15:31:35,425 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 15:31:35,425 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 15:31:35,425 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-26 15:31:35,426 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1112] L816-1-->reader_twoErr12ASSERT_VIOLATIONASSERT: Formula: (and (<= 0 |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset_75|) (<= (+ |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset_75| 4) (select |v_#length_278| |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_85|)) (= |v_reader_twoThread1of1ForFork0_~val~1#1_89| |v_reader_twoThread1of1ForFork0_ring_dequeue_#res#1_31|) (<= 0 (+ |v_reader_twoThread1of1ForFork0_ring_dequeue_#res#1_31| 2147483648)) (= |v_reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1_49| |v_reader_twoThread1of1ForFork0_ring_dequeue_#res#1_31|) (= (store |v_#memory_int_274| |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_85| (store (select |v_#memory_int_274| |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_85|) |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset_75| (let ((.cse0 (+ |v_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1_52| 1))) (let ((.cse1 (mod .cse0 4))) (ite (and (< .cse0 0) (not (= .cse1 0))) (+ (- 4) .cse1) .cse1))))) |v_#memory_int_273|) (= (select |v_#valid_303| |v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_85|) 1) (<= |v_reader_twoThread1of1ForFork0_~val~1#1_89| 0)) InVars {reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset=|v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset_75|, reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1=|v_reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1_49|, #valid=|v_#valid_303|, #memory_int=|v_#memory_int_274|, #length=|v_#length_278|, reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1=|v_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1_52|, reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base=|v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_85|} OutVars{reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.offset=|v_reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.offset_95|, reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset=|v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset_75|, reader_twoThread1of1ForFork0_~val~1#1=|v_reader_twoThread1of1ForFork0_~val~1#1_89|, reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1=|v_reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1_49|, #valid=|v_#valid_303|, reader_twoThread1of1ForFork0_#t~ret23#1=|v_reader_twoThread1of1ForFork0_#t~ret23#1_35|, #memory_int=|v_#memory_int_273|, #length=|v_#length_278|, reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.base=|v_reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.base_95|, reader_twoThread1of1ForFork0_ring_dequeue_#res#1=|v_reader_twoThread1of1ForFork0_ring_dequeue_#res#1_31|, reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base=|v_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base_85|} AuxVars[] AssignedVars[reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.offset, reader_twoThread1of1ForFork0_~val~1#1, reader_twoThread1of1ForFork0_#t~ret23#1, #memory_int, reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1, reader_twoThread1of1ForFork0_reach_error_#t~nondet3#1.base, reader_twoThread1of1ForFork0_ring_dequeue_#res#1][355], [Black: 497#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 501#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select |#length| |writer_fnThread1of1ForFork1_~r~1#1.base|) 24) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 493#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (not (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 0)) (<= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (<= (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20) 0) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24)), Black: 511#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (<= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 0)), Black: 495#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (<= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 0)), Black: 381#(and (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24)), Black: 385#(and (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 492#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (not (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 0)) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| 0) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24)), Black: 505#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (not (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 0)) (= (select |#length| |writer_fnThread1of1ForFork1_~r~1#1.base|) 24) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (<= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (<= (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20) 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 387#(and (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24)), Black: 494#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (not (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 0)) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (<= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 0)), Black: 509#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (not (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 0)) (<= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (<= (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20) 0) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24) (<= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 0)), Black: 491#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 24)), 366#(and (= (select |#valid| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 1) (= (select |#valid| |writer_fnThread1of1ForFork1_~r~1#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1) (= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 1)), Black: 499#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select |#length| |writer_fnThread1of1ForFork1_~r~1#1.base|) 24) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), 455#true, 318#(and (= (select |#valid| |ULTIMATE.start_writer_fn_~r~1#1.base|) 1) (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1)), writer_fnThread1of1ForFork1InUse, Black: 411#(and (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (<= 24 (select |#length| |writer_fnThread1of1ForFork1_~r~1#1.base|)) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (<= 24 (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|)) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (<= 24 (select |#length| |ULTIMATE.start_main_~#r~3#1.base|))), 524#true, 285#true, 132#L810-1true, 428#true, Black: 537#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 526#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 529#(and (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 533#(and (<= |ULTIMATE.start_ring_enqueue_#t~mem6#1| 0) (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 545#(and (<= |ULTIMATE.start_ring_enqueue_#t~mem6#1| 0) (not (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 0)) (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 418#(and (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 1) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 293#true, Black: 535#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 547#(and (<= |ULTIMATE.start_ring_enqueue_#t~mem6#1| 0) (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 419#(and (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 530#(and (not (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 0)) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= |ULTIMATE.start_ring_enqueue_#t~mem4#1| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 532#(and (<= |ULTIMATE.start_ring_enqueue_#t~mem6#1| 0) (not (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 0)) (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), Black: 541#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 531#(and (not (= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 0)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|) 24)), 116#L810-1true, 303#(and (= |ULTIMATE.start_main_~#writer~0#1.offset| 0) (or (= (select |#length| |ULTIMATE.start_main_~#writer~0#1.base|) 4) (= 32 (select |#length| |ULTIMATE.start_main_~#writer~0#1.base|)))), 307#(= |ULTIMATE.start_writer_fn_~i~1#1| 0), Black: 440#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 310#true, Black: 314#(= (select |#valid| |ULTIMATE.start_ring_enqueue_~r#1.base|) 1), Black: 442#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (<= 24 (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|)) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_ring_enqueue_#t~mem4#1| 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 316#(and (= (select |#valid| |ULTIMATE.start_writer_fn_~r~1#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1)), Black: 436#(and (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (<= (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 24) (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|)) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0)), Black: 444#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|)) (<= (+ (* (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 4) 24) (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|))), Black: 430#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 438#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 446#(and (= (select (select |#memory_int| |ULTIMATE.start_writer_fn_~r~1#1.base|) 20) 0) (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (<= 0 |ULTIMATE.start_ring_enqueue_#t~mem6#1|) (= (select (select |#memory_int| |ULTIMATE.start_ring_enqueue_~r#1.base|) 20) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (<= (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 24) (select |#length| |ULTIMATE.start_ring_enqueue_~r#1.base|)) (= |ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), 376#(and (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1)), Black: 582#(and (<= (+ 4 |ULTIMATE.start_main_~#reader~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#reader~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#reader~0#1.offset| 1))), 263#reader_twoErr12ASSERT_VIOLATIONASSERTtrue, 588#(= |reader_twoThread1of1ForFork0_~i~2#1| 0), Black: 334#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select |#length| |writer_fnThread1of1ForFork1_~r~1#1.base|) 24) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0)), Black: 332#(and (= (select |#length| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 24) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0)), Black: 327#(and (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0)), Black: 466#(and (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 474#(and (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (<= (+ (* 4 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) 24) (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|)) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 457#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 344#(and (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0)), Black: 472#(and (<= 24 (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|)) (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 348#(and (= |ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#r~3#1.base|) 24) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= (select |#length| |ULTIMATE.start_writer_fn_~r~1#1.base|) 24)), Black: 464#(and (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (<= (+ (* |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 4) 24) (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|)) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|)), Black: 468#(and (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), 485#true, Black: 476#(and (= |writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (= |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (<= (+ (* |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 4) 24) (select |#length| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|)) (= 0 (select (select |#memory_int| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 20)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#r~3#1.base|) 20) 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 20) 0) (= |ULTIMATE.start_main_~#r~3#1.offset| 0) (<= 0 |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1|) (= |writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (= (select (select |#memory_int| |writer_fnThread1of1ForFork1_~r~1#1.base|) 20) 0) (not (= |ULTIMATE.start_main_~#r~3#1.base| |ULTIMATE.start_main_~#writer~0#1.base|))), Black: 360#(= (select |#valid| |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) 1), Black: 364#(and (= (select |#valid| |writer_fnThread1of1ForFork1_#in~arg#1.base|) 1) (= (select |#valid| |writer_fnThread1of1ForFork1_~r~1#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#r~3#1.base|) 1)), Black: 355#true, 580#true]) [2023-08-26 15:31:35,426 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-26 15:31:35,426 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 15:31:35,426 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 15:31:35,426 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event