/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --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-ext/37_stack_lock_p0_vs_concur-pthread.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:36:21,999 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:36:22,057 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-NoLbe.epf [2023-11-30 04:36:22,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:36:22,091 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:36:22,092 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:36:22,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:36:22,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:36:22,095 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:36:22,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:36:22,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:36:22,099 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:36:22,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:36:22,100 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:36:22,100 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:36:22,100 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:36:22,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:36:22,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:36:22,100 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:36:22,100 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:36:22,101 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:36:22,101 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:36:22,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:36:22,102 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:36:22,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:36:22,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:36:22,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:36:22,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:36:22,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:36:22,103 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:36:22,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:36:22,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:36:22,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:36:22,104 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true 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-11-30 04:36:22,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:36:22,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:36:22,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:36:22,284 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:36:22,284 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:36:22,285 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i [2023-11-30 04:36:23,261 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:36:23,452 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:36:23,452 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i [2023-11-30 04:36:23,461 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7f1c3614/4d87f470d7044ad98a8c97c8ca52fe9f/FLAG621b5990e [2023-11-30 04:36:23,472 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7f1c3614/4d87f470d7044ad98a8c97c8ca52fe9f [2023-11-30 04:36:23,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:36:23,474 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:36:23,475 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:36:23,475 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:36:23,478 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:36:23,478 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:36:23" (1/1) ... [2023-11-30 04:36:23,479 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a63b1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:36:23, skipping insertion in model container [2023-11-30 04:36:23,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:36:23" (1/1) ... [2023-11-30 04:36:23,521 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:36:23,803 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:36:23,813 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:36:23,853 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:36:23,878 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:36:23,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:36:23 WrapperNode [2023-11-30 04:36:23,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:36:23,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:36:23,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:36:23,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:36:23,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:36:23" (1/1) ... [2023-11-30 04:36:23,909 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:36:23" (1/1) ... [2023-11-30 04:36:23,930 INFO L138 Inliner]: procedures = 165, calls = 31, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 85 [2023-11-30 04:36:23,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:36:23,931 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:36:23,931 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:36:23,931 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:36:23,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:36:23" (1/1) ... [2023-11-30 04:36:23,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:36:23" (1/1) ... [2023-11-30 04:36:23,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:36:23" (1/1) ... [2023-11-30 04:36:23,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:36:23" (1/1) ... [2023-11-30 04:36:23,955 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:36:23" (1/1) ... [2023-11-30 04:36:23,957 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:36:23" (1/1) ... [2023-11-30 04:36:23,958 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:36:23" (1/1) ... [2023-11-30 04:36:23,959 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:36:23" (1/1) ... [2023-11-30 04:36:23,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:36:23,961 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:36:23,961 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:36:23,961 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:36:23,962 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:36:23" (1/1) ... [2023-11-30 04:36:23,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:36:23,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:36:24,013 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-11-30 04:36:24,039 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-11-30 04:36:24,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 04:36:24,060 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-30 04:36:24,060 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-30 04:36:24,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:36:24,060 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-30 04:36:24,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:36:24,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:36:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:36:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:36:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-30 04:36:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:36:24,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:36:24,062 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 04:36:24,202 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:36:24,203 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:36:24,397 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:36:24,429 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:36:24,430 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-30 04:36:24,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:36:24 BoogieIcfgContainer [2023-11-30 04:36:24,431 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:36:24,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:36:24,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:36:24,435 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:36:24,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:36:23" (1/3) ... [2023-11-30 04:36:24,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fea8eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:36:24, skipping insertion in model container [2023-11-30 04:36:24,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:36:23" (2/3) ... [2023-11-30 04:36:24,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fea8eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:36:24, skipping insertion in model container [2023-11-30 04:36:24,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:36:24" (3/3) ... [2023-11-30 04:36:24,436 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur-pthread.i [2023-11-30 04:36:24,447 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:36:24,448 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-11-30 04:36:24,448 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:36:24,489 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:36:24,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 105 transitions, 214 flow [2023-11-30 04:36:24,540 INFO L124 PetriNetUnfolderBase]: 8/118 cut-off events. [2023-11-30 04:36:24,540 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:36:24,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 118 events. 8/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 197 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 84. Up to 4 conditions per place. [2023-11-30 04:36:24,544 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 105 transitions, 214 flow [2023-11-30 04:36:24,547 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 105 transitions, 214 flow [2023-11-30 04:36:24,553 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:36:24,557 INFO L362 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@52b26598, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:36:24,557 INFO L363 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-11-30 04:36:24,561 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:36:24,561 INFO L124 PetriNetUnfolderBase]: 1/27 cut-off events. [2023-11-30 04:36:24,562 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:36:24,562 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:36:24,562 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:36:24,562 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-30 04:36:24,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:36:24,565 INFO L85 PathProgramCache]: Analyzing trace with hash -2117625798, now seen corresponding path program 1 times [2023-11-30 04:36:24,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:36:24,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653859476] [2023-11-30 04:36:24,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:36:24,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:36:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:36:24,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:36:24,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:36:24,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653859476] [2023-11-30 04:36:24,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653859476] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:36:24,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:36:24,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:36:24,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306377208] [2023-11-30 04:36:24,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:36:24,768 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:36:24,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:36:24,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:36:24,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:36:24,789 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 105 [2023-11-30 04:36:24,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 105 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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-11-30 04:36:24,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:36:24,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 105 [2023-11-30 04:36:24,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:36:24,899 INFO L124 PetriNetUnfolderBase]: 93/482 cut-off events. [2023-11-30 04:36:24,899 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:36:24,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 482 events. 93/482 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2620 event pairs, 48 based on Foata normal form. 59/399 useless extension candidates. Maximal degree in co-relation 654. Up to 111 conditions per place. [2023-11-30 04:36:24,903 INFO L140 encePairwiseOnDemand]: 94/105 looper letters, 43 selfloop transitions, 3 changer transitions 0/107 dead transitions. [2023-11-30 04:36:24,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 107 transitions, 310 flow [2023-11-30 04:36:24,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:36:24,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:36:24,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2023-11-30 04:36:24,911 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8317460317460318 [2023-11-30 04:36:24,912 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 262 transitions. [2023-11-30 04:36:24,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions. [2023-11-30 04:36:24,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:36:24,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions. [2023-11-30 04:36:24,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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-11-30 04:36:24,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 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-11-30 04:36:24,918 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 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-11-30 04:36:24,921 INFO L307 CegarLoopForPetriNet]: 101 programPoint places, -10 predicate places. [2023-11-30 04:36:24,921 INFO L500 AbstractCegarLoop]: Abstraction has has 91 places, 107 transitions, 310 flow [2023-11-30 04:36:24,921 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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-11-30 04:36:24,921 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:36:24,921 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:36:24,921 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:36:24,921 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-30 04:36:24,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:36:24,922 INFO L85 PathProgramCache]: Analyzing trace with hash -2117625797, now seen corresponding path program 1 times [2023-11-30 04:36:24,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:36:24,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132836379] [2023-11-30 04:36:24,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:36:24,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:36:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:36:25,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:36:25,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:36:25,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132836379] [2023-11-30 04:36:25,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132836379] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:36:25,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:36:25,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:36:25,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841194808] [2023-11-30 04:36:25,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:36:25,046 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:36:25,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:36:25,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:36:25,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:36:25,047 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 105 [2023-11-30 04:36:25,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 107 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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-11-30 04:36:25,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:36:25,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 105 [2023-11-30 04:36:25,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:36:25,106 INFO L124 PetriNetUnfolderBase]: 69/359 cut-off events. [2023-11-30 04:36:25,106 INFO L125 PetriNetUnfolderBase]: For 57/65 co-relation queries the response was YES. [2023-11-30 04:36:25,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 359 events. 69/359 cut-off events. For 57/65 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1599 event pairs, 40 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 620. Up to 147 conditions per place. [2023-11-30 04:36:25,111 INFO L140 encePairwiseOnDemand]: 103/105 looper letters, 36 selfloop transitions, 1 changer transitions 0/105 dead transitions. [2023-11-30 04:36:25,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 105 transitions, 376 flow [2023-11-30 04:36:25,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:36:25,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:36:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2023-11-30 04:36:25,115 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7365079365079366 [2023-11-30 04:36:25,116 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 232 transitions. [2023-11-30 04:36:25,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 232 transitions. [2023-11-30 04:36:25,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:36:25,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 232 transitions. [2023-11-30 04:36:25,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 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-11-30 04:36:25,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 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-11-30 04:36:25,119 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 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-11-30 04:36:25,120 INFO L307 CegarLoopForPetriNet]: 101 programPoint places, -9 predicate places. [2023-11-30 04:36:25,120 INFO L500 AbstractCegarLoop]: Abstraction has has 92 places, 105 transitions, 376 flow [2023-11-30 04:36:25,120 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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-11-30 04:36:25,120 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:36:25,121 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:36:25,121 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:36:25,121 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-30 04:36:25,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:36:25,122 INFO L85 PathProgramCache]: Analyzing trace with hash 2072875580, now seen corresponding path program 1 times [2023-11-30 04:36:25,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:36:25,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935200717] [2023-11-30 04:36:25,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:36:25,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:36:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:36:25,147 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:36:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:36:25,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:36:25,167 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:36:25,168 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 31 remaining) [2023-11-30 04:36:25,169 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 31 remaining) [2023-11-30 04:36:25,169 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2023-11-30 04:36:25,169 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2023-11-30 04:36:25,170 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 31 remaining) [2023-11-30 04:36:25,170 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 31 remaining) [2023-11-30 04:36:25,170 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2023-11-30 04:36:25,170 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2023-11-30 04:36:25,170 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2023-11-30 04:36:25,170 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (21 of 31 remaining) [2023-11-30 04:36:25,170 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 31 remaining) [2023-11-30 04:36:25,170 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 31 remaining) [2023-11-30 04:36:25,171 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (18 of 31 remaining) [2023-11-30 04:36:25,171 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2023-11-30 04:36:25,171 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2023-11-30 04:36:25,171 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2023-11-30 04:36:25,171 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2023-11-30 04:36:25,171 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2023-11-30 04:36:25,171 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2023-11-30 04:36:25,171 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 31 remaining) [2023-11-30 04:36:25,172 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 31 remaining) [2023-11-30 04:36:25,172 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 31 remaining) [2023-11-30 04:36:25,172 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 31 remaining) [2023-11-30 04:36:25,172 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 31 remaining) [2023-11-30 04:36:25,172 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 31 remaining) [2023-11-30 04:36:25,172 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (5 of 31 remaining) [2023-11-30 04:36:25,172 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 31 remaining) [2023-11-30 04:36:25,172 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 31 remaining) [2023-11-30 04:36:25,172 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (2 of 31 remaining) [2023-11-30 04:36:25,173 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 31 remaining) [2023-11-30 04:36:25,173 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 31 remaining) [2023-11-30 04:36:25,173 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:36:25,173 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:36:25,175 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:36:25,175 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-30 04:36:25,207 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:36:25,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 175 transitions, 360 flow [2023-11-30 04:36:25,228 INFO L124 PetriNetUnfolderBase]: 15/203 cut-off events. [2023-11-30 04:36:25,228 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 04:36:25,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 203 events. 15/203 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 594 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 153. Up to 6 conditions per place. [2023-11-30 04:36:25,230 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 175 transitions, 360 flow [2023-11-30 04:36:25,232 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 175 transitions, 360 flow [2023-11-30 04:36:25,233 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:36:25,234 INFO L362 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@52b26598, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:36:25,234 INFO L363 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2023-11-30 04:36:25,236 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:36:25,236 INFO L124 PetriNetUnfolderBase]: 1/27 cut-off events. [2023-11-30 04:36:25,236 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:36:25,236 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:36:25,236 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:36:25,236 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-30 04:36:25,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:36:25,237 INFO L85 PathProgramCache]: Analyzing trace with hash 354813001, now seen corresponding path program 1 times [2023-11-30 04:36:25,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:36:25,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439231619] [2023-11-30 04:36:25,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:36:25,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:36:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:36:25,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:36:25,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:36:25,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439231619] [2023-11-30 04:36:25,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439231619] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:36:25,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:36:25,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:36:25,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64870401] [2023-11-30 04:36:25,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:36:25,269 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:36:25,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:36:25,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:36:25,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:36:25,271 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 175 [2023-11-30 04:36:25,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 175 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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-11-30 04:36:25,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:36:25,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 175 [2023-11-30 04:36:25,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:36:26,459 INFO L124 PetriNetUnfolderBase]: 4084/12073 cut-off events. [2023-11-30 04:36:26,459 INFO L125 PetriNetUnfolderBase]: For 163/163 co-relation queries the response was YES. [2023-11-30 04:36:26,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18470 conditions, 12073 events. 4084/12073 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 131441 event pairs, 1762 based on Foata normal form. 1774/9955 useless extension candidates. Maximal degree in co-relation 14223. Up to 3464 conditions per place. [2023-11-30 04:36:26,546 INFO L140 encePairwiseOnDemand]: 158/175 looper letters, 78 selfloop transitions, 4 changer transitions 0/185 dead transitions. [2023-11-30 04:36:26,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 185 transitions, 549 flow [2023-11-30 04:36:26,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:36:26,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:36:26,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-11-30 04:36:26,550 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8495238095238096 [2023-11-30 04:36:26,550 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-11-30 04:36:26,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-11-30 04:36:26,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:36:26,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-11-30 04:36:26,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 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-11-30 04:36:26,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 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-11-30 04:36:26,565 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 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-11-30 04:36:26,566 INFO L307 CegarLoopForPetriNet]: 167 programPoint places, -16 predicate places. [2023-11-30 04:36:26,566 INFO L500 AbstractCegarLoop]: Abstraction has has 151 places, 185 transitions, 549 flow [2023-11-30 04:36:26,566 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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-11-30 04:36:26,566 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:36:26,566 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:36:26,567 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:36:26,567 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-30 04:36:26,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:36:26,567 INFO L85 PathProgramCache]: Analyzing trace with hash 354813002, now seen corresponding path program 1 times [2023-11-30 04:36:26,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:36:26,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713150828] [2023-11-30 04:36:26,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:36:26,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:36:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:36:26,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:36:26,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:36:26,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713150828] [2023-11-30 04:36:26,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713150828] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:36:26,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:36:26,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:36:26,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877038717] [2023-11-30 04:36:26,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:36:26,631 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:36:26,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:36:26,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:36:26,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:36:26,633 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 175 [2023-11-30 04:36:26,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 185 transitions, 549 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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-11-30 04:36:26,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:36:26,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 175 [2023-11-30 04:36:26,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:36:27,535 INFO L124 PetriNetUnfolderBase]: 3874/10649 cut-off events. [2023-11-30 04:36:27,536 INFO L125 PetriNetUnfolderBase]: For 2109/2490 co-relation queries the response was YES. [2023-11-30 04:36:27,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21459 conditions, 10649 events. 3874/10649 cut-off events. For 2109/2490 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 109186 event pairs, 1928 based on Foata normal form. 0/8485 useless extension candidates. Maximal degree in co-relation 17240. Up to 5225 conditions per place. [2023-11-30 04:36:27,593 INFO L140 encePairwiseOnDemand]: 173/175 looper letters, 66 selfloop transitions, 1 changer transitions 0/183 dead transitions. [2023-11-30 04:36:27,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 183 transitions, 675 flow [2023-11-30 04:36:27,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:36:27,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:36:27,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2023-11-30 04:36:27,595 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7428571428571429 [2023-11-30 04:36:27,596 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 390 transitions. [2023-11-30 04:36:27,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions. [2023-11-30 04:36:27,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:36:27,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions. [2023-11-30 04:36:27,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 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-11-30 04:36:27,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 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-11-30 04:36:27,601 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 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-11-30 04:36:27,602 INFO L307 CegarLoopForPetriNet]: 167 programPoint places, -15 predicate places. [2023-11-30 04:36:27,602 INFO L500 AbstractCegarLoop]: Abstraction has has 152 places, 183 transitions, 675 flow [2023-11-30 04:36:27,602 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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-11-30 04:36:27,602 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:36:27,603 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:36:27,603 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:36:27,603 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-30 04:36:27,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:36:27,606 INFO L85 PathProgramCache]: Analyzing trace with hash -2047825239, now seen corresponding path program 1 times [2023-11-30 04:36:27,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:36:27,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972301924] [2023-11-30 04:36:27,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:36:27,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:36:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:36:27,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:36:27,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:36:27,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972301924] [2023-11-30 04:36:27,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972301924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:36:27,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:36:27,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:36:27,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511274650] [2023-11-30 04:36:27,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:36:27,675 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:36:27,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:36:27,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:36:27,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:36:27,676 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 175 [2023-11-30 04:36:27,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 183 transitions, 675 flow. Second operand has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 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-11-30 04:36:27,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:36:27,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 175 [2023-11-30 04:36:27,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:36:28,450 INFO L124 PetriNetUnfolderBase]: 3908/10463 cut-off events. [2023-11-30 04:36:28,450 INFO L125 PetriNetUnfolderBase]: For 3203/3781 co-relation queries the response was YES. [2023-11-30 04:36:28,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23083 conditions, 10463 events. 3908/10463 cut-off events. For 3203/3781 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 106684 event pairs, 1726 based on Foata normal form. 0/8262 useless extension candidates. Maximal degree in co-relation 19902. Up to 5295 conditions per place. [2023-11-30 04:36:28,509 INFO L140 encePairwiseOnDemand]: 168/175 looper letters, 36 selfloop transitions, 3 changer transitions 0/190 dead transitions. [2023-11-30 04:36:28,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 190 transitions, 800 flow [2023-11-30 04:36:28,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:36:28,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:36:28,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2023-11-30 04:36:28,512 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8761904761904762 [2023-11-30 04:36:28,512 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2023-11-30 04:36:28,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2023-11-30 04:36:28,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:36:28,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2023-11-30 04:36:28,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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-11-30 04:36:28,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 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-11-30 04:36:28,515 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 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-11-30 04:36:28,517 INFO L307 CegarLoopForPetriNet]: 167 programPoint places, -13 predicate places. [2023-11-30 04:36:28,517 INFO L500 AbstractCegarLoop]: Abstraction has has 154 places, 190 transitions, 800 flow [2023-11-30 04:36:28,518 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 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-11-30 04:36:28,518 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:36:28,518 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:36:28,518 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:36:28,519 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-30 04:36:28,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:36:28,519 INFO L85 PathProgramCache]: Analyzing trace with hash -2047825237, now seen corresponding path program 1 times [2023-11-30 04:36:28,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:36:28,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111438630] [2023-11-30 04:36:28,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:36:28,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:36:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:36:28,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:36:28,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:36:28,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111438630] [2023-11-30 04:36:28,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111438630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:36:28,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:36:28,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:36:28,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513260509] [2023-11-30 04:36:28,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:36:28,576 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:36:28,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:36:28,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:36:28,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:36:28,578 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 175 [2023-11-30 04:36:28,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 190 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-11-30 04:36:28,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:36:28,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 175 [2023-11-30 04:36:28,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:36:29,963 INFO L124 PetriNetUnfolderBase]: 6278/16060 cut-off events. [2023-11-30 04:36:29,963 INFO L125 PetriNetUnfolderBase]: For 11054/13887 co-relation queries the response was YES. [2023-11-30 04:36:29,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44545 conditions, 16060 events. 6278/16060 cut-off events. For 11054/13887 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 174426 event pairs, 1537 based on Foata normal form. 400/13068 useless extension candidates. Maximal degree in co-relation 41268. Up to 8161 conditions per place. [2023-11-30 04:36:30,167 INFO L140 encePairwiseOnDemand]: 161/175 looper letters, 145 selfloop transitions, 16 changer transitions 0/257 dead transitions. [2023-11-30 04:36:30,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 257 transitions, 1561 flow [2023-11-30 04:36:30,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:36:30,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:36:30,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-11-30 04:36:30,168 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7980952380952381 [2023-11-30 04:36:30,168 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-11-30 04:36:30,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-11-30 04:36:30,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:36:30,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-11-30 04:36:30,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 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-11-30 04:36:30,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 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-11-30 04:36:30,171 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 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-11-30 04:36:30,171 INFO L307 CegarLoopForPetriNet]: 167 programPoint places, -11 predicate places. [2023-11-30 04:36:30,171 INFO L500 AbstractCegarLoop]: Abstraction has has 156 places, 257 transitions, 1561 flow [2023-11-30 04:36:30,171 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-11-30 04:36:30,171 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:36:30,171 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:36:30,172 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:36:30,172 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-30 04:36:30,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:36:30,172 INFO L85 PathProgramCache]: Analyzing trace with hash -2047825236, now seen corresponding path program 1 times [2023-11-30 04:36:30,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:36:30,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640283184] [2023-11-30 04:36:30,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:36:30,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:36:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:36:30,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:36:30,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:36:30,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640283184] [2023-11-30 04:36:30,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640283184] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:36:30,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:36:30,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:36:30,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162729710] [2023-11-30 04:36:30,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:36:30,228 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:36:30,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:36:30,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:36:30,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:36:30,229 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 175 [2023-11-30 04:36:30,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 257 transitions, 1561 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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-11-30 04:36:30,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:36:30,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 175 [2023-11-30 04:36:30,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:36:31,208 INFO L124 PetriNetUnfolderBase]: 4561/12177 cut-off events. [2023-11-30 04:36:31,209 INFO L125 PetriNetUnfolderBase]: For 15293/18938 co-relation queries the response was YES. [2023-11-30 04:36:31,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38410 conditions, 12177 events. 4561/12177 cut-off events. For 15293/18938 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 126859 event pairs, 1196 based on Foata normal form. 793/11382 useless extension candidates. Maximal degree in co-relation 34606. Up to 5462 conditions per place. [2023-11-30 04:36:31,280 INFO L140 encePairwiseOnDemand]: 167/175 looper letters, 154 selfloop transitions, 3 changer transitions 0/272 dead transitions. [2023-11-30 04:36:31,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 272 transitions, 2019 flow [2023-11-30 04:36:31,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:36:31,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:36:31,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2023-11-30 04:36:31,281 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7657142857142857 [2023-11-30 04:36:31,281 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2023-11-30 04:36:31,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2023-11-30 04:36:31,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:36:31,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2023-11-30 04:36:31,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 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-11-30 04:36:31,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 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-11-30 04:36:31,284 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 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-11-30 04:36:31,284 INFO L307 CegarLoopForPetriNet]: 167 programPoint places, -15 predicate places. [2023-11-30 04:36:31,284 INFO L500 AbstractCegarLoop]: Abstraction has has 152 places, 272 transitions, 2019 flow [2023-11-30 04:36:31,284 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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-11-30 04:36:31,284 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:36:31,284 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:36:31,284 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:36:31,285 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-30 04:36:31,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:36:31,285 INFO L85 PathProgramCache]: Analyzing trace with hash -136055252, now seen corresponding path program 1 times [2023-11-30 04:36:31,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:36:31,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294549672] [2023-11-30 04:36:31,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:36:31,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:36:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:36:31,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:36:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:36:31,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:36:31,301 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:36:31,301 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 45 remaining) [2023-11-30 04:36:31,302 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 45 remaining) [2023-11-30 04:36:31,302 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 45 remaining) [2023-11-30 04:36:31,302 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 45 remaining) [2023-11-30 04:36:31,302 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 45 remaining) [2023-11-30 04:36:31,302 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 45 remaining) [2023-11-30 04:36:31,302 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 45 remaining) [2023-11-30 04:36:31,303 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 45 remaining) [2023-11-30 04:36:31,303 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 45 remaining) [2023-11-30 04:36:31,303 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (35 of 45 remaining) [2023-11-30 04:36:31,303 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 45 remaining) [2023-11-30 04:36:31,303 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 45 remaining) [2023-11-30 04:36:31,303 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (32 of 45 remaining) [2023-11-30 04:36:31,303 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 45 remaining) [2023-11-30 04:36:31,303 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 45 remaining) [2023-11-30 04:36:31,303 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 45 remaining) [2023-11-30 04:36:31,303 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 45 remaining) [2023-11-30 04:36:31,303 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 45 remaining) [2023-11-30 04:36:31,304 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 45 remaining) [2023-11-30 04:36:31,304 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 45 remaining) [2023-11-30 04:36:31,304 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 45 remaining) [2023-11-30 04:36:31,304 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 45 remaining) [2023-11-30 04:36:31,304 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 45 remaining) [2023-11-30 04:36:31,304 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 45 remaining) [2023-11-30 04:36:31,304 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 45 remaining) [2023-11-30 04:36:31,304 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (19 of 45 remaining) [2023-11-30 04:36:31,304 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 45 remaining) [2023-11-30 04:36:31,304 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 45 remaining) [2023-11-30 04:36:31,304 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (16 of 45 remaining) [2023-11-30 04:36:31,305 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 45 remaining) [2023-11-30 04:36:31,305 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 45 remaining) [2023-11-30 04:36:31,305 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 45 remaining) [2023-11-30 04:36:31,305 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 45 remaining) [2023-11-30 04:36:31,305 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 45 remaining) [2023-11-30 04:36:31,305 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 45 remaining) [2023-11-30 04:36:31,305 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 45 remaining) [2023-11-30 04:36:31,305 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 45 remaining) [2023-11-30 04:36:31,305 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 45 remaining) [2023-11-30 04:36:31,305 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 45 remaining) [2023-11-30 04:36:31,305 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (5 of 45 remaining) [2023-11-30 04:36:31,305 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 45 remaining) [2023-11-30 04:36:31,306 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 45 remaining) [2023-11-30 04:36:31,306 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (2 of 45 remaining) [2023-11-30 04:36:31,306 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 45 remaining) [2023-11-30 04:36:31,306 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 45 remaining) [2023-11-30 04:36:31,306 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 04:36:31,306 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-30 04:36:31,306 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:36:31,307 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-30 04:36:31,355 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:36:31,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 245 transitions, 508 flow [2023-11-30 04:36:31,391 INFO L124 PetriNetUnfolderBase]: 22/288 cut-off events. [2023-11-30 04:36:31,391 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-30 04:36:31,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 288 events. 22/288 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1058 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 222. Up to 8 conditions per place. [2023-11-30 04:36:31,394 INFO L82 GeneralOperation]: Start removeDead. Operand has 233 places, 245 transitions, 508 flow [2023-11-30 04:36:31,396 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 245 transitions, 508 flow [2023-11-30 04:36:31,397 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:36:31,399 INFO L362 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@52b26598, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:36:31,399 INFO L363 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2023-11-30 04:36:31,400 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:36:31,400 INFO L124 PetriNetUnfolderBase]: 1/27 cut-off events. [2023-11-30 04:36:31,400 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:36:31,400 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:36:31,401 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:36:31,401 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:36:31,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:36:31,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1239246942, now seen corresponding path program 1 times [2023-11-30 04:36:31,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:36:31,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600434854] [2023-11-30 04:36:31,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:36:31,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:36:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:36:31,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:36:31,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:36:31,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600434854] [2023-11-30 04:36:31,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600434854] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:36:31,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:36:31,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:36:31,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200226989] [2023-11-30 04:36:31,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:36:31,441 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:36:31,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:36:31,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:36:31,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:36:31,442 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 245 [2023-11-30 04:36:31,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 245 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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-11-30 04:36:31,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:36:31,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 245 [2023-11-30 04:36:31,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:36:54,723 INFO L124 PetriNetUnfolderBase]: 116156/269525 cut-off events. [2023-11-30 04:36:54,724 INFO L125 PetriNetUnfolderBase]: For 7619/7619 co-relation queries the response was YES. [2023-11-30 04:36:55,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428183 conditions, 269525 events. 116156/269525 cut-off events. For 7619/7619 co-relation queries the response was YES. Maximal size of possible extension queue 8106. Compared 3864083 event pairs, 47645 based on Foata normal form. 43663/222983 useless extension candidates. Maximal degree in co-relation 137636. Up to 88265 conditions per place. [2023-11-30 04:36:57,384 INFO L140 encePairwiseOnDemand]: 222/245 looper letters, 113 selfloop transitions, 5 changer transitions 0/263 dead transitions. [2023-11-30 04:36:57,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 263 transitions, 792 flow [2023-11-30 04:36:57,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:36:57,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:36:57,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 630 transitions. [2023-11-30 04:36:57,386 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2023-11-30 04:36:57,386 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 630 transitions. [2023-11-30 04:36:57,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 630 transitions. [2023-11-30 04:36:57,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:36:57,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 630 transitions. [2023-11-30 04:36:57,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 210.0) internal successors, (630), 3 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-11-30 04:36:57,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 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-11-30 04:36:57,389 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 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-11-30 04:36:57,389 INFO L307 CegarLoopForPetriNet]: 233 programPoint places, -22 predicate places. [2023-11-30 04:36:57,389 INFO L500 AbstractCegarLoop]: Abstraction has has 211 places, 263 transitions, 792 flow [2023-11-30 04:36:57,390 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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-11-30 04:36:57,390 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:36:57,390 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:36:57,390 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 04:36:57,390 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:36:57,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:36:57,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1239246943, now seen corresponding path program 1 times [2023-11-30 04:36:57,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:36:57,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863771965] [2023-11-30 04:36:57,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:36:57,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:36:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:36:57,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:36:57,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:36:57,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863771965] [2023-11-30 04:36:57,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863771965] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:36:57,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:36:57,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:36:57,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632116713] [2023-11-30 04:36:57,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:36:57,421 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:36:57,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:36:57,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:36:57,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:36:57,422 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 245 [2023-11-30 04:36:57,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 263 transitions, 792 flow. Second operand has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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-11-30 04:36:57,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:36:57,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 245 [2023-11-30 04:36:57,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:37:06,616 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_3| 0) (= (store |v_#length_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 0)) (< |v_#StackHeapBarrier_1| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|) (= |v_#valid_1| (store |v_#valid_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_3|} AuxVars[] AssignedVars[#valid, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread1of3ForFork0_push_~#newTop~0#1.base][152], [124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 236#true, 122#L719-5true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 50#L699-2true, 97#L699-4true]) [2023-11-30 04:37:06,616 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2023-11-30 04:37:06,616 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-30 04:37:06,630 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-30 04:37:06,630 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-30 04:37:08,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_3| 0) (= (store |v_#length_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 0)) (< |v_#StackHeapBarrier_1| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|) (= |v_#valid_1| (store |v_#valid_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_3|} AuxVars[] AssignedVars[#valid, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread1of3ForFork0_push_~#newTop~0#1.base][152], [236#true, thr1Thread1of3ForFork0InUse, 73#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 122#L719-5true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 50#L699-2true, 97#L699-4true]) [2023-11-30 04:37:08,540 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-30 04:37:08,540 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-30 04:37:08,540 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-30 04:37:08,540 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-30 04:37:09,895 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_3| 0) (= (store |v_#length_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 0)) (< |v_#StackHeapBarrier_1| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|) (= |v_#valid_1| (store |v_#valid_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_3|} AuxVars[] AssignedVars[#valid, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread1of3ForFork0_push_~#newTop~0#1.base][152], [124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 236#true, thr1Thread1of3ForFork0InUse, 78#L719-4true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 50#L699-2true, 97#L699-4true]) [2023-11-30 04:37:09,895 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-30 04:37:09,895 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-30 04:37:09,895 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-30 04:37:09,895 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-30 04:37:10,091 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][151], [124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 236#true, 122#L719-5true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 168#L699-2true, 19#L699-4true]) [2023-11-30 04:37:10,091 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2023-11-30 04:37:10,091 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-30 04:37:10,091 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-30 04:37:10,092 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-30 04:37:11,732 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_3| 0) (= (store |v_#length_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 0)) (< |v_#StackHeapBarrier_1| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|) (= |v_#valid_1| (store |v_#valid_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_3|} AuxVars[] AssignedVars[#valid, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread1of3ForFork0_push_~#newTop~0#1.base][152], [236#true, thr1Thread1of3ForFork0InUse, 78#L719-4true, 73#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 50#L699-2true, 97#L699-4true]) [2023-11-30 04:37:11,732 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-30 04:37:11,732 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-30 04:37:11,732 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-30 04:37:11,732 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-30 04:37:11,906 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][151], [thr1Thread1of3ForFork0InUse, 236#true, 122#L719-5true, 73#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 168#L699-2true, 19#L699-4true]) [2023-11-30 04:37:11,906 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-30 04:37:11,906 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-30 04:37:11,906 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-30 04:37:11,906 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-30 04:37:12,666 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_3| 0) (= (store |v_#length_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 0)) (< |v_#StackHeapBarrier_1| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|) (= |v_#valid_1| (store |v_#valid_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_3|} AuxVars[] AssignedVars[#valid, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread1of3ForFork0_push_~#newTop~0#1.base][152], [thr1Thread1of3ForFork0InUse, 236#true, 122#L719-5true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 50#L699-2true, 97#L699-4true, 105#thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:37:12,667 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-30 04:37:12,667 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-30 04:37:12,667 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-30 04:37:12,667 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-30 04:37:13,182 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][151], [124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 236#true, 78#L719-4true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 168#L699-2true, 19#L699-4true]) [2023-11-30 04:37:13,183 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-30 04:37:13,183 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-30 04:37:13,183 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-30 04:37:13,183 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-30 04:37:15,081 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][151], [thr1Thread1of3ForFork0InUse, 236#true, 78#L719-4true, 73#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 168#L699-2true, 19#L699-4true]) [2023-11-30 04:37:15,082 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-30 04:37:15,082 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-30 04:37:15,082 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-30 04:37:15,082 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-30 04:37:15,518 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_3| 0) (= (store |v_#length_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 0)) (< |v_#StackHeapBarrier_1| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|) (= |v_#valid_1| (store |v_#valid_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_3|} AuxVars[] AssignedVars[#valid, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread1of3ForFork0_push_~#newTop~0#1.base][152], [236#true, thr1Thread1of3ForFork0InUse, 78#L719-4true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 50#L699-2true, 105#thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 97#L699-4true]) [2023-11-30 04:37:15,518 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2023-11-30 04:37:15,519 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-30 04:37:15,519 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-30 04:37:15,519 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-30 04:37:22,300 INFO L124 PetriNetUnfolderBase]: 136003/288556 cut-off events. [2023-11-30 04:37:22,300 INFO L125 PetriNetUnfolderBase]: For 67916/80443 co-relation queries the response was YES. [2023-11-30 04:37:23,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613526 conditions, 288556 events. 136003/288556 cut-off events. For 67916/80443 co-relation queries the response was YES. Maximal size of possible extension queue 8641. Compared 3915442 event pairs, 65154 based on Foata normal form. 0/228135 useless extension candidates. Maximal degree in co-relation 227054. Up to 157420 conditions per place. [2023-11-30 04:37:25,646 INFO L140 encePairwiseOnDemand]: 243/245 looper letters, 96 selfloop transitions, 1 changer transitions 0/261 dead transitions. [2023-11-30 04:37:25,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 261 transitions, 978 flow [2023-11-30 04:37:25,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:37:25,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:37:25,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 548 transitions. [2023-11-30 04:37:25,648 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.745578231292517 [2023-11-30 04:37:25,648 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 548 transitions. [2023-11-30 04:37:25,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 548 transitions. [2023-11-30 04:37:25,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:37:25,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 548 transitions. [2023-11-30 04:37:25,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 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-11-30 04:37:25,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 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-11-30 04:37:25,650 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 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-11-30 04:37:25,651 INFO L307 CegarLoopForPetriNet]: 233 programPoint places, -21 predicate places. [2023-11-30 04:37:25,651 INFO L500 AbstractCegarLoop]: Abstraction has has 212 places, 261 transitions, 978 flow [2023-11-30 04:37:25,651 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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-11-30 04:37:25,651 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:37:25,651 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:37:25,651 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 04:37:25,651 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:37:25,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:37:25,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1357528825, now seen corresponding path program 1 times [2023-11-30 04:37:25,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:37:25,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770603426] [2023-11-30 04:37:25,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:37:25,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:37:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:37:25,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:37:25,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:37:25,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770603426] [2023-11-30 04:37:25,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770603426] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:37:25,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:37:25,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:37:25,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631580716] [2023-11-30 04:37:25,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:37:25,674 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:37:25,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:37:25,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:37:25,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:37:25,675 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 245 [2023-11-30 04:37:25,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 261 transitions, 978 flow. Second operand has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 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-11-30 04:37:25,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:37:25,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 245 [2023-11-30 04:37:25,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:37:34,427 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_3| 0) (= (store |v_#length_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 0)) (< |v_#StackHeapBarrier_1| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|) (= |v_#valid_1| (store |v_#valid_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_3|} AuxVars[] AssignedVars[#valid, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread1of3ForFork0_push_~#newTop~0#1.base][158], [124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 236#true, 122#L719-5true, thr1Thread2of3ForFork0InUse, 244#true, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 50#L699-2true, 97#L699-4true]) [2023-11-30 04:37:34,427 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2023-11-30 04:37:34,428 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-30 04:37:34,428 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-30 04:37:34,428 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-30 04:37:35,997 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_3| 0) (= (store |v_#length_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 0)) (< |v_#StackHeapBarrier_1| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|) (= |v_#valid_1| (store |v_#valid_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_3|} AuxVars[] AssignedVars[#valid, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread1of3ForFork0_push_~#newTop~0#1.base][158], [236#true, thr1Thread1of3ForFork0InUse, 73#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 122#L719-5true, thr1Thread2of3ForFork0InUse, 244#true, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 50#L699-2true, 97#L699-4true]) [2023-11-30 04:37:35,998 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-30 04:37:35,998 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-30 04:37:35,998 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-30 04:37:35,998 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-30 04:37:37,568 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_3| 0) (= (store |v_#length_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 0)) (< |v_#StackHeapBarrier_1| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|) (= |v_#valid_1| (store |v_#valid_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_3|} AuxVars[] AssignedVars[#valid, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread1of3ForFork0_push_~#newTop~0#1.base][158], [124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 236#true, thr1Thread1of3ForFork0InUse, 78#L719-4true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 244#true, thr1Thread3of3ForFork0InUse, 50#L699-2true, 97#L699-4true]) [2023-11-30 04:37:37,569 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-30 04:37:37,569 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-30 04:37:37,569 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-30 04:37:37,569 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-30 04:37:37,771 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][157], [124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 236#true, thr1Thread1of3ForFork0InUse, 122#L719-5true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 244#true, thr1Thread3of3ForFork0InUse, 168#L699-2true, 19#L699-4true]) [2023-11-30 04:37:37,771 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2023-11-30 04:37:37,771 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-30 04:37:37,771 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-30 04:37:37,771 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-30 04:37:39,249 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_3| 0) (= (store |v_#length_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 0)) (< |v_#StackHeapBarrier_1| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|) (= |v_#valid_1| (store |v_#valid_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_3|} AuxVars[] AssignedVars[#valid, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread1of3ForFork0_push_~#newTop~0#1.base][158], [236#true, thr1Thread1of3ForFork0InUse, 73#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 78#L719-4true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 244#true, thr1Thread3of3ForFork0InUse, 50#L699-2true, 97#L699-4true]) [2023-11-30 04:37:39,249 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-30 04:37:39,250 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-30 04:37:39,250 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-30 04:37:39,250 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-30 04:37:39,685 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][157], [thr1Thread1of3ForFork0InUse, 236#true, 73#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 122#L719-5true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 244#true, 168#L699-2true, thr1Thread3of3ForFork0InUse, 19#L699-4true]) [2023-11-30 04:37:39,686 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-30 04:37:39,686 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-30 04:37:39,686 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-30 04:37:39,686 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-30 04:37:40,231 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_3| 0) (= (store |v_#length_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 0)) (< |v_#StackHeapBarrier_1| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|) (= |v_#valid_1| (store |v_#valid_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_3|} AuxVars[] AssignedVars[#valid, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread1of3ForFork0_push_~#newTop~0#1.base][158], [thr1Thread1of3ForFork0InUse, 236#true, 122#L719-5true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 244#true, thr1Thread3of3ForFork0InUse, 50#L699-2true, 105#thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 97#L699-4true]) [2023-11-30 04:37:40,232 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-30 04:37:40,232 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-30 04:37:40,232 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-30 04:37:40,232 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-30 04:37:41,032 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][157], [124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 236#true, 78#L719-4true, thr1Thread2of3ForFork0InUse, 244#true, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 168#L699-2true, 19#L699-4true]) [2023-11-30 04:37:41,032 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-30 04:37:41,032 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-30 04:37:41,032 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-30 04:37:41,032 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-30 04:37:42,684 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][157], [thr1Thread1of3ForFork0InUse, 236#true, 73#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 78#L719-4true, thr1Thread2of3ForFork0InUse, 244#true, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 168#L699-2true, 19#L699-4true]) [2023-11-30 04:37:42,684 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-30 04:37:42,684 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-30 04:37:42,684 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-30 04:37:42,684 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-30 04:37:43,427 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_3| 0) (= (store |v_#length_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 0)) (< |v_#StackHeapBarrier_1| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|) (= |v_#valid_1| (store |v_#valid_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_3|} AuxVars[] AssignedVars[#valid, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread1of3ForFork0_push_~#newTop~0#1.base][158], [thr1Thread1of3ForFork0InUse, 236#true, 78#L719-4true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 244#true, thr1Thread3of3ForFork0InUse, 50#L699-2true, 97#L699-4true, 105#thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:37:43,427 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2023-11-30 04:37:43,427 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-30 04:37:43,427 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-30 04:37:43,427 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-30 04:37:50,600 INFO L124 PetriNetUnfolderBase]: 136284/282546 cut-off events. [2023-11-30 04:37:50,600 INFO L125 PetriNetUnfolderBase]: For 98334/116780 co-relation queries the response was YES. [2023-11-30 04:37:51,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 662061 conditions, 282546 events. 136284/282546 cut-off events. For 98334/116780 co-relation queries the response was YES. Maximal size of possible extension queue 8670. Compared 3792129 event pairs, 57172 based on Foata normal form. 0/221966 useless extension candidates. Maximal degree in co-relation 501849. Up to 157682 conditions per place. [2023-11-30 04:37:53,643 INFO L140 encePairwiseOnDemand]: 235/245 looper letters, 55 selfloop transitions, 4 changer transitions 0/272 dead transitions. [2023-11-30 04:37:53,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 272 transitions, 1174 flow [2023-11-30 04:37:53,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:37:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:37:53,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 642 transitions. [2023-11-30 04:37:53,645 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8734693877551021 [2023-11-30 04:37:53,645 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 642 transitions. [2023-11-30 04:37:53,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 642 transitions. [2023-11-30 04:37:53,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:37:53,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 642 transitions. [2023-11-30 04:37:53,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 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-11-30 04:37:53,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 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-11-30 04:37:53,648 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 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-11-30 04:37:53,648 INFO L307 CegarLoopForPetriNet]: 233 programPoint places, -19 predicate places. [2023-11-30 04:37:53,648 INFO L500 AbstractCegarLoop]: Abstraction has has 214 places, 272 transitions, 1174 flow [2023-11-30 04:37:53,648 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 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-11-30 04:37:53,649 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:37:53,649 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:37:53,649 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 04:37:53,649 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:37:53,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:37:53,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1357528827, now seen corresponding path program 1 times [2023-11-30 04:37:53,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:37:53,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811103539] [2023-11-30 04:37:53,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:37:53,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:37:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:37:53,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:37:53,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:37:53,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811103539] [2023-11-30 04:37:53,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811103539] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:37:53,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:37:53,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:37:53,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980767434] [2023-11-30 04:37:53,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:37:53,678 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:37:53,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:37:53,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:37:53,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:37:53,678 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 245 [2023-11-30 04:37:53,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 272 transitions, 1174 flow. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 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-11-30 04:37:53,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:37:53,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 245 [2023-11-30 04:37:53,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:38:02,600 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][164], [248#true, 124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 236#true, thr1Thread2of3ForFork0InUse, 67#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 244#true, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 168#L699-2true, 144#thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:38:02,601 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-30 04:38:02,601 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-30 04:38:02,601 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-30 04:38:02,601 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-30 04:38:05,174 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][164], [248#true, 124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 236#true, thr1Thread2of3ForFork0InUse, 67#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 244#true, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 168#L699-2true, 215#thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:38:05,175 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2023-11-30 04:38:05,175 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-30 04:38:05,175 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-30 04:38:05,175 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-30 04:38:12,140 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][55], [248#true, 124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 78#L719-4true, thr1Thread2of3ForFork0InUse, 21#L713-4true, 244#true, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 168#L699-2true, 238#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1)]) [2023-11-30 04:38:12,140 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2023-11-30 04:38:12,140 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-30 04:38:12,140 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-30 04:38:12,140 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-30 04:38:12,141 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][55], [248#true, 124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 78#L719-4true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 244#true, thr1Thread3of3ForFork0InUse, 168#L699-2true, 238#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 158#L698-1true]) [2023-11-30 04:38:12,141 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2023-11-30 04:38:12,141 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-30 04:38:12,141 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-30 04:38:12,141 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-30 04:38:12,141 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][164], [248#true, 124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 236#true, thr1Thread2of3ForFork0InUse, 67#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 21#L713-4true, 244#true, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 168#L699-2true]) [2023-11-30 04:38:12,141 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2023-11-30 04:38:12,141 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-30 04:38:12,141 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-30 04:38:12,141 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-30 04:38:12,142 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][164], [248#true, 124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 236#true, thr1Thread2of3ForFork0InUse, 67#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 244#true, thr1Thread3of3ForFork0InUse, 168#L699-2true, 158#L698-1true]) [2023-11-30 04:38:12,142 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2023-11-30 04:38:12,142 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-30 04:38:12,142 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-30 04:38:12,142 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-30 04:38:14,007 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][164], [248#true, 124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 236#true, 122#L719-5true, thr1Thread2of3ForFork0InUse, 244#true, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 168#L699-2true, 19#L699-4true]) [2023-11-30 04:38:14,007 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2023-11-30 04:38:14,007 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-30 04:38:14,007 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-30 04:38:14,007 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-30 04:38:15,513 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][164], [248#true, thr1Thread1of3ForFork0InUse, 236#true, 73#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 67#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 244#true, thr1Thread3of3ForFork0InUse, 168#L699-2true, 158#L698-1true]) [2023-11-30 04:38:15,513 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-30 04:38:15,513 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-30 04:38:15,513 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-30 04:38:15,513 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-30 04:38:15,869 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][164], [34#thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 248#true, 124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 236#true, thr1Thread2of3ForFork0InUse, 67#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 244#true, thr1Thread3of3ForFork0InUse, 168#L699-2true]) [2023-11-30 04:38:15,869 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2023-11-30 04:38:15,869 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-30 04:38:15,869 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-30 04:38:15,869 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-30 04:38:15,897 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][164], [248#true, 124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 236#true, 122#L719-5true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 244#true, thr1Thread3of3ForFork0InUse, 168#L699-2true, 158#L698-1true]) [2023-11-30 04:38:15,897 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2023-11-30 04:38:15,897 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-30 04:38:15,897 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-30 04:38:15,898 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-30 04:38:17,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][164], [248#true, thr1Thread1of3ForFork0InUse, 236#true, 73#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 67#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 244#true, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 21#L713-4true, thr1Thread3of3ForFork0InUse, 168#L699-2true]) [2023-11-30 04:38:17,669 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2023-11-30 04:38:17,669 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-30 04:38:17,669 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-30 04:38:17,670 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-30 04:38:18,023 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][164], [248#true, 124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 236#true, 122#L719-5true, thr1Thread2of3ForFork0InUse, 21#L713-4true, 244#true, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 168#L699-2true]) [2023-11-30 04:38:18,024 INFO L294 olderBase$Statistics]: this new event has 98 ancestors and is cut-off event [2023-11-30 04:38:18,024 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-30 04:38:18,024 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-30 04:38:18,024 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-30 04:38:20,202 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][164], [248#true, thr1Thread1of3ForFork0InUse, 236#true, 73#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 122#L719-5true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 244#true, thr1Thread3of3ForFork0InUse, 168#L699-2true, 19#L699-4true]) [2023-11-30 04:38:20,202 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-30 04:38:20,202 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-30 04:38:20,202 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-30 04:38:20,202 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-30 04:38:21,529 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][164], [34#thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 248#true, 236#true, thr1Thread1of3ForFork0InUse, 73#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 67#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 244#true, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 168#L699-2true]) [2023-11-30 04:38:21,529 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-30 04:38:21,530 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-30 04:38:21,530 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-30 04:38:21,530 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-30 04:38:22,086 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][164], [248#true, thr1Thread1of3ForFork0InUse, 236#true, 73#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 122#L719-5true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 244#true, thr1Thread3of3ForFork0InUse, 168#L699-2true, 158#L698-1true]) [2023-11-30 04:38:22,087 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2023-11-30 04:38:22,087 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-30 04:38:22,087 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-30 04:38:22,087 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-30 04:38:24,184 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][164], [30#thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 248#true, 124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 236#true, 67#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 244#true, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 168#L699-2true]) [2023-11-30 04:38:24,184 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2023-11-30 04:38:24,184 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-30 04:38:24,184 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-30 04:38:24,184 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-30 04:38:24,234 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][164], [248#true, thr1Thread1of3ForFork0InUse, 236#true, 73#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 122#L719-5true, thr1Thread2of3ForFork0InUse, 21#L713-4true, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 244#true, thr1Thread3of3ForFork0InUse, 168#L699-2true]) [2023-11-30 04:38:24,234 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2023-11-30 04:38:24,234 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-11-30 04:38:24,234 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-30 04:38:24,234 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-30 04:38:24,615 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][164], [248#true, 124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 236#true, 78#L719-4true, thr1Thread2of3ForFork0InUse, 244#true, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 168#L699-2true, 19#L699-4true]) [2023-11-30 04:38:24,615 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-30 04:38:24,615 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-30 04:38:24,615 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-30 04:38:24,615 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-30 04:38:26,305 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][164], [248#true, 124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 236#true, 78#L719-4true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 244#true, thr1Thread3of3ForFork0InUse, 168#L699-2true, 158#L698-1true]) [2023-11-30 04:38:26,305 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2023-11-30 04:38:26,305 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-30 04:38:26,305 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-30 04:38:26,305 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-30 04:38:27,337 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][164], [248#true, 124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 236#true, 122#L719-5true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 244#true, thr1Thread3of3ForFork0InUse, 64#L698true, 168#L699-2true]) [2023-11-30 04:38:27,338 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2023-11-30 04:38:27,338 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-30 04:38:27,338 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-30 04:38:27,338 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-30 04:38:27,944 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][164], [248#true, 124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 236#true, 78#L719-4true, thr1Thread2of3ForFork0InUse, 244#true, 21#L713-4true, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 168#L699-2true]) [2023-11-30 04:38:27,944 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2023-11-30 04:38:27,944 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-30 04:38:27,944 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-30 04:38:27,944 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-30 04:38:28,683 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][164], [30#thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 248#true, 236#true, thr1Thread1of3ForFork0InUse, 73#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 67#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 244#true, 168#L699-2true, thr1Thread3of3ForFork0InUse]) [2023-11-30 04:38:28,683 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-30 04:38:28,683 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-30 04:38:28,684 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-30 04:38:28,684 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-30 04:38:29,350 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][164], [248#true, thr1Thread1of3ForFork0InUse, 236#true, 78#L719-4true, 73#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 244#true, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 168#L699-2true, 19#L699-4true]) [2023-11-30 04:38:29,350 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-30 04:38:29,350 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-30 04:38:29,350 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-30 04:38:29,350 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-30 04:38:30,647 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][164], [248#true, 236#true, thr1Thread1of3ForFork0InUse, 78#L719-4true, 73#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 244#true, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 168#L699-2true, 158#L698-1true]) [2023-11-30 04:38:30,648 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-30 04:38:30,649 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-30 04:38:30,649 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-30 04:38:30,649 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-30 04:38:31,504 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][164], [248#true, thr1Thread1of3ForFork0InUse, 236#true, 73#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 122#L719-5true, thr1Thread2of3ForFork0InUse, 244#true, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 168#L699-2true, 64#L698true]) [2023-11-30 04:38:31,504 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-30 04:38:31,504 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-30 04:38:31,504 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-30 04:38:31,504 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-30 04:38:31,912 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][164], [248#true, thr1Thread1of3ForFork0InUse, 236#true, 78#L719-4true, 73#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 244#true, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 21#L713-4true, thr1Thread3of3ForFork0InUse, 168#L699-2true]) [2023-11-30 04:38:31,913 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2023-11-30 04:38:31,913 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-30 04:38:31,913 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-30 04:38:31,913 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-30 04:38:34,993 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][164], [248#true, 124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 236#true, 78#L719-4true, thr1Thread2of3ForFork0InUse, 244#true, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 64#L698true, 168#L699-2true]) [2023-11-30 04:38:34,993 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-30 04:38:34,993 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-30 04:38:34,993 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-30 04:38:34,993 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-30 04:38:38,598 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][164], [248#true, thr1Thread1of3ForFork0InUse, 236#true, 78#L719-4true, 73#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 244#true, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 168#L699-2true, 64#L698true]) [2023-11-30 04:38:38,598 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2023-11-30 04:38:38,599 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-30 04:38:38,599 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-30 04:38:38,599 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-30 04:38:50,930 INFO L124 PetriNetUnfolderBase]: 257066/510131 cut-off events. [2023-11-30 04:38:50,931 INFO L125 PetriNetUnfolderBase]: For 374529/470395 co-relation queries the response was YES. [2023-11-30 04:38:53,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1518653 conditions, 510131 events. 257066/510131 cut-off events. For 374529/470395 co-relation queries the response was YES. Maximal size of possible extension queue 16132. Compared 7073428 event pairs, 67843 based on Foata normal form. 8630/410779 useless extension candidates. Maximal degree in co-relation 1137610. Up to 286946 conditions per place. [2023-11-30 04:38:57,929 INFO L140 encePairwiseOnDemand]: 230/245 looper letters, 223 selfloop transitions, 18 changer transitions 0/379 dead transitions. [2023-11-30 04:38:57,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 379 transitions, 2376 flow [2023-11-30 04:38:57,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:38:57,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:38:57,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 593 transitions. [2023-11-30 04:38:57,936 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8068027210884354 [2023-11-30 04:38:57,936 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 593 transitions. [2023-11-30 04:38:57,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 593 transitions. [2023-11-30 04:38:57,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:38:57,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 593 transitions. [2023-11-30 04:38:57,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 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-11-30 04:38:57,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 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-11-30 04:38:57,939 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 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-11-30 04:38:57,940 INFO L307 CegarLoopForPetriNet]: 233 programPoint places, -17 predicate places. [2023-11-30 04:38:57,941 INFO L500 AbstractCegarLoop]: Abstraction has has 216 places, 379 transitions, 2376 flow [2023-11-30 04:38:57,941 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 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-11-30 04:38:57,941 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:38:57,941 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:38:57,941 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 04:38:57,941 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:38:57,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:38:57,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1357528828, now seen corresponding path program 1 times [2023-11-30 04:38:57,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:38:57,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573302681] [2023-11-30 04:38:57,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:38:57,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:38:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:38:57,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:38:57,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:38:57,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573302681] [2023-11-30 04:38:57,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573302681] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:38:57,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:38:57,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:38:57,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165701413] [2023-11-30 04:38:57,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:38:57,994 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:38:57,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:38:57,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:38:57,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:38:57,995 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 245 [2023-11-30 04:38:57,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 379 transitions, 2376 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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-11-30 04:38:57,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:38:57,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 245 [2023-11-30 04:38:57,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:39:22,801 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L713-3-->L698: Formula: true InVars {} OutVars{thr1Thread1of3ForFork0_push_~d#1=|v_thr1Thread1of3ForFork0_push_~d#1_1|, thr1Thread1of3ForFork0_push_#t~mem2#1=|v_thr1Thread1of3ForFork0_push_#t~mem2#1_1|, thr1Thread1of3ForFork0_push_#t~mem1#1=|v_thr1Thread1of3ForFork0_push_#t~mem1#1_1|, thr1Thread1of3ForFork0_push_~oldTop~0#1=|v_thr1Thread1of3ForFork0_push_~oldTop~0#1_1|, thr1Thread1of3ForFork0_push_#t~nondet3#1=|v_thr1Thread1of3ForFork0_push_#t~nondet3#1_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_1|, thr1Thread1of3ForFork0_push_#t~mem4#1=|v_thr1Thread1of3ForFork0_push_#t~mem4#1_1|, thr1Thread1of3ForFork0_push_#t~nondet6#1=|v_thr1Thread1of3ForFork0_push_#t~nondet6#1_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_1|, thr1Thread1of3ForFork0_push_#t~mem5#1=|v_thr1Thread1of3ForFork0_push_#t~mem5#1_1|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_push_~d#1, thr1Thread1of3ForFork0_push_#t~mem2#1, thr1Thread1of3ForFork0_push_#t~mem1#1, thr1Thread1of3ForFork0_push_~oldTop~0#1, thr1Thread1of3ForFork0_push_#t~nondet3#1, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset, thr1Thread1of3ForFork0_push_#t~mem4#1, thr1Thread1of3ForFork0_push_#t~nondet6#1, thr1Thread1of3ForFork0_push_~#newTop~0#1.base, thr1Thread1of3ForFork0_push_#t~mem5#1][29], [248#true, 236#true, thr1Thread1of3ForFork0InUse, 122#L719-5true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 244#true, thr1Thread3of3ForFork0InUse, 64#L698true, 97#L699-4true, 105#thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 252#true]) [2023-11-30 04:39:22,802 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2023-11-30 04:39:22,802 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-30 04:39:22,802 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-30 04:39:22,802 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-30 04:39:32,066 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L713-3-->L698: Formula: true InVars {} OutVars{thr1Thread1of3ForFork0_push_~d#1=|v_thr1Thread1of3ForFork0_push_~d#1_1|, thr1Thread1of3ForFork0_push_#t~mem2#1=|v_thr1Thread1of3ForFork0_push_#t~mem2#1_1|, thr1Thread1of3ForFork0_push_#t~mem1#1=|v_thr1Thread1of3ForFork0_push_#t~mem1#1_1|, thr1Thread1of3ForFork0_push_~oldTop~0#1=|v_thr1Thread1of3ForFork0_push_~oldTop~0#1_1|, thr1Thread1of3ForFork0_push_#t~nondet3#1=|v_thr1Thread1of3ForFork0_push_#t~nondet3#1_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_1|, thr1Thread1of3ForFork0_push_#t~mem4#1=|v_thr1Thread1of3ForFork0_push_#t~mem4#1_1|, thr1Thread1of3ForFork0_push_#t~nondet6#1=|v_thr1Thread1of3ForFork0_push_#t~nondet6#1_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_1|, thr1Thread1of3ForFork0_push_#t~mem5#1=|v_thr1Thread1of3ForFork0_push_#t~mem5#1_1|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_push_~d#1, thr1Thread1of3ForFork0_push_#t~mem2#1, thr1Thread1of3ForFork0_push_#t~mem1#1, thr1Thread1of3ForFork0_push_~oldTop~0#1, thr1Thread1of3ForFork0_push_#t~nondet3#1, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset, thr1Thread1of3ForFork0_push_#t~mem4#1, thr1Thread1of3ForFork0_push_#t~nondet6#1, thr1Thread1of3ForFork0_push_~#newTop~0#1.base, thr1Thread1of3ForFork0_push_#t~mem5#1][29], [248#true, 236#true, thr1Thread1of3ForFork0InUse, 78#L719-4true, thr1Thread2of3ForFork0InUse, 244#true, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 64#L698true, 105#thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 252#true, 97#L699-4true]) [2023-11-30 04:39:32,066 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-30 04:39:32,066 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-30 04:39:32,066 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-30 04:39:32,066 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-30 04:39:47,512 INFO L124 PetriNetUnfolderBase]: 185426/368763 cut-off events. [2023-11-30 04:39:47,512 INFO L125 PetriNetUnfolderBase]: For 474355/606903 co-relation queries the response was YES. [2023-11-30 04:39:49,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1289191 conditions, 368763 events. 185426/368763 cut-off events. For 474355/606903 co-relation queries the response was YES. Maximal size of possible extension queue 11084. Compared 4903356 event pairs, 41338 based on Foata normal form. 20193/335742 useless extension candidates. Maximal degree in co-relation 940308. Up to 193968 conditions per place. [2023-11-30 04:39:52,935 INFO L140 encePairwiseOnDemand]: 237/245 looper letters, 248 selfloop transitions, 3 changer transitions 0/424 dead transitions. [2023-11-30 04:39:52,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 424 transitions, 3292 flow [2023-11-30 04:39:52,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:39:52,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:39:52,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 577 transitions. [2023-11-30 04:39:52,937 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7850340136054422 [2023-11-30 04:39:52,937 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 577 transitions. [2023-11-30 04:39:52,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 577 transitions. [2023-11-30 04:39:52,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:39:52,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 577 transitions. [2023-11-30 04:39:52,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 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-11-30 04:39:52,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 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-11-30 04:39:52,939 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 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-11-30 04:39:52,939 INFO L307 CegarLoopForPetriNet]: 233 programPoint places, -21 predicate places. [2023-11-30 04:39:52,939 INFO L500 AbstractCegarLoop]: Abstraction has has 212 places, 424 transitions, 3292 flow [2023-11-30 04:39:52,940 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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-11-30 04:39:52,940 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:39:52,940 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:39:52,940 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 04:39:52,940 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err8ASSERT_VIOLATIONARRAY_INDEX === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:39:52,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:39:52,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1517821375, now seen corresponding path program 1 times [2023-11-30 04:39:52,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:39:52,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270070011] [2023-11-30 04:39:52,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:39:52,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:39:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:39:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:39:53,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:39:53,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270070011] [2023-11-30 04:39:53,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270070011] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:39:53,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:39:53,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 04:39:53,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969985071] [2023-11-30 04:39:53,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:39:53,063 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 04:39:53,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:39:53,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 04:39:53,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-30 04:39:53,065 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 245 [2023-11-30 04:39:53,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 424 transitions, 3292 flow. Second operand has 5 states, 5 states have (on average 163.4) internal successors, (817), 5 states have internal predecessors, (817), 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-11-30 04:39:53,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:39:53,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 245 [2023-11-30 04:39:53,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:41:03,453 INFO L124 PetriNetUnfolderBase]: 266746/532994 cut-off events. [2023-11-30 04:41:03,453 INFO L125 PetriNetUnfolderBase]: For 1028981/1221480 co-relation queries the response was YES. [2023-11-30 04:41:07,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2070908 conditions, 532994 events. 266746/532994 cut-off events. For 1028981/1221480 co-relation queries the response was YES. Maximal size of possible extension queue 15695. Compared 7321287 event pairs, 57163 based on Foata normal form. 381/452057 useless extension candidates. Maximal degree in co-relation 1575461. Up to 272185 conditions per place. [2023-11-30 04:41:14,017 INFO L140 encePairwiseOnDemand]: 236/245 looper letters, 353 selfloop transitions, 19 changer transitions 0/563 dead transitions. [2023-11-30 04:41:14,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 563 transitions, 5530 flow [2023-11-30 04:41:14,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 04:41:14,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 04:41:14,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1107 transitions. [2023-11-30 04:41:14,025 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.753061224489796 [2023-11-30 04:41:14,025 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1107 transitions. [2023-11-30 04:41:14,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1107 transitions. [2023-11-30 04:41:14,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:41:14,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1107 transitions. [2023-11-30 04:41:14,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 184.5) internal successors, (1107), 6 states have internal predecessors, (1107), 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-11-30 04:41:14,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 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-11-30 04:41:14,040 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 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-11-30 04:41:14,040 INFO L307 CegarLoopForPetriNet]: 233 programPoint places, -16 predicate places. [2023-11-30 04:41:14,040 INFO L500 AbstractCegarLoop]: Abstraction has has 217 places, 563 transitions, 5530 flow [2023-11-30 04:41:14,041 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 163.4) internal successors, (817), 5 states have internal predecessors, (817), 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-11-30 04:41:14,041 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:41:14,041 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:41:14,041 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 04:41:14,041 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:41:14,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:41:14,041 INFO L85 PathProgramCache]: Analyzing trace with hash 588901201, now seen corresponding path program 1 times [2023-11-30 04:41:14,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:41:14,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948852016] [2023-11-30 04:41:14,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:41:14,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:41:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:41:14,137 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-30 04:41:14,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:41:14,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948852016] [2023-11-30 04:41:14,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948852016] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:41:14,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:41:14,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:41:14,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742512589] [2023-11-30 04:41:14,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:41:14,140 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:41:14,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:41:14,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:41:14,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:41:14,141 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 245 [2023-11-30 04:41:14,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 563 transitions, 5530 flow. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 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-11-30 04:41:14,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:41:14,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 245 [2023-11-30 04:41:14,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand