/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_87-lists_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 05:30:15,172 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 05:30:15,246 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:30:15,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 05:30:15,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 05:30:15,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 05:30:15,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 05:30:15,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 05:30:15,273 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 05:30:15,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 05:30:15,277 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 05:30:15,277 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 05:30:15,277 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 05:30:15,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 05:30:15,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 05:30:15,278 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 05:30:15,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 05:30:15,278 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 05:30:15,279 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 05:30:15,279 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 05:30:15,279 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 05:30:15,279 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 05:30:15,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 05:30:15,280 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 05:30:15,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 05:30:15,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 05:30:15,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 05:30:15,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 05:30:15,280 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 05:30:15,281 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 05:30:15,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 05:30:15,281 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 05:30:15,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 05:30:15,282 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:30:15,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 05:30:15,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 05:30:15,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 05:30:15,481 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 05:30:15,481 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 05:30:15,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_87-lists_racefree.i [2023-11-30 05:30:16,453 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 05:30:16,643 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 05:30:16,643 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_87-lists_racefree.i [2023-11-30 05:30:16,659 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5880c0c94/7a585d29f4c8424ea75f2f26b53c1357/FLAGa41d750d9 [2023-11-30 05:30:16,698 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5880c0c94/7a585d29f4c8424ea75f2f26b53c1357 [2023-11-30 05:30:16,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 05:30:16,701 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 05:30:16,701 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 05:30:16,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 05:30:16,709 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 05:30:16,710 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 05:30:16" (1/1) ... [2023-11-30 05:30:16,711 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c6f1954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:30:16, skipping insertion in model container [2023-11-30 05:30:16,711 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 05:30:16" (1/1) ... [2023-11-30 05:30:16,791 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 05:30:17,231 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 05:30:17,303 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 05:30:17,346 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 05:30:17,392 INFO L206 MainTranslator]: Completed translation [2023-11-30 05:30:17,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:30:17 WrapperNode [2023-11-30 05:30:17,392 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 05:30:17,393 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 05:30:17,393 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 05:30:17,393 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 05:30:17,397 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:30:17" (1/1) ... [2023-11-30 05:30:17,426 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:30:17" (1/1) ... [2023-11-30 05:30:17,454 INFO L138 Inliner]: procedures = 279, calls = 69, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 261 [2023-11-30 05:30:17,454 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 05:30:17,455 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 05:30:17,455 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 05:30:17,455 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 05:30:17,465 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:30:17" (1/1) ... [2023-11-30 05:30:17,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:30:17" (1/1) ... [2023-11-30 05:30:17,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:30:17" (1/1) ... [2023-11-30 05:30:17,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:30:17" (1/1) ... [2023-11-30 05:30:17,491 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:30:17" (1/1) ... [2023-11-30 05:30:17,504 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:30:17" (1/1) ... [2023-11-30 05:30:17,506 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:30:17" (1/1) ... [2023-11-30 05:30:17,507 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:30:17" (1/1) ... [2023-11-30 05:30:17,510 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 05:30:17,510 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 05:30:17,510 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 05:30:17,510 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 05:30:17,511 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:30:17" (1/1) ... [2023-11-30 05:30:17,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 05:30:17,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:30:17,556 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:30:17,597 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:30:17,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 05:30:17,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-30 05:30:17,600 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2023-11-30 05:30:17,600 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2023-11-30 05:30:17,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 05:30:17,600 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-30 05:30:17,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 05:30:17,601 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2023-11-30 05:30:17,601 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2023-11-30 05:30:17,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 05:30:17,601 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-30 05:30:17,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-30 05:30:17,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 05:30:17,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-30 05:30:17,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 05:30:17,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 05:30:17,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 05:30:17,604 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:30:17,766 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 05:30:17,768 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 05:30:18,151 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 05:30:18,169 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 05:30:18,169 INFO L309 CfgBuilder]: Removed 16 assume(true) statements. [2023-11-30 05:30:18,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 05:30:18 BoogieIcfgContainer [2023-11-30 05:30:18,170 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 05:30:18,172 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 05:30:18,172 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 05:30:18,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 05:30:18,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 05:30:16" (1/3) ... [2023-11-30 05:30:18,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42df5a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 05:30:18, skipping insertion in model container [2023-11-30 05:30:18,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:30:17" (2/3) ... [2023-11-30 05:30:18,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42df5a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 05:30:18, skipping insertion in model container [2023-11-30 05:30:18,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 05:30:18" (3/3) ... [2023-11-30 05:30:18,175 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_87-lists_racefree.i [2023-11-30 05:30:18,186 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 05:30:18,186 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2023-11-30 05:30:18,186 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 05:30:18,251 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-30 05:30:18,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 288 places, 311 transitions, 642 flow [2023-11-30 05:30:18,370 INFO L124 PetriNetUnfolderBase]: 59/579 cut-off events. [2023-11-30 05:30:18,370 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-30 05:30:18,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 579 events. 59/579 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2579 event pairs, 0 based on Foata normal form. 0/434 useless extension candidates. Maximal degree in co-relation 288. Up to 8 conditions per place. [2023-11-30 05:30:18,378 INFO L82 GeneralOperation]: Start removeDead. Operand has 288 places, 311 transitions, 642 flow [2023-11-30 05:30:18,384 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 288 places, 311 transitions, 642 flow [2023-11-30 05:30:18,390 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:30:18,394 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;@3b99741e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:30:18,394 INFO L363 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2023-11-30 05:30:18,399 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:30:18,399 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2023-11-30 05:30:18,399 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:30:18,399 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:30:18,399 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:30:18,400 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:30:18,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:30:18,403 INFO L85 PathProgramCache]: Analyzing trace with hash -355649721, now seen corresponding path program 1 times [2023-11-30 05:30:18,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:30:18,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722657387] [2023-11-30 05:30:18,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:30:18,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:30:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:30:18,611 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:18,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:30:18,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722657387] [2023-11-30 05:30:18,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722657387] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:30:18,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:30:18,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:30:18,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594106994] [2023-11-30 05:30:18,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:30:18,620 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:30:18,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:30:18,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:30:18,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:30:18,653 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 311 [2023-11-30 05:30:18,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 311 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 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:18,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:30:18,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 311 [2023-11-30 05:30:18,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:30:18,975 INFO L124 PetriNetUnfolderBase]: 171/1710 cut-off events. [2023-11-30 05:30:18,975 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2023-11-30 05:30:18,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2029 conditions, 1710 events. 171/1710 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 12441 event pairs, 110 based on Foata normal form. 307/1699 useless extension candidates. Maximal degree in co-relation 1161. Up to 264 conditions per place. [2023-11-30 05:30:18,991 INFO L140 encePairwiseOnDemand]: 288/311 looper letters, 33 selfloop transitions, 2 changer transitions 0/294 dead transitions. [2023-11-30 05:30:18,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 294 transitions, 678 flow [2023-11-30 05:30:18,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:30:18,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:30:19,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 840 transitions. [2023-11-30 05:30:19,005 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9003215434083601 [2023-11-30 05:30:19,006 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 840 transitions. [2023-11-30 05:30:19,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 840 transitions. [2023-11-30 05:30:19,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:30:19,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 840 transitions. [2023-11-30 05:30:19,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 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:19,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 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:19,019 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 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:19,021 INFO L307 CegarLoopForPetriNet]: 288 programPoint places, -1 predicate places. [2023-11-30 05:30:19,022 INFO L500 AbstractCegarLoop]: Abstraction has has 287 places, 294 transitions, 678 flow [2023-11-30 05:30:19,022 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 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:19,022 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:30:19,022 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:19,022 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 05:30:19,023 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:30:19,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:30:19,024 INFO L85 PathProgramCache]: Analyzing trace with hash 336640463, now seen corresponding path program 1 times [2023-11-30 05:30:19,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:30:19,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514419156] [2023-11-30 05:30:19,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:30:19,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:30:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:30:19,198 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:19,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:30:19,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514419156] [2023-11-30 05:30:19,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514419156] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:30:19,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:30:19,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 05:30:19,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303496601] [2023-11-30 05:30:19,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:30:19,201 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 05:30:19,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:30:19,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 05:30:19,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-30 05:30:19,203 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 311 [2023-11-30 05:30:19,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 294 transitions, 678 flow. Second operand has 6 states, 6 states have (on average 207.5) internal successors, (1245), 6 states have internal predecessors, (1245), 0 states have call successors, (0), 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:19,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:30:19,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 311 [2023-11-30 05:30:19,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:30:22,416 INFO L124 PetriNetUnfolderBase]: 8794/25645 cut-off events. [2023-11-30 05:30:22,417 INFO L125 PetriNetUnfolderBase]: For 2704/2908 co-relation queries the response was YES. [2023-11-30 05:30:22,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42135 conditions, 25645 events. 8794/25645 cut-off events. For 2704/2908 co-relation queries the response was YES. Maximal size of possible extension queue 926. Compared 308772 event pairs, 8290 based on Foata normal form. 0/20114 useless extension candidates. Maximal degree in co-relation 39191. Up to 13442 conditions per place. [2023-11-30 05:30:22,580 INFO L140 encePairwiseOnDemand]: 301/311 looper letters, 77 selfloop transitions, 9 changer transitions 0/294 dead transitions. [2023-11-30 05:30:22,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 294 transitions, 850 flow [2023-11-30 05:30:22,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 05:30:22,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 05:30:22,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1522 transitions. [2023-11-30 05:30:22,583 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6991272393201654 [2023-11-30 05:30:22,583 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1522 transitions. [2023-11-30 05:30:22,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1522 transitions. [2023-11-30 05:30:22,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:30:22,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1522 transitions. [2023-11-30 05:30:22,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 217.42857142857142) internal successors, (1522), 7 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:30:22,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 311.0) internal successors, (2488), 8 states have internal predecessors, (2488), 0 states have call successors, (0), 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:22,590 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 311.0) internal successors, (2488), 8 states have internal predecessors, (2488), 0 states have call successors, (0), 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:22,591 INFO L307 CegarLoopForPetriNet]: 288 programPoint places, 3 predicate places. [2023-11-30 05:30:22,591 INFO L500 AbstractCegarLoop]: Abstraction has has 291 places, 294 transitions, 850 flow [2023-11-30 05:30:22,591 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 207.5) internal successors, (1245), 6 states have internal predecessors, (1245), 0 states have call successors, (0), 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:22,591 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:30:22,592 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:22,592 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 05:30:22,592 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:22,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:30:22,593 INFO L85 PathProgramCache]: Analyzing trace with hash 336640464, now seen corresponding path program 1 times [2023-11-30 05:30:22,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:30:22,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868460185] [2023-11-30 05:30:22,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:30:22,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:30:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:30:22,769 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:22,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:30:22,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868460185] [2023-11-30 05:30:22,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868460185] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:30:22,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:30:22,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 05:30:22,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730927877] [2023-11-30 05:30:22,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:30:22,770 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 05:30:22,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:30:22,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 05:30:22,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-30 05:30:22,772 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 311 [2023-11-30 05:30:22,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 294 transitions, 850 flow. Second operand has 6 states, 6 states have (on average 210.33333333333334) internal successors, (1262), 6 states have internal predecessors, (1262), 0 states have call successors, (0), 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:22,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:30:22,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 311 [2023-11-30 05:30:22,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:30:27,859 INFO L124 PetriNetUnfolderBase]: 16762/44520 cut-off events. [2023-11-30 05:30:27,860 INFO L125 PetriNetUnfolderBase]: For 17121/19777 co-relation queries the response was YES. [2023-11-30 05:30:27,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90402 conditions, 44520 events. 16762/44520 cut-off events. For 17121/19777 co-relation queries the response was YES. Maximal size of possible extension queue 1849. Compared 570647 event pairs, 15948 based on Foata normal form. 0/42353 useless extension candidates. Maximal degree in co-relation 85885. Up to 20969 conditions per place. [2023-11-30 05:30:28,151 INFO L140 encePairwiseOnDemand]: 301/311 looper letters, 73 selfloop transitions, 9 changer transitions 0/292 dead transitions. [2023-11-30 05:30:28,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 292 transitions, 1006 flow [2023-11-30 05:30:28,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 05:30:28,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 05:30:28,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1538 transitions. [2023-11-30 05:30:28,157 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7064768029398254 [2023-11-30 05:30:28,157 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1538 transitions. [2023-11-30 05:30:28,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1538 transitions. [2023-11-30 05:30:28,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:30:28,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1538 transitions. [2023-11-30 05:30:28,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 219.71428571428572) internal successors, (1538), 7 states have internal predecessors, (1538), 0 states have call successors, (0), 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:28,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 311.0) internal successors, (2488), 8 states have internal predecessors, (2488), 0 states have call successors, (0), 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:28,166 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 311.0) internal successors, (2488), 8 states have internal predecessors, (2488), 0 states have call successors, (0), 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:28,167 INFO L307 CegarLoopForPetriNet]: 288 programPoint places, 7 predicate places. [2023-11-30 05:30:28,167 INFO L500 AbstractCegarLoop]: Abstraction has has 295 places, 292 transitions, 1006 flow [2023-11-30 05:30:28,168 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 210.33333333333334) internal successors, (1262), 6 states have internal predecessors, (1262), 0 states have call successors, (0), 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:28,168 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:30:28,168 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:28,168 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 05:30:28,168 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:28,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:30:28,169 INFO L85 PathProgramCache]: Analyzing trace with hash -950194077, now seen corresponding path program 1 times [2023-11-30 05:30:28,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:30:28,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111047933] [2023-11-30 05:30:28,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:30:28,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:30:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:30:28,325 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:28,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:30:28,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111047933] [2023-11-30 05:30:28,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111047933] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:30:28,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:30:28,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 05:30:28,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683188758] [2023-11-30 05:30:28,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:30:28,326 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 05:30:28,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:30:28,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 05:30:28,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-30 05:30:28,328 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 311 [2023-11-30 05:30:28,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 292 transitions, 1006 flow. Second operand has 6 states, 6 states have (on average 210.66666666666666) internal successors, (1264), 6 states have internal predecessors, (1264), 0 states have call successors, (0), 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:28,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:30:28,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 311 [2023-11-30 05:30:28,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:30:34,196 INFO L124 PetriNetUnfolderBase]: 19474/50592 cut-off events. [2023-11-30 05:30:34,197 INFO L125 PetriNetUnfolderBase]: For 42820/48608 co-relation queries the response was YES. [2023-11-30 05:30:34,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131364 conditions, 50592 events. 19474/50592 cut-off events. For 42820/48608 co-relation queries the response was YES. Maximal size of possible extension queue 1980. Compared 646675 event pairs, 12591 based on Foata normal form. 530/49026 useless extension candidates. Maximal degree in co-relation 125261. Up to 24898 conditions per place. [2023-11-30 05:30:34,601 INFO L140 encePairwiseOnDemand]: 302/311 looper letters, 161 selfloop transitions, 6 changer transitions 0/375 dead transitions. [2023-11-30 05:30:34,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 375 transitions, 1832 flow [2023-11-30 05:30:34,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 05:30:34,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 05:30:34,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1208 transitions. [2023-11-30 05:30:34,608 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7768488745980707 [2023-11-30 05:30:34,608 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1208 transitions. [2023-11-30 05:30:34,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1208 transitions. [2023-11-30 05:30:34,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:30:34,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1208 transitions. [2023-11-30 05:30:34,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 241.6) internal successors, (1208), 5 states have internal predecessors, (1208), 0 states have call successors, (0), 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:34,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 311.0) internal successors, (1866), 6 states have internal predecessors, (1866), 0 states have call successors, (0), 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:34,615 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 311.0) internal successors, (1866), 6 states have internal predecessors, (1866), 0 states have call successors, (0), 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:34,618 INFO L307 CegarLoopForPetriNet]: 288 programPoint places, 10 predicate places. [2023-11-30 05:30:34,618 INFO L500 AbstractCegarLoop]: Abstraction has has 298 places, 375 transitions, 1832 flow [2023-11-30 05:30:34,618 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 210.66666666666666) internal successors, (1264), 6 states have internal predecessors, (1264), 0 states have call successors, (0), 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:34,618 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:30:34,619 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:34,619 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 05:30:34,619 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:34,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:30:34,619 INFO L85 PathProgramCache]: Analyzing trace with hash -950194076, now seen corresponding path program 1 times [2023-11-30 05:30:34,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:30:34,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328454683] [2023-11-30 05:30:34,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:30:34,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:30:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:30:34,867 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:34,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:30:34,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328454683] [2023-11-30 05:30:34,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328454683] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:30:34,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:30:34,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 05:30:34,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602600285] [2023-11-30 05:30:34,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:30:34,868 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 05:30:34,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:30:34,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 05:30:34,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-30 05:30:34,870 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 311 [2023-11-30 05:30:34,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 375 transitions, 1832 flow. Second operand has 7 states, 7 states have (on average 185.71428571428572) internal successors, (1300), 7 states have internal predecessors, (1300), 0 states have call successors, (0), 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:34,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:30:34,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 311 [2023-11-30 05:30:34,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:30:41,238 INFO L124 PetriNetUnfolderBase]: 22495/54357 cut-off events. [2023-11-30 05:30:41,247 INFO L125 PetriNetUnfolderBase]: For 69373/76689 co-relation queries the response was YES. [2023-11-30 05:30:41,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173839 conditions, 54357 events. 22495/54357 cut-off events. For 69373/76689 co-relation queries the response was YES. Maximal size of possible extension queue 2228. Compared 678340 event pairs, 13819 based on Foata normal form. 6/52967 useless extension candidates. Maximal degree in co-relation 166102. Up to 26221 conditions per place. [2023-11-30 05:30:41,975 INFO L140 encePairwiseOnDemand]: 303/311 looper letters, 201 selfloop transitions, 7 changer transitions 0/389 dead transitions. [2023-11-30 05:30:41,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 389 transitions, 2312 flow [2023-11-30 05:30:41,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 05:30:41,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 05:30:41,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1264 transitions. [2023-11-30 05:30:41,979 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.677384780278671 [2023-11-30 05:30:41,979 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1264 transitions. [2023-11-30 05:30:41,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1264 transitions. [2023-11-30 05:30:41,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:30:41,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1264 transitions. [2023-11-30 05:30:41,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 210.66666666666666) internal successors, (1264), 6 states have internal predecessors, (1264), 0 states have call successors, (0), 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:41,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 311.0) internal successors, (2177), 7 states have internal predecessors, (2177), 0 states have call successors, (0), 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:41,985 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 311.0) internal successors, (2177), 7 states have internal predecessors, (2177), 0 states have call successors, (0), 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:41,987 INFO L307 CegarLoopForPetriNet]: 288 programPoint places, 15 predicate places. [2023-11-30 05:30:41,987 INFO L500 AbstractCegarLoop]: Abstraction has has 303 places, 389 transitions, 2312 flow [2023-11-30 05:30:41,987 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 185.71428571428572) internal successors, (1300), 7 states have internal predecessors, (1300), 0 states have call successors, (0), 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:41,988 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:30:41,988 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:41,988 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 05:30:41,988 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:41,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:30:41,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1477662714, now seen corresponding path program 1 times [2023-11-30 05:30:41,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:30:41,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205523796] [2023-11-30 05:30:41,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:30:41,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:30:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:30:42,076 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:42,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:30:42,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205523796] [2023-11-30 05:30:42,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205523796] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:30:42,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305031665] [2023-11-30 05:30:42,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:30:42,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:30:42,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:30:42,085 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:42,090 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:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:30:42,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-30 05:30:42,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:30:42,258 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:42,258 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:30:42,313 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:42,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305031665] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:30:42,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:30:42,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-30 05:30:42,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628581701] [2023-11-30 05:30:42,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:30:42,314 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-30 05:30:42,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:30:42,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-30 05:30:42,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-30 05:30:42,317 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 311 [2023-11-30 05:30:42,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 389 transitions, 2312 flow. Second operand has 10 states, 10 states have (on average 262.4) internal successors, (2624), 10 states have internal predecessors, (2624), 0 states have call successors, (0), 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,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:30:42,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 311 [2023-11-30 05:30:42,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:30:49,373 INFO L124 PetriNetUnfolderBase]: 22495/54376 cut-off events. [2023-11-30 05:30:49,374 INFO L125 PetriNetUnfolderBase]: For 91480/98946 co-relation queries the response was YES. [2023-11-30 05:30:49,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180426 conditions, 54376 events. 22495/54376 cut-off events. For 91480/98946 co-relation queries the response was YES. Maximal size of possible extension queue 2228. Compared 678110 event pairs, 13819 based on Foata normal form. 0/52980 useless extension candidates. Maximal degree in co-relation 172273. Up to 26221 conditions per place. [2023-11-30 05:30:49,788 INFO L140 encePairwiseOnDemand]: 305/311 looper letters, 60 selfloop transitions, 9 changer transitions 0/398 dead transitions. [2023-11-30 05:30:49,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 398 transitions, 2506 flow [2023-11-30 05:30:49,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 05:30:49,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 05:30:49,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2386 transitions. [2023-11-30 05:30:49,792 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8524473026080743 [2023-11-30 05:30:49,792 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2386 transitions. [2023-11-30 05:30:49,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2386 transitions. [2023-11-30 05:30:49,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:30:49,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2386 transitions. [2023-11-30 05:30:49,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 265.1111111111111) internal successors, (2386), 9 states have internal predecessors, (2386), 0 states have call successors, (0), 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:49,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 311.0) internal successors, (3110), 10 states have internal predecessors, (3110), 0 states have call successors, (0), 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:49,800 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 311.0) internal successors, (3110), 10 states have internal predecessors, (3110), 0 states have call successors, (0), 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:49,801 INFO L307 CegarLoopForPetriNet]: 288 programPoint places, 23 predicate places. [2023-11-30 05:30:49,801 INFO L500 AbstractCegarLoop]: Abstraction has has 311 places, 398 transitions, 2506 flow [2023-11-30 05:30:49,801 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 262.4) internal successors, (2624), 10 states have internal predecessors, (2624), 0 states have call successors, (0), 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:49,801 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:30:49,802 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:49,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-30 05:30:50,006 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:50,007 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:50,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:30:50,007 INFO L85 PathProgramCache]: Analyzing trace with hash -2136363278, now seen corresponding path program 1 times [2023-11-30 05:30:50,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:30:50,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012228946] [2023-11-30 05:30:50,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:30:50,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:30:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:30:50,252 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:50,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:30:50,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012228946] [2023-11-30 05:30:50,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012228946] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:30:50,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780858164] [2023-11-30 05:30:50,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:30:50,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:30:50,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:30:50,267 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:50,281 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:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:30:50,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-30 05:30:50,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:30:50,546 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:30:50,546 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:50,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:30:50,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 05:30:50,743 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:50,802 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:50,802 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:30:51,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 05:30:51,186 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:51,591 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:51,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780858164] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:30:51,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:30:51,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 8] total 27 [2023-11-30 05:30:51,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264106141] [2023-11-30 05:30:51,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:30:51,592 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-30 05:30:51,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:30:51,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-30 05:30:51,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2023-11-30 05:30:51,596 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 311 [2023-11-30 05:30:51,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 398 transitions, 2506 flow. Second operand has 28 states, 28 states have (on average 182.57142857142858) internal successors, (5112), 28 states have internal predecessors, (5112), 0 states have call successors, (0), 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:51,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:30:51,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 311 [2023-11-30 05:30:51,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:30:59,891 INFO L124 PetriNetUnfolderBase]: 22495/54387 cut-off events. [2023-11-30 05:30:59,893 INFO L125 PetriNetUnfolderBase]: For 124189/135970 co-relation queries the response was YES. [2023-11-30 05:31:00,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215447 conditions, 54387 events. 22495/54387 cut-off events. For 124189/135970 co-relation queries the response was YES. Maximal size of possible extension queue 2229. Compared 678633 event pairs, 13819 based on Foata normal form. 7/52998 useless extension candidates. Maximal degree in co-relation 205794. Up to 26221 conditions per place. [2023-11-30 05:31:00,494 INFO L140 encePairwiseOnDemand]: 297/311 looper letters, 223 selfloop transitions, 18 changer transitions 0/418 dead transitions. [2023-11-30 05:31:00,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 418 transitions, 3152 flow [2023-11-30 05:31:00,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-30 05:31:00,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-30 05:31:00,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3064 transitions. [2023-11-30 05:31:00,500 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6157556270096463 [2023-11-30 05:31:00,500 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3064 transitions. [2023-11-30 05:31:00,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3064 transitions. [2023-11-30 05:31:00,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:31:00,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3064 transitions. [2023-11-30 05:31:00,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 191.5) internal successors, (3064), 16 states have internal predecessors, (3064), 0 states have call successors, (0), 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:00,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 311.0) internal successors, (5287), 17 states have internal predecessors, (5287), 0 states have call successors, (0), 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:00,521 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 311.0) internal successors, (5287), 17 states have internal predecessors, (5287), 0 states have call successors, (0), 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:00,522 INFO L307 CegarLoopForPetriNet]: 288 programPoint places, 38 predicate places. [2023-11-30 05:31:00,522 INFO L500 AbstractCegarLoop]: Abstraction has has 326 places, 418 transitions, 3152 flow [2023-11-30 05:31:00,523 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 182.57142857142858) internal successors, (5112), 28 states have internal predecessors, (5112), 0 states have call successors, (0), 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:00,523 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:31:00,523 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:31:00,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-30 05:31:00,730 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:31:00,731 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:31:00,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:31:00,731 INFO L85 PathProgramCache]: Analyzing trace with hash 402435422, now seen corresponding path program 2 times [2023-11-30 05:31:00,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:31:00,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756079082] [2023-11-30 05:31:00,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:00,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:31:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:00,895 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:31:00,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:31:00,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756079082] [2023-11-30 05:31:00,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756079082] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:31:00,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85153317] [2023-11-30 05:31:00,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 05:31:00,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:31:00,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:31:00,904 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:31:00,938 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:31:00,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-30 05:31:00,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 05:31:00,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-30 05:31:01,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:31:01,010 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:31:01,037 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:31:01,037 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 05:31:01,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85153317] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:31:01,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 05:31:01,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2023-11-30 05:31:01,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914506713] [2023-11-30 05:31:01,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:31:01,037 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:31:01,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:31:01,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:31:01,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-11-30 05:31:01,039 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 311 [2023-11-30 05:31:01,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 418 transitions, 3152 flow. Second operand has 4 states, 4 states have (on average 211.75) internal successors, (847), 4 states have internal predecessors, (847), 0 states have call successors, (0), 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:01,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:31:01,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 311 [2023-11-30 05:31:01,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:31:08,959 INFO L124 PetriNetUnfolderBase]: 24701/56304 cut-off events. [2023-11-30 05:31:08,960 INFO L125 PetriNetUnfolderBase]: For 190726/212533 co-relation queries the response was YES. [2023-11-30 05:31:09,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256999 conditions, 56304 events. 24701/56304 cut-off events. For 190726/212533 co-relation queries the response was YES. Maximal size of possible extension queue 2292. Compared 666713 event pairs, 14007 based on Foata normal form. 1/54526 useless extension candidates. Maximal degree in co-relation 248876. Up to 28834 conditions per place. [2023-11-30 05:31:09,466 INFO L140 encePairwiseOnDemand]: 304/311 looper letters, 251 selfloop transitions, 8 changer transitions 0/514 dead transitions. [2023-11-30 05:31:09,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 514 transitions, 4809 flow [2023-11-30 05:31:09,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 05:31:09,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 05:31:09,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 966 transitions. [2023-11-30 05:31:09,468 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7765273311897106 [2023-11-30 05:31:09,468 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 966 transitions. [2023-11-30 05:31:09,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 966 transitions. [2023-11-30 05:31:09,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:31:09,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 966 transitions. [2023-11-30 05:31:09,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 241.5) internal successors, (966), 4 states have internal predecessors, (966), 0 states have call successors, (0), 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:09,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 311.0) internal successors, (1555), 5 states have internal predecessors, (1555), 0 states have call successors, (0), 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:09,472 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 311.0) internal successors, (1555), 5 states have internal predecessors, (1555), 0 states have call successors, (0), 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:09,472 INFO L307 CegarLoopForPetriNet]: 288 programPoint places, 41 predicate places. [2023-11-30 05:31:09,472 INFO L500 AbstractCegarLoop]: Abstraction has has 329 places, 514 transitions, 4809 flow [2023-11-30 05:31:09,472 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 211.75) internal successors, (847), 4 states have internal predecessors, (847), 0 states have call successors, (0), 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:09,472 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:31:09,473 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:31:09,488 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:31:09,677 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:31:09,677 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:31:09,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:31:09,678 INFO L85 PathProgramCache]: Analyzing trace with hash 402435421, now seen corresponding path program 1 times [2023-11-30 05:31:09,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:31:09,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308071630] [2023-11-30 05:31:09,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:09,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:31:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:09,741 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:31:09,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:31:09,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308071630] [2023-11-30 05:31:09,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308071630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:31:09,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:31:09,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:31:09,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026283085] [2023-11-30 05:31:09,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:31:09,742 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:31:09,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:31:09,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:31:09,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:31:09,743 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 311 [2023-11-30 05:31:09,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 514 transitions, 4809 flow. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 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:09,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:31:09,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 311 [2023-11-30 05:31:09,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:31:17,796 INFO L124 PetriNetUnfolderBase]: 23783/54417 cut-off events. [2023-11-30 05:31:17,796 INFO L125 PetriNetUnfolderBase]: For 240572/262162 co-relation queries the response was YES. [2023-11-30 05:31:18,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273272 conditions, 54417 events. 23783/54417 cut-off events. For 240572/262162 co-relation queries the response was YES. Maximal size of possible extension queue 2169. Compared 642056 event pairs, 12837 based on Foata normal form. 783/53542 useless extension candidates. Maximal degree in co-relation 264678. Up to 27189 conditions per place. [2023-11-30 05:31:18,585 INFO L140 encePairwiseOnDemand]: 307/311 looper letters, 231 selfloop transitions, 3 changer transitions 0/509 dead transitions. [2023-11-30 05:31:18,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 509 transitions, 5217 flow [2023-11-30 05:31:18,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:31:18,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:31:18,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 750 transitions. [2023-11-30 05:31:18,587 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8038585209003215 [2023-11-30 05:31:18,587 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 750 transitions. [2023-11-30 05:31:18,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 750 transitions. [2023-11-30 05:31:18,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:31:18,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 750 transitions. [2023-11-30 05:31:18,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 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:18,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 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:18,589 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 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:18,590 INFO L307 CegarLoopForPetriNet]: 288 programPoint places, 41 predicate places. [2023-11-30 05:31:18,590 INFO L500 AbstractCegarLoop]: Abstraction has has 329 places, 509 transitions, 5217 flow [2023-11-30 05:31:18,590 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 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:18,590 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:31:18,590 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:18,590 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 05:31:18,590 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:18,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:31:18,590 INFO L85 PathProgramCache]: Analyzing trace with hash 15865870, now seen corresponding path program 2 times [2023-11-30 05:31:18,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:31:18,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345327947] [2023-11-30 05:31:18,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:18,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:31:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:19,342 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:19,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:31:19,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345327947] [2023-11-30 05:31:19,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345327947] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:31:19,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989528236] [2023-11-30 05:31:19,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 05:31:19,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:31:19,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:31:19,347 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:19,391 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:19,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 05:31:19,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 05:31:19,494 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-30 05:31:19,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:31:19,669 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:31:19,669 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:19,674 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:19,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 05:31:19,906 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:20,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 05:31:20,267 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:20,451 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:31:20,451 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:20,455 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:20,635 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:20,636 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:31:20,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 05:31:20,993 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:21,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 05:31:21,349 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:21,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 05:31:21,732 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:22,151 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:22,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989528236] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:31:22,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:31:22,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 14] total 51 [2023-11-30 05:31:22,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156087184] [2023-11-30 05:31:22,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:31:22,152 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-30 05:31:22,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:31:22,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-30 05:31:22,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=2353, Unknown=0, NotChecked=0, Total=2652 [2023-11-30 05:31:22,156 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 311 [2023-11-30 05:31:22,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 509 transitions, 5217 flow. Second operand has 52 states, 52 states have (on average 182.53846153846155) internal successors, (9492), 52 states have internal predecessors, (9492), 0 states have call successors, (0), 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:22,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:31:22,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 311 [2023-11-30 05:31:22,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:31:44,421 INFO L124 PetriNetUnfolderBase]: 45131/104429 cut-off events. [2023-11-30 05:31:44,421 INFO L125 PetriNetUnfolderBase]: For 542701/597341 co-relation queries the response was YES. [2023-11-30 05:31:44,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588684 conditions, 104429 events. 45131/104429 cut-off events. For 542701/597341 co-relation queries the response was YES. Maximal size of possible extension queue 3207. Compared 1320968 event pairs, 25502 based on Foata normal form. 9/101181 useless extension candidates. Maximal degree in co-relation 410039. Up to 51839 conditions per place. [2023-11-30 05:31:45,473 INFO L140 encePairwiseOnDemand]: 291/311 looper letters, 563 selfloop transitions, 52 changer transitions 0/799 dead transitions. [2023-11-30 05:31:45,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 799 transitions, 10534 flow [2023-11-30 05:31:45,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-30 05:31:45,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-11-30 05:31:45,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 7193 transitions. [2023-11-30 05:31:45,494 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6086478253511592 [2023-11-30 05:31:45,494 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 7193 transitions. [2023-11-30 05:31:45,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 7193 transitions. [2023-11-30 05:31:45,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:31:45,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 7193 transitions. [2023-11-30 05:31:45,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 189.28947368421052) internal successors, (7193), 38 states have internal predecessors, (7193), 0 states have call successors, (0), 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:45,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 311.0) internal successors, (12129), 39 states have internal predecessors, (12129), 0 states have call successors, (0), 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:45,536 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 311.0) internal successors, (12129), 39 states have internal predecessors, (12129), 0 states have call successors, (0), 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:45,537 INFO L307 CegarLoopForPetriNet]: 288 programPoint places, 78 predicate places. [2023-11-30 05:31:45,537 INFO L500 AbstractCegarLoop]: Abstraction has has 366 places, 799 transitions, 10534 flow [2023-11-30 05:31:45,539 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 182.53846153846155) internal successors, (9492), 52 states have internal predecessors, (9492), 0 states have call successors, (0), 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:45,539 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:31:45,539 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:45,547 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:45,745 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:45,746 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:45,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:31:45,747 INFO L85 PathProgramCache]: Analyzing trace with hash 627890178, now seen corresponding path program 1 times [2023-11-30 05:31:45,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:31:45,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61546484] [2023-11-30 05:31:45,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:45,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:31:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:45,911 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:45,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:31:45,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61546484] [2023-11-30 05:31:45,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61546484] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:31:45,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378558021] [2023-11-30 05:31:45,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:31:45,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:31:45,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:31:45,924 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:45,925 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:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:31:46,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-30 05:31:46,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:31:46,258 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:46,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:31:46,391 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:46,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378558021] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:31:46,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:31:46,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2023-11-30 05:31:46,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747593328] [2023-11-30 05:31:46,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:31:46,395 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-30 05:31:46,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:31:46,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-30 05:31:46,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2023-11-30 05:31:46,398 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 311 [2023-11-30 05:31:46,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 799 transitions, 10534 flow. Second operand has 22 states, 22 states have (on average 262.77272727272725) internal successors, (5781), 22 states have internal predecessors, (5781), 0 states have call successors, (0), 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:46,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:31:46,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 311 [2023-11-30 05:31:46,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:32:02,898 INFO L124 PetriNetUnfolderBase]: 31849/75565 cut-off events. [2023-11-30 05:32:02,898 INFO L125 PetriNetUnfolderBase]: For 484181/516587 co-relation queries the response was YES. [2023-11-30 05:32:03,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430333 conditions, 75565 events. 31849/75565 cut-off events. For 484181/516587 co-relation queries the response was YES. Maximal size of possible extension queue 2721. Compared 953214 event pairs, 13596 based on Foata normal form. 0/73404 useless extension candidates. Maximal degree in co-relation 419870. Up to 36760 conditions per place. [2023-11-30 05:32:03,716 INFO L140 encePairwiseOnDemand]: 305/311 looper letters, 137 selfloop transitions, 27 changer transitions 0/693 dead transitions. [2023-11-30 05:32:03,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 693 transitions, 8991 flow [2023-11-30 05:32:03,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-30 05:32:03,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-11-30 05:32:03,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 7105 transitions. [2023-11-30 05:32:03,723 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8461355245921163 [2023-11-30 05:32:03,723 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 7105 transitions. [2023-11-30 05:32:03,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 7105 transitions. [2023-11-30 05:32:03,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:32:03,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 7105 transitions. [2023-11-30 05:32:03,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 263.14814814814815) internal successors, (7105), 27 states have internal predecessors, (7105), 0 states have call successors, (0), 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:03,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 311.0) internal successors, (8708), 28 states have internal predecessors, (8708), 0 states have call successors, (0), 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:03,760 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 311.0) internal successors, (8708), 28 states have internal predecessors, (8708), 0 states have call successors, (0), 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:03,760 INFO L307 CegarLoopForPetriNet]: 288 programPoint places, 102 predicate places. [2023-11-30 05:32:03,760 INFO L500 AbstractCegarLoop]: Abstraction has has 390 places, 693 transitions, 8991 flow [2023-11-30 05:32:03,761 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 262.77272727272725) internal successors, (5781), 22 states have internal predecessors, (5781), 0 states have call successors, (0), 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:03,761 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:32:03,762 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:32:03,768 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:32:03,967 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:32:03,968 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:32:03,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:32:03,968 INFO L85 PathProgramCache]: Analyzing trace with hash -362767802, now seen corresponding path program 3 times [2023-11-30 05:32:03,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:32:03,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902887254] [2023-11-30 05:32:03,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:32:03,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:32:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:32:06,098 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:06,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:32:06,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902887254] [2023-11-30 05:32:06,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902887254] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:32:06,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176643495] [2023-11-30 05:32:06,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-30 05:32:06,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:32:06,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:32:06,117 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:32:06,120 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:33:01,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-11-30 05:33:01,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 05:33:01,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 121 conjunts are in the unsatisfiable core [2023-11-30 05:33:01,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:33:01,678 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:33:01,679 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:33:01,683 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:33:01,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 05:33:01,884 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:33:02,059 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:33:02,059 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:33:02,062 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:33:02,367 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-30 05:33:02,367 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:33:02,376 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:33:02,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:33:02,758 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-30 05:33:02,758 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:33:02,764 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:33:02,764 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:33:03,357 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-30 05:33:03,357 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:33:03,368 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-30 05:33:03,368 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:33:03,767 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-30 05:33:03,767 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:33:03,788 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-11-30 05:33:03,788 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 24 treesize of output 28 [2023-11-30 05:33:04,616 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-30 05:33:04,616 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:33:04,631 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-30 05:33:04,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-11-30 05:33:05,013 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:33:05,014 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:33:07,003 INFO L349 Elim1Store]: treesize reduction 39, result has 20.4 percent of original size [2023-11-30 05:33:07,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 48 [2023-11-30 05:33:10,185 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-30 05:33:10,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 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:33:21,564 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-30 05:33:21,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 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:34:06,376 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-30 05:34:06,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 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:34:58,722 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-30 05:34:58,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 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:35:20,516 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:35:20,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176643495] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:35:20,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:35:20,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 48, 39] total 116 [2023-11-30 05:35:20,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370049819] [2023-11-30 05:35:20,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:35:20,518 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 117 states [2023-11-30 05:35:20,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:35:20,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2023-11-30 05:35:20,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1498, Invalid=12057, Unknown=17, NotChecked=0, Total=13572 [2023-11-30 05:35:20,553 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 311 [2023-11-30 05:35:20,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 693 transitions, 8991 flow. Second operand has 117 states, 117 states have (on average 180.4188034188034) internal successors, (21109), 117 states have internal predecessors, (21109), 0 states have call successors, (0), 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:20,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:35:20,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 311 [2023-11-30 05:35:20,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:36:14,576 INFO L124 PetriNetUnfolderBase]: 45370/105853 cut-off events. [2023-11-30 05:36:14,576 INFO L125 PetriNetUnfolderBase]: For 764786/830712 co-relation queries the response was YES. [2023-11-30 05:36:14,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 677256 conditions, 105853 events. 45370/105853 cut-off events. For 764786/830712 co-relation queries the response was YES. Maximal size of possible extension queue 2739. Compared 1293956 event pairs, 25344 based on Foata normal form. 85/102667 useless extension candidates. Maximal degree in co-relation 473449. Up to 52411 conditions per place. [2023-11-30 05:36:15,882 INFO L140 encePairwiseOnDemand]: 286/311 looper letters, 828 selfloop transitions, 136 changer transitions 0/1146 dead transitions. [2023-11-30 05:36:15,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 1146 transitions, 18136 flow [2023-11-30 05:36:15,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-11-30 05:36:15,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2023-11-30 05:36:15,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 16141 transitions. [2023-11-30 05:36:15,895 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5965554200391765 [2023-11-30 05:36:15,895 INFO L72 ComplementDD]: Start complementDD. Operand 87 states and 16141 transitions. [2023-11-30 05:36:15,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 16141 transitions. [2023-11-30 05:36:15,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:36:15,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 87 states and 16141 transitions. [2023-11-30 05:36:15,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 88 states, 87 states have (on average 185.5287356321839) internal successors, (16141), 87 states have internal predecessors, (16141), 0 states have call successors, (0), 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:36:15,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 88 states, 88 states have (on average 311.0) internal successors, (27368), 88 states have internal predecessors, (27368), 0 states have call successors, (0), 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:36:15,945 INFO L81 ComplementDD]: Finished complementDD. Result has 88 states, 88 states have (on average 311.0) internal successors, (27368), 88 states have internal predecessors, (27368), 0 states have call successors, (0), 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:36:15,946 INFO L307 CegarLoopForPetriNet]: 288 programPoint places, 188 predicate places. [2023-11-30 05:36:15,946 INFO L500 AbstractCegarLoop]: Abstraction has has 476 places, 1146 transitions, 18136 flow [2023-11-30 05:36:15,948 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 117 states, 117 states have (on average 180.4188034188034) internal successors, (21109), 117 states have internal predecessors, (21109), 0 states have call successors, (0), 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:36:15,948 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:36:15,948 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:36:15,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-30 05:36:16,164 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:36:16,164 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:36:16,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:36:16,165 INFO L85 PathProgramCache]: Analyzing trace with hash -920406584, now seen corresponding path program 2 times [2023-11-30 05:36:16,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:36:16,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683895663] [2023-11-30 05:36:16,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:36:16,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:36:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:36:16,757 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:36:16,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:36:16,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683895663] [2023-11-30 05:36:16,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683895663] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:36:16,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563516029] [2023-11-30 05:36:16,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 05:36:16,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:36:16,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:36:16,759 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:36:16,761 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:36:16,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-30 05:36:16,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 05:36:16,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-30 05:36:16,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:36:16,945 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:36:17,005 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:36:17,005 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 05:36:17,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563516029] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:36:17,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 05:36:17,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [21] total 25 [2023-11-30 05:36:17,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453838873] [2023-11-30 05:36:17,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:36:17,006 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 05:36:17,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:36:17,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 05:36:17,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2023-11-30 05:36:17,007 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 311 [2023-11-30 05:36:17,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 1146 transitions, 18136 flow. Second operand has 6 states, 6 states have (on average 213.33333333333334) internal successors, (1280), 6 states have internal predecessors, (1280), 0 states have call successors, (0), 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:36:17,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:36:17,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 311 [2023-11-30 05:36:17,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:36:21,048 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([807] 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[][620], [t1_funThread1of1ForFork1InUse, 139#L1052-16true, 338#true, 308#true, 2699#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 1062#true, 328#true, 321#true, 295#true, 1326#true, 4491#(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)), 260#L1009true, 291#true, 669#true, 1333#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 92#t2_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 1987#true, t2_funThread1of1ForFork0InUse]) [2023-11-30 05:36:21,048 INFO L294 olderBase$Statistics]: this new event has 249 ancestors and is cut-off event [2023-11-30 05:36:21,048 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2023-11-30 05:36:21,048 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2023-11-30 05:36:21,048 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2023-11-30 05:36:21,048 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([805] 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][624], [t1_funThread1of1ForFork1InUse, 139#L1052-16true, 308#true, 338#true, 2699#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 328#true, 1062#true, 321#true, 295#true, 1326#true, 4491#(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)), 260#L1009true, 271#L1017-1true, 291#true, 1333#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 669#true, 1987#true, t2_funThread1of1ForFork0InUse]) [2023-11-30 05:36:21,048 INFO L294 olderBase$Statistics]: this new event has 249 ancestors and is cut-off event [2023-11-30 05:36:21,048 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2023-11-30 05:36:21,048 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2023-11-30 05:36:21,056 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2023-11-30 05:36:21,235 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([807] 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[][620], [t1_funThread1of1ForFork1InUse, 338#true, 308#true, 1062#true, 328#true, 2699#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 321#true, 295#true, 1326#true, 209#ULTIMATE.startFINALtrue, 4491#(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)), 260#L1009true, 291#true, 1333#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 669#true, 92#t2_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, t2_funThread1of1ForFork0InUse, 1987#true]) [2023-11-30 05:36:21,235 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2023-11-30 05:36:21,235 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-30 05:36:21,235 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-30 05:36:21,235 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-30 05:36:21,235 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([805] 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][624], [t1_funThread1of1ForFork1InUse, 338#true, 308#true, 2699#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 328#true, 1062#true, 321#true, 1326#true, 209#ULTIMATE.startFINALtrue, 295#true, 4491#(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)), 260#L1009true, 271#L1017-1true, 291#true, 1333#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 669#true, t2_funThread1of1ForFork0InUse, 1987#true]) [2023-11-30 05:36:21,235 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2023-11-30 05:36:21,235 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-30 05:36:21,235 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-30 05:36:21,236 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-30 05:36:22,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] L1040-->L1040-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_56| |v_~#mutexes~0.base_8|)) (.cse1 (+ (* |v_t2_funThread1of1ForFork0_~i~1#1_9| 24) |v_~#mutexes~0.offset_7|))) (and (= (select .cse0 .cse1) 0) (= |v_#pthreadsMutex_55| (store |v_#pthreadsMutex_56| |v_~#mutexes~0.base_8| (store .cse0 .cse1 1))) (= |v_t2_funThread1of1ForFork0_#t~nondet18#1_1| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_56|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_9|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_55|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_9|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|, t2_funThread1of1ForFork0_#t~nondet18#1=|v_t2_funThread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet18#1][824], [t1_funThread1of1ForFork1InUse, 139#L1052-16true, 338#true, 308#true, 2699#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 328#true, 1062#true, 321#true, 1326#true, 295#true, 4491#(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)), 260#L1009true, 291#true, 143#L1040-3true, 669#true, 1333#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), t2_funThread1of1ForFork0InUse, 1987#true]) [2023-11-30 05:36:22,669 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is not cut-off event [2023-11-30 05:36:22,669 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is not cut-off event [2023-11-30 05:36:22,669 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is not cut-off event [2023-11-30 05:36:22,669 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is not cut-off event [2023-11-30 05:36:22,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] L1040-->L1040-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_56| |v_~#mutexes~0.base_8|)) (.cse1 (+ (* |v_t2_funThread1of1ForFork0_~i~1#1_9| 24) |v_~#mutexes~0.offset_7|))) (and (= (select .cse0 .cse1) 0) (= |v_#pthreadsMutex_55| (store |v_#pthreadsMutex_56| |v_~#mutexes~0.base_8| (store .cse0 .cse1 1))) (= |v_t2_funThread1of1ForFork0_#t~nondet18#1_1| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_56|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_9|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_55|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_7|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_9|, ~#mutexes~0.base=|v_~#mutexes~0.base_8|, t2_funThread1of1ForFork0_#t~nondet18#1=|v_t2_funThread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet18#1][824], [t1_funThread1of1ForFork1InUse, 338#true, 308#true, 1062#true, 328#true, 2699#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 321#true, 1326#true, 295#true, 209#ULTIMATE.startFINALtrue, 4491#(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)), 260#L1009true, 291#true, 143#L1040-3true, 669#true, 1333#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), t2_funThread1of1ForFork0InUse, 1987#true]) [2023-11-30 05:36:22,669 INFO L294 olderBase$Statistics]: this new event has 258 ancestors and is cut-off event [2023-11-30 05:36:22,669 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2023-11-30 05:36:22,669 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2023-11-30 05:36:22,669 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2023-11-30 05:36:24,823 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([853] L1041-52-->L1041-41: Formula: (let ((.cse0 (select |v_#pthreadsMutex_104| |v_~#__global_lock~0.base_35|))) (and (= |v_t2_funThread1of1ForFork0_#t~nondet28#1_1| 0) (= (store |v_#pthreadsMutex_104| |v_~#__global_lock~0.base_35| (store .cse0 |v_~#__global_lock~0.offset_35| 1)) |v_#pthreadsMutex_103|) (= (select .cse0 |v_~#__global_lock~0.offset_35|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_104|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_103|, t2_funThread1of1ForFork0_#t~nondet28#1=|v_t2_funThread1of1ForFork0_#t~nondet28#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet28#1][944], [t1_funThread1of1ForFork1InUse, 139#L1052-16true, 338#true, 308#true, 328#true, 2699#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 1062#true, 321#true, 1326#true, 295#true, 4491#(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)), 260#L1009true, 291#true, 22#L1041-41true, 1333#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 669#true, t2_funThread1of1ForFork0InUse, 1987#true]) [2023-11-30 05:36:24,823 INFO L294 olderBase$Statistics]: this new event has 261 ancestors and is not cut-off event [2023-11-30 05:36:24,823 INFO L297 olderBase$Statistics]: existing Event has 261 ancestors and is not cut-off event [2023-11-30 05:36:24,823 INFO L297 olderBase$Statistics]: existing Event has 261 ancestors and is not cut-off event [2023-11-30 05:36:24,824 INFO L297 olderBase$Statistics]: existing Event has 261 ancestors and is not cut-off event [2023-11-30 05:36:25,187 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L1041-18-->L1041-7: Formula: (let ((.cse0 (select |v_#pthreadsMutex_64| |v_~#__global_lock~0.base_19|))) (and (= |v_t2_funThread1of1ForFork0_#t~nondet20#1_1| 0) (= |v_#pthreadsMutex_63| (store |v_#pthreadsMutex_64| |v_~#__global_lock~0.base_19| (store .cse0 |v_~#__global_lock~0.offset_19| 1))) (= (select .cse0 |v_~#__global_lock~0.offset_19|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_64|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_19|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_19|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_63|, t2_funThread1of1ForFork0_#t~nondet20#1=|v_t2_funThread1of1ForFork0_#t~nondet20#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_19|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_19|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet20#1][948], [t1_funThread1of1ForFork1InUse, 139#L1052-16true, 338#true, 308#true, 63#L1041-7true, 1062#true, 328#true, 2699#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 321#true, 1326#true, 295#true, 4491#(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)), 260#L1009true, 291#true, 1333#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 669#true, t2_funThread1of1ForFork0InUse, 1987#true]) [2023-11-30 05:36:25,187 INFO L294 olderBase$Statistics]: this new event has 262 ancestors and is not cut-off event [2023-11-30 05:36:25,187 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is not cut-off event [2023-11-30 05:36:25,187 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is not cut-off event [2023-11-30 05:36:25,187 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is not cut-off event [2023-11-30 05:36:25,187 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L1041-18-->L1041-7: Formula: (let ((.cse0 (select |v_#pthreadsMutex_64| |v_~#__global_lock~0.base_19|))) (and (= |v_t2_funThread1of1ForFork0_#t~nondet20#1_1| 0) (= |v_#pthreadsMutex_63| (store |v_#pthreadsMutex_64| |v_~#__global_lock~0.base_19| (store .cse0 |v_~#__global_lock~0.offset_19| 1))) (= (select .cse0 |v_~#__global_lock~0.offset_19|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_64|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_19|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_19|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_63|, t2_funThread1of1ForFork0_#t~nondet20#1=|v_t2_funThread1of1ForFork0_#t~nondet20#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_19|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_19|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet20#1][948], [t1_funThread1of1ForFork1InUse, 308#true, 338#true, 63#L1041-7true, 328#true, 2699#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 1062#true, 321#true, 209#ULTIMATE.startFINALtrue, 1326#true, 295#true, 4491#(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)), 260#L1009true, 291#true, 669#true, 1333#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), t2_funThread1of1ForFork0InUse, 1987#true]) [2023-11-30 05:36:25,187 INFO L294 olderBase$Statistics]: this new event has 265 ancestors and is cut-off event [2023-11-30 05:36:25,187 INFO L297 olderBase$Statistics]: existing Event has 265 ancestors and is cut-off event [2023-11-30 05:36:25,187 INFO L297 olderBase$Statistics]: existing Event has 265 ancestors and is cut-off event [2023-11-30 05:36:25,187 INFO L297 olderBase$Statistics]: existing Event has 265 ancestors and is cut-off event [2023-11-30 05:36:25,204 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([864] L1041-42-->t2_funErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (or (< |v_t2_funThread1of1ForFork0_~p~2#1.offset_5| 0) (< (select |v_#length_16| |v_t2_funThread1of1ForFork0_~p~2#1.base_7|) (+ |v_t2_funThread1of1ForFork0_~p~2#1.offset_5| 4))) InVars {#length=|v_#length_16|, t2_funThread1of1ForFork0_~p~2#1.base=|v_t2_funThread1of1ForFork0_~p~2#1.base_7|, t2_funThread1of1ForFork0_~p~2#1.offset=|v_t2_funThread1of1ForFork0_~p~2#1.offset_5|} OutVars{#length=|v_#length_16|, t2_funThread1of1ForFork0_~p~2#1.base=|v_t2_funThread1of1ForFork0_~p~2#1.base_7|, t2_funThread1of1ForFork0_~p~2#1.offset=|v_t2_funThread1of1ForFork0_~p~2#1.offset_5|} AuxVars[] AssignedVars[][1103], [t1_funThread1of1ForFork1InUse, 139#L1052-16true, 308#true, 338#true, 1062#true, 2699#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 328#true, 321#true, 52#t2_funErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 295#true, 1326#true, 4491#(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)), 260#L1009true, 291#true, 669#true, 1333#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), t2_funThread1of1ForFork0InUse, 1987#true]) [2023-11-30 05:36:25,204 INFO L294 olderBase$Statistics]: this new event has 263 ancestors and is cut-off event [2023-11-30 05:36:25,205 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2023-11-30 05:36:25,205 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2023-11-30 05:36:25,205 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2023-11-30 05:36:25,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L1041-42-->L1041-43: Formula: (and (<= (+ |v_t2_funThread1of1ForFork0_~p~2#1.offset_3| 4) (select |v_#length_15| |v_t2_funThread1of1ForFork0_~p~2#1.base_3|)) (= |v_t2_funThread1of1ForFork0_#t~mem29#1_1| (select (select |v_#memory_int_7| |v_t2_funThread1of1ForFork0_~p~2#1.base_3|) |v_t2_funThread1of1ForFork0_~p~2#1.offset_3|)) (= (select |v_#valid_15| |v_t2_funThread1of1ForFork0_~p~2#1.base_3|) 1) (<= 0 |v_t2_funThread1of1ForFork0_~p~2#1.offset_3|)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_15|, t2_funThread1of1ForFork0_~p~2#1.base=|v_t2_funThread1of1ForFork0_~p~2#1.base_3|, t2_funThread1of1ForFork0_~p~2#1.offset=|v_t2_funThread1of1ForFork0_~p~2#1.offset_3|, #valid=|v_#valid_15|} OutVars{t2_funThread1of1ForFork0_#t~mem29#1=|v_t2_funThread1of1ForFork0_#t~mem29#1_1|, t2_funThread1of1ForFork0_~p~2#1.base=|v_t2_funThread1of1ForFork0_~p~2#1.base_3|, t2_funThread1of1ForFork0_~p~2#1.offset=|v_t2_funThread1of1ForFork0_~p~2#1.offset_3|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, #length=|v_#length_15|} AuxVars[] AssignedVars[t2_funThread1of1ForFork0_#t~mem29#1][1107], [t1_funThread1of1ForFork1InUse, 139#L1052-16true, 338#true, 308#true, 148#L1041-43true, 2699#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 328#true, 1062#true, 321#true, 1326#true, 295#true, 4491#(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)), 260#L1009true, 291#true, 669#true, 1333#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), t2_funThread1of1ForFork0InUse, 1987#true]) [2023-11-30 05:36:25,206 INFO L294 olderBase$Statistics]: this new event has 263 ancestors and is cut-off event [2023-11-30 05:36:25,206 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2023-11-30 05:36:25,206 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2023-11-30 05:36:25,206 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2023-11-30 05:36:25,561 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([868] L1041-8-->L1041-9: Formula: (and (= |v_t2_funThread1of1ForFork0_#t~mem21#1_1| (select (select |v_#memory_int_1| |v_t2_funThread1of1ForFork0_~p~2#1.base_9|) |v_t2_funThread1of1ForFork0_~p~2#1.offset_7|)) (<= 0 |v_t2_funThread1of1ForFork0_~p~2#1.offset_7|) (= (select |v_#valid_7| |v_t2_funThread1of1ForFork0_~p~2#1.base_9|) 1) (<= (+ |v_t2_funThread1of1ForFork0_~p~2#1.offset_7| 4) (select |v_#length_7| |v_t2_funThread1of1ForFork0_~p~2#1.base_9|))) InVars {#memory_int=|v_#memory_int_1|, #length=|v_#length_7|, t2_funThread1of1ForFork0_~p~2#1.base=|v_t2_funThread1of1ForFork0_~p~2#1.base_9|, t2_funThread1of1ForFork0_~p~2#1.offset=|v_t2_funThread1of1ForFork0_~p~2#1.offset_7|, #valid=|v_#valid_7|} OutVars{t2_funThread1of1ForFork0_~p~2#1.base=|v_t2_funThread1of1ForFork0_~p~2#1.base_9|, t2_funThread1of1ForFork0_~p~2#1.offset=|v_t2_funThread1of1ForFork0_~p~2#1.offset_7|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, t2_funThread1of1ForFork0_#t~mem21#1=|v_t2_funThread1of1ForFork0_#t~mem21#1_1|, #length=|v_#length_7|} AuxVars[] AssignedVars[t2_funThread1of1ForFork0_#t~mem21#1][1139], [t1_funThread1of1ForFork1InUse, 139#L1052-16true, 308#true, 338#true, 44#L1041-9true, 2699#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 1062#true, 328#true, 321#true, 295#true, 1326#true, 4491#(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)), 260#L1009true, 291#true, 669#true, 1333#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), t2_funThread1of1ForFork0InUse, 1987#true]) [2023-11-30 05:36:25,561 INFO L294 olderBase$Statistics]: this new event has 264 ancestors and is cut-off event [2023-11-30 05:36:25,561 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2023-11-30 05:36:25,561 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2023-11-30 05:36:25,561 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2023-11-30 05:36:25,562 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([870] L1041-8-->t2_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (or (< (select |v_#length_8| |v_t2_funThread1of1ForFork0_~p~2#1.base_13|) (+ |v_t2_funThread1of1ForFork0_~p~2#1.offset_9| 4)) (< |v_t2_funThread1of1ForFork0_~p~2#1.offset_9| 0)) InVars {#length=|v_#length_8|, t2_funThread1of1ForFork0_~p~2#1.base=|v_t2_funThread1of1ForFork0_~p~2#1.base_13|, t2_funThread1of1ForFork0_~p~2#1.offset=|v_t2_funThread1of1ForFork0_~p~2#1.offset_9|} OutVars{#length=|v_#length_8|, t2_funThread1of1ForFork0_~p~2#1.base=|v_t2_funThread1of1ForFork0_~p~2#1.base_13|, t2_funThread1of1ForFork0_~p~2#1.offset=|v_t2_funThread1of1ForFork0_~p~2#1.offset_9|} AuxVars[] AssignedVars[][1143], [t1_funThread1of1ForFork1InUse, 139#L1052-16true, 338#true, 308#true, 210#t2_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 1062#true, 328#true, 2699#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 321#true, 1326#true, 295#true, 4491#(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)), 260#L1009true, 291#true, 1333#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 669#true, t2_funThread1of1ForFork0InUse, 1987#true]) [2023-11-30 05:36:25,562 INFO L294 olderBase$Statistics]: this new event has 264 ancestors and is cut-off event [2023-11-30 05:36:25,562 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2023-11-30 05:36:25,562 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2023-11-30 05:36:25,562 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2023-11-30 05:36:25,924 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([853] L1041-52-->L1041-41: Formula: (let ((.cse0 (select |v_#pthreadsMutex_104| |v_~#__global_lock~0.base_35|))) (and (= |v_t2_funThread1of1ForFork0_#t~nondet28#1_1| 0) (= (store |v_#pthreadsMutex_104| |v_~#__global_lock~0.base_35| (store .cse0 |v_~#__global_lock~0.offset_35| 1)) |v_#pthreadsMutex_103|) (= (select .cse0 |v_~#__global_lock~0.offset_35|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_104|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_103|, t2_funThread1of1ForFork0_#t~nondet28#1=|v_t2_funThread1of1ForFork0_#t~nondet28#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet28#1][944], [t1_funThread1of1ForFork1InUse, 338#true, 308#true, 1062#true, 328#true, 2699#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 321#true, 209#ULTIMATE.startFINALtrue, 295#true, 1326#true, 4491#(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)), 260#L1009true, 291#true, 22#L1041-41true, 1333#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 669#true, 1987#true, t2_funThread1of1ForFork0InUse]) [2023-11-30 05:36:25,924 INFO L294 olderBase$Statistics]: this new event has 264 ancestors and is not cut-off event [2023-11-30 05:36:25,924 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is not cut-off event [2023-11-30 05:36:25,924 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is not cut-off event [2023-11-30 05:36:25,924 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is not cut-off event [2023-11-30 05:36:26,540 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([864] L1041-42-->t2_funErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (or (< |v_t2_funThread1of1ForFork0_~p~2#1.offset_5| 0) (< (select |v_#length_16| |v_t2_funThread1of1ForFork0_~p~2#1.base_7|) (+ |v_t2_funThread1of1ForFork0_~p~2#1.offset_5| 4))) InVars {#length=|v_#length_16|, t2_funThread1of1ForFork0_~p~2#1.base=|v_t2_funThread1of1ForFork0_~p~2#1.base_7|, t2_funThread1of1ForFork0_~p~2#1.offset=|v_t2_funThread1of1ForFork0_~p~2#1.offset_5|} OutVars{#length=|v_#length_16|, t2_funThread1of1ForFork0_~p~2#1.base=|v_t2_funThread1of1ForFork0_~p~2#1.base_7|, t2_funThread1of1ForFork0_~p~2#1.offset=|v_t2_funThread1of1ForFork0_~p~2#1.offset_5|} AuxVars[] AssignedVars[][1103], [t1_funThread1of1ForFork1InUse, 338#true, 308#true, 1062#true, 328#true, 2699#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 321#true, 52#t2_funErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 209#ULTIMATE.startFINALtrue, 1326#true, 295#true, 4491#(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)), 260#L1009true, 291#true, 1333#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 669#true, t2_funThread1of1ForFork0InUse, 1987#true]) [2023-11-30 05:36:26,540 INFO L294 olderBase$Statistics]: this new event has 266 ancestors and is cut-off event [2023-11-30 05:36:26,540 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2023-11-30 05:36:26,540 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2023-11-30 05:36:26,540 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2023-11-30 05:36:26,541 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L1041-42-->L1041-43: Formula: (and (<= (+ |v_t2_funThread1of1ForFork0_~p~2#1.offset_3| 4) (select |v_#length_15| |v_t2_funThread1of1ForFork0_~p~2#1.base_3|)) (= |v_t2_funThread1of1ForFork0_#t~mem29#1_1| (select (select |v_#memory_int_7| |v_t2_funThread1of1ForFork0_~p~2#1.base_3|) |v_t2_funThread1of1ForFork0_~p~2#1.offset_3|)) (= (select |v_#valid_15| |v_t2_funThread1of1ForFork0_~p~2#1.base_3|) 1) (<= 0 |v_t2_funThread1of1ForFork0_~p~2#1.offset_3|)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_15|, t2_funThread1of1ForFork0_~p~2#1.base=|v_t2_funThread1of1ForFork0_~p~2#1.base_3|, t2_funThread1of1ForFork0_~p~2#1.offset=|v_t2_funThread1of1ForFork0_~p~2#1.offset_3|, #valid=|v_#valid_15|} OutVars{t2_funThread1of1ForFork0_#t~mem29#1=|v_t2_funThread1of1ForFork0_#t~mem29#1_1|, t2_funThread1of1ForFork0_~p~2#1.base=|v_t2_funThread1of1ForFork0_~p~2#1.base_3|, t2_funThread1of1ForFork0_~p~2#1.offset=|v_t2_funThread1of1ForFork0_~p~2#1.offset_3|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, #length=|v_#length_15|} AuxVars[] AssignedVars[t2_funThread1of1ForFork0_#t~mem29#1][1107], [t1_funThread1of1ForFork1InUse, 338#true, 308#true, 148#L1041-43true, 1062#true, 328#true, 2699#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 321#true, 209#ULTIMATE.startFINALtrue, 295#true, 1326#true, 4491#(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)), 260#L1009true, 291#true, 1333#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 669#true, t2_funThread1of1ForFork0InUse, 1987#true]) [2023-11-30 05:36:26,541 INFO L294 olderBase$Statistics]: this new event has 266 ancestors and is cut-off event [2023-11-30 05:36:26,541 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2023-11-30 05:36:26,541 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2023-11-30 05:36:26,541 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2023-11-30 05:36:26,900 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([868] L1041-8-->L1041-9: Formula: (and (= |v_t2_funThread1of1ForFork0_#t~mem21#1_1| (select (select |v_#memory_int_1| |v_t2_funThread1of1ForFork0_~p~2#1.base_9|) |v_t2_funThread1of1ForFork0_~p~2#1.offset_7|)) (<= 0 |v_t2_funThread1of1ForFork0_~p~2#1.offset_7|) (= (select |v_#valid_7| |v_t2_funThread1of1ForFork0_~p~2#1.base_9|) 1) (<= (+ |v_t2_funThread1of1ForFork0_~p~2#1.offset_7| 4) (select |v_#length_7| |v_t2_funThread1of1ForFork0_~p~2#1.base_9|))) InVars {#memory_int=|v_#memory_int_1|, #length=|v_#length_7|, t2_funThread1of1ForFork0_~p~2#1.base=|v_t2_funThread1of1ForFork0_~p~2#1.base_9|, t2_funThread1of1ForFork0_~p~2#1.offset=|v_t2_funThread1of1ForFork0_~p~2#1.offset_7|, #valid=|v_#valid_7|} OutVars{t2_funThread1of1ForFork0_~p~2#1.base=|v_t2_funThread1of1ForFork0_~p~2#1.base_9|, t2_funThread1of1ForFork0_~p~2#1.offset=|v_t2_funThread1of1ForFork0_~p~2#1.offset_7|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, t2_funThread1of1ForFork0_#t~mem21#1=|v_t2_funThread1of1ForFork0_#t~mem21#1_1|, #length=|v_#length_7|} AuxVars[] AssignedVars[t2_funThread1of1ForFork0_#t~mem21#1][1139], [t1_funThread1of1ForFork1InUse, 338#true, 308#true, 44#L1041-9true, 2699#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 328#true, 1062#true, 321#true, 1326#true, 209#ULTIMATE.startFINALtrue, 295#true, 4491#(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)), 260#L1009true, 291#true, 669#true, 1333#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), t2_funThread1of1ForFork0InUse, 1987#true]) [2023-11-30 05:36:26,900 INFO L294 olderBase$Statistics]: this new event has 267 ancestors and is cut-off event [2023-11-30 05:36:26,900 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-30 05:36:26,900 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-30 05:36:26,900 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-30 05:36:26,901 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([870] L1041-8-->t2_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (or (< (select |v_#length_8| |v_t2_funThread1of1ForFork0_~p~2#1.base_13|) (+ |v_t2_funThread1of1ForFork0_~p~2#1.offset_9| 4)) (< |v_t2_funThread1of1ForFork0_~p~2#1.offset_9| 0)) InVars {#length=|v_#length_8|, t2_funThread1of1ForFork0_~p~2#1.base=|v_t2_funThread1of1ForFork0_~p~2#1.base_13|, t2_funThread1of1ForFork0_~p~2#1.offset=|v_t2_funThread1of1ForFork0_~p~2#1.offset_9|} OutVars{#length=|v_#length_8|, t2_funThread1of1ForFork0_~p~2#1.base=|v_t2_funThread1of1ForFork0_~p~2#1.base_13|, t2_funThread1of1ForFork0_~p~2#1.offset=|v_t2_funThread1of1ForFork0_~p~2#1.offset_9|} AuxVars[] AssignedVars[][1143], [t1_funThread1of1ForFork1InUse, 338#true, 308#true, 210#t2_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 328#true, 2699#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 1062#true, 321#true, 295#true, 209#ULTIMATE.startFINALtrue, 1326#true, 4491#(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)), 260#L1009true, 291#true, 1333#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 669#true, t2_funThread1of1ForFork0InUse, 1987#true]) [2023-11-30 05:36:26,901 INFO L294 olderBase$Statistics]: this new event has 267 ancestors and is cut-off event [2023-11-30 05:36:26,901 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-30 05:36:26,901 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-30 05:36:26,901 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-30 05:36:30,360 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L1041-55-->L1042-2: Formula: (and (= |v_t2_funThread1of1ForFork0_#t~nondet31#1_1| 0) (= |v_#pthreadsMutex_95| (store |v_#pthreadsMutex_96| |v_~#mutexes~0.base_12| (store (select |v_#pthreadsMutex_96| |v_~#mutexes~0.base_12|) (+ (* |v_t2_funThread1of1ForFork0_~i~1#1_11| 24) |v_~#mutexes~0.offset_11|) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_96|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_11|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_11|, ~#mutexes~0.base=|v_~#mutexes~0.base_12|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_95|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_11|, t2_funThread1of1ForFork0_#t~nondet31#1=|v_t2_funThread1of1ForFork0_#t~nondet31#1_1|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_11|, ~#mutexes~0.base=|v_~#mutexes~0.base_12|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet31#1][1341], [t1_funThread1of1ForFork1InUse, 139#L1052-16true, 338#true, 308#true, 2699#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 1062#true, 328#true, 321#true, 295#true, 1326#true, 4491#(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)), 260#L1009true, 291#true, 123#L1042-2true, 1333#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 669#true, t2_funThread1of1ForFork0InUse, 1987#true]) [2023-11-30 05:36:30,361 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is not cut-off event [2023-11-30 05:36:30,361 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is not cut-off event [2023-11-30 05:36:30,361 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is not cut-off event [2023-11-30 05:36:30,361 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is not cut-off event [2023-11-30 05:36:31,549 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L1041-55-->L1042-2: Formula: (and (= |v_t2_funThread1of1ForFork0_#t~nondet31#1_1| 0) (= |v_#pthreadsMutex_95| (store |v_#pthreadsMutex_96| |v_~#mutexes~0.base_12| (store (select |v_#pthreadsMutex_96| |v_~#mutexes~0.base_12|) (+ (* |v_t2_funThread1of1ForFork0_~i~1#1_11| 24) |v_~#mutexes~0.offset_11|) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_96|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_11|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_11|, ~#mutexes~0.base=|v_~#mutexes~0.base_12|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_95|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_11|, t2_funThread1of1ForFork0_#t~nondet31#1=|v_t2_funThread1of1ForFork0_#t~nondet31#1_1|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_11|, ~#mutexes~0.base=|v_~#mutexes~0.base_12|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet31#1][1341], [t1_funThread1of1ForFork1InUse, 308#true, 338#true, 1062#true, 328#true, 2699#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 321#true, 1326#true, 209#ULTIMATE.startFINALtrue, 295#true, 4491#(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)), 260#L1009true, 291#true, 123#L1042-2true, 1333#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 669#true, t2_funThread1of1ForFork0InUse, 1987#true]) [2023-11-30 05:36:31,550 INFO L294 olderBase$Statistics]: this new event has 278 ancestors and is not cut-off event [2023-11-30 05:36:31,550 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is not cut-off event [2023-11-30 05:36:31,550 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is not cut-off event [2023-11-30 05:36:31,550 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is not cut-off event [2023-11-30 05:36:32,828 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L1041-55-->L1042-2: Formula: (and (= |v_t2_funThread1of1ForFork0_#t~nondet31#1_1| 0) (= |v_#pthreadsMutex_95| (store |v_#pthreadsMutex_96| |v_~#mutexes~0.base_12| (store (select |v_#pthreadsMutex_96| |v_~#mutexes~0.base_12|) (+ (* |v_t2_funThread1of1ForFork0_~i~1#1_11| 24) |v_~#mutexes~0.offset_11|) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_96|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_11|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_11|, ~#mutexes~0.base=|v_~#mutexes~0.base_12|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_95|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_11|, t2_funThread1of1ForFork0_#t~nondet31#1=|v_t2_funThread1of1ForFork0_#t~nondet31#1_1|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_11|, ~#mutexes~0.base=|v_~#mutexes~0.base_12|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet31#1][1341], [t1_funThread1of1ForFork1InUse, 338#true, 308#true, 328#true, 2699#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 1062#true, 321#true, 295#true, 1326#true, 4491#(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)), 260#L1009true, 291#true, 123#L1042-2true, 669#true, 1333#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 204#L1052-15true, 1987#true, t2_funThread1of1ForFork0InUse]) [2023-11-30 05:36:32,829 INFO L294 olderBase$Statistics]: this new event has 283 ancestors and is cut-off event [2023-11-30 05:36:32,829 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2023-11-30 05:36:32,829 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2023-11-30 05:36:32,829 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2023-11-30 05:36:32,829 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([841] L1041-55-->L1042-2: Formula: (and (= |v_t2_funThread1of1ForFork0_#t~nondet31#1_1| 0) (= |v_#pthreadsMutex_95| (store |v_#pthreadsMutex_96| |v_~#mutexes~0.base_12| (store (select |v_#pthreadsMutex_96| |v_~#mutexes~0.base_12|) (+ (* |v_t2_funThread1of1ForFork0_~i~1#1_11| 24) |v_~#mutexes~0.offset_11|) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_96|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_11|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_11|, ~#mutexes~0.base=|v_~#mutexes~0.base_12|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_95|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_11|, t2_funThread1of1ForFork0_#t~nondet31#1=|v_t2_funThread1of1ForFork0_#t~nondet31#1_1|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_11|, ~#mutexes~0.base=|v_~#mutexes~0.base_12|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet31#1][1341], [t1_funThread1of1ForFork1InUse, 338#true, 308#true, 1062#true, 2699#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 328#true, 321#true, 1326#true, 209#ULTIMATE.startFINALtrue, 295#true, 4491#(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)), 260#L1009true, 291#true, 123#L1042-2true, 1333#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 669#true, t2_funThread1of1ForFork0InUse, 1987#true]) [2023-11-30 05:36:32,829 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2023-11-30 05:36:32,829 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2023-11-30 05:36:32,829 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2023-11-30 05:36:32,829 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2023-11-30 05:36:32,829 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2023-11-30 05:36:32,829 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([841] L1041-55-->L1042-2: Formula: (and (= |v_t2_funThread1of1ForFork0_#t~nondet31#1_1| 0) (= |v_#pthreadsMutex_95| (store |v_#pthreadsMutex_96| |v_~#mutexes~0.base_12| (store (select |v_#pthreadsMutex_96| |v_~#mutexes~0.base_12|) (+ (* |v_t2_funThread1of1ForFork0_~i~1#1_11| 24) |v_~#mutexes~0.offset_11|) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_96|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_11|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_11|, ~#mutexes~0.base=|v_~#mutexes~0.base_12|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_95|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_11|, t2_funThread1of1ForFork0_#t~nondet31#1=|v_t2_funThread1of1ForFork0_#t~nondet31#1_1|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_11|, ~#mutexes~0.base=|v_~#mutexes~0.base_12|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet31#1][1341], [t1_funThread1of1ForFork1InUse, 139#L1052-16true, 308#true, 338#true, 328#true, 1062#true, 2699#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 321#true, 295#true, 1326#true, 4491#(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)), 260#L1009true, 291#true, 123#L1042-2true, 1333#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 669#true, t2_funThread1of1ForFork0InUse, 1987#true]) [2023-11-30 05:36:32,829 INFO L294 olderBase$Statistics]: this new event has 284 ancestors and is cut-off event [2023-11-30 05:36:32,829 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-30 05:36:32,829 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-30 05:36:32,829 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-30 05:36:32,829 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-30 05:36:32,830 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L1041-55-->L1042-2: Formula: (and (= |v_t2_funThread1of1ForFork0_#t~nondet31#1_1| 0) (= |v_#pthreadsMutex_95| (store |v_#pthreadsMutex_96| |v_~#mutexes~0.base_12| (store (select |v_#pthreadsMutex_96| |v_~#mutexes~0.base_12|) (+ (* |v_t2_funThread1of1ForFork0_~i~1#1_11| 24) |v_~#mutexes~0.offset_11|) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_96|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_11|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_11|, ~#mutexes~0.base=|v_~#mutexes~0.base_12|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_95|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_11|, t2_funThread1of1ForFork0_#t~nondet31#1=|v_t2_funThread1of1ForFork0_#t~nondet31#1_1|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_11|, ~#mutexes~0.base=|v_~#mutexes~0.base_12|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet31#1][1341], [t1_funThread1of1ForFork1InUse, 139#L1052-16true, 338#true, 308#true, 2699#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 328#true, 1062#true, 321#true, 1326#true, 295#true, 4491#(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)), 291#true, 123#L1042-2true, 93#L1030-4true, 1333#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 669#true, t2_funThread1of1ForFork0InUse, 1987#true]) [2023-11-30 05:36:32,830 INFO L294 olderBase$Statistics]: this new event has 283 ancestors and is cut-off event [2023-11-30 05:36:32,830 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2023-11-30 05:36:32,830 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2023-11-30 05:36:32,830 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2023-11-30 05:36:33,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L1041-55-->L1042-2: Formula: (and (= |v_t2_funThread1of1ForFork0_#t~nondet31#1_1| 0) (= |v_#pthreadsMutex_95| (store |v_#pthreadsMutex_96| |v_~#mutexes~0.base_12| (store (select |v_#pthreadsMutex_96| |v_~#mutexes~0.base_12|) (+ (* |v_t2_funThread1of1ForFork0_~i~1#1_11| 24) |v_~#mutexes~0.offset_11|) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_96|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_11|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_11|, ~#mutexes~0.base=|v_~#mutexes~0.base_12|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_95|, ~#mutexes~0.offset=|v_~#mutexes~0.offset_11|, t2_funThread1of1ForFork0_#t~nondet31#1=|v_t2_funThread1of1ForFork0_#t~nondet31#1_1|, t2_funThread1of1ForFork0_~i~1#1=|v_t2_funThread1of1ForFork0_~i~1#1_11|, ~#mutexes~0.base=|v_~#mutexes~0.base_12|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet31#1][1341], [t1_funThread1of1ForFork1InUse, 308#true, 338#true, 2699#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), 328#true, 1062#true, 321#true, 209#ULTIMATE.startFINALtrue, 1326#true, 295#true, 4491#(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)), 291#true, 123#L1042-2true, 93#L1030-4true, 669#true, 1333#(and (= |~#buckets~0.offset| 0) (= |~#buckets~0.base| 4) (= (select |#length| 4) 1024)), t2_funThread1of1ForFork0InUse, 1987#true]) [2023-11-30 05:36:33,875 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2023-11-30 05:36:33,875 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2023-11-30 05:36:33,875 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2023-11-30 05:36:33,875 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2023-11-30 05:36:50,013 INFO L124 PetriNetUnfolderBase]: 54449/121340 cut-off events. [2023-11-30 05:36:50,014 INFO L125 PetriNetUnfolderBase]: For 1426128/1486757 co-relation queries the response was YES. [2023-11-30 05:36:50,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 836951 conditions, 121340 events. 54449/121340 cut-off events. For 1426128/1486757 co-relation queries the response was YES. Maximal size of possible extension queue 3111. Compared 1521042 event pairs, 8281 based on Foata normal form. 5561/122595 useless extension candidates. Maximal degree in co-relation 586847. Up to 60275 conditions per place. [2023-11-30 05:36:51,853 INFO L140 encePairwiseOnDemand]: 302/311 looper letters, 1333 selfloop transitions, 16 changer transitions 0/1858 dead transitions. [2023-11-30 05:36:51,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 1858 transitions, 35782 flow [2023-11-30 05:36:51,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 05:36:51,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 05:36:51,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1738 transitions. [2023-11-30 05:36:51,856 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7983463481855765 [2023-11-30 05:36:51,856 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1738 transitions. [2023-11-30 05:36:51,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1738 transitions. [2023-11-30 05:36:51,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:36:51,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1738 transitions. [2023-11-30 05:36:51,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 248.28571428571428) internal successors, (1738), 7 states have internal predecessors, (1738), 0 states have call successors, (0), 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:36:51,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 311.0) internal successors, (2488), 8 states have internal predecessors, (2488), 0 states have call successors, (0), 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:36:51,873 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 311.0) internal successors, (2488), 8 states have internal predecessors, (2488), 0 states have call successors, (0), 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:36:51,874 INFO L307 CegarLoopForPetriNet]: 288 programPoint places, 192 predicate places. [2023-11-30 05:36:51,874 INFO L500 AbstractCegarLoop]: Abstraction has has 480 places, 1858 transitions, 35782 flow [2023-11-30 05:36:51,874 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 213.33333333333334) internal successors, (1280), 6 states have internal predecessors, (1280), 0 states have call successors, (0), 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:36:51,874 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:36:51,874 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:36:51,883 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:36:52,078 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:36:52,079 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:36:52,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:36:52,079 INFO L85 PathProgramCache]: Analyzing trace with hash -920406585, now seen corresponding path program 1 times [2023-11-30 05:36:52,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:36:52,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253090629] [2023-11-30 05:36:52,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:36:52,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:36:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:36:52,345 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:36:52,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:36:52,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253090629] [2023-11-30 05:36:52,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253090629] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:36:52,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:36:52,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 05:36:52,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358007140] [2023-11-30 05:36:52,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:36:52,346 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 05:36:52,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:36:52,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 05:36:52,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-30 05:36:52,347 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 311 [2023-11-30 05:36:52,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 1858 transitions, 35782 flow. Second operand has 6 states, 6 states have (on average 210.5) internal successors, (1263), 6 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:36:52,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:36:52,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 311 [2023-11-30 05:36:52,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:37:46,128 INFO L124 PetriNetUnfolderBase]: 64480/150866 cut-off events. [2023-11-30 05:37:46,129 INFO L125 PetriNetUnfolderBase]: For 1793048/1875250 co-relation queries the response was YES. [2023-11-30 05:37:47,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1039976 conditions, 150866 events. 64480/150866 cut-off events. For 1793048/1875250 co-relation queries the response was YES. Maximal size of possible extension queue 3772. Compared 1952295 event pairs, 23072 based on Foata normal form. 3952/150111 useless extension candidates. Maximal degree in co-relation 780169. Up to 68234 conditions per place. [2023-11-30 05:37:48,486 INFO L140 encePairwiseOnDemand]: 298/311 looper letters, 1742 selfloop transitions, 63 changer transitions 0/2546 dead transitions. [2023-11-30 05:37:48,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 487 places, 2546 transitions, 53990 flow [2023-11-30 05:37:48,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-30 05:37:48,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-30 05:37:48,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1974 transitions. [2023-11-30 05:37:48,488 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7934083601286174 [2023-11-30 05:37:48,488 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1974 transitions. [2023-11-30 05:37:48,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1974 transitions. [2023-11-30 05:37:48,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:37:48,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1974 transitions. [2023-11-30 05:37:48,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 246.75) internal successors, (1974), 8 states have internal predecessors, (1974), 0 states have call successors, (0), 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:37:48,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 311.0) internal successors, (2799), 9 states have internal predecessors, (2799), 0 states have call successors, (0), 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:37:48,503 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 311.0) internal successors, (2799), 9 states have internal predecessors, (2799), 0 states have call successors, (0), 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:37:48,504 INFO L307 CegarLoopForPetriNet]: 288 programPoint places, 199 predicate places. [2023-11-30 05:37:48,504 INFO L500 AbstractCegarLoop]: Abstraction has has 487 places, 2546 transitions, 53990 flow [2023-11-30 05:37:48,504 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 210.5) internal successors, (1263), 6 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:37:48,504 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:37:48,504 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:37:48,504 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 05:37:48,504 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:37:48,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:37:48,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1624074933, now seen corresponding path program 1 times [2023-11-30 05:37:48,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:37:48,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525799636] [2023-11-30 05:37:48,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:37:48,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:37:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:37:49,237 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:37:49,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:37:49,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525799636] [2023-11-30 05:37:49,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525799636] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:37:49,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893267615] [2023-11-30 05:37:49,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:37:49,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:37:49,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:37:49,239 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:37:49,241 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:37:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:37:49,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-30 05:37:49,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:37:49,642 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:37:49,642 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:37:50,041 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:37:50,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893267615] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:37:50,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:37:50,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 42 [2023-11-30 05:37:50,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368297569] [2023-11-30 05:37:50,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:37:50,042 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-30 05:37:50,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:37:50,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-30 05:37:50,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=462, Invalid=1260, Unknown=0, NotChecked=0, Total=1722 [2023-11-30 05:37:50,047 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 311 [2023-11-30 05:37:50,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 2546 transitions, 53990 flow. Second operand has 42 states, 42 states have (on average 262.8809523809524) internal successors, (11041), 42 states have internal predecessors, (11041), 0 states have call successors, (0), 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:37:50,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:37:50,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 311 [2023-11-30 05:37:50,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:38:43,694 INFO L124 PetriNetUnfolderBase]: 48886/119417 cut-off events. [2023-11-30 05:38:43,708 INFO L125 PetriNetUnfolderBase]: For 1627003/1683216 co-relation queries the response was YES. [2023-11-30 05:38:44,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815791 conditions, 119417 events. 48886/119417 cut-off events. For 1627003/1683216 co-relation queries the response was YES. Maximal size of possible extension queue 3766. Compared 1622011 event pairs, 11967 based on Foata normal form. 117/115439 useless extension candidates. Maximal degree in co-relation 801147. Up to 51896 conditions per place. [2023-11-30 05:38:45,583 INFO L140 encePairwiseOnDemand]: 305/311 looper letters, 669 selfloop transitions, 57 changer transitions 0/2254 dead transitions. [2023-11-30 05:38:45,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 2254 transitions, 48711 flow [2023-11-30 05:38:45,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-11-30 05:38:45,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2023-11-30 05:38:45,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 14972 transitions. [2023-11-30 05:38:45,591 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8445873526259379 [2023-11-30 05:38:45,591 INFO L72 ComplementDD]: Start complementDD. Operand 57 states and 14972 transitions. [2023-11-30 05:38:45,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 14972 transitions. [2023-11-30 05:38:45,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:38:45,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 57 states and 14972 transitions. [2023-11-30 05:38:45,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 58 states, 57 states have (on average 262.6666666666667) internal successors, (14972), 57 states have internal predecessors, (14972), 0 states have call successors, (0), 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:38:45,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 58 states, 58 states have (on average 311.0) internal successors, (18038), 58 states have internal predecessors, (18038), 0 states have call successors, (0), 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:38:45,611 INFO L81 ComplementDD]: Finished complementDD. Result has 58 states, 58 states have (on average 311.0) internal successors, (18038), 58 states have internal predecessors, (18038), 0 states have call successors, (0), 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:38:45,612 INFO L307 CegarLoopForPetriNet]: 288 programPoint places, 253 predicate places. [2023-11-30 05:38:45,612 INFO L500 AbstractCegarLoop]: Abstraction has has 541 places, 2254 transitions, 48711 flow [2023-11-30 05:38:45,613 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 262.8809523809524) internal successors, (11041), 42 states have internal predecessors, (11041), 0 states have call successors, (0), 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:38:45,613 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:38:45,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:38:45,618 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:38:45,818 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:38:45,818 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:38:45,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:38:45,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1907646134, now seen corresponding path program 4 times [2023-11-30 05:38:45,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:38:45,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387650086] [2023-11-30 05:38:45,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:38:45,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:38:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:38:51,252 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:38:51,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:38:51,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387650086] [2023-11-30 05:38:51,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387650086] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:38:51,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827799519] [2023-11-30 05:38:51,252 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-30 05:38:51,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:38:51,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:38:51,254 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:38:51,256 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:40:05,039 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-30 05:40:05,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 05:40:05,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 1435 conjuncts, 230 conjunts are in the unsatisfiable core [2023-11-30 05:40:05,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:40:05,284 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-30 05:40:05,284 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:40:05,767 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:40:05,767 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:40:05,778 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-30 05:40:05,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 26 [2023-11-30 05:40:06,225 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:40:06,225 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:40:06,228 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 20 treesize of output 13 [2023-11-30 05:40:06,720 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-30 05:40:06,721 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:40:06,728 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:40:06,728 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:40:07,163 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:40:07,163 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:40:07,165 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:40:07,690 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-30 05:40:07,690 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:40:07,693 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:40:07,905 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:40:07,905 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:40:07,910 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:40:08,421 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-30 05:40:08,421 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:40:08,427 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:40:09,186 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-30 05:40:09,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-30 05:40:09,189 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:40:09,885 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-30 05:40:09,885 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:40:09,895 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:40:09,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:40:10,506 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:40:10,507 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:40:10,509 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:40:11,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 05:40:11,110 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:40:11,425 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:40:11,426 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:40:11,432 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:40:12,063 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:40:12,063 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:40:12,067 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:40:12,702 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-30 05:40:12,702 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:40:12,709 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:40:12,709 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:40:13,364 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-30 05:40:13,364 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:40:13,374 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 05:40:13,375 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:40:13,754 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:40:13,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:40:14,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 05:40:14,343 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:40:15,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 05:40:15,046 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:40:15,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 05:40:15,816 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:40:16,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 05:40:16,698 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:40:17,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 05:40:17,517 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:40:18,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 05:40:18,489 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:40:19,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 05:40:19,458 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:40:22,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 05:40:22,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 134 [2023-11-30 05:40:25,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 05:40:25,230 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 58 treesize of output 76 [2023-11-30 05:40:26,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 05:40:26,954 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 58 treesize of output 76 [2023-11-30 05:40:28,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 05:40:28,776 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 58 treesize of output 76 [2023-11-30 05:40:32,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 05:40:32,665 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 90 treesize of output 108 [2023-11-30 05:40:34,773 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse1 (+ .cse0 8 |c_~#buckets~0.offset|))) (and (or (< 0 (+ 57 .cse0 |c_~#buckets~0.offset|)) (forall ((v_ArrVal_2894 Int) (|v_ULTIMATE.start_main_#t~malloc33#1.base_92| Int)) (or (< (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc33#1.base_92| v_ArrVal_2894) |c_~#buckets~0.base|) .cse1) (= |c_~#buckets~0.base| |v_ULTIMATE.start_main_#t~malloc33#1.base_92|)))) (forall ((v_prenex_18 Int)) (or (= |c_~#buckets~0.base| v_prenex_18) (forall ((v_prenex_17 Int) (v_prenex_12 Int) (|v_ULTIMATE.start_main_#t~malloc33#1.base_84| Int) (v_prenex_13 Int) (v_ArrVal_2909 Int) (v_ArrVal_2900 Int) (v_ArrVal_2899 Int)) (let ((.cse2 (store |c_#length| v_prenex_18 v_prenex_17))) (or (= |c_~#buckets~0.base| v_prenex_12) (= |c_~#buckets~0.base| |v_ULTIMATE.start_main_#t~malloc33#1.base_84|) (< (select .cse2 |c_~#buckets~0.base|) .cse1) (< (+ .cse0 59 |c_~#buckets~0.offset|) (select (store (store (store .cse2 |v_ULTIMATE.start_main_#t~malloc33#1.base_84| v_ArrVal_2899) v_prenex_13 v_ArrVal_2900) v_prenex_12 v_ArrVal_2909) |c_~#buckets~0.base|)) (= v_prenex_13 v_prenex_12) (= |c_~#buckets~0.base| v_prenex_13))))))))) is different from false [2023-11-30 05:40:42,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 05:40:42,736 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 105 treesize of output 123 [2023-11-30 05:40:45,779 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse1 (+ .cse0 12 |c_~#buckets~0.offset|))) (and (or (< 0 (+ .cse0 |c_~#buckets~0.offset| 61)) (forall ((|v_ULTIMATE.start_main_#t~malloc33#1.base_96| Int) (v_ArrVal_2892 Int) (v_ArrVal_2894 Int) (|v_ULTIMATE.start_main_#t~malloc33#1.base_92| Int) (v_prenex_20 Int) (v_prenex_19 Int)) (or (= |c_~#buckets~0.base| v_prenex_19) (< 8 v_ArrVal_2892) (< (select (store (store (store |c_#length| |v_ULTIMATE.start_main_#t~malloc33#1.base_96| v_ArrVal_2892) v_prenex_19 v_prenex_20) |v_ULTIMATE.start_main_#t~malloc33#1.base_92| v_ArrVal_2894) |c_~#buckets~0.base|) .cse1) (= |c_~#buckets~0.base| |v_ULTIMATE.start_main_#t~malloc33#1.base_92|)))) (forall ((v_ArrVal_2892 Int)) (or (forall ((v_prenex_18 Int) (v_prenex_17 Int) (|v_ULTIMATE.start_main_#t~malloc33#1.base_96| Int) (v_prenex_12 Int) (|v_ULTIMATE.start_main_#t~malloc33#1.base_84| Int) (|v_ULTIMATE.start_main_#t~malloc33#1.base_94| Int) (v_ArrVal_2893 Int) (v_prenex_13 Int) (v_ArrVal_2909 Int) (v_ArrVal_2900 Int) (v_ArrVal_2899 Int)) (let ((.cse2 (store (store (store |c_#length| |v_ULTIMATE.start_main_#t~malloc33#1.base_96| v_ArrVal_2892) |v_ULTIMATE.start_main_#t~malloc33#1.base_94| v_ArrVal_2893) v_prenex_18 v_prenex_17))) (or (= |c_~#buckets~0.base| v_prenex_12) (= |c_~#buckets~0.base| |v_ULTIMATE.start_main_#t~malloc33#1.base_94|) (= |c_~#buckets~0.base| |v_ULTIMATE.start_main_#t~malloc33#1.base_84|) (= |c_~#buckets~0.base| v_prenex_18) (< (select .cse2 |c_~#buckets~0.base|) .cse1) (< (+ .cse0 63 |c_~#buckets~0.offset|) (select (store (store (store .cse2 |v_ULTIMATE.start_main_#t~malloc33#1.base_84| v_ArrVal_2899) v_prenex_13 v_ArrVal_2900) v_prenex_12 v_ArrVal_2909) |c_~#buckets~0.base|)) (= v_prenex_13 v_prenex_12) (= |c_~#buckets~0.base| v_prenex_13)))) (< 8 v_ArrVal_2892)))))) is different from false [2023-11-30 05:40:47,890 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 12 |c_~#buckets~0.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc33#1.base_96| Int) (v_ArrVal_2892 Int) (v_ArrVal_2894 Int) (|v_ULTIMATE.start_main_#t~malloc33#1.base_92| Int) (v_prenex_20 Int) (v_prenex_19 Int)) (or (= |c_~#buckets~0.base| v_prenex_19) (< 8 v_ArrVal_2892) (< (select (store (store (store |c_#length| |v_ULTIMATE.start_main_#t~malloc33#1.base_96| v_ArrVal_2892) v_prenex_19 v_prenex_20) |v_ULTIMATE.start_main_#t~malloc33#1.base_92| v_ArrVal_2894) |c_~#buckets~0.base|) .cse0) (= |c_~#buckets~0.base| |v_ULTIMATE.start_main_#t~malloc33#1.base_92|))) (< 0 (+ |c_~#buckets~0.offset| 61))) (forall ((v_ArrVal_2892 Int)) (or (< 8 v_ArrVal_2892) (forall ((v_prenex_18 Int) (v_prenex_17 Int) (|v_ULTIMATE.start_main_#t~malloc33#1.base_96| Int) (v_prenex_12 Int) (|v_ULTIMATE.start_main_#t~malloc33#1.base_84| Int) (|v_ULTIMATE.start_main_#t~malloc33#1.base_94| Int) (v_ArrVal_2893 Int) (v_prenex_13 Int) (v_ArrVal_2909 Int) (v_ArrVal_2900 Int) (v_ArrVal_2899 Int)) (let ((.cse1 (store (store (store |c_#length| |v_ULTIMATE.start_main_#t~malloc33#1.base_96| v_ArrVal_2892) |v_ULTIMATE.start_main_#t~malloc33#1.base_94| v_ArrVal_2893) v_prenex_18 v_prenex_17))) (or (= |c_~#buckets~0.base| v_prenex_12) (= |c_~#buckets~0.base| |v_ULTIMATE.start_main_#t~malloc33#1.base_94|) (= |c_~#buckets~0.base| |v_ULTIMATE.start_main_#t~malloc33#1.base_84|) (= |c_~#buckets~0.base| v_prenex_18) (= v_prenex_13 v_prenex_12) (< (+ 63 |c_~#buckets~0.offset|) (select (store (store (store .cse1 |v_ULTIMATE.start_main_#t~malloc33#1.base_84| v_ArrVal_2899) v_prenex_13 v_ArrVal_2900) v_prenex_12 v_ArrVal_2909) |c_~#buckets~0.base|)) (= |c_~#buckets~0.base| v_prenex_13) (< (select .cse1 |c_~#buckets~0.base|) .cse0)))))))) is different from false [2023-11-30 05:40:48,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1875 backedges. 0 proven. 1678 refuted. 2 times theorem prover too weak. 0 trivial. 195 not checked. [2023-11-30 05:40:48,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827799519] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:40:48,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:40:48,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 96, 57] total 211 [2023-11-30 05:40:48,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447517532] [2023-11-30 05:40:48,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:40:48,792 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 212 states [2023-11-30 05:40:48,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:40:48,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 212 interpolants. [2023-11-30 05:40:48,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2953, Invalid=40524, Unknown=7, NotChecked=1248, Total=44732 [2023-11-30 05:40:48,812 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 311 [2023-11-30 05:40:48,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 2254 transitions, 48711 flow. Second operand has 212 states, 212 states have (on average 180.69811320754718) internal successors, (38308), 212 states have internal predecessors, (38308), 0 states have call successors, (0), 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:40:48,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:40:48,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 311 [2023-11-30 05:40:48,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:41:12,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-11-30 05:44:02,372 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-30 05:44:02,372 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-30 05:44:03,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-30 05:44:03,455 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 72 remaining) [2023-11-30 05:44:03,455 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 05:44:03,455 WARN L624 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-11-30 05:44:03,456 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 72 remaining) [2023-11-30 05:44:03,457 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 72 remaining) [2023-11-30 05:44:03,457 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 72 remaining) [2023-11-30 05:44:03,457 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 72 remaining) [2023-11-30 05:44:03,457 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 72 remaining) [2023-11-30 05:44:03,457 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 72 remaining) [2023-11-30 05:44:03,457 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 72 remaining) [2023-11-30 05:44:03,457 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 72 remaining) [2023-11-30 05:44:03,457 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 72 remaining) [2023-11-30 05:44:03,457 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 72 remaining) [2023-11-30 05:44:03,457 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 72 remaining) [2023-11-30 05:44:03,457 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 72 remaining) [2023-11-30 05:44:03,457 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 72 remaining) [2023-11-30 05:44:03,457 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 72 remaining) [2023-11-30 05:44:03,458 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 72 remaining) [2023-11-30 05:44:03,458 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 72 remaining) [2023-11-30 05:44:03,458 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 72 remaining) [2023-11-30 05:44:03,458 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 72 remaining) [2023-11-30 05:44:03,458 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 72 remaining) [2023-11-30 05:44:03,458 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 72 remaining) [2023-11-30 05:44:03,458 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 72 remaining) [2023-11-30 05:44:03,458 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 72 remaining) [2023-11-30 05:44:03,458 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 72 remaining) [2023-11-30 05:44:03,458 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 72 remaining) [2023-11-30 05:44:03,458 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 72 remaining) [2023-11-30 05:44:03,458 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 72 remaining) [2023-11-30 05:44:03,458 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 72 remaining) [2023-11-30 05:44:03,458 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 72 remaining) [2023-11-30 05:44:03,458 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 72 remaining) [2023-11-30 05:44:03,458 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 72 remaining) [2023-11-30 05:44:03,458 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 72 remaining) [2023-11-30 05:44:03,458 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 72 remaining) [2023-11-30 05:44:03,458 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 72 remaining) [2023-11-30 05:44:03,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 72 remaining) [2023-11-30 05:44:03,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 72 remaining) [2023-11-30 05:44:03,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 72 remaining) [2023-11-30 05:44:03,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 72 remaining) [2023-11-30 05:44:03,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 72 remaining) [2023-11-30 05:44:03,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 72 remaining) [2023-11-30 05:44:03,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 72 remaining) [2023-11-30 05:44:03,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 72 remaining) [2023-11-30 05:44:03,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 72 remaining) [2023-11-30 05:44:03,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 72 remaining) [2023-11-30 05:44:03,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 72 remaining) [2023-11-30 05:44:03,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 72 remaining) [2023-11-30 05:44:03,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 72 remaining) [2023-11-30 05:44:03,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 72 remaining) [2023-11-30 05:44:03,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 72 remaining) [2023-11-30 05:44:03,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 72 remaining) [2023-11-30 05:44:03,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 72 remaining) [2023-11-30 05:44:03,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 72 remaining) [2023-11-30 05:44:03,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 72 remaining) [2023-11-30 05:44:03,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 72 remaining) [2023-11-30 05:44:03,460 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 72 remaining) [2023-11-30 05:44:03,460 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 72 remaining) [2023-11-30 05:44:03,460 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 72 remaining) [2023-11-30 05:44:03,460 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 72 remaining) [2023-11-30 05:44:03,460 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 72 remaining) [2023-11-30 05:44:03,460 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 72 remaining) [2023-11-30 05:44:03,460 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 72 remaining) [2023-11-30 05:44:03,460 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 72 remaining) [2023-11-30 05:44:03,460 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 72 remaining) [2023-11-30 05:44:03,460 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 72 remaining) [2023-11-30 05:44:03,460 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 72 remaining) [2023-11-30 05:44:03,460 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 72 remaining) [2023-11-30 05:44:03,460 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 72 remaining) [2023-11-30 05:44:03,460 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 72 remaining) [2023-11-30 05:44:03,460 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 72 remaining) [2023-11-30 05:44:03,460 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 72 remaining) [2023-11-30 05:44:03,460 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 72 remaining) [2023-11-30 05:44:03,460 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 72 remaining) [2023-11-30 05:44:03,461 INFO L457 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:44:03,465 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 05:44:03,465 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 05:44:03,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 05:44:03 BasicIcfg [2023-11-30 05:44:03,467 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 05:44:03,467 INFO L158 Benchmark]: Toolchain (without parser) took 826766.39ms. Allocated memory was 310.4MB in the beginning and 15.9GB in the end (delta: 15.6GB). Free memory was 262.1MB in the beginning and 8.6GB in the end (delta: -8.3GB). Peak memory consumption was 8.2GB. Max. memory is 16.0GB. [2023-11-30 05:44:03,467 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 310.4MB. Free memory was 266.2MB in the beginning and 266.0MB in the end (delta: 209.8kB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 05:44:03,467 INFO L158 Benchmark]: CACSL2BoogieTranslator took 691.10ms. Allocated memory is still 310.4MB. Free memory was 262.1MB in the beginning and 226.0MB in the end (delta: 36.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-11-30 05:44:03,467 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.07ms. Allocated memory is still 310.4MB. Free memory was 226.0MB in the beginning and 222.9MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 05:44:03,468 INFO L158 Benchmark]: Boogie Preprocessor took 55.14ms. Allocated memory was 310.4MB in the beginning and 373.3MB in the end (delta: 62.9MB). Free memory was 222.9MB in the beginning and 344.3MB in the end (delta: -121.5MB). Peak memory consumption was 11.1MB. Max. memory is 16.0GB. [2023-11-30 05:44:03,468 INFO L158 Benchmark]: RCFGBuilder took 660.06ms. Allocated memory is still 373.3MB. Free memory was 344.3MB in the beginning and 308.7MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. [2023-11-30 05:44:03,492 INFO L158 Benchmark]: TraceAbstraction took 825295.19ms. Allocated memory was 373.3MB in the beginning and 15.9GB in the end (delta: 15.5GB). Free memory was 307.6MB in the beginning and 8.6GB in the end (delta: -8.2GB). Peak memory consumption was 8.2GB. Max. memory is 16.0GB. [2023-11-30 05:44:03,496 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 310.4MB. Free memory was 266.2MB in the beginning and 266.0MB in the end (delta: 209.8kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 691.10ms. Allocated memory is still 310.4MB. Free memory was 262.1MB in the beginning and 226.0MB in the end (delta: 36.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 61.07ms. Allocated memory is still 310.4MB. Free memory was 226.0MB in the beginning and 222.9MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 55.14ms. Allocated memory was 310.4MB in the beginning and 373.3MB in the end (delta: 62.9MB). Free memory was 222.9MB in the beginning and 344.3MB in the end (delta: -121.5MB). Peak memory consumption was 11.1MB. Max. memory is 16.0GB. * RCFGBuilder took 660.06ms. Allocated memory is still 373.3MB. Free memory was 344.3MB in the beginning and 308.7MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. * TraceAbstraction took 825295.19ms. Allocated memory was 373.3MB in the beginning and 15.9GB in the end (delta: 15.5GB). Free memory was 307.6MB in the beginning and 8.6GB in the end (delta: -8.2GB). Peak memory consumption was 8.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1051]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 453 locations, 72 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 825.2s, OverallIterations: 16, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 493.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 11666 SdHoareTripleChecker+Valid, 75.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11666 mSDsluCounter, 10612 SdHoareTripleChecker+Invalid, 71.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1340 IncrementalHoareTripleChecker+Unchecked, 10108 mSDsCounter, 1022 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43868 IncrementalHoareTripleChecker+Invalid, 46232 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1022 mSolverCounterUnsat, 504 mSDtfsCounter, 43868 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2734 GetRequests, 1863 SyntacticMatches, 32 SemanticMatches, 839 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 50029 ImplicationChecksByTransitivity, 325.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53990occurred in iteration=14, InterpolantAutomatonStates: 284, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 129.4s SatisfiabilityAnalysisTime, 198.5s InterpolantComputationTime, 2898 NumberOfCodeBlocks, 2706 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 3804 ConstructedInterpolants, 535 QuantifiedInterpolants, 49890 SizeOfPredicates, 223 NumberOfNonLiveVariables, 4663 ConjunctsInSsa, 489 ConjunctsInUnsatCore, 32 InterpolantComputations, 9 PerfectInterpolantSequences, 1284/11184 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown