/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/goblint-regression/28-race_reach_86-lists_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 05:29:55,331 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 05:29:55,380 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 05:29:55,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 05:29:55,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 05:29:55,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 05:29:55,400 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 05:29:55,400 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 05:29:55,400 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 05:29:55,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 05:29:55,403 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 05:29:55,403 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 05:29:55,404 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 05:29:55,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 05:29:55,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 05:29:55,405 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 05:29:55,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 05:29:55,405 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 05:29:55,405 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 05:29:55,405 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 05:29:55,405 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 05:29:55,406 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 05:29:55,406 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 05:29:55,406 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 05:29:55,406 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 05:29:55,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 05:29:55,407 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 05:29:55,408 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 05:29:55,408 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 05:29:55,408 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 05:29:55,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 05:29:55,409 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 05:29:55,409 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 05:29:55,409 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 05:29:55,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 05:29:55,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 05:29:55,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 05:29:55,633 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 05:29:55,635 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 05:29:55,636 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_86-lists_racing.i [2023-11-30 05:29:56,688 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 05:29:56,883 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 05:29:56,884 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_86-lists_racing.i [2023-11-30 05:29:56,899 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb99384f2/a09d1adcae2f4373a58ddcea059f205c/FLAG6db2dcc2e [2023-11-30 05:29:56,913 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb99384f2/a09d1adcae2f4373a58ddcea059f205c [2023-11-30 05:29:56,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 05:29:56,916 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 05:29:56,919 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 05:29:56,919 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 05:29:56,922 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 05:29:56,923 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 05:29:56" (1/1) ... [2023-11-30 05:29:56,924 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68d53ca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:29:56, skipping insertion in model container [2023-11-30 05:29:56,925 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 05:29:56" (1/1) ... [2023-11-30 05:29:56,968 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 05:29:57,345 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 05:29:57,408 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 05:29:57,435 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 05:29:57,472 INFO L206 MainTranslator]: Completed translation [2023-11-30 05:29:57,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:29:57 WrapperNode [2023-11-30 05:29:57,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 05:29:57,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 05:29:57,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 05:29:57,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 05:29:57,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:29:57" (1/1) ... [2023-11-30 05:29:57,500 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:29:57" (1/1) ... [2023-11-30 05:29:57,541 INFO L138 Inliner]: procedures = 279, calls = 70, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 269 [2023-11-30 05:29:57,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 05:29:57,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 05:29:57,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 05:29:57,542 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 05:29:57,550 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:29:57" (1/1) ... [2023-11-30 05:29:57,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:29:57" (1/1) ... [2023-11-30 05:29:57,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:29:57" (1/1) ... [2023-11-30 05:29:57,571 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:29:57" (1/1) ... [2023-11-30 05:29:57,578 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:29:57" (1/1) ... [2023-11-30 05:29:57,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:29:57" (1/1) ... [2023-11-30 05:29:57,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:29:57" (1/1) ... [2023-11-30 05:29:57,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:29:57" (1/1) ... [2023-11-30 05:29:57,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 05:29:57,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 05:29:57,587 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 05:29:57,587 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 05:29:57,588 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:29:57" (1/1) ... [2023-11-30 05:29:57,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 05:29:57,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:29:57,641 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 05:29:57,674 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 05:29:57,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 05:29:57,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-30 05:29:57,689 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2023-11-30 05:29:57,689 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2023-11-30 05:29:57,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 05:29:57,689 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-30 05:29:57,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 05:29:57,690 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2023-11-30 05:29:57,690 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2023-11-30 05:29:57,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 05:29:57,690 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-30 05:29:57,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-30 05:29:57,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 05:29:57,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-30 05:29:57,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 05:29:57,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 05:29:57,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 05:29:57,692 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 05:29:57,842 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 05:29:57,843 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 05:29:58,187 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 05:29:58,207 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 05:29:58,208 INFO L309 CfgBuilder]: Removed 16 assume(true) statements. [2023-11-30 05:29:58,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 05:29:58 BoogieIcfgContainer [2023-11-30 05:29:58,209 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 05:29:58,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 05:29:58,210 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 05:29:58,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 05:29:58,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 05:29:56" (1/3) ... [2023-11-30 05:29:58,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61720310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 05:29:58, skipping insertion in model container [2023-11-30 05:29:58,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:29:57" (2/3) ... [2023-11-30 05:29:58,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61720310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 05:29:58, skipping insertion in model container [2023-11-30 05:29:58,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 05:29:58" (3/3) ... [2023-11-30 05:29:58,214 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_86-lists_racing.i [2023-11-30 05:29:58,225 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 05:29:58,225 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2023-11-30 05:29:58,225 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 05:29:58,295 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-30 05:29:58,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 299 places, 323 transitions, 666 flow [2023-11-30 05:29:58,499 INFO L124 PetriNetUnfolderBase]: 61/603 cut-off events. [2023-11-30 05:29:58,499 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-30 05:29:58,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 603 events. 61/603 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2666 event pairs, 0 based on Foata normal form. 0/456 useless extension candidates. Maximal degree in co-relation 300. Up to 8 conditions per place. [2023-11-30 05:29:58,514 INFO L82 GeneralOperation]: Start removeDead. Operand has 299 places, 323 transitions, 666 flow [2023-11-30 05:29:58,524 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 299 places, 323 transitions, 666 flow [2023-11-30 05:29:58,535 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:29:58,540 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;@2ab0beba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:29:58,540 INFO L363 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2023-11-30 05:29:58,546 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:29:58,546 INFO L124 PetriNetUnfolderBase]: 3/52 cut-off events. [2023-11-30 05:29:58,546 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:29:58,546 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:29:58,547 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] [2023-11-30 05:29:58,547 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-30 05:29:58,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:29:58,551 INFO L85 PathProgramCache]: Analyzing trace with hash 85178761, now seen corresponding path program 1 times [2023-11-30 05:29:58,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:29:58,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200314449] [2023-11-30 05:29:58,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:29:58,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:29:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:29:58,818 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 05:29:58,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:29:58,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200314449] [2023-11-30 05:29:58,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200314449] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:29:58,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:29:58,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:29:58,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807839197] [2023-11-30 05:29:58,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:29:58,827 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:29:58,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:29:58,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:29:58,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:29:58,861 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 323 [2023-11-30 05:29:58,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 323 transitions, 666 flow. Second operand has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 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 05:29:58,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:29:58,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 323 [2023-11-30 05:29:58,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:29:59,173 INFO L124 PetriNetUnfolderBase]: 159/1454 cut-off events. [2023-11-30 05:29:59,173 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2023-11-30 05:29:59,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1773 conditions, 1454 events. 159/1454 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 9552 event pairs, 110 based on Foata normal form. 316/1518 useless extension candidates. Maximal degree in co-relation 969. Up to 264 conditions per place. [2023-11-30 05:29:59,187 INFO L140 encePairwiseOnDemand]: 299/323 looper letters, 33 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2023-11-30 05:29:59,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 305 transitions, 700 flow [2023-11-30 05:29:59,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:29:59,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:29:59,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 874 transitions. [2023-11-30 05:29:59,203 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9019607843137255 [2023-11-30 05:29:59,204 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 874 transitions. [2023-11-30 05:29:59,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 874 transitions. [2023-11-30 05:29:59,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:29:59,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 874 transitions. [2023-11-30 05:29:59,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:29:59,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 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 05:29:59,220 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 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 05:29:59,222 INFO L307 CegarLoopForPetriNet]: 299 programPoint places, -1 predicate places. [2023-11-30 05:29:59,223 INFO L500 AbstractCegarLoop]: Abstraction has has 298 places, 305 transitions, 700 flow [2023-11-30 05:29:59,223 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 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 05:29:59,223 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:29:59,224 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 05:29:59,224 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 05:29:59,224 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-30 05:29:59,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:29:59,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1275630214, now seen corresponding path program 1 times [2023-11-30 05:29:59,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:29:59,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235908944] [2023-11-30 05:29:59,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:29:59,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:29:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:29:59,396 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 05:29:59,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:29:59,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235908944] [2023-11-30 05:29:59,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235908944] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:29:59,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:29:59,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 05:29:59,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730426966] [2023-11-30 05:29:59,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:29:59,399 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 05:29:59,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:29:59,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 05:29:59,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-30 05:29:59,402 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 323 [2023-11-30 05:29:59,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 305 transitions, 700 flow. Second operand has 6 states, 6 states have (on average 218.5) internal successors, (1311), 6 states have internal predecessors, (1311), 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 05:29:59,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:29:59,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 323 [2023-11-30 05:29:59,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:30:02,409 INFO L124 PetriNetUnfolderBase]: 8548/23061 cut-off events. [2023-11-30 05:30:02,409 INFO L125 PetriNetUnfolderBase]: For 2638/2638 co-relation queries the response was YES. [2023-11-30 05:30:02,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39515 conditions, 23061 events. 8548/23061 cut-off events. For 2638/2638 co-relation queries the response was YES. Maximal size of possible extension queue 907. Compared 263366 event pairs, 8290 based on Foata normal form. 0/17941 useless extension candidates. Maximal degree in co-relation 36831. Up to 13406 conditions per place. [2023-11-30 05:30:02,571 INFO L140 encePairwiseOnDemand]: 313/323 looper letters, 77 selfloop transitions, 9 changer transitions 0/305 dead transitions. [2023-11-30 05:30:02,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 305 transitions, 872 flow [2023-11-30 05:30:02,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 05:30:02,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 05:30:02,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1599 transitions. [2023-11-30 05:30:02,574 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7072091994692614 [2023-11-30 05:30:02,574 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1599 transitions. [2023-11-30 05:30:02,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1599 transitions. [2023-11-30 05:30:02,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:30:02,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1599 transitions. [2023-11-30 05:30:02,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 228.42857142857142) internal successors, (1599), 7 states have internal predecessors, (1599), 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 05:30:02,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 323.0) internal successors, (2584), 8 states have internal predecessors, (2584), 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 05:30:02,581 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 323.0) internal successors, (2584), 8 states have internal predecessors, (2584), 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 05:30:02,582 INFO L307 CegarLoopForPetriNet]: 299 programPoint places, 3 predicate places. [2023-11-30 05:30:02,582 INFO L500 AbstractCegarLoop]: Abstraction has has 302 places, 305 transitions, 872 flow [2023-11-30 05:30:02,582 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 218.5) internal successors, (1311), 6 states have internal predecessors, (1311), 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 05:30:02,582 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:30:02,583 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 05:30:02,583 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 05:30:02,583 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-30 05:30:02,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:30:02,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1275630215, now seen corresponding path program 1 times [2023-11-30 05:30:02,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:30:02,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250082334] [2023-11-30 05:30:02,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:30:02,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:30:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:30:02,676 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 05:30:02,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:30:02,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250082334] [2023-11-30 05:30:02,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250082334] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:30:02,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:30:02,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 05:30:02,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645037690] [2023-11-30 05:30:02,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:30:02,677 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 05:30:02,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:30:02,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 05:30:02,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-30 05:30:02,679 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 323 [2023-11-30 05:30:02,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 305 transitions, 872 flow. Second operand has 6 states, 6 states have (on average 221.33333333333334) internal successors, (1328), 6 states have internal predecessors, (1328), 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 05:30:02,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:30:02,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 323 [2023-11-30 05:30:02,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:30:07,349 INFO L124 PetriNetUnfolderBase]: 16539/41600 cut-off events. [2023-11-30 05:30:07,349 INFO L125 PetriNetUnfolderBase]: For 17966/21307 co-relation queries the response was YES. [2023-11-30 05:30:07,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88326 conditions, 41600 events. 16539/41600 cut-off events. For 17966/21307 co-relation queries the response was YES. Maximal size of possible extension queue 1808. Compared 511622 event pairs, 16105 based on Foata normal form. 0/39748 useless extension candidates. Maximal degree in co-relation 84093. Up to 21603 conditions per place. [2023-11-30 05:30:07,774 INFO L140 encePairwiseOnDemand]: 313/323 looper letters, 73 selfloop transitions, 9 changer transitions 0/303 dead transitions. [2023-11-30 05:30:07,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 303 transitions, 1028 flow [2023-11-30 05:30:07,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 05:30:07,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 05:30:07,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1615 transitions. [2023-11-30 05:30:07,777 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2023-11-30 05:30:07,778 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1615 transitions. [2023-11-30 05:30:07,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1615 transitions. [2023-11-30 05:30:07,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:30:07,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1615 transitions. [2023-11-30 05:30:07,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 230.71428571428572) internal successors, (1615), 7 states have internal predecessors, (1615), 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 05:30:07,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 323.0) internal successors, (2584), 8 states have internal predecessors, (2584), 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 05:30:07,785 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 323.0) internal successors, (2584), 8 states have internal predecessors, (2584), 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 05:30:07,786 INFO L307 CegarLoopForPetriNet]: 299 programPoint places, 7 predicate places. [2023-11-30 05:30:07,786 INFO L500 AbstractCegarLoop]: Abstraction has has 306 places, 303 transitions, 1028 flow [2023-11-30 05:30:07,787 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 221.33333333333334) internal successors, (1328), 6 states have internal predecessors, (1328), 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 05:30:07,787 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:30:07,787 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, 1, 1, 1, 1] [2023-11-30 05:30:07,787 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 05:30:07,787 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-30 05:30:07,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:30:07,788 INFO L85 PathProgramCache]: Analyzing trace with hash 432320472, now seen corresponding path program 1 times [2023-11-30 05:30:07,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:30:07,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986682046] [2023-11-30 05:30:07,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:30:07,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:30:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:30:07,945 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 05:30:07,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:30:07,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986682046] [2023-11-30 05:30:07,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986682046] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:30:07,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:30:07,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 05:30:07,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816407134] [2023-11-30 05:30:07,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:30:07,947 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 05:30:07,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:30:07,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 05:30:07,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-30 05:30:07,949 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 323 [2023-11-30 05:30:07,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 303 transitions, 1028 flow. Second operand has 6 states, 6 states have (on average 221.66666666666666) internal successors, (1330), 6 states have internal predecessors, (1330), 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 05:30:07,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:30:07,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 323 [2023-11-30 05:30:07,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:30:13,500 INFO L124 PetriNetUnfolderBase]: 19213/49326 cut-off events. [2023-11-30 05:30:13,500 INFO L125 PetriNetUnfolderBase]: For 42592/52613 co-relation queries the response was YES. [2023-11-30 05:30:13,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129783 conditions, 49326 events. 19213/49326 cut-off events. For 42592/52613 co-relation queries the response was YES. Maximal size of possible extension queue 1974. Compared 621046 event pairs, 12619 based on Foata normal form. 530/47776 useless extension candidates. Maximal degree in co-relation 123906. Up to 24744 conditions per place. [2023-11-30 05:30:13,972 INFO L140 encePairwiseOnDemand]: 314/323 looper letters, 161 selfloop transitions, 6 changer transitions 0/386 dead transitions. [2023-11-30 05:30:13,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 386 transitions, 1854 flow [2023-11-30 05:30:13,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 05:30:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 05:30:13,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1263 transitions. [2023-11-30 05:30:13,975 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7820433436532508 [2023-11-30 05:30:13,976 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1263 transitions. [2023-11-30 05:30:13,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1263 transitions. [2023-11-30 05:30:13,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:30:13,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1263 transitions. [2023-11-30 05:30:13,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 252.6) internal successors, (1263), 5 states have internal predecessors, (1263), 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 05:30:13,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 323.0) internal successors, (1938), 6 states have internal predecessors, (1938), 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 05:30:13,982 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 323.0) internal successors, (1938), 6 states have internal predecessors, (1938), 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 05:30:13,982 INFO L307 CegarLoopForPetriNet]: 299 programPoint places, 10 predicate places. [2023-11-30 05:30:13,983 INFO L500 AbstractCegarLoop]: Abstraction has has 309 places, 386 transitions, 1854 flow [2023-11-30 05:30:13,983 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 221.66666666666666) internal successors, (1330), 6 states have internal predecessors, (1330), 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 05:30:13,983 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:30:13,983 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, 1, 1, 1, 1] [2023-11-30 05:30:13,983 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 05:30:13,984 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-30 05:30:13,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:30:13,984 INFO L85 PathProgramCache]: Analyzing trace with hash 432320473, now seen corresponding path program 1 times [2023-11-30 05:30:13,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:30:13,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910482405] [2023-11-30 05:30:13,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:30:13,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:30:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:30:14,151 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 05:30:14,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:30:14,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910482405] [2023-11-30 05:30:14,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910482405] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:30:14,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:30:14,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 05:30:14,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335239122] [2023-11-30 05:30:14,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:30:14,152 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 05:30:14,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:30:14,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 05:30:14,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-30 05:30:14,154 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 323 [2023-11-30 05:30:14,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 386 transitions, 1854 flow. Second operand has 7 states, 7 states have (on average 196.71428571428572) internal successors, (1377), 7 states have internal predecessors, (1377), 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 05:30:14,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:30:14,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 323 [2023-11-30 05:30:14,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:30:20,678 INFO L124 PetriNetUnfolderBase]: 22377/53766 cut-off events. [2023-11-30 05:30:20,679 INFO L125 PetriNetUnfolderBase]: For 66967/82417 co-relation queries the response was YES. [2023-11-30 05:30:20,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173056 conditions, 53766 events. 22377/53766 cut-off events. For 66967/82417 co-relation queries the response was YES. Maximal size of possible extension queue 2205. Compared 661007 event pairs, 13866 based on Foata normal form. 36/52629 useless extension candidates. Maximal degree in co-relation 165510. Up to 26173 conditions per place. [2023-11-30 05:30:21,170 INFO L140 encePairwiseOnDemand]: 315/323 looper letters, 201 selfloop transitions, 7 changer transitions 0/400 dead transitions. [2023-11-30 05:30:21,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 400 transitions, 2334 flow [2023-11-30 05:30:21,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 05:30:21,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 05:30:21,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1330 transitions. [2023-11-30 05:30:21,175 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6862745098039216 [2023-11-30 05:30:21,175 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1330 transitions. [2023-11-30 05:30:21,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1330 transitions. [2023-11-30 05:30:21,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:30:21,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1330 transitions. [2023-11-30 05:30:21,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 221.66666666666666) internal successors, (1330), 6 states have internal predecessors, (1330), 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 05:30:21,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 323.0) internal successors, (2261), 7 states have internal predecessors, (2261), 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 05:30:21,181 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 323.0) internal successors, (2261), 7 states have internal predecessors, (2261), 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 05:30:21,183 INFO L307 CegarLoopForPetriNet]: 299 programPoint places, 15 predicate places. [2023-11-30 05:30:21,183 INFO L500 AbstractCegarLoop]: Abstraction has has 314 places, 400 transitions, 2334 flow [2023-11-30 05:30:21,183 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 196.71428571428572) internal successors, (1377), 7 states have internal predecessors, (1377), 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 05:30:21,183 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:30:21,183 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:30:21,183 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 05:30:21,184 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-30 05:30:21,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:30:21,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1077217460, now seen corresponding path program 1 times [2023-11-30 05:30:21,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:30:21,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729376049] [2023-11-30 05:30:21,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:30:21,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:30:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:30:21,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:30:21,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:30:21,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729376049] [2023-11-30 05:30:21,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729376049] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:30:21,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648107151] [2023-11-30 05:30:21,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:30:21,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:30:21,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:30:21,258 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 05:30:21,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-30 05:30:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:30:21,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-30 05:30:21,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:30:21,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:30:21,403 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:30:21,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:30:21,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648107151] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:30:21,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:30:21,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-30 05:30:21,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949760205] [2023-11-30 05:30:21,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:30:21,456 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-30 05:30:21,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:30:21,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-30 05:30:21,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-30 05:30:21,458 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 323 [2023-11-30 05:30:21,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 400 transitions, 2334 flow. Second operand has 10 states, 10 states have (on average 273.4) internal successors, (2734), 10 states have internal predecessors, (2734), 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 05:30:21,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:30:21,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 323 [2023-11-30 05:30:21,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:30:28,870 INFO L124 PetriNetUnfolderBase]: 22377/53785 cut-off events. [2023-11-30 05:30:28,871 INFO L125 PetriNetUnfolderBase]: For 87623/100140 co-relation queries the response was YES. [2023-11-30 05:30:29,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179643 conditions, 53785 events. 22377/53785 cut-off events. For 87623/100140 co-relation queries the response was YES. Maximal size of possible extension queue 2205. Compared 660710 event pairs, 13866 based on Foata normal form. 0/52612 useless extension candidates. Maximal degree in co-relation 171681. Up to 26173 conditions per place. [2023-11-30 05:30:29,331 INFO L140 encePairwiseOnDemand]: 317/323 looper letters, 60 selfloop transitions, 9 changer transitions 0/409 dead transitions. [2023-11-30 05:30:29,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 409 transitions, 2528 flow [2023-11-30 05:30:29,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 05:30:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 05:30:29,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2485 transitions. [2023-11-30 05:30:29,335 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8548331613347093 [2023-11-30 05:30:29,335 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2485 transitions. [2023-11-30 05:30:29,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2485 transitions. [2023-11-30 05:30:29,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:30:29,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2485 transitions. [2023-11-30 05:30:29,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 276.1111111111111) internal successors, (2485), 9 states have internal predecessors, (2485), 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 05:30:29,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 323.0) internal successors, (3230), 10 states have internal predecessors, (3230), 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 05:30:29,344 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 323.0) internal successors, (3230), 10 states have internal predecessors, (3230), 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 05:30:29,345 INFO L307 CegarLoopForPetriNet]: 299 programPoint places, 23 predicate places. [2023-11-30 05:30:29,345 INFO L500 AbstractCegarLoop]: Abstraction has has 322 places, 409 transitions, 2528 flow [2023-11-30 05:30:29,346 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 273.4) internal successors, (2734), 10 states have internal predecessors, (2734), 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 05:30:29,346 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:30:29,346 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2023-11-30 05:30:29,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-30 05:30:29,551 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-30 05:30:29,552 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-30 05:30:29,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:30:29,552 INFO L85 PathProgramCache]: Analyzing trace with hash -602424489, now seen corresponding path program 1 times [2023-11-30 05:30:29,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:30:29,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099592680] [2023-11-30 05:30:29,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:30:29,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:30:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:30:29,882 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:30:29,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:30:29,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099592680] [2023-11-30 05:30:29,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099592680] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:30:29,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21903157] [2023-11-30 05:30:29,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:30:29,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:30:29,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:30:29,884 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 05:30:29,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-30 05:30:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:30:29,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-30 05:30:29,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:30:30,175 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:30:30,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 05:30:30,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-30 05:30:30,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 05:30:30,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-30 05:30:30,439 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:30:30,439 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:30:30,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 05:30:30,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2023-11-30 05:30:31,052 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:30:31,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21903157] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:30:31,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:30:31,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 8] total 27 [2023-11-30 05:30:31,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930461841] [2023-11-30 05:30:31,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:30:31,053 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-30 05:30:31,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:30:31,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-30 05:30:31,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2023-11-30 05:30:31,057 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 323 [2023-11-30 05:30:31,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 409 transitions, 2528 flow. Second operand has 28 states, 28 states have (on average 193.57142857142858) internal successors, (5420), 28 states have internal predecessors, (5420), 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 05:30:31,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:30:31,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 323 [2023-11-30 05:30:31,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:30:42,037 INFO L124 PetriNetUnfolderBase]: 28461/70059 cut-off events. [2023-11-30 05:30:42,037 INFO L125 PetriNetUnfolderBase]: For 162004/185234 co-relation queries the response was YES. [2023-11-30 05:30:42,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280078 conditions, 70059 events. 28461/70059 cut-off events. For 162004/185234 co-relation queries the response was YES. Maximal size of possible extension queue 2639. Compared 905854 event pairs, 14310 based on Foata normal form. 39/68634 useless extension candidates. Maximal degree in co-relation 270616. Up to 34135 conditions per place. [2023-11-30 05:30:42,933 INFO L140 encePairwiseOnDemand]: 305/323 looper letters, 329 selfloop transitions, 22 changer transitions 0/539 dead transitions. [2023-11-30 05:30:42,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 539 transitions, 4438 flow [2023-11-30 05:30:42,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-30 05:30:42,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-30 05:30:42,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3488 transitions. [2023-11-30 05:30:42,948 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6352212711710071 [2023-11-30 05:30:42,948 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3488 transitions. [2023-11-30 05:30:42,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3488 transitions. [2023-11-30 05:30:42,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:30:42,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3488 transitions. [2023-11-30 05:30:42,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 205.1764705882353) internal successors, (3488), 17 states have internal predecessors, (3488), 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 05:30:42,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 323.0) internal successors, (5814), 18 states have internal predecessors, (5814), 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 05:30:42,962 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 323.0) internal successors, (5814), 18 states have internal predecessors, (5814), 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 05:30:42,963 INFO L307 CegarLoopForPetriNet]: 299 programPoint places, 39 predicate places. [2023-11-30 05:30:42,963 INFO L500 AbstractCegarLoop]: Abstraction has has 338 places, 539 transitions, 4438 flow [2023-11-30 05:30:42,965 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 193.57142857142858) internal successors, (5420), 28 states have internal predecessors, (5420), 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 05:30:42,965 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:30:42,965 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 05:30:42,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-30 05:30:43,169 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-30 05:30:43,174 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-30 05:30:43,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:30:43,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1423825200, now seen corresponding path program 2 times [2023-11-30 05:30:43,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:30:43,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051517426] [2023-11-30 05:30:43,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:30:43,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:30:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:30:43,334 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:30:43,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:30:43,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051517426] [2023-11-30 05:30:43,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051517426] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:30:43,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777473882] [2023-11-30 05:30:43,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 05:30:43,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:30:43,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:30:43,339 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 05:30:43,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-30 05:30:43,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-30 05:30:43,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 05:30:43,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-30 05:30:43,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:30:43,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-30 05:30:43,477 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-11-30 05:30:43,477 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 05:30:43,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777473882] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:30:43,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 05:30:43,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2023-11-30 05:30:43,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292319202] [2023-11-30 05:30:43,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:30:43,478 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:30:43,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:30:43,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:30:43,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-11-30 05:30:43,480 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 323 [2023-11-30 05:30:43,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 539 transitions, 4438 flow. Second operand has 4 states, 4 states have (on average 222.75) internal successors, (891), 4 states have internal predecessors, (891), 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 05:30:43,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:30:43,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 323 [2023-11-30 05:30:43,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:30:54,605 INFO L124 PetriNetUnfolderBase]: 32469/74461 cut-off events. [2023-11-30 05:30:54,605 INFO L125 PetriNetUnfolderBase]: For 256777/305170 co-relation queries the response was YES. [2023-11-30 05:30:54,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342700 conditions, 74461 events. 32469/74461 cut-off events. For 256777/305170 co-relation queries the response was YES. Maximal size of possible extension queue 2790. Compared 909919 event pairs, 16808 based on Foata normal form. 5/71734 useless extension candidates. Maximal degree in co-relation 334580. Up to 38209 conditions per place. [2023-11-30 05:30:55,556 INFO L140 encePairwiseOnDemand]: 316/323 looper letters, 340 selfloop transitions, 8 changer transitions 0/642 dead transitions. [2023-11-30 05:30:55,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 642 transitions, 6329 flow [2023-11-30 05:30:55,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 05:30:55,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 05:30:55,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1010 transitions. [2023-11-30 05:30:55,572 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.781733746130031 [2023-11-30 05:30:55,572 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1010 transitions. [2023-11-30 05:30:55,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1010 transitions. [2023-11-30 05:30:55,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:30:55,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1010 transitions. [2023-11-30 05:30:55,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 252.5) internal successors, (1010), 4 states have internal predecessors, (1010), 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 05:30:55,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 323.0) internal successors, (1615), 5 states have internal predecessors, (1615), 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 05:30:55,576 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 323.0) internal successors, (1615), 5 states have internal predecessors, (1615), 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 05:30:55,577 INFO L307 CegarLoopForPetriNet]: 299 programPoint places, 42 predicate places. [2023-11-30 05:30:55,578 INFO L500 AbstractCegarLoop]: Abstraction has has 341 places, 642 transitions, 6329 flow [2023-11-30 05:30:55,578 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 222.75) internal successors, (891), 4 states have internal predecessors, (891), 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 05:30:55,578 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:30:55,578 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 05:30:55,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-30 05:30:55,783 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:30:55,783 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-30 05:30:55,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:30:55,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1423825201, now seen corresponding path program 1 times [2023-11-30 05:30:55,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:30:55,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578604173] [2023-11-30 05:30:55,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:30:55,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:30:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:30:55,848 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-11-30 05:30:55,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:30:55,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578604173] [2023-11-30 05:30:55,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578604173] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:30:55,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:30:55,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:30:55,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785900222] [2023-11-30 05:30:55,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:30:55,849 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:30:55,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:30:55,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:30:55,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:30:55,851 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 323 [2023-11-30 05:30:55,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 642 transitions, 6329 flow. Second operand has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 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 05:30:55,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:30:55,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 323 [2023-11-30 05:30:55,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:31:07,182 INFO L124 PetriNetUnfolderBase]: 31636/70824 cut-off events. [2023-11-30 05:31:07,183 INFO L125 PetriNetUnfolderBase]: For 320661/377907 co-relation queries the response was YES. [2023-11-30 05:31:07,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367893 conditions, 70824 events. 31636/70824 cut-off events. For 320661/377907 co-relation queries the response was YES. Maximal size of possible extension queue 2664. Compared 851573 event pairs, 13427 based on Foata normal form. 841/69291 useless extension candidates. Maximal degree in co-relation 359301. Up to 36739 conditions per place. [2023-11-30 05:31:07,963 INFO L140 encePairwiseOnDemand]: 319/323 looper letters, 313 selfloop transitions, 3 changer transitions 0/637 dead transitions. [2023-11-30 05:31:07,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 637 transitions, 6901 flow [2023-11-30 05:31:07,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:31:07,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:31:07,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 783 transitions. [2023-11-30 05:31:07,965 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8080495356037152 [2023-11-30 05:31:07,965 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 783 transitions. [2023-11-30 05:31:07,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 783 transitions. [2023-11-30 05:31:07,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:31:07,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 783 transitions. [2023-11-30 05:31:07,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 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 05:31:07,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 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 05:31:07,968 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 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 05:31:07,968 INFO L307 CegarLoopForPetriNet]: 299 programPoint places, 42 predicate places. [2023-11-30 05:31:07,968 INFO L500 AbstractCegarLoop]: Abstraction has has 341 places, 637 transitions, 6901 flow [2023-11-30 05:31:07,969 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 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 05:31:07,969 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:31:07,969 INFO L232 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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 05:31:07,969 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 05:31:07,969 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-30 05:31:07,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:31:07,969 INFO L85 PathProgramCache]: Analyzing trace with hash -2077909421, now seen corresponding path program 2 times [2023-11-30 05:31:07,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:31:07,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112208991] [2023-11-30 05:31:07,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:07,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:31:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:08,732 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:31:08,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:31:08,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112208991] [2023-11-30 05:31:08,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112208991] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:31:08,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482450070] [2023-11-30 05:31:08,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 05:31:08,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:31:08,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:31:08,746 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 05:31:08,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-30 05:31:08,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 05:31:08,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 05:31:08,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-30 05:31:08,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:31:09,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 05:31:09,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-30 05:31:09,235 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-30 05:31:09,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-30 05:31:09,248 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:31:09,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 05:31:09,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 05:31:09,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-30 05:31:09,619 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-30 05:31:09,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-30 05:31:09,631 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:31:09,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 05:31:09,788 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:31:09,788 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:31:10,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 05:31:10,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2023-11-30 05:31:10,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 05:31:10,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2023-11-30 05:31:10,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 05:31:10,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2023-11-30 05:31:11,160 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:31:11,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482450070] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:31:11,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:31:11,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 14] total 49 [2023-11-30 05:31:11,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126305850] [2023-11-30 05:31:11,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:31:11,161 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-30 05:31:11,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:31:11,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-30 05:31:11,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=2104, Unknown=0, NotChecked=0, Total=2450 [2023-11-30 05:31:11,167 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 323 [2023-11-30 05:31:11,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 637 transitions, 6901 flow. Second operand has 50 states, 50 states have (on average 193.68) internal successors, (9684), 50 states have internal predecessors, (9684), 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 05:31:11,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:31:11,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 323 [2023-11-30 05:31:11,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:31:33,795 INFO L124 PetriNetUnfolderBase]: 45077/98426 cut-off events. [2023-11-30 05:31:33,795 INFO L125 PetriNetUnfolderBase]: For 509116/614477 co-relation queries the response was YES. [2023-11-30 05:31:34,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583513 conditions, 98426 events. 45077/98426 cut-off events. For 509116/614477 co-relation queries the response was YES. Maximal size of possible extension queue 3089. Compared 1176878 event pairs, 28649 based on Foata normal form. 103/94853 useless extension candidates. Maximal degree in co-relation 407119. Up to 51934 conditions per place. [2023-11-30 05:31:35,270 INFO L140 encePairwiseOnDemand]: 307/323 looper letters, 569 selfloop transitions, 46 changer transitions 0/810 dead transitions. [2023-11-30 05:31:35,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 810 transitions, 10556 flow [2023-11-30 05:31:35,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-30 05:31:35,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-11-30 05:31:35,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 7363 transitions. [2023-11-30 05:31:35,281 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6160990712074303 [2023-11-30 05:31:35,281 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 7363 transitions. [2023-11-30 05:31:35,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 7363 transitions. [2023-11-30 05:31:35,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:31:35,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 7363 transitions. [2023-11-30 05:31:35,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 199.0) internal successors, (7363), 37 states have internal predecessors, (7363), 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 05:31:35,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 323.0) internal successors, (12274), 38 states have internal predecessors, (12274), 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 05:31:35,311 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 323.0) internal successors, (12274), 38 states have internal predecessors, (12274), 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 05:31:35,311 INFO L307 CegarLoopForPetriNet]: 299 programPoint places, 78 predicate places. [2023-11-30 05:31:35,311 INFO L500 AbstractCegarLoop]: Abstraction has has 377 places, 810 transitions, 10556 flow [2023-11-30 05:31:35,313 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 193.68) internal successors, (9684), 50 states have internal predecessors, (9684), 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 05:31:35,313 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:31:35,314 INFO L232 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:31:35,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-30 05:31:35,518 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:31:35,519 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting t1_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-30 05:31:35,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:31:35,520 INFO L85 PathProgramCache]: Analyzing trace with hash -309018648, now seen corresponding path program 1 times [2023-11-30 05:31:35,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:31:35,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107538729] [2023-11-30 05:31:35,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:35,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:31:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:35,688 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:31:35,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:31:35,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107538729] [2023-11-30 05:31:35,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107538729] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:31:35,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239609774] [2023-11-30 05:31:35,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:35,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:31:35,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:31:35,690 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 05:31:35,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-30 05:31:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:35,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-30 05:31:35,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:31:35,931 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:31:35,931 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:31:36,058 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:31:36,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239609774] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:31:36,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:31:36,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2023-11-30 05:31:36,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697273353] [2023-11-30 05:31:36,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:31:36,059 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-30 05:31:36,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:31:36,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-30 05:31:36,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2023-11-30 05:31:36,062 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 323 [2023-11-30 05:31:36,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 810 transitions, 10556 flow. Second operand has 22 states, 22 states have (on average 273.77272727272725) internal successors, (6023), 22 states have internal predecessors, (6023), 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 05:31:36,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:31:36,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 323 [2023-11-30 05:31:36,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:31:53,258 INFO L124 PetriNetUnfolderBase]: 31851/72727 cut-off events. [2023-11-30 05:31:53,258 INFO L125 PetriNetUnfolderBase]: For 486770/545534 co-relation queries the response was YES. [2023-11-30 05:31:53,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 427526 conditions, 72727 events. 31851/72727 cut-off events. For 486770/545534 co-relation queries the response was YES. Maximal size of possible extension queue 2655. Compared 881729 event pairs, 16867 based on Foata normal form. 2/69816 useless extension candidates. Maximal degree in co-relation 417065. Up to 36762 conditions per place. [2023-11-30 05:31:54,185 INFO L140 encePairwiseOnDemand]: 317/323 looper letters, 137 selfloop transitions, 27 changer transitions 0/704 dead transitions. [2023-11-30 05:31:54,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 704 transitions, 9013 flow [2023-11-30 05:31:54,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-30 05:31:54,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-11-30 05:31:54,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 7402 transitions. [2023-11-30 05:31:54,191 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8487558766196537 [2023-11-30 05:31:54,191 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 7402 transitions. [2023-11-30 05:31:54,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 7402 transitions. [2023-11-30 05:31:54,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:31:54,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 7402 transitions. [2023-11-30 05:31:54,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 274.14814814814815) internal successors, (7402), 27 states have internal predecessors, (7402), 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 05:31:54,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 323.0) internal successors, (9044), 28 states have internal predecessors, (9044), 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 05:31:54,206 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 323.0) internal successors, (9044), 28 states have internal predecessors, (9044), 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 05:31:54,206 INFO L307 CegarLoopForPetriNet]: 299 programPoint places, 102 predicate places. [2023-11-30 05:31:54,206 INFO L500 AbstractCegarLoop]: Abstraction has has 401 places, 704 transitions, 9013 flow [2023-11-30 05:31:54,207 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 273.77272727272725) internal successors, (6023), 22 states have internal predecessors, (6023), 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 05:31:54,207 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:31:54,207 INFO L232 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 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 05:31:54,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-30 05:31:54,412 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-30 05:31:54,413 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-30 05:31:54,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:31:54,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1560319051, now seen corresponding path program 3 times [2023-11-30 05:31:54,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:31:54,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056817506] [2023-11-30 05:31:54,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:54,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:31:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:56,531 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 0 proven. 427 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:31:56,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:31:56,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056817506] [2023-11-30 05:31:56,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056817506] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:31:56,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827577727] [2023-11-30 05:31:56,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-30 05:31:56,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:31:56,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:31:56,533 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 05:31:56,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-30 05:32:41,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-11-30 05:32:41,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 05:32:41,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 107 conjunts are in the unsatisfiable core [2023-11-30 05:32:41,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:32:41,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 05:32:41,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-30 05:32:41,537 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:32:41,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 05:32:41,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-30 05:32:41,791 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:32:41,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 05:32:41,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-30 05:32:42,079 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-30 05:32:42,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-30 05:32:42,089 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:32:42,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 05:32:42,392 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:32:42,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 05:32:42,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-30 05:32:42,713 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:32:42,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 05:32:42,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-30 05:32:43,046 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:32:43,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 05:32:43,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-30 05:32:43,454 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:32:43,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 05:32:43,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-30 05:32:43,698 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 0 proven. 427 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:32:43,698 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:32:44,038 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-30 05:32:44,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-11-30 05:32:44,440 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-30 05:32:44,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-11-30 05:32:44,909 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-30 05:32:44,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-11-30 05:32:45,425 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-30 05:32:45,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-11-30 05:32:45,910 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-30 05:32:45,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-11-30 05:32:46,359 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-30 05:32:46,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-11-30 05:32:46,900 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-30 05:32:46,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-11-30 05:32:47,468 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 0 proven. 427 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:32:47,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827577727] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:32:47,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:32:47,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 47, 27] total 103 [2023-11-30 05:32:47,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613254146] [2023-11-30 05:32:47,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:32:47,469 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2023-11-30 05:32:47,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:32:47,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2023-11-30 05:32:47,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1014, Invalid=9698, Unknown=0, NotChecked=0, Total=10712 [2023-11-30 05:32:47,479 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 323 [2023-11-30 05:32:47,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 704 transitions, 9013 flow. Second operand has 104 states, 104 states have (on average 193.3846153846154) internal successors, (20112), 104 states have internal predecessors, (20112), 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 05:32:47,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:32:47,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 323 [2023-11-30 05:32:47,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:33:24,717 INFO L124 PetriNetUnfolderBase]: 45933/106799 cut-off events. [2023-11-30 05:33:24,717 INFO L125 PetriNetUnfolderBase]: For 850923/987466 co-relation queries the response was YES. [2023-11-30 05:33:25,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 677056 conditions, 106799 events. 45933/106799 cut-off events. For 850923/987466 co-relation queries the response was YES. Maximal size of possible extension queue 2671. Compared 1299413 event pairs, 26512 based on Foata normal form. 119/102881 useless extension candidates. Maximal degree in co-relation 463164. Up to 52342 conditions per place. [2023-11-30 05:33:26,416 INFO L140 encePairwiseOnDemand]: 303/323 looper letters, 626 selfloop transitions, 104 changer transitions 0/925 dead transitions. [2023-11-30 05:33:26,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 925 transitions, 14050 flow [2023-11-30 05:33:26,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-11-30 05:33:26,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2023-11-30 05:33:26,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 14759 transitions. [2023-11-30 05:33:26,426 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6092466460268318 [2023-11-30 05:33:26,426 INFO L72 ComplementDD]: Start complementDD. Operand 75 states and 14759 transitions. [2023-11-30 05:33:26,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 14759 transitions. [2023-11-30 05:33:26,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:33:26,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 75 states and 14759 transitions. [2023-11-30 05:33:26,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 76 states, 75 states have (on average 196.78666666666666) internal successors, (14759), 75 states have internal predecessors, (14759), 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 05:33:26,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 76 states, 76 states have (on average 323.0) internal successors, (24548), 76 states have internal predecessors, (24548), 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 05:33:26,459 INFO L81 ComplementDD]: Finished complementDD. Result has 76 states, 76 states have (on average 323.0) internal successors, (24548), 76 states have internal predecessors, (24548), 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 05:33:26,460 INFO L307 CegarLoopForPetriNet]: 299 programPoint places, 176 predicate places. [2023-11-30 05:33:26,460 INFO L500 AbstractCegarLoop]: Abstraction has has 475 places, 925 transitions, 14050 flow [2023-11-30 05:33:26,462 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 193.3846153846154) internal successors, (20112), 104 states have internal predecessors, (20112), 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 05:33:26,462 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:33:26,462 INFO L232 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:33:26,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-30 05:33:26,677 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:33:26,677 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting t1_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-30 05:33:26,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:33:26,677 INFO L85 PathProgramCache]: Analyzing trace with hash 428885598, now seen corresponding path program 2 times [2023-11-30 05:33:26,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:33:26,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134122302] [2023-11-30 05:33:26,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:33:26,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:33:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:33:27,133 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:33:27,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:33:27,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134122302] [2023-11-30 05:33:27,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134122302] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:33:27,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018923824] [2023-11-30 05:33:27,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 05:33:27,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:33:27,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:33:27,146 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 05:33:27,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-30 05:33:27,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-30 05:33:27,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 05:33:27,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-30 05:33:27,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:33:27,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-30 05:33:27,395 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2023-11-30 05:33:27,395 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 05:33:27,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018923824] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:33:27,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 05:33:27,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [21] total 25 [2023-11-30 05:33:27,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137073137] [2023-11-30 05:33:27,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:33:27,396 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 05:33:27,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:33:27,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 05:33:27,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2023-11-30 05:33:27,398 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 323 [2023-11-30 05:33:27,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 925 transitions, 14050 flow. Second operand has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 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 05:33:27,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:33:27,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 323 [2023-11-30 05:33:27,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:33:29,473 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([961] L1010-->t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (not (= (select |v_#valid_28| |v_t1_funThread1of1ForFork1_init_~p#1.base_7|) 1)) InVars {#valid=|v_#valid_28|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_7|} OutVars{#valid=|v_#valid_28|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_7|} AuxVars[] AssignedVars[][355], [319#true, 2705#true, 302#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 339#true, 1996#true, t1_funThread1of1ForFork1InUse, 306#true, 1343#true, 208#t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 225#ULTIMATE.startFINALtrue, 1347#true, 332#true, 680#true, 242#t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 05:33:29,473 INFO L294 olderBase$Statistics]: this new event has 246 ancestors and is cut-off event [2023-11-30 05:33:29,473 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2023-11-30 05:33:29,473 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2023-11-30 05:33:29,473 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2023-11-30 05:33:29,474 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([960] L1010-->L1010-1: Formula: (and (<= 0 |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|) (= (store |v_#memory_$Pointer$.offset_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_$Pointer$.offset_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| (select (select |v_#memory_$Pointer$.offset_14| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|))) |v_#memory_$Pointer$.offset_14|) (= (store |v_#memory_$Pointer$.base_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_$Pointer$.base_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| (select (select |v_#memory_$Pointer$.base_14| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|))) |v_#memory_$Pointer$.base_14|) (= |v_#memory_int_12| (store |v_#memory_int_13| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_int_13| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| 0))) (= (select |v_#valid_27| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) 1) (<= (+ |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| 4) (select |v_#length_27| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_15|, #valid=|v_#valid_27|, t1_funThread1of1ForFork1_init_~p#1.offset=|v_t1_funThread1of1ForFork1_init_~p#1.offset_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_27|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_15|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_5|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_14|, #valid=|v_#valid_27|, t1_funThread1of1ForFork1_init_~p#1.offset=|v_t1_funThread1of1ForFork1_init_~p#1.offset_5|, #memory_int=|v_#memory_int_12|, #length=|v_#length_27|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_14|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_5|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][356], [319#true, 2705#true, 302#true, 1079#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 349#true, t2_funThread1of1ForFork0InUse, 266#L1010-1true, 339#true, 1996#true, t1_funThread1of1ForFork1InUse, 306#true, 208#t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 225#ULTIMATE.startFINALtrue, 1343#true, 1347#true, 332#true, 680#true]) [2023-11-30 05:33:29,474 INFO L294 olderBase$Statistics]: this new event has 246 ancestors and is cut-off event [2023-11-30 05:33:29,474 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2023-11-30 05:33:29,474 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2023-11-30 05:33:29,474 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2023-11-30 05:33:30,044 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([961] L1010-->t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (not (= (select |v_#valid_28| |v_t1_funThread1of1ForFork1_init_~p#1.base_7|) 1)) InVars {#valid=|v_#valid_28|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_7|} OutVars{#valid=|v_#valid_28|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_7|} AuxVars[] AssignedVars[][355], [319#true, 2705#true, 302#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 339#true, t1_funThread1of1ForFork1InUse, 1996#true, 306#true, 34#t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 1343#true, 332#true, 1347#true, 199#L1054-16true, 680#true, 242#t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 05:33:30,044 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2023-11-30 05:33:30,044 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2023-11-30 05:33:30,044 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2023-11-30 05:33:30,044 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2023-11-30 05:33:30,048 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([960] L1010-->L1010-1: Formula: (and (<= 0 |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|) (= (store |v_#memory_$Pointer$.offset_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_$Pointer$.offset_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| (select (select |v_#memory_$Pointer$.offset_14| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|))) |v_#memory_$Pointer$.offset_14|) (= (store |v_#memory_$Pointer$.base_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_$Pointer$.base_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| (select (select |v_#memory_$Pointer$.base_14| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|))) |v_#memory_$Pointer$.base_14|) (= |v_#memory_int_12| (store |v_#memory_int_13| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_int_13| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| 0))) (= (select |v_#valid_27| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) 1) (<= (+ |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| 4) (select |v_#length_27| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_15|, #valid=|v_#valid_27|, t1_funThread1of1ForFork1_init_~p#1.offset=|v_t1_funThread1of1ForFork1_init_~p#1.offset_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_27|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_15|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_5|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_14|, #valid=|v_#valid_27|, t1_funThread1of1ForFork1_init_~p#1.offset=|v_t1_funThread1of1ForFork1_init_~p#1.offset_5|, #memory_int=|v_#memory_int_12|, #length=|v_#length_27|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_14|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_5|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][356], [319#true, 2705#true, 302#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 266#L1010-1true, 339#true, t1_funThread1of1ForFork1InUse, 1996#true, 306#true, 1343#true, 34#t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 332#true, 1347#true, 199#L1054-16true, 680#true]) [2023-11-30 05:33:30,048 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2023-11-30 05:33:30,048 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2023-11-30 05:33:30,048 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2023-11-30 05:33:30,049 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2023-11-30 05:33:30,460 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([961] L1010-->t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (not (= (select |v_#valid_28| |v_t1_funThread1of1ForFork1_init_~p#1.base_7|) 1)) InVars {#valid=|v_#valid_28|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_7|} OutVars{#valid=|v_#valid_28|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_7|} AuxVars[] AssignedVars[][355], [319#true, 2705#true, 302#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 339#true, 1996#true, t1_funThread1of1ForFork1InUse, 306#true, 34#t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 225#ULTIMATE.startFINALtrue, 1343#true, 1347#true, 332#true, 680#true, 242#t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 05:33:30,460 INFO L294 olderBase$Statistics]: this new event has 254 ancestors and is cut-off event [2023-11-30 05:33:30,460 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2023-11-30 05:33:30,460 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2023-11-30 05:33:30,460 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2023-11-30 05:33:30,462 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([960] L1010-->L1010-1: Formula: (and (<= 0 |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|) (= (store |v_#memory_$Pointer$.offset_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_$Pointer$.offset_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| (select (select |v_#memory_$Pointer$.offset_14| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|))) |v_#memory_$Pointer$.offset_14|) (= (store |v_#memory_$Pointer$.base_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_$Pointer$.base_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| (select (select |v_#memory_$Pointer$.base_14| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|))) |v_#memory_$Pointer$.base_14|) (= |v_#memory_int_12| (store |v_#memory_int_13| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_int_13| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| 0))) (= (select |v_#valid_27| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) 1) (<= (+ |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| 4) (select |v_#length_27| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_15|, #valid=|v_#valid_27|, t1_funThread1of1ForFork1_init_~p#1.offset=|v_t1_funThread1of1ForFork1_init_~p#1.offset_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_27|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_15|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_5|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_14|, #valid=|v_#valid_27|, t1_funThread1of1ForFork1_init_~p#1.offset=|v_t1_funThread1of1ForFork1_init_~p#1.offset_5|, #memory_int=|v_#memory_int_12|, #length=|v_#length_27|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_14|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_5|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][356], [319#true, 2705#true, 302#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 266#L1010-1true, 339#true, 1996#true, t1_funThread1of1ForFork1InUse, 306#true, 1343#true, 34#t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 225#ULTIMATE.startFINALtrue, 332#true, 1347#true, 680#true]) [2023-11-30 05:33:30,462 INFO L294 olderBase$Statistics]: this new event has 254 ancestors and is cut-off event [2023-11-30 05:33:30,462 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2023-11-30 05:33:30,462 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2023-11-30 05:33:30,462 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2023-11-30 05:33:31,759 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([961] L1010-->t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (not (= (select |v_#valid_28| |v_t1_funThread1of1ForFork1_init_~p#1.base_7|) 1)) InVars {#valid=|v_#valid_28|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_7|} OutVars{#valid=|v_#valid_28|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_7|} AuxVars[] AssignedVars[][355], [319#true, 2705#true, 302#true, 1079#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 349#true, t2_funThread1of1ForFork0InUse, 339#true, 1996#true, t1_funThread1of1ForFork1InUse, 306#true, 1343#true, 34#t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 332#true, 1347#true, 199#L1054-16true, 680#true, 242#t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 05:33:31,760 INFO L294 olderBase$Statistics]: this new event has 261 ancestors and is cut-off event [2023-11-30 05:33:31,760 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2023-11-30 05:33:31,760 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2023-11-30 05:33:31,760 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2023-11-30 05:33:31,760 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2023-11-30 05:33:31,760 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([960] L1010-->L1010-1: Formula: (and (<= 0 |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|) (= (store |v_#memory_$Pointer$.offset_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_$Pointer$.offset_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| (select (select |v_#memory_$Pointer$.offset_14| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|))) |v_#memory_$Pointer$.offset_14|) (= (store |v_#memory_$Pointer$.base_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_$Pointer$.base_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| (select (select |v_#memory_$Pointer$.base_14| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|))) |v_#memory_$Pointer$.base_14|) (= |v_#memory_int_12| (store |v_#memory_int_13| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_int_13| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| 0))) (= (select |v_#valid_27| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) 1) (<= (+ |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| 4) (select |v_#length_27| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_15|, #valid=|v_#valid_27|, t1_funThread1of1ForFork1_init_~p#1.offset=|v_t1_funThread1of1ForFork1_init_~p#1.offset_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_27|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_15|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_5|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_14|, #valid=|v_#valid_27|, t1_funThread1of1ForFork1_init_~p#1.offset=|v_t1_funThread1of1ForFork1_init_~p#1.offset_5|, #memory_int=|v_#memory_int_12|, #length=|v_#length_27|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_14|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_5|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][356], [319#true, 2705#true, 302#true, 1079#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 349#true, t2_funThread1of1ForFork0InUse, 339#true, 266#L1010-1true, 1996#true, t1_funThread1of1ForFork1InUse, 306#true, 1343#true, 34#t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 1347#true, 332#true, 199#L1054-16true, 680#true]) [2023-11-30 05:33:31,760 INFO L294 olderBase$Statistics]: this new event has 261 ancestors and is cut-off event [2023-11-30 05:33:31,760 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2023-11-30 05:33:31,760 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2023-11-30 05:33:31,760 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2023-11-30 05:33:31,760 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2023-11-30 05:33:32,487 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([961] L1010-->t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (not (= (select |v_#valid_28| |v_t1_funThread1of1ForFork1_init_~p#1.base_7|) 1)) InVars {#valid=|v_#valid_28|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_7|} OutVars{#valid=|v_#valid_28|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_7|} AuxVars[] AssignedVars[][355], [319#true, 2705#true, 302#true, 1079#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 349#true, t2_funThread1of1ForFork0InUse, 339#true, 1996#true, t1_funThread1of1ForFork1InUse, 306#true, 225#ULTIMATE.startFINALtrue, 1343#true, 34#t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 332#true, 1347#true, 680#true, 242#t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 05:33:32,487 INFO L294 olderBase$Statistics]: this new event has 264 ancestors and is cut-off event [2023-11-30 05:33:32,487 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2023-11-30 05:33:32,488 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2023-11-30 05:33:32,488 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2023-11-30 05:33:32,488 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2023-11-30 05:33:32,488 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([960] L1010-->L1010-1: Formula: (and (<= 0 |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|) (= (store |v_#memory_$Pointer$.offset_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_$Pointer$.offset_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| (select (select |v_#memory_$Pointer$.offset_14| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|))) |v_#memory_$Pointer$.offset_14|) (= (store |v_#memory_$Pointer$.base_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_$Pointer$.base_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| (select (select |v_#memory_$Pointer$.base_14| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|))) |v_#memory_$Pointer$.base_14|) (= |v_#memory_int_12| (store |v_#memory_int_13| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_int_13| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| 0))) (= (select |v_#valid_27| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) 1) (<= (+ |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| 4) (select |v_#length_27| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_15|, #valid=|v_#valid_27|, t1_funThread1of1ForFork1_init_~p#1.offset=|v_t1_funThread1of1ForFork1_init_~p#1.offset_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_27|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_15|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_5|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_14|, #valid=|v_#valid_27|, t1_funThread1of1ForFork1_init_~p#1.offset=|v_t1_funThread1of1ForFork1_init_~p#1.offset_5|, #memory_int=|v_#memory_int_12|, #length=|v_#length_27|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_14|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_5|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][356], [319#true, 2705#true, 302#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 266#L1010-1true, 339#true, 1996#true, t1_funThread1of1ForFork1InUse, 306#true, 225#ULTIMATE.startFINALtrue, 1343#true, 34#t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 332#true, 1347#true, 680#true]) [2023-11-30 05:33:32,488 INFO L294 olderBase$Statistics]: this new event has 264 ancestors and is cut-off event [2023-11-30 05:33:32,488 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2023-11-30 05:33:32,488 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2023-11-30 05:33:32,488 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2023-11-30 05:33:32,488 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2023-11-30 05:33:34,205 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([961] L1010-->t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (not (= (select |v_#valid_28| |v_t1_funThread1of1ForFork1_init_~p#1.base_7|) 1)) InVars {#valid=|v_#valid_28|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_7|} OutVars{#valid=|v_#valid_28|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_7|} AuxVars[] AssignedVars[][355], [319#true, 2705#true, 302#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 339#true, t1_funThread1of1ForFork1InUse, 1996#true, 306#true, 1343#true, 225#ULTIMATE.startFINALtrue, 1347#true, 332#true, 680#true, 242#t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 48#L1042-3true]) [2023-11-30 05:33:34,206 INFO L294 olderBase$Statistics]: this new event has 270 ancestors and is cut-off event [2023-11-30 05:33:34,206 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2023-11-30 05:33:34,206 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2023-11-30 05:33:34,206 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2023-11-30 05:33:34,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([960] L1010-->L1010-1: Formula: (and (<= 0 |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|) (= (store |v_#memory_$Pointer$.offset_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_$Pointer$.offset_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| (select (select |v_#memory_$Pointer$.offset_14| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|))) |v_#memory_$Pointer$.offset_14|) (= (store |v_#memory_$Pointer$.base_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_$Pointer$.base_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| (select (select |v_#memory_$Pointer$.base_14| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|))) |v_#memory_$Pointer$.base_14|) (= |v_#memory_int_12| (store |v_#memory_int_13| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_int_13| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| 0))) (= (select |v_#valid_27| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) 1) (<= (+ |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| 4) (select |v_#length_27| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_15|, #valid=|v_#valid_27|, t1_funThread1of1ForFork1_init_~p#1.offset=|v_t1_funThread1of1ForFork1_init_~p#1.offset_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_27|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_15|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_5|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_14|, #valid=|v_#valid_27|, t1_funThread1of1ForFork1_init_~p#1.offset=|v_t1_funThread1of1ForFork1_init_~p#1.offset_5|, #memory_int=|v_#memory_int_12|, #length=|v_#length_27|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_14|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_5|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][356], [319#true, 2705#true, 302#true, 1079#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 349#true, t2_funThread1of1ForFork0InUse, 266#L1010-1true, 339#true, t1_funThread1of1ForFork1InUse, 1996#true, 306#true, 1343#true, 225#ULTIMATE.startFINALtrue, 332#true, 1347#true, 680#true, 48#L1042-3true]) [2023-11-30 05:33:34,206 INFO L294 olderBase$Statistics]: this new event has 270 ancestors and is cut-off event [2023-11-30 05:33:34,207 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2023-11-30 05:33:34,207 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2023-11-30 05:33:34,207 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2023-11-30 05:33:35,277 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([893] L1043-52-->L1043-41: Formula: (let ((.cse0 (select |v_#pthreadsMutex_72| |v_~#__global_lock~0.base_31|))) (and (= |v_t2_funThread1of1ForFork0_#t~nondet29#1_1| 0) (= (select .cse0 |v_~#__global_lock~0.offset_31|) 0) (= |v_#pthreadsMutex_71| (store |v_#pthreadsMutex_72| |v_~#__global_lock~0.base_31| (store .cse0 |v_~#__global_lock~0.offset_31| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_72|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_71|, t2_funThread1of1ForFork0_#t~nondet29#1=|v_t2_funThread1of1ForFork0_#t~nondet29#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet29#1][926], [319#true, 2705#true, 302#true, 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 339#true, 1996#true, t1_funThread1of1ForFork1InUse, 263#L1043-41true, 306#true, 225#ULTIMATE.startFINALtrue, 1343#true, 332#true, 1347#true, 680#true, 4467#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 98#L1030-4true]) [2023-11-30 05:33:35,277 INFO L294 olderBase$Statistics]: this new event has 273 ancestors and is cut-off event [2023-11-30 05:33:35,277 INFO L297 olderBase$Statistics]: existing Event has 273 ancestors and is cut-off event [2023-11-30 05:33:35,277 INFO L297 olderBase$Statistics]: existing Event has 273 ancestors and is cut-off event [2023-11-30 05:33:35,277 INFO L297 olderBase$Statistics]: existing Event has 273 ancestors and is cut-off event [2023-11-30 05:33:35,784 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([893] L1043-52-->L1043-41: Formula: (let ((.cse0 (select |v_#pthreadsMutex_72| |v_~#__global_lock~0.base_31|))) (and (= |v_t2_funThread1of1ForFork0_#t~nondet29#1_1| 0) (= (select .cse0 |v_~#__global_lock~0.offset_31|) 0) (= |v_#pthreadsMutex_71| (store |v_#pthreadsMutex_72| |v_~#__global_lock~0.base_31| (store .cse0 |v_~#__global_lock~0.offset_31| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_72|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_71|, t2_funThread1of1ForFork0_#t~nondet29#1=|v_t2_funThread1of1ForFork0_#t~nondet29#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet29#1][926], [278#L1009true, 319#true, 2705#true, 302#true, 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 339#true, t1_funThread1of1ForFork1InUse, 1996#true, 263#L1043-41true, 306#true, 1343#true, 225#ULTIMATE.startFINALtrue, 332#true, 1347#true, 680#true, 4467#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0))]) [2023-11-30 05:33:35,784 INFO L294 olderBase$Statistics]: this new event has 274 ancestors and is cut-off event [2023-11-30 05:33:35,784 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2023-11-30 05:33:35,784 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2023-11-30 05:33:35,784 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2023-11-30 05:33:35,791 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L1043-18-->L1043-7: Formula: (let ((.cse0 (select |v_#pthreadsMutex_32| |v_~#__global_lock~0.base_15|))) (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#__global_lock~0.base_15| (store .cse0 |v_~#__global_lock~0.offset_15| 1))) (= |v_t2_funThread1of1ForFork0_#t~nondet21#1_1| 0) (= (select .cse0 |v_~#__global_lock~0.offset_15|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_15|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, t2_funThread1of1ForFork0_#t~nondet21#1=|v_t2_funThread1of1ForFork0_#t~nondet21#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_15|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_15|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet21#1][925], [9#L1043-7true, 319#true, 2705#true, 302#true, 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 339#true, t1_funThread1of1ForFork1InUse, 1996#true, 306#true, 225#ULTIMATE.startFINALtrue, 1343#true, 332#true, 1347#true, 680#true, 4467#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 98#L1030-4true]) [2023-11-30 05:33:35,791 INFO L294 olderBase$Statistics]: this new event has 274 ancestors and is cut-off event [2023-11-30 05:33:35,791 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2023-11-30 05:33:35,791 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2023-11-30 05:33:35,792 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2023-11-30 05:33:36,102 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([961] L1010-->t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (not (= (select |v_#valid_28| |v_t1_funThread1of1ForFork1_init_~p#1.base_7|) 1)) InVars {#valid=|v_#valid_28|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_7|} OutVars{#valid=|v_#valid_28|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_7|} AuxVars[] AssignedVars[][355], [319#true, 2705#true, 302#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 50#t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 339#true, t1_funThread1of1ForFork1InUse, 1996#true, 306#true, 1343#true, 1347#true, 332#true, 199#L1054-16true, 680#true, 242#t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 05:33:36,102 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2023-11-30 05:33:36,102 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-30 05:33:36,102 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-30 05:33:36,102 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-30 05:33:36,102 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([960] L1010-->L1010-1: Formula: (and (<= 0 |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|) (= (store |v_#memory_$Pointer$.offset_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_$Pointer$.offset_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| (select (select |v_#memory_$Pointer$.offset_14| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|))) |v_#memory_$Pointer$.offset_14|) (= (store |v_#memory_$Pointer$.base_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_$Pointer$.base_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| (select (select |v_#memory_$Pointer$.base_14| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|))) |v_#memory_$Pointer$.base_14|) (= |v_#memory_int_12| (store |v_#memory_int_13| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_int_13| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| 0))) (= (select |v_#valid_27| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) 1) (<= (+ |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| 4) (select |v_#length_27| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_15|, #valid=|v_#valid_27|, t1_funThread1of1ForFork1_init_~p#1.offset=|v_t1_funThread1of1ForFork1_init_~p#1.offset_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_27|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_15|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_5|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_14|, #valid=|v_#valid_27|, t1_funThread1of1ForFork1_init_~p#1.offset=|v_t1_funThread1of1ForFork1_init_~p#1.offset_5|, #memory_int=|v_#memory_int_12|, #length=|v_#length_27|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_14|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_5|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][356], [319#true, 2705#true, 302#true, 1079#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 349#true, t2_funThread1of1ForFork0InUse, 50#t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 266#L1010-1true, 339#true, t1_funThread1of1ForFork1InUse, 1996#true, 306#true, 1343#true, 332#true, 1347#true, 199#L1054-16true, 680#true]) [2023-11-30 05:33:36,103 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2023-11-30 05:33:36,103 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-30 05:33:36,103 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-30 05:33:36,103 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-30 05:33:36,119 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([893] L1043-52-->L1043-41: Formula: (let ((.cse0 (select |v_#pthreadsMutex_72| |v_~#__global_lock~0.base_31|))) (and (= |v_t2_funThread1of1ForFork0_#t~nondet29#1_1| 0) (= (select .cse0 |v_~#__global_lock~0.offset_31|) 0) (= |v_#pthreadsMutex_71| (store |v_#pthreadsMutex_72| |v_~#__global_lock~0.base_31| (store .cse0 |v_~#__global_lock~0.offset_31| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_72|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_71|, t2_funThread1of1ForFork0_#t~nondet29#1=|v_t2_funThread1of1ForFork0_#t~nondet29#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet29#1][959], [319#true, 2705#true, 302#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 339#true, 1996#true, t1_funThread1of1ForFork1InUse, 263#L1043-41true, 306#true, 1343#true, 225#ULTIMATE.startFINALtrue, 1347#true, 332#true, 680#true, 279#L1010true]) [2023-11-30 05:33:36,119 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2023-11-30 05:33:36,119 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-30 05:33:36,119 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-30 05:33:36,119 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-30 05:33:36,124 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L1043-18-->L1043-7: Formula: (let ((.cse0 (select |v_#pthreadsMutex_32| |v_~#__global_lock~0.base_15|))) (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#__global_lock~0.base_15| (store .cse0 |v_~#__global_lock~0.offset_15| 1))) (= |v_t2_funThread1of1ForFork0_#t~nondet21#1_1| 0) (= (select .cse0 |v_~#__global_lock~0.offset_15|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_15|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, t2_funThread1of1ForFork0_#t~nondet21#1=|v_t2_funThread1of1ForFork0_#t~nondet21#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_15|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_15|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet21#1][925], [278#L1009true, 9#L1043-7true, 319#true, 2705#true, 302#true, 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 339#true, t1_funThread1of1ForFork1InUse, 1996#true, 306#true, 1343#true, 225#ULTIMATE.startFINALtrue, 332#true, 1347#true, 680#true, 4467#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0))]) [2023-11-30 05:33:36,124 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2023-11-30 05:33:36,124 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-30 05:33:36,124 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-30 05:33:36,125 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-30 05:33:36,490 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([961] L1010-->t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (not (= (select |v_#valid_28| |v_t1_funThread1of1ForFork1_init_~p#1.base_7|) 1)) InVars {#valid=|v_#valid_28|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_7|} OutVars{#valid=|v_#valid_28|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_7|} AuxVars[] AssignedVars[][355], [319#true, 2705#true, 302#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 339#true, t1_funThread1of1ForFork1InUse, 1996#true, 306#true, 1343#true, 332#true, 1347#true, 199#L1054-16true, 680#true, 242#t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 13#t2_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 05:33:36,490 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2023-11-30 05:33:36,490 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2023-11-30 05:33:36,490 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2023-11-30 05:33:36,490 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2023-11-30 05:33:36,490 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([960] L1010-->L1010-1: Formula: (and (<= 0 |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|) (= (store |v_#memory_$Pointer$.offset_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_$Pointer$.offset_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| (select (select |v_#memory_$Pointer$.offset_14| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|))) |v_#memory_$Pointer$.offset_14|) (= (store |v_#memory_$Pointer$.base_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_$Pointer$.base_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| (select (select |v_#memory_$Pointer$.base_14| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|))) |v_#memory_$Pointer$.base_14|) (= |v_#memory_int_12| (store |v_#memory_int_13| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_int_13| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| 0))) (= (select |v_#valid_27| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) 1) (<= (+ |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| 4) (select |v_#length_27| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_15|, #valid=|v_#valid_27|, t1_funThread1of1ForFork1_init_~p#1.offset=|v_t1_funThread1of1ForFork1_init_~p#1.offset_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_27|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_15|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_5|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_14|, #valid=|v_#valid_27|, t1_funThread1of1ForFork1_init_~p#1.offset=|v_t1_funThread1of1ForFork1_init_~p#1.offset_5|, #memory_int=|v_#memory_int_12|, #length=|v_#length_27|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_14|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_5|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][356], [319#true, 2705#true, 302#true, 1079#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 349#true, t2_funThread1of1ForFork0InUse, 266#L1010-1true, 339#true, t1_funThread1of1ForFork1InUse, 1996#true, 306#true, 1343#true, 1347#true, 332#true, 199#L1054-16true, 680#true, 13#t2_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 05:33:36,490 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2023-11-30 05:33:36,491 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2023-11-30 05:33:36,491 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2023-11-30 05:33:36,491 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2023-11-30 05:33:36,503 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L1043-18-->L1043-7: Formula: (let ((.cse0 (select |v_#pthreadsMutex_32| |v_~#__global_lock~0.base_15|))) (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#__global_lock~0.base_15| (store .cse0 |v_~#__global_lock~0.offset_15| 1))) (= |v_t2_funThread1of1ForFork0_#t~nondet21#1_1| 0) (= (select .cse0 |v_~#__global_lock~0.offset_15|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_15|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, t2_funThread1of1ForFork0_#t~nondet21#1=|v_t2_funThread1of1ForFork0_#t~nondet21#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_15|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_15|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet21#1][958], [9#L1043-7true, 319#true, 2705#true, 302#true, 1079#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 349#true, t2_funThread1of1ForFork0InUse, 339#true, 1996#true, t1_funThread1of1ForFork1InUse, 306#true, 1343#true, 225#ULTIMATE.startFINALtrue, 1347#true, 332#true, 680#true, 279#L1010true]) [2023-11-30 05:33:36,503 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2023-11-30 05:33:36,503 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2023-11-30 05:33:36,503 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2023-11-30 05:33:36,503 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2023-11-30 05:33:37,318 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([961] L1010-->t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (not (= (select |v_#valid_28| |v_t1_funThread1of1ForFork1_init_~p#1.base_7|) 1)) InVars {#valid=|v_#valid_28|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_7|} OutVars{#valid=|v_#valid_28|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_7|} AuxVars[] AssignedVars[][355], [319#true, 2705#true, 302#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 50#t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 339#true, 1996#true, t1_funThread1of1ForFork1InUse, 306#true, 1343#true, 225#ULTIMATE.startFINALtrue, 1347#true, 332#true, 680#true, 242#t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 05:33:37,318 INFO L294 olderBase$Statistics]: this new event has 278 ancestors and is cut-off event [2023-11-30 05:33:37,318 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2023-11-30 05:33:37,318 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2023-11-30 05:33:37,318 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2023-11-30 05:33:37,319 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([960] L1010-->L1010-1: Formula: (and (<= 0 |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|) (= (store |v_#memory_$Pointer$.offset_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_$Pointer$.offset_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| (select (select |v_#memory_$Pointer$.offset_14| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|))) |v_#memory_$Pointer$.offset_14|) (= (store |v_#memory_$Pointer$.base_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_$Pointer$.base_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| (select (select |v_#memory_$Pointer$.base_14| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|))) |v_#memory_$Pointer$.base_14|) (= |v_#memory_int_12| (store |v_#memory_int_13| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_int_13| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| 0))) (= (select |v_#valid_27| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) 1) (<= (+ |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| 4) (select |v_#length_27| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_15|, #valid=|v_#valid_27|, t1_funThread1of1ForFork1_init_~p#1.offset=|v_t1_funThread1of1ForFork1_init_~p#1.offset_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_27|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_15|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_5|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_14|, #valid=|v_#valid_27|, t1_funThread1of1ForFork1_init_~p#1.offset=|v_t1_funThread1of1ForFork1_init_~p#1.offset_5|, #memory_int=|v_#memory_int_12|, #length=|v_#length_27|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_14|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_5|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][356], [319#true, 2705#true, 302#true, 1079#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 349#true, t2_funThread1of1ForFork0InUse, 50#t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 266#L1010-1true, 339#true, 1996#true, t1_funThread1of1ForFork1InUse, 306#true, 225#ULTIMATE.startFINALtrue, 1343#true, 332#true, 1347#true, 680#true]) [2023-11-30 05:33:37,319 INFO L294 olderBase$Statistics]: this new event has 278 ancestors and is cut-off event [2023-11-30 05:33:37,319 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2023-11-30 05:33:37,319 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2023-11-30 05:33:37,319 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2023-11-30 05:33:37,665 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([961] L1010-->t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (not (= (select |v_#valid_28| |v_t1_funThread1of1ForFork1_init_~p#1.base_7|) 1)) InVars {#valid=|v_#valid_28|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_7|} OutVars{#valid=|v_#valid_28|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_7|} AuxVars[] AssignedVars[][355], [319#true, 2705#true, 302#true, 1079#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 349#true, t2_funThread1of1ForFork0InUse, 339#true, 1996#true, t1_funThread1of1ForFork1InUse, 306#true, 1343#true, 225#ULTIMATE.startFINALtrue, 332#true, 1347#true, 680#true, 242#t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 13#t2_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 05:33:37,665 INFO L294 olderBase$Statistics]: this new event has 279 ancestors and is cut-off event [2023-11-30 05:33:37,665 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2023-11-30 05:33:37,666 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2023-11-30 05:33:37,666 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2023-11-30 05:33:37,666 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([960] L1010-->L1010-1: Formula: (and (<= 0 |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|) (= (store |v_#memory_$Pointer$.offset_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_$Pointer$.offset_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| (select (select |v_#memory_$Pointer$.offset_14| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|))) |v_#memory_$Pointer$.offset_14|) (= (store |v_#memory_$Pointer$.base_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_$Pointer$.base_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| (select (select |v_#memory_$Pointer$.base_14| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|))) |v_#memory_$Pointer$.base_14|) (= |v_#memory_int_12| (store |v_#memory_int_13| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_int_13| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| 0))) (= (select |v_#valid_27| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) 1) (<= (+ |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| 4) (select |v_#length_27| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_15|, #valid=|v_#valid_27|, t1_funThread1of1ForFork1_init_~p#1.offset=|v_t1_funThread1of1ForFork1_init_~p#1.offset_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_27|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_15|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_5|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_14|, #valid=|v_#valid_27|, t1_funThread1of1ForFork1_init_~p#1.offset=|v_t1_funThread1of1ForFork1_init_~p#1.offset_5|, #memory_int=|v_#memory_int_12|, #length=|v_#length_27|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_14|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_5|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][356], [319#true, 2705#true, 302#true, 1079#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 349#true, t2_funThread1of1ForFork0InUse, 266#L1010-1true, 339#true, 1996#true, t1_funThread1of1ForFork1InUse, 306#true, 225#ULTIMATE.startFINALtrue, 1343#true, 332#true, 1347#true, 680#true, 13#t2_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 05:33:37,666 INFO L294 olderBase$Statistics]: this new event has 279 ancestors and is cut-off event [2023-11-30 05:33:37,666 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2023-11-30 05:33:37,666 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2023-11-30 05:33:37,666 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2023-11-30 05:33:40,158 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([961] L1010-->t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (not (= (select |v_#valid_28| |v_t1_funThread1of1ForFork1_init_~p#1.base_7|) 1)) InVars {#valid=|v_#valid_28|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_7|} OutVars{#valid=|v_#valid_28|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_7|} AuxVars[] AssignedVars[][355], [319#true, 2705#true, 302#true, 88#L1043-50true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 339#true, t1_funThread1of1ForFork1InUse, 1996#true, 306#true, 1343#true, 225#ULTIMATE.startFINALtrue, 1347#true, 332#true, 680#true, 242#t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 05:33:40,158 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2023-11-30 05:33:40,158 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2023-11-30 05:33:40,158 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2023-11-30 05:33:40,158 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2023-11-30 05:33:40,159 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([960] L1010-->L1010-1: Formula: (and (<= 0 |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|) (= (store |v_#memory_$Pointer$.offset_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_$Pointer$.offset_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| (select (select |v_#memory_$Pointer$.offset_14| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|))) |v_#memory_$Pointer$.offset_14|) (= (store |v_#memory_$Pointer$.base_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_$Pointer$.base_15| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| (select (select |v_#memory_$Pointer$.base_14| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5|))) |v_#memory_$Pointer$.base_14|) (= |v_#memory_int_12| (store |v_#memory_int_13| |v_t1_funThread1of1ForFork1_init_~p#1.base_5| (store (select |v_#memory_int_13| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| 0))) (= (select |v_#valid_27| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|) 1) (<= (+ |v_t1_funThread1of1ForFork1_init_~p#1.offset_5| 4) (select |v_#length_27| |v_t1_funThread1of1ForFork1_init_~p#1.base_5|))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_15|, #valid=|v_#valid_27|, t1_funThread1of1ForFork1_init_~p#1.offset=|v_t1_funThread1of1ForFork1_init_~p#1.offset_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_27|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_15|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_5|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_14|, #valid=|v_#valid_27|, t1_funThread1of1ForFork1_init_~p#1.offset=|v_t1_funThread1of1ForFork1_init_~p#1.offset_5|, #memory_int=|v_#memory_int_12|, #length=|v_#length_27|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_14|, t1_funThread1of1ForFork1_init_~p#1.base=|v_t1_funThread1of1ForFork1_init_~p#1.base_5|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][356], [319#true, 2705#true, 302#true, 88#L1043-50true, 1079#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 349#true, t2_funThread1of1ForFork0InUse, 266#L1010-1true, 339#true, t1_funThread1of1ForFork1InUse, 1996#true, 306#true, 1343#true, 225#ULTIMATE.startFINALtrue, 332#true, 1347#true, 680#true]) [2023-11-30 05:33:40,159 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2023-11-30 05:33:40,159 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2023-11-30 05:33:40,159 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2023-11-30 05:33:40,159 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2023-11-30 05:33:40,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([881] L1043-55-->L1044-2: Formula: (and (= |v_t2_funThread1of1ForFork0_#t~nondet32#1_1| 0) (= |v_#pthreadsMutex_63| (store |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8| (store (select |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8|) (+ |v_~#mutexes~0.offset_7| (* |v_t2_funThread1of1ForFork0_~i~1#1_7| 24)) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_64|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_63|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|, t2_funThread1of1ForFork0_#t~nondet32#1=|v_t2_funThread1of1ForFork0_#t~nondet32#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet32#1][1300], [319#true, 2705#true, 302#true, 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 339#true, 1996#true, t1_funThread1of1ForFork1InUse, 54#L1044-2true, 306#true, 1343#true, 225#ULTIMATE.startFINALtrue, 332#true, 1347#true, 680#true, 4467#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 98#L1030-4true]) [2023-11-30 05:33:40,687 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2023-11-30 05:33:40,687 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2023-11-30 05:33:40,687 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2023-11-30 05:33:40,687 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2023-11-30 05:33:40,981 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([881] L1043-55-->L1044-2: Formula: (and (= |v_t2_funThread1of1ForFork0_#t~nondet32#1_1| 0) (= |v_#pthreadsMutex_63| (store |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8| (store (select |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8|) (+ |v_~#mutexes~0.offset_7| (* |v_t2_funThread1of1ForFork0_~i~1#1_7| 24)) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_64|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_63|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|, t2_funThread1of1ForFork0_#t~nondet32#1=|v_t2_funThread1of1ForFork0_#t~nondet32#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet32#1][1300], [278#L1009true, 319#true, 2705#true, 302#true, 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 339#true, 1996#true, t1_funThread1of1ForFork1InUse, 54#L1044-2true, 306#true, 1343#true, 225#ULTIMATE.startFINALtrue, 332#true, 1347#true, 680#true, 4467#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0))]) [2023-11-30 05:33:40,982 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2023-11-30 05:33:40,982 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2023-11-30 05:33:40,982 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2023-11-30 05:33:40,982 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2023-11-30 05:33:41,307 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([881] L1043-55-->L1044-2: Formula: (and (= |v_t2_funThread1of1ForFork0_#t~nondet32#1_1| 0) (= |v_#pthreadsMutex_63| (store |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8| (store (select |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8|) (+ |v_~#mutexes~0.offset_7| (* |v_t2_funThread1of1ForFork0_~i~1#1_7| 24)) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_64|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_63|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|, t2_funThread1of1ForFork0_#t~nondet32#1=|v_t2_funThread1of1ForFork0_#t~nondet32#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet32#1][1342], [319#true, 2705#true, 302#true, 1079#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 349#true, t2_funThread1of1ForFork0InUse, 339#true, 1996#true, t1_funThread1of1ForFork1InUse, 54#L1044-2true, 306#true, 1343#true, 225#ULTIMATE.startFINALtrue, 1347#true, 332#true, 680#true, 279#L1010true]) [2023-11-30 05:33:41,307 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2023-11-30 05:33:41,307 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2023-11-30 05:33:41,307 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2023-11-30 05:33:41,307 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2023-11-30 05:33:41,916 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([881] L1043-55-->L1044-2: Formula: (and (= |v_t2_funThread1of1ForFork0_#t~nondet32#1_1| 0) (= |v_#pthreadsMutex_63| (store |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8| (store (select |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8|) (+ |v_~#mutexes~0.offset_7| (* |v_t2_funThread1of1ForFork0_~i~1#1_7| 24)) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_64|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_63|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|, t2_funThread1of1ForFork0_#t~nondet32#1=|v_t2_funThread1of1ForFork0_#t~nondet32#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet32#1][1342], [319#true, 2705#true, 302#true, 1079#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 349#true, t2_funThread1of1ForFork0InUse, 339#true, t1_funThread1of1ForFork1InUse, 1996#true, 54#L1044-2true, 306#true, 1343#true, 332#true, 1347#true, 199#L1054-16true, 680#true, 279#L1010true]) [2023-11-30 05:33:41,916 INFO L294 olderBase$Statistics]: this new event has 295 ancestors and is cut-off event [2023-11-30 05:33:41,917 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2023-11-30 05:33:41,917 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2023-11-30 05:33:41,917 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2023-11-30 05:33:41,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([881] L1043-55-->L1044-2: Formula: (and (= |v_t2_funThread1of1ForFork0_#t~nondet32#1_1| 0) (= |v_#pthreadsMutex_63| (store |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8| (store (select |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8|) (+ |v_~#mutexes~0.offset_7| (* |v_t2_funThread1of1ForFork0_~i~1#1_7| 24)) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_64|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_63|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|, t2_funThread1of1ForFork0_#t~nondet32#1=|v_t2_funThread1of1ForFork0_#t~nondet32#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet32#1][1300], [319#true, 2705#true, 302#true, 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 339#true, t1_funThread1of1ForFork1InUse, 1996#true, 54#L1044-2true, 306#true, 1343#true, 1347#true, 332#true, 199#L1054-16true, 680#true, 98#L1030-4true, 4467#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0))]) [2023-11-30 05:33:41,917 INFO L294 olderBase$Statistics]: this new event has 293 ancestors and is cut-off event [2023-11-30 05:33:41,917 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2023-11-30 05:33:41,917 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2023-11-30 05:33:41,917 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2023-11-30 05:33:41,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([881] L1043-55-->L1044-2: Formula: (and (= |v_t2_funThread1of1ForFork0_#t~nondet32#1_1| 0) (= |v_#pthreadsMutex_63| (store |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8| (store (select |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8|) (+ |v_~#mutexes~0.offset_7| (* |v_t2_funThread1of1ForFork0_~i~1#1_7| 24)) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_64|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_63|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|, t2_funThread1of1ForFork0_#t~nondet32#1=|v_t2_funThread1of1ForFork0_#t~nondet32#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet32#1][1300], [278#L1009true, 319#true, 2705#true, 302#true, 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 339#true, t1_funThread1of1ForFork1InUse, 1996#true, 54#L1044-2true, 306#true, 1343#true, 332#true, 1347#true, 199#L1054-16true, 680#true, 4467#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0))]) [2023-11-30 05:33:41,917 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is cut-off event [2023-11-30 05:33:41,917 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2023-11-30 05:33:41,917 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2023-11-30 05:33:41,917 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2023-11-30 05:33:41,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([881] L1043-55-->L1044-2: Formula: (and (= |v_t2_funThread1of1ForFork0_#t~nondet32#1_1| 0) (= |v_#pthreadsMutex_63| (store |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8| (store (select |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8|) (+ |v_~#mutexes~0.offset_7| (* |v_t2_funThread1of1ForFork0_~i~1#1_7| 24)) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_64|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_63|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|, t2_funThread1of1ForFork0_#t~nondet32#1=|v_t2_funThread1of1ForFork0_#t~nondet32#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet32#1][1267], [319#true, 2705#true, 302#true, 1079#true, 349#true, 133#L1030-3true, t2_funThread1of1ForFork0InUse, 339#true, t1_funThread1of1ForFork1InUse, 1996#true, 54#L1044-2true, 306#true, 1343#true, 1347#true, 332#true, 199#L1054-16true, 680#true, 4449#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0))]) [2023-11-30 05:33:41,918 INFO L294 olderBase$Statistics]: this new event has 292 ancestors and is cut-off event [2023-11-30 05:33:41,918 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2023-11-30 05:33:41,918 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2023-11-30 05:33:41,918 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2023-11-30 05:33:42,391 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([881] L1043-55-->L1044-2: Formula: (and (= |v_t2_funThread1of1ForFork0_#t~nondet32#1_1| 0) (= |v_#pthreadsMutex_63| (store |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8| (store (select |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8|) (+ |v_~#mutexes~0.offset_7| (* |v_t2_funThread1of1ForFork0_~i~1#1_7| 24)) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_64|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_63|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|, t2_funThread1of1ForFork0_#t~nondet32#1=|v_t2_funThread1of1ForFork0_#t~nondet32#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet32#1][1217], [278#L1009true, 319#true, 302#true, 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 2708#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 339#true, 1996#true, t1_funThread1of1ForFork1InUse, 54#L1044-2true, 306#true, 683#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 1343#true, 1347#true, 332#true, 199#L1054-16true, 4467#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0))]) [2023-11-30 05:33:42,391 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is cut-off event [2023-11-30 05:33:42,391 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2023-11-30 05:33:42,391 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2023-11-30 05:33:42,391 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2023-11-30 05:33:42,391 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([881] L1043-55-->L1044-2: Formula: (and (= |v_t2_funThread1of1ForFork0_#t~nondet32#1_1| 0) (= |v_#pthreadsMutex_63| (store |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8| (store (select |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8|) (+ |v_~#mutexes~0.offset_7| (* |v_t2_funThread1of1ForFork0_~i~1#1_7| 24)) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_64|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_63|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|, t2_funThread1of1ForFork0_#t~nondet32#1=|v_t2_funThread1of1ForFork0_#t~nondet32#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet32#1][1217], [278#L1009true, 319#true, 302#true, 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 2708#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 339#true, t1_funThread1of1ForFork1InUse, 1996#true, 54#L1044-2true, 683#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 306#true, 1343#true, 332#true, 1347#true, 4467#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 202#L1054-15true]) [2023-11-30 05:33:42,392 INFO L294 olderBase$Statistics]: this new event has 293 ancestors and is cut-off event [2023-11-30 05:33:42,392 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2023-11-30 05:33:42,392 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2023-11-30 05:33:42,392 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2023-11-30 05:33:42,393 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([881] L1043-55-->L1044-2: Formula: (and (= |v_t2_funThread1of1ForFork0_#t~nondet32#1_1| 0) (= |v_#pthreadsMutex_63| (store |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8| (store (select |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8|) (+ |v_~#mutexes~0.offset_7| (* |v_t2_funThread1of1ForFork0_~i~1#1_7| 24)) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_64|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_63|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|, t2_funThread1of1ForFork0_#t~nondet32#1=|v_t2_funThread1of1ForFork0_#t~nondet32#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet32#1][1219], [319#true, 302#true, 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 2708#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 133#L1030-3true, 339#true, t1_funThread1of1ForFork1InUse, 1996#true, 54#L1044-2true, 306#true, 683#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 1343#true, 1347#true, 332#true, 199#L1054-16true, 4449#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0))]) [2023-11-30 05:33:42,393 INFO L294 olderBase$Statistics]: this new event has 292 ancestors and is cut-off event [2023-11-30 05:33:42,393 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2023-11-30 05:33:42,393 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2023-11-30 05:33:42,393 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2023-11-30 05:33:42,718 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([881] L1043-55-->L1044-2: Formula: (and (= |v_t2_funThread1of1ForFork0_#t~nondet32#1_1| 0) (= |v_#pthreadsMutex_63| (store |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8| (store (select |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8|) (+ |v_~#mutexes~0.offset_7| (* |v_t2_funThread1of1ForFork0_~i~1#1_7| 24)) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_64|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_63|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|, t2_funThread1of1ForFork0_#t~nondet32#1=|v_t2_funThread1of1ForFork0_#t~nondet32#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet32#1][1217], [278#L1009true, 319#true, 302#true, 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 2708#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 339#true, 1996#true, t1_funThread1of1ForFork1InUse, 54#L1044-2true, 306#true, 683#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 225#ULTIMATE.startFINALtrue, 1343#true, 332#true, 1347#true, 4467#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0))]) [2023-11-30 05:33:42,719 INFO L294 olderBase$Statistics]: this new event has 297 ancestors and is cut-off event [2023-11-30 05:33:42,719 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2023-11-30 05:33:42,719 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2023-11-30 05:33:42,719 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2023-11-30 05:33:43,084 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([881] L1043-55-->L1044-2: Formula: (and (= |v_t2_funThread1of1ForFork0_#t~nondet32#1_1| 0) (= |v_#pthreadsMutex_63| (store |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8| (store (select |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8|) (+ |v_~#mutexes~0.offset_7| (* |v_t2_funThread1of1ForFork0_~i~1#1_7| 24)) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_64|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_63|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|, t2_funThread1of1ForFork0_#t~nondet32#1=|v_t2_funThread1of1ForFork0_#t~nondet32#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet32#1][1342], [319#true, 2705#true, 302#true, 1079#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 349#true, t2_funThread1of1ForFork0InUse, 339#true, t1_funThread1of1ForFork1InUse, 1996#true, 54#L1044-2true, 306#true, 1343#true, 225#ULTIMATE.startFINALtrue, 332#true, 1347#true, 680#true, 279#L1010true]) [2023-11-30 05:33:43,085 INFO L294 olderBase$Statistics]: this new event has 298 ancestors and is cut-off event [2023-11-30 05:33:43,085 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2023-11-30 05:33:43,085 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2023-11-30 05:33:43,085 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2023-11-30 05:33:43,085 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2023-11-30 05:33:43,085 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([881] L1043-55-->L1044-2: Formula: (and (= |v_t2_funThread1of1ForFork0_#t~nondet32#1_1| 0) (= |v_#pthreadsMutex_63| (store |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8| (store (select |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8|) (+ |v_~#mutexes~0.offset_7| (* |v_t2_funThread1of1ForFork0_~i~1#1_7| 24)) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_64|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_63|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|, t2_funThread1of1ForFork0_#t~nondet32#1=|v_t2_funThread1of1ForFork0_#t~nondet32#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet32#1][1300], [278#L1009true, 319#true, 2705#true, 302#true, 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 339#true, 1996#true, t1_funThread1of1ForFork1InUse, 54#L1044-2true, 306#true, 1343#true, 225#ULTIMATE.startFINALtrue, 1347#true, 332#true, 680#true, 4467#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0))]) [2023-11-30 05:33:43,085 INFO L294 olderBase$Statistics]: this new event has 297 ancestors and is cut-off event [2023-11-30 05:33:43,085 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2023-11-30 05:33:43,086 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2023-11-30 05:33:43,086 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2023-11-30 05:33:43,086 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2023-11-30 05:33:43,086 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([881] L1043-55-->L1044-2: Formula: (and (= |v_t2_funThread1of1ForFork0_#t~nondet32#1_1| 0) (= |v_#pthreadsMutex_63| (store |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8| (store (select |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8|) (+ |v_~#mutexes~0.offset_7| (* |v_t2_funThread1of1ForFork0_~i~1#1_7| 24)) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_64|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_63|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|, t2_funThread1of1ForFork0_#t~nondet32#1=|v_t2_funThread1of1ForFork0_#t~nondet32#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet32#1][1300], [319#true, 2705#true, 302#true, 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 339#true, t1_funThread1of1ForFork1InUse, 1996#true, 54#L1044-2true, 306#true, 225#ULTIMATE.startFINALtrue, 1343#true, 1347#true, 332#true, 680#true, 4467#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 98#L1030-4true]) [2023-11-30 05:33:43,086 INFO L294 olderBase$Statistics]: this new event has 296 ancestors and is cut-off event [2023-11-30 05:33:43,086 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2023-11-30 05:33:43,086 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2023-11-30 05:33:43,086 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2023-11-30 05:33:43,100 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2023-11-30 05:33:43,100 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([881] L1043-55-->L1044-2: Formula: (and (= |v_t2_funThread1of1ForFork0_#t~nondet32#1_1| 0) (= |v_#pthreadsMutex_63| (store |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8| (store (select |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8|) (+ |v_~#mutexes~0.offset_7| (* |v_t2_funThread1of1ForFork0_~i~1#1_7| 24)) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_64|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_63|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|, t2_funThread1of1ForFork0_#t~nondet32#1=|v_t2_funThread1of1ForFork0_#t~nondet32#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet32#1][1267], [319#true, 2705#true, 302#true, 1079#true, 349#true, 133#L1030-3true, t2_funThread1of1ForFork0InUse, 339#true, t1_funThread1of1ForFork1InUse, 1996#true, 54#L1044-2true, 306#true, 1343#true, 225#ULTIMATE.startFINALtrue, 332#true, 1347#true, 680#true, 4449#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0))]) [2023-11-30 05:33:43,100 INFO L294 olderBase$Statistics]: this new event has 295 ancestors and is cut-off event [2023-11-30 05:33:43,100 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2023-11-30 05:33:43,100 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2023-11-30 05:33:43,100 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2023-11-30 05:33:43,336 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([881] L1043-55-->L1044-2: Formula: (and (= |v_t2_funThread1of1ForFork0_#t~nondet32#1_1| 0) (= |v_#pthreadsMutex_63| (store |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8| (store (select |v_#pthreadsMutex_64| |v_~#mutexes~0.base_8|) (+ |v_~#mutexes~0.offset_7| (* |v_t2_funThread1of1ForFork0_~i~1#1_7| 24)) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_64|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_63|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_7|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|, t2_funThread1of1ForFork0_#t~nondet32#1=|v_t2_funThread1of1ForFork0_#t~nondet32#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet32#1][1219], [319#true, 302#true, 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 133#L1030-3true, 2708#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 339#true, t1_funThread1of1ForFork1InUse, 1996#true, 54#L1044-2true, 683#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 306#true, 1343#true, 225#ULTIMATE.startFINALtrue, 1347#true, 332#true, 4449#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0))]) [2023-11-30 05:33:43,336 INFO L294 olderBase$Statistics]: this new event has 295 ancestors and is cut-off event [2023-11-30 05:33:43,336 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2023-11-30 05:33:43,337 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2023-11-30 05:33:43,337 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2023-11-30 05:33:59,060 INFO L124 PetriNetUnfolderBase]: 54813/121014 cut-off events. [2023-11-30 05:33:59,060 INFO L125 PetriNetUnfolderBase]: For 1503097/1729694 co-relation queries the response was YES. [2023-11-30 05:33:59,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838263 conditions, 121014 events. 54813/121014 cut-off events. For 1503097/1729694 co-relation queries the response was YES. Maximal size of possible extension queue 3147. Compared 1517038 event pairs, 9251 based on Foata normal form. 6728/122207 useless extension candidates. Maximal degree in co-relation 591897. Up to 60532 conditions per place. [2023-11-30 05:34:00,781 INFO L140 encePairwiseOnDemand]: 314/323 looper letters, 1189 selfloop transitions, 14 changer transitions 0/1641 dead transitions. [2023-11-30 05:34:00,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 1641 transitions, 31460 flow [2023-11-30 05:34:00,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 05:34:00,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 05:34:00,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1815 transitions. [2023-11-30 05:34:00,783 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8027421494913755 [2023-11-30 05:34:00,783 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1815 transitions. [2023-11-30 05:34:00,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1815 transitions. [2023-11-30 05:34:00,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:34:00,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1815 transitions. [2023-11-30 05:34:00,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 259.2857142857143) internal successors, (1815), 7 states have internal predecessors, (1815), 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 05:34:00,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 323.0) internal successors, (2584), 8 states have internal predecessors, (2584), 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 05:34:00,786 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 323.0) internal successors, (2584), 8 states have internal predecessors, (2584), 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 05:34:00,786 INFO L307 CegarLoopForPetriNet]: 299 programPoint places, 180 predicate places. [2023-11-30 05:34:00,787 INFO L500 AbstractCegarLoop]: Abstraction has has 479 places, 1641 transitions, 31460 flow [2023-11-30 05:34:00,787 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 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 05:34:00,787 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:34:00,787 INFO L232 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:34:00,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-30 05:34:00,991 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:34:00,991 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-30 05:34:00,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:34:00,992 INFO L85 PathProgramCache]: Analyzing trace with hash 428885597, now seen corresponding path program 1 times [2023-11-30 05:34:00,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:34:00,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354430301] [2023-11-30 05:34:00,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:34:00,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:34:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:34:01,305 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2023-11-30 05:34:01,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:34:01,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354430301] [2023-11-30 05:34:01,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354430301] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:34:01,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:34:01,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 05:34:01,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111700309] [2023-11-30 05:34:01,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:34:01,307 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 05:34:01,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:34:01,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 05:34:01,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-30 05:34:01,309 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 323 [2023-11-30 05:34:01,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 1641 transitions, 31460 flow. Second operand has 6 states, 6 states have (on average 221.5) internal successors, (1329), 6 states have internal predecessors, (1329), 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 05:34:01,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:34:01,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 323 [2023-11-30 05:34:01,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:34:07,590 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([847] L1017-18-->t2_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (or (< (+ |v_t2_funThread1of1ForFork0_take_~p~0#1.offset_7| 4) 0) (< (select |v_#length_4| |v_t2_funThread1of1ForFork0_take_~p~0#1.base_9|) (+ |v_t2_funThread1of1ForFork0_take_~p~0#1.offset_7| 8))) InVars {#length=|v_#length_4|, t2_funThread1of1ForFork0_take_~p~0#1.offset=|v_t2_funThread1of1ForFork0_take_~p~0#1.offset_7|, t2_funThread1of1ForFork0_take_~p~0#1.base=|v_t2_funThread1of1ForFork0_take_~p~0#1.base_9|} OutVars{#length=|v_#length_4|, t2_funThread1of1ForFork0_take_~p~0#1.offset=|v_t2_funThread1of1ForFork0_take_~p~0#1.offset_7|, t2_funThread1of1ForFork0_take_~p~0#1.base=|v_t2_funThread1of1ForFork0_take_~p~0#1.base_9|} AuxVars[] AssignedVars[][778], [278#L1009true, 319#true, 2705#true, 302#true, 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 339#true, t1_funThread1of1ForFork1InUse, 97#t2_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 1996#true, 306#true, 1343#true, 337#(= (select |#valid| |~#buckets~0.base|) 1), 4483#(and (= (select |#valid| |t1_funThread1of1ForFork1_~p~1#1.base|) 1) (= (select |#valid| |t1_funThread1of1ForFork1_init_#in~p#1.base|) 1)), 1347#true, 680#true, 4467#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 202#L1054-15true]) [2023-11-30 05:34:07,590 INFO L294 olderBase$Statistics]: this new event has 258 ancestors and is cut-off event [2023-11-30 05:34:07,591 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2023-11-30 05:34:07,591 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2023-11-30 05:34:07,591 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2023-11-30 05:34:07,591 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([845] L1017-18-->L1017-1: Formula: (let ((.cse0 (+ |v_t2_funThread1of1ForFork0_take_~p~0#1.offset_5| 4))) (and (<= 0 .cse0) (= (select |v_#valid_3| |v_t2_funThread1of1ForFork0_take_~p~0#1.base_5|) 1) (= |v_t2_funThread1of1ForFork0_take_#t~mem4#1.base_3| (select (select |v_#memory_$Pointer$.base_2| |v_t2_funThread1of1ForFork0_take_~p~0#1.base_5|) .cse0)) (<= (+ |v_t2_funThread1of1ForFork0_take_~p~0#1.offset_5| 8) (select |v_#length_3| |v_t2_funThread1of1ForFork0_take_~p~0#1.base_5|)) (= |v_t2_funThread1of1ForFork0_take_#t~mem4#1.offset_3| (select (select |v_#memory_$Pointer$.offset_2| |v_t2_funThread1of1ForFork0_take_~p~0#1.base_5|) .cse0)))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_2|, #valid=|v_#valid_3|, #length=|v_#length_3|, t2_funThread1of1ForFork0_take_~p~0#1.offset=|v_t2_funThread1of1ForFork0_take_~p~0#1.offset_5|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_2|, t2_funThread1of1ForFork0_take_~p~0#1.base=|v_t2_funThread1of1ForFork0_take_~p~0#1.base_5|} OutVars{t2_funThread1of1ForFork0_take_#t~mem4#1.offset=|v_t2_funThread1of1ForFork0_take_#t~mem4#1.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_2|, #valid=|v_#valid_3|, #length=|v_#length_3|, t2_funThread1of1ForFork0_take_~p~0#1.offset=|v_t2_funThread1of1ForFork0_take_~p~0#1.offset_5|, t2_funThread1of1ForFork0_take_#t~mem4#1.base=|v_t2_funThread1of1ForFork0_take_#t~mem4#1.base_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_2|, t2_funThread1of1ForFork0_take_~p~0#1.base=|v_t2_funThread1of1ForFork0_take_~p~0#1.base_5|} AuxVars[] AssignedVars[t2_funThread1of1ForFork0_take_#t~mem4#1.offset, t2_funThread1of1ForFork0_take_#t~mem4#1.base][806], [278#L1009true, 319#true, 2705#true, 302#true, 1079#true, 286#L1017-1true, 349#true, t2_funThread1of1ForFork0InUse, 339#true, t1_funThread1of1ForFork1InUse, 1996#true, 306#true, 337#(= (select |#valid| |~#buckets~0.base|) 1), 1343#true, 4483#(and (= (select |#valid| |t1_funThread1of1ForFork1_~p~1#1.base|) 1) (= (select |#valid| |t1_funThread1of1ForFork1_init_#in~p#1.base|) 1)), 1347#true, 680#true, 4467#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 202#L1054-15true]) [2023-11-30 05:34:07,591 INFO L294 olderBase$Statistics]: this new event has 258 ancestors and is cut-off event [2023-11-30 05:34:07,591 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2023-11-30 05:34:07,591 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2023-11-30 05:34:07,591 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2023-11-30 05:34:07,591 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([846] L1017-18-->t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (not (= (select |v_#valid_4| |v_t2_funThread1of1ForFork0_take_~p~0#1.base_7|) 1)) InVars {#valid=|v_#valid_4|, t2_funThread1of1ForFork0_take_~p~0#1.base=|v_t2_funThread1of1ForFork0_take_~p~0#1.base_7|} OutVars{#valid=|v_#valid_4|, t2_funThread1of1ForFork0_take_~p~0#1.base=|v_t2_funThread1of1ForFork0_take_~p~0#1.base_7|} AuxVars[] AssignedVars[][826], [4485#(and (= (select |#valid| |t1_funThread1of1ForFork1_~p~1#1.base|) 1) (= (select |#valid| |t1_funThread1of1ForFork1_init_~p#1.base|) 1) (= (select |#valid| |t1_funThread1of1ForFork1_init_#in~p#1.base|) 1)), 319#true, 2705#true, 302#true, 1079#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 349#true, t2_funThread1of1ForFork0InUse, 339#true, t1_funThread1of1ForFork1InUse, 1996#true, 306#true, 337#(= (select |#valid| |~#buckets~0.base|) 1), 1343#true, 34#t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 1347#true, 680#true, 279#L1010true, 202#L1054-15true]) [2023-11-30 05:34:07,591 INFO L294 olderBase$Statistics]: this new event has 259 ancestors and is cut-off event [2023-11-30 05:34:07,591 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-30 05:34:07,591 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-30 05:34:07,591 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-30 05:34:07,591 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([846] L1017-18-->t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (not (= (select |v_#valid_4| |v_t2_funThread1of1ForFork0_take_~p~0#1.base_7|) 1)) InVars {#valid=|v_#valid_4|, t2_funThread1of1ForFork0_take_~p~0#1.base=|v_t2_funThread1of1ForFork0_take_~p~0#1.base_7|} OutVars{#valid=|v_#valid_4|, t2_funThread1of1ForFork0_take_~p~0#1.base=|v_t2_funThread1of1ForFork0_take_~p~0#1.base_7|} AuxVars[] AssignedVars[][808], [278#L1009true, 319#true, 2705#true, 302#true, 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 339#true, t1_funThread1of1ForFork1InUse, 1996#true, 306#true, 34#t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 337#(= (select |#valid| |~#buckets~0.base|) 1), 1343#true, 4483#(and (= (select |#valid| |t1_funThread1of1ForFork1_~p~1#1.base|) 1) (= (select |#valid| |t1_funThread1of1ForFork1_init_#in~p#1.base|) 1)), 1347#true, 680#true, 4467#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 202#L1054-15true]) [2023-11-30 05:34:07,591 INFO L294 olderBase$Statistics]: this new event has 258 ancestors and is cut-off event [2023-11-30 05:34:07,591 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2023-11-30 05:34:07,592 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2023-11-30 05:34:07,592 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2023-11-30 05:34:07,592 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([845] L1017-18-->L1017-1: Formula: (let ((.cse0 (+ |v_t2_funThread1of1ForFork0_take_~p~0#1.offset_5| 4))) (and (<= 0 .cse0) (= (select |v_#valid_3| |v_t2_funThread1of1ForFork0_take_~p~0#1.base_5|) 1) (= |v_t2_funThread1of1ForFork0_take_#t~mem4#1.base_3| (select (select |v_#memory_$Pointer$.base_2| |v_t2_funThread1of1ForFork0_take_~p~0#1.base_5|) .cse0)) (<= (+ |v_t2_funThread1of1ForFork0_take_~p~0#1.offset_5| 8) (select |v_#length_3| |v_t2_funThread1of1ForFork0_take_~p~0#1.base_5|)) (= |v_t2_funThread1of1ForFork0_take_#t~mem4#1.offset_3| (select (select |v_#memory_$Pointer$.offset_2| |v_t2_funThread1of1ForFork0_take_~p~0#1.base_5|) .cse0)))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_2|, #valid=|v_#valid_3|, #length=|v_#length_3|, t2_funThread1of1ForFork0_take_~p~0#1.offset=|v_t2_funThread1of1ForFork0_take_~p~0#1.offset_5|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_2|, t2_funThread1of1ForFork0_take_~p~0#1.base=|v_t2_funThread1of1ForFork0_take_~p~0#1.base_5|} OutVars{t2_funThread1of1ForFork0_take_#t~mem4#1.offset=|v_t2_funThread1of1ForFork0_take_#t~mem4#1.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_2|, #valid=|v_#valid_3|, #length=|v_#length_3|, t2_funThread1of1ForFork0_take_~p~0#1.offset=|v_t2_funThread1of1ForFork0_take_~p~0#1.offset_5|, t2_funThread1of1ForFork0_take_#t~mem4#1.base=|v_t2_funThread1of1ForFork0_take_#t~mem4#1.base_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_2|, t2_funThread1of1ForFork0_take_~p~0#1.base=|v_t2_funThread1of1ForFork0_take_~p~0#1.base_5|} AuxVars[] AssignedVars[t2_funThread1of1ForFork0_take_#t~mem4#1.offset, t2_funThread1of1ForFork0_take_#t~mem4#1.base][827], [4485#(and (= (select |#valid| |t1_funThread1of1ForFork1_~p~1#1.base|) 1) (= (select |#valid| |t1_funThread1of1ForFork1_init_~p#1.base|) 1) (= (select |#valid| |t1_funThread1of1ForFork1_init_#in~p#1.base|) 1)), 319#true, 2705#true, 302#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 1079#true, 286#L1017-1true, 349#true, t2_funThread1of1ForFork0InUse, 339#true, t1_funThread1of1ForFork1InUse, 1996#true, 306#true, 1343#true, 337#(= (select |#valid| |~#buckets~0.base|) 1), 1347#true, 680#true, 279#L1010true, 202#L1054-15true]) [2023-11-30 05:34:07,592 INFO L294 olderBase$Statistics]: this new event has 259 ancestors and is cut-off event [2023-11-30 05:34:07,592 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-30 05:34:07,592 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-30 05:34:07,592 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-30 05:34:07,592 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([847] L1017-18-->t2_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (or (< (+ |v_t2_funThread1of1ForFork0_take_~p~0#1.offset_7| 4) 0) (< (select |v_#length_4| |v_t2_funThread1of1ForFork0_take_~p~0#1.base_9|) (+ |v_t2_funThread1of1ForFork0_take_~p~0#1.offset_7| 8))) InVars {#length=|v_#length_4|, t2_funThread1of1ForFork0_take_~p~0#1.offset=|v_t2_funThread1of1ForFork0_take_~p~0#1.offset_7|, t2_funThread1of1ForFork0_take_~p~0#1.base=|v_t2_funThread1of1ForFork0_take_~p~0#1.base_9|} OutVars{#length=|v_#length_4|, t2_funThread1of1ForFork0_take_~p~0#1.offset=|v_t2_funThread1of1ForFork0_take_~p~0#1.offset_7|, t2_funThread1of1ForFork0_take_~p~0#1.base=|v_t2_funThread1of1ForFork0_take_~p~0#1.base_9|} AuxVars[] AssignedVars[][828], [4485#(and (= (select |#valid| |t1_funThread1of1ForFork1_~p~1#1.base|) 1) (= (select |#valid| |t1_funThread1of1ForFork1_init_~p#1.base|) 1) (= (select |#valid| |t1_funThread1of1ForFork1_init_#in~p#1.base|) 1)), 319#true, 2705#true, 302#true, 4469#(and (<= 8 (select |#length| |t1_funThread1of1ForFork1_~p~1#1.base|)) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_#in~p#1.base|)) (= |t1_funThread1of1ForFork1_init_~p#1.offset| 0) (<= 8 (select |#length| |t1_funThread1of1ForFork1_init_~p#1.base|)) (= |t1_funThread1of1ForFork1_init_#in~p#1.offset| 0) (= |t1_funThread1of1ForFork1_~p~1#1.offset| 0)), 1079#true, 349#true, t2_funThread1of1ForFork0InUse, 339#true, t1_funThread1of1ForFork1InUse, 97#t2_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 1996#true, 306#true, 1343#true, 337#(= (select |#valid| |~#buckets~0.base|) 1), 1347#true, 680#true, 279#L1010true, 202#L1054-15true]) [2023-11-30 05:34:07,592 INFO L294 olderBase$Statistics]: this new event has 259 ancestors and is cut-off event [2023-11-30 05:34:07,592 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-30 05:34:07,593 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-30 05:34:07,600 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-30 05:34:49,515 INFO L124 PetriNetUnfolderBase]: 65058/152200 cut-off events. [2023-11-30 05:34:49,515 INFO L125 PetriNetUnfolderBase]: For 1902548/2080013 co-relation queries the response was YES. [2023-11-30 05:34:50,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040164 conditions, 152200 events. 65058/152200 cut-off events. For 1902548/2080013 co-relation queries the response was YES. Maximal size of possible extension queue 3604. Compared 1964197 event pairs, 23867 based on Foata normal form. 3747/149398 useless extension candidates. Maximal degree in co-relation 776091. Up to 68134 conditions per place. [2023-11-30 05:34:51,906 INFO L140 encePairwiseOnDemand]: 310/323 looper letters, 1536 selfloop transitions, 50 changer transitions 0/2260 dead transitions. [2023-11-30 05:34:51,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 2260 transitions, 47724 flow [2023-11-30 05:34:51,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-30 05:34:51,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-30 05:34:51,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2062 transitions. [2023-11-30 05:34:51,908 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7979876160990712 [2023-11-30 05:34:51,908 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2062 transitions. [2023-11-30 05:34:51,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2062 transitions. [2023-11-30 05:34:51,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:34:51,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2062 transitions. [2023-11-30 05:34:51,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 257.75) internal successors, (2062), 8 states have internal predecessors, (2062), 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 05:34:51,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 323.0) internal successors, (2907), 9 states have internal predecessors, (2907), 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 05:34:51,912 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 323.0) internal successors, (2907), 9 states have internal predecessors, (2907), 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 05:34:51,913 INFO L307 CegarLoopForPetriNet]: 299 programPoint places, 187 predicate places. [2023-11-30 05:34:51,913 INFO L500 AbstractCegarLoop]: Abstraction has has 486 places, 2260 transitions, 47724 flow [2023-11-30 05:34:51,913 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 221.5) internal successors, (1329), 6 states have internal predecessors, (1329), 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 05:34:51,913 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:34:51,913 INFO L232 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:34:51,913 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 05:34:51,913 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-30 05:34:51,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:34:51,915 INFO L85 PathProgramCache]: Analyzing trace with hash -2035980555, now seen corresponding path program 1 times [2023-11-30 05:34:51,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:34:51,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379857809] [2023-11-30 05:34:51,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:34:51,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:34:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:34:52,340 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-30 05:34:52,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:34:52,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379857809] [2023-11-30 05:34:52,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379857809] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:34:52,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83494258] [2023-11-30 05:34:52,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:34:52,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:34:52,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:34:52,341 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 05:34:52,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-30 05:34:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:34:52,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-30 05:34:52,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:34:52,744 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-30 05:34:52,744 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:34:53,125 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-30 05:34:53,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83494258] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:34:53,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:34:53,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 42 [2023-11-30 05:34:53,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363137487] [2023-11-30 05:34:53,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:34:53,126 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-30 05:34:53,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:34:53,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-30 05:34:53,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=462, Invalid=1260, Unknown=0, NotChecked=0, Total=1722 [2023-11-30 05:34:53,131 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 323 [2023-11-30 05:34:53,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 486 places, 2260 transitions, 47724 flow. Second operand has 42 states, 42 states have (on average 273.8809523809524) internal successors, (11503), 42 states have internal predecessors, (11503), 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 05:34:53,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:34:53,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 323 [2023-11-30 05:34:53,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:35:45,425 INFO L124 PetriNetUnfolderBase]: 48522/112288 cut-off events. [2023-11-30 05:35:45,425 INFO L125 PetriNetUnfolderBase]: For 1563747/1739831 co-relation queries the response was YES. [2023-11-30 05:35:46,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804041 conditions, 112288 events. 48522/112288 cut-off events. For 1563747/1739831 co-relation queries the response was YES. Maximal size of possible extension queue 3557. Compared 1449383 event pairs, 18452 based on Foata normal form. 69/107930 useless extension candidates. Maximal degree in co-relation 789451. Up to 51517 conditions per place. [2023-11-30 05:35:47,538 INFO L140 encePairwiseOnDemand]: 317/323 looper letters, 595 selfloop transitions, 57 changer transitions 0/1968 dead transitions. [2023-11-30 05:35:47,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 1968 transitions, 42297 flow [2023-11-30 05:35:47,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-11-30 05:35:47,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2023-11-30 05:35:47,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 15599 transitions. [2023-11-30 05:35:47,569 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.847265221878225 [2023-11-30 05:35:47,569 INFO L72 ComplementDD]: Start complementDD. Operand 57 states and 15599 transitions. [2023-11-30 05:35:47,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 15599 transitions. [2023-11-30 05:35:47,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:35:47,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 57 states and 15599 transitions. [2023-11-30 05:35:47,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 58 states, 57 states have (on average 273.6666666666667) internal successors, (15599), 57 states have internal predecessors, (15599), 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 05:35:47,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 58 states, 58 states have (on average 323.0) internal successors, (18734), 58 states have internal predecessors, (18734), 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 05:35:47,610 INFO L81 ComplementDD]: Finished complementDD. Result has 58 states, 58 states have (on average 323.0) internal successors, (18734), 58 states have internal predecessors, (18734), 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 05:35:47,611 INFO L307 CegarLoopForPetriNet]: 299 programPoint places, 241 predicate places. [2023-11-30 05:35:47,611 INFO L500 AbstractCegarLoop]: Abstraction has has 540 places, 1968 transitions, 42297 flow [2023-11-30 05:35:47,612 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 273.8809523809524) internal successors, (11503), 42 states have internal predecessors, (11503), 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 05:35:47,613 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:35:47,613 INFO L232 CegarLoopForPetriNet]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 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 05:35:47,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-30 05:35:47,820 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-30 05:35:47,820 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-11-30 05:35:47,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:35:47,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1967964101, now seen corresponding path program 4 times [2023-11-30 05:35:47,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:35:47,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591290012] [2023-11-30 05:35:47,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:35:47,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:35:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:35:55,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1875 backedges. 0 proven. 1875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:35:55,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:35:55,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591290012] [2023-11-30 05:35:55,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591290012] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:35:55,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925617662] [2023-11-30 05:35:55,984 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-30 05:35:55,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:35:55,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:35:55,985 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 05:35:55,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-30 05:37:25,851 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-30 05:37:25,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 05:37:25,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 1435 conjuncts, 258 conjunts are in the unsatisfiable core [2023-11-30 05:37:25,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:37:26,101 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-30 05:37:26,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-30 05:37:26,637 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2023-11-30 05:37:26,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 38 [2023-11-30 05:37:26,701 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:37:26,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 05:37:27,124 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-30 05:37:27,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2023-11-30 05:37:27,133 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:37:27,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 05:37:27,508 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:37:27,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 05:37:27,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-30 05:37:27,880 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:37:27,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 05:37:27,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-30 05:37:28,375 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:37:28,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 05:37:28,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-30 05:37:28,887 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-30 05:37:28,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-30 05:37:28,896 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:37:28,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 05:37:29,421 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:37:29,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 05:37:29,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-30 05:37:29,948 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:37:29,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 05:37:29,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-30 05:37:30,500 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-30 05:37:30,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-30 05:37:30,516 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-30 05:37:30,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-30 05:37:30,949 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-30 05:37:30,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-30 05:37:30,961 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-30 05:37:30,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-30 05:37:31,528 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-30 05:37:31,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-11-30 05:37:31,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-30 05:37:32,310 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-30 05:37:32,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-30 05:37:32,331 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2023-11-30 05:37:32,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2023-11-30 05:37:33,340 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-30 05:37:33,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-30 05:37:33,390 INFO L349 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-11-30 05:37:33,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 57 [2023-11-30 05:37:34,825 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2023-11-30 05:37:34,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2023-11-30 05:37:34,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-30 05:37:37,031 INFO L349 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2023-11-30 05:37:37,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 46 [2023-11-30 05:37:37,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-30 05:37:37,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1875 backedges. 0 proven. 1875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:37:37,344 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:41:05,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 05:41:05,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 895 treesize of output 1685