/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:08:31,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:08:31,074 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-12-05 21:08:31,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:08:31,104 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:08:31,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:08:31,105 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:08:31,105 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:08:31,106 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:08:31,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:08:31,109 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:08:31,109 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:08:31,109 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:08:31,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:08:31,111 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:08:31,111 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:08:31,111 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:08:31,111 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:08:31,111 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:08:31,111 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:08:31,112 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:08:31,112 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:08:31,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:08:31,113 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:08:31,113 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:08:31,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:08:31,113 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:08:31,113 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:08:31,113 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:08:31,114 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:08:31,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:08:31,114 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:08:31,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:08:31,115 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-12-05 21:08:31,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:08:31,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:08:31,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:08:31,361 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:08:31,362 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:08:31,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_power.oepc.i [2023-12-05 21:08:32,425 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:08:32,625 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:08:32,625 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_power.oepc.i [2023-12-05 21:08:32,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f350be2ae/454ed5ee81fa4f9692ced0b35b533d04/FLAGaba8d37c4 [2023-12-05 21:08:32,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f350be2ae/454ed5ee81fa4f9692ced0b35b533d04 [2023-12-05 21:08:32,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:08:32,654 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:08:32,664 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:08:32,664 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:08:32,668 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:08:32,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:08:32" (1/1) ... [2023-12-05 21:08:32,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@151da38c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:32, skipping insertion in model container [2023-12-05 21:08:32,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:08:32" (1/1) ... [2023-12-05 21:08:32,722 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:08:33,145 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:08:33,182 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:08:33,303 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:08:33,339 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:08:33,339 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:08:33,355 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:08:33,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:33 WrapperNode [2023-12-05 21:08:33,356 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:08:33,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:08:33,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:08:33,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:08:33,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:33" (1/1) ... [2023-12-05 21:08:33,397 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:33" (1/1) ... [2023-12-05 21:08:33,423 INFO L138 Inliner]: procedures = 176, calls = 85, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 175 [2023-12-05 21:08:33,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:08:33,428 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:08:33,428 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:08:33,428 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:08:33,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:33" (1/1) ... [2023-12-05 21:08:33,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:33" (1/1) ... [2023-12-05 21:08:33,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:33" (1/1) ... [2023-12-05 21:08:33,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:33" (1/1) ... [2023-12-05 21:08:33,469 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:33" (1/1) ... [2023-12-05 21:08:33,471 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:33" (1/1) ... [2023-12-05 21:08:33,473 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:33" (1/1) ... [2023-12-05 21:08:33,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:33" (1/1) ... [2023-12-05 21:08:33,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:08:33,478 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:08:33,478 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:08:33,478 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:08:33,478 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:33" (1/1) ... [2023-12-05 21:08:33,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:08:33,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:08:33,531 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-12-05 21:08:33,558 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-12-05 21:08:33,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:08:33,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:08:33,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:08:33,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:08:33,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:08:33,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:08:33,583 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-05 21:08:33,590 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-05 21:08:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-05 21:08:33,591 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-05 21:08:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-05 21:08:33,591 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-05 21:08:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:08:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:08:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:08:33,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:08:33,593 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:08:33,707 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:08:33,709 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:08:34,275 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:08:34,817 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:08:34,817 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:08:34,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:08:34 BoogieIcfgContainer [2023-12-05 21:08:34,819 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:08:34,820 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:08:34,820 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:08:34,823 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:08:34,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:08:32" (1/3) ... [2023-12-05 21:08:34,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74fa23d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:08:34, skipping insertion in model container [2023-12-05 21:08:34,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:33" (2/3) ... [2023-12-05 21:08:34,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74fa23d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:08:34, skipping insertion in model container [2023-12-05 21:08:34,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:08:34" (3/3) ... [2023-12-05 21:08:34,825 INFO L112 eAbstractionObserver]: Analyzing ICFG safe001_power.oepc.i [2023-12-05 21:08:34,839 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:08:34,839 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2023-12-05 21:08:34,839 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:08:34,991 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:08:35,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 196 transitions, 404 flow [2023-12-05 21:08:35,143 INFO L124 PetriNetUnfolderBase]: 3/193 cut-off events. [2023-12-05 21:08:35,143 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:08:35,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 3/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 369 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2023-12-05 21:08:35,151 INFO L82 GeneralOperation]: Start removeDead. Operand has 203 places, 196 transitions, 404 flow [2023-12-05 21:08:35,166 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 200 places, 193 transitions, 395 flow [2023-12-05 21:08:35,178 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:08:35,184 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;@9a23a6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:08:35,184 INFO L363 AbstractCegarLoop]: Starting to check reachability of 107 error locations. [2023-12-05 21:08:35,196 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:08:35,196 INFO L124 PetriNetUnfolderBase]: 0/56 cut-off events. [2023-12-05 21:08:35,196 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:08:35,196 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:35,197 INFO L233 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, 1, 1, 1] [2023-12-05 21:08:35,198 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-12-05 21:08:35,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:35,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1619544611, now seen corresponding path program 1 times [2023-12-05 21:08:35,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:35,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393317757] [2023-12-05 21:08:35,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:35,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:35,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:35,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:35,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393317757] [2023-12-05 21:08:35,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393317757] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:35,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:35,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:35,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508856961] [2023-12-05 21:08:35,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:35,463 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:35,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:35,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:35,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:35,491 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 196 [2023-12-05 21:08:35,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 193 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:35,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:35,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 196 [2023-12-05 21:08:35,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:40,721 INFO L124 PetriNetUnfolderBase]: 17481/31804 cut-off events. [2023-12-05 21:08:40,722 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-12-05 21:08:40,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56452 conditions, 31804 events. 17481/31804 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 2518. Compared 298558 event pairs, 11961 based on Foata normal form. 900/15489 useless extension candidates. Maximal degree in co-relation 56378. Up to 16876 conditions per place. [2023-12-05 21:08:41,088 INFO L140 encePairwiseOnDemand]: 156/196 looper letters, 74 selfloop transitions, 2 changer transitions 0/174 dead transitions. [2023-12-05 21:08:41,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 174 transitions, 509 flow [2023-12-05 21:08:41,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:41,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:41,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions. [2023-12-05 21:08:41,098 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7602040816326531 [2023-12-05 21:08:41,099 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 447 transitions. [2023-12-05 21:08:41,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 447 transitions. [2023-12-05 21:08:41,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:41,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 447 transitions. [2023-12-05 21:08:41,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:41,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:41,109 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:41,111 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, -36 predicate places. [2023-12-05 21:08:41,112 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 174 transitions, 509 flow [2023-12-05 21:08:41,112 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:41,112 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:41,112 INFO L233 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, 1, 1, 1] [2023-12-05 21:08:41,112 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:08:41,113 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-12-05 21:08:41,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:41,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1619544612, now seen corresponding path program 1 times [2023-12-05 21:08:41,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:41,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537132395] [2023-12-05 21:08:41,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:41,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:41,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:41,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:41,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537132395] [2023-12-05 21:08:41,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537132395] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:41,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:41,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:41,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677410228] [2023-12-05 21:08:41,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:41,221 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:41,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:41,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:41,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:41,222 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 196 [2023-12-05 21:08:41,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 174 transitions, 509 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:41,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:41,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 196 [2023-12-05 21:08:41,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:46,556 INFO L124 PetriNetUnfolderBase]: 17543/31917 cut-off events. [2023-12-05 21:08:46,556 INFO L125 PetriNetUnfolderBase]: For 2029/6805 co-relation queries the response was YES. [2023-12-05 21:08:46,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80384 conditions, 31917 events. 17543/31917 cut-off events. For 2029/6805 co-relation queries the response was YES. Maximal size of possible extension queue 2518. Compared 299437 event pairs, 12023 based on Foata normal form. 0/14693 useless extension candidates. Maximal degree in co-relation 80304. Up to 18473 conditions per place. [2023-12-05 21:08:46,790 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 92 selfloop transitions, 2 changer transitions 0/195 dead transitions. [2023-12-05 21:08:46,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 195 transitions, 781 flow [2023-12-05 21:08:46,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:46,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2023-12-05 21:08:46,793 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6649659863945578 [2023-12-05 21:08:46,793 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 391 transitions. [2023-12-05 21:08:46,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 391 transitions. [2023-12-05 21:08:46,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:46,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 391 transitions. [2023-12-05 21:08:46,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:46,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:46,797 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:46,798 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, -35 predicate places. [2023-12-05 21:08:46,798 INFO L500 AbstractCegarLoop]: Abstraction has has 165 places, 195 transitions, 781 flow [2023-12-05 21:08:46,798 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:46,799 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:46,799 INFO L233 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, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:46,799 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:08:46,799 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-12-05 21:08:46,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:46,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1807974935, now seen corresponding path program 1 times [2023-12-05 21:08:46,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:46,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448100592] [2023-12-05 21:08:46,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:46,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:46,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:46,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:46,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448100592] [2023-12-05 21:08:46,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448100592] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:46,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:46,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:08:46,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377717884] [2023-12-05 21:08:46,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:46,991 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:08:46,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:46,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:08:46,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:08:46,993 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 196 [2023-12-05 21:08:46,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 195 transitions, 781 flow. Second operand has 6 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:46,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:46,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 196 [2023-12-05 21:08:46,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:50,218 INFO L124 PetriNetUnfolderBase]: 10538/21046 cut-off events. [2023-12-05 21:08:50,219 INFO L125 PetriNetUnfolderBase]: For 4078/7528 co-relation queries the response was YES. [2023-12-05 21:08:50,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66503 conditions, 21046 events. 10538/21046 cut-off events. For 4078/7528 co-relation queries the response was YES. Maximal size of possible extension queue 1240. Compared 202870 event pairs, 2846 based on Foata normal form. 0/12708 useless extension candidates. Maximal degree in co-relation 66412. Up to 11676 conditions per place. [2023-12-05 21:08:50,379 INFO L140 encePairwiseOnDemand]: 173/196 looper letters, 101 selfloop transitions, 19 changer transitions 0/216 dead transitions. [2023-12-05 21:08:50,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 216 transitions, 1143 flow [2023-12-05 21:08:50,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:08:50,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:08:50,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 854 transitions. [2023-12-05 21:08:50,382 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6224489795918368 [2023-12-05 21:08:50,382 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 854 transitions. [2023-12-05 21:08:50,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 854 transitions. [2023-12-05 21:08:50,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:50,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 854 transitions. [2023-12-05 21:08:50,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:50,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:50,387 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:50,388 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, -32 predicate places. [2023-12-05 21:08:50,388 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 216 transitions, 1143 flow [2023-12-05 21:08:50,389 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:50,389 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:50,389 INFO L233 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, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:50,389 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:08:50,389 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-12-05 21:08:50,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:50,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1807974934, now seen corresponding path program 1 times [2023-12-05 21:08:50,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:50,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014544272] [2023-12-05 21:08:50,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:50,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:50,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:50,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014544272] [2023-12-05 21:08:50,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014544272] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:50,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:50,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:08:50,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500185016] [2023-12-05 21:08:50,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:50,555 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:08:50,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:50,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:08:50,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:08:50,558 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 196 [2023-12-05 21:08:50,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 216 transitions, 1143 flow. Second operand has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:50,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:50,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 196 [2023-12-05 21:08:50,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:51,470 INFO L124 PetriNetUnfolderBase]: 2293/5539 cut-off events. [2023-12-05 21:08:51,470 INFO L125 PetriNetUnfolderBase]: For 2592/3208 co-relation queries the response was YES. [2023-12-05 21:08:51,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18822 conditions, 5539 events. 2293/5539 cut-off events. For 2592/3208 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 49308 event pairs, 319 based on Foata normal form. 0/4472 useless extension candidates. Maximal degree in co-relation 18722. Up to 3292 conditions per place. [2023-12-05 21:08:51,506 INFO L140 encePairwiseOnDemand]: 183/196 looper letters, 64 selfloop transitions, 2 changer transitions 0/173 dead transitions. [2023-12-05 21:08:51,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 173 transitions, 931 flow [2023-12-05 21:08:51,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:08:51,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:08:51,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2023-12-05 21:08:51,508 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6135204081632653 [2023-12-05 21:08:51,508 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2023-12-05 21:08:51,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2023-12-05 21:08:51,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:51,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2023-12-05 21:08:51,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:51,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:51,511 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:51,512 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, -40 predicate places. [2023-12-05 21:08:51,512 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 173 transitions, 931 flow [2023-12-05 21:08:51,512 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:51,512 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:51,512 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:51,513 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:08:51,513 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-12-05 21:08:51,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:51,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1027722071, now seen corresponding path program 1 times [2023-12-05 21:08:51,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:51,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032946474] [2023-12-05 21:08:51,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:51,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:51,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:51,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:51,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032946474] [2023-12-05 21:08:51,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032946474] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:51,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:51,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:51,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491110866] [2023-12-05 21:08:51,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:51,548 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:51,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:51,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:51,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:51,549 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 196 [2023-12-05 21:08:51,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 173 transitions, 931 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:51,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:51,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 196 [2023-12-05 21:08:51,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:52,578 INFO L124 PetriNetUnfolderBase]: 2746/6275 cut-off events. [2023-12-05 21:08:52,579 INFO L125 PetriNetUnfolderBase]: For 6117/6989 co-relation queries the response was YES. [2023-12-05 21:08:52,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25512 conditions, 6275 events. 2746/6275 cut-off events. For 6117/6989 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 55665 event pairs, 344 based on Foata normal form. 2/5021 useless extension candidates. Maximal degree in co-relation 25403. Up to 3750 conditions per place. [2023-12-05 21:08:52,620 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 73 selfloop transitions, 2 changer transitions 0/173 dead transitions. [2023-12-05 21:08:52,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 173 transitions, 1085 flow [2023-12-05 21:08:52,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:52,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:52,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-12-05 21:08:52,622 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6037414965986394 [2023-12-05 21:08:52,622 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-12-05 21:08:52,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-12-05 21:08:52,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:52,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-12-05 21:08:52,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:52,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:52,624 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:52,625 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, -39 predicate places. [2023-12-05 21:08:52,625 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 173 transitions, 1085 flow [2023-12-05 21:08:52,625 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:52,625 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:52,625 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:52,625 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:08:52,625 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-12-05 21:08:52,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:52,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1027722070, now seen corresponding path program 1 times [2023-12-05 21:08:52,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:52,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934950084] [2023-12-05 21:08:52,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:52,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:52,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:52,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:52,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934950084] [2023-12-05 21:08:52,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934950084] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:52,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:52,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:52,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397951662] [2023-12-05 21:08:52,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:52,673 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:52,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:52,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:52,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:52,674 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 196 [2023-12-05 21:08:52,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 173 transitions, 1085 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:52,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:52,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 196 [2023-12-05 21:08:52,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:53,690 INFO L124 PetriNetUnfolderBase]: 2745/6173 cut-off events. [2023-12-05 21:08:53,690 INFO L125 PetriNetUnfolderBase]: For 9056/10386 co-relation queries the response was YES. [2023-12-05 21:08:53,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29269 conditions, 6173 events. 2745/6173 cut-off events. For 9056/10386 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 54041 event pairs, 240 based on Foata normal form. 2/4919 useless extension candidates. Maximal degree in co-relation 29152. Up to 3750 conditions per place. [2023-12-05 21:08:53,732 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 88 selfloop transitions, 2 changer transitions 0/192 dead transitions. [2023-12-05 21:08:53,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 192 transitions, 1497 flow [2023-12-05 21:08:53,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:53,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:53,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-12-05 21:08:53,735 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6258503401360545 [2023-12-05 21:08:53,735 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-12-05 21:08:53,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-12-05 21:08:53,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:53,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-12-05 21:08:53,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:53,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:53,739 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:53,741 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, -38 predicate places. [2023-12-05 21:08:53,741 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 192 transitions, 1497 flow [2023-12-05 21:08:53,741 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:53,741 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:53,741 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:53,742 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:08:53,742 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-12-05 21:08:53,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:53,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1025304015, now seen corresponding path program 1 times [2023-12-05 21:08:53,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:53,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396184602] [2023-12-05 21:08:53,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:53,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:53,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:53,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396184602] [2023-12-05 21:08:53,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396184602] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:53,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:53,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:53,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229859838] [2023-12-05 21:08:53,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:53,800 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:53,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:53,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:53,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:53,803 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 196 [2023-12-05 21:08:53,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 192 transitions, 1497 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:53,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:53,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 196 [2023-12-05 21:08:53,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:54,880 INFO L124 PetriNetUnfolderBase]: 3192/6949 cut-off events. [2023-12-05 21:08:54,881 INFO L125 PetriNetUnfolderBase]: For 17427/18123 co-relation queries the response was YES. [2023-12-05 21:08:54,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37299 conditions, 6949 events. 3192/6949 cut-off events. For 17427/18123 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 60356 event pairs, 248 based on Foata normal form. 6/5514 useless extension candidates. Maximal degree in co-relation 37173. Up to 4219 conditions per place. [2023-12-05 21:08:54,940 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 95 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2023-12-05 21:08:54,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 194 transitions, 1725 flow [2023-12-05 21:08:54,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:54,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-12-05 21:08:54,942 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6020408163265306 [2023-12-05 21:08:54,942 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-12-05 21:08:54,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-12-05 21:08:54,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:54,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-12-05 21:08:54,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:54,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:54,945 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:54,945 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, -37 predicate places. [2023-12-05 21:08:54,945 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 194 transitions, 1725 flow [2023-12-05 21:08:54,946 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:54,946 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:54,946 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:54,946 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:08:54,946 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-12-05 21:08:54,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:54,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1025304016, now seen corresponding path program 1 times [2023-12-05 21:08:54,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:54,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977753451] [2023-12-05 21:08:54,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:54,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:54,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:54,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:54,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977753451] [2023-12-05 21:08:54,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977753451] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:54,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:54,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:54,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881457141] [2023-12-05 21:08:54,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:54,999 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:54,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:54,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:54,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:55,000 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 196 [2023-12-05 21:08:55,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 194 transitions, 1725 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:55,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:55,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 196 [2023-12-05 21:08:55,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:56,472 INFO L124 PetriNetUnfolderBase]: 3185/6793 cut-off events. [2023-12-05 21:08:56,472 INFO L125 PetriNetUnfolderBase]: For 24917/25435 co-relation queries the response was YES. [2023-12-05 21:08:56,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41374 conditions, 6793 events. 3185/6793 cut-off events. For 24917/25435 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 58593 event pairs, 144 based on Foata normal form. 6/5358 useless extension candidates. Maximal degree in co-relation 41240. Up to 4219 conditions per place. [2023-12-05 21:08:56,526 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 110 selfloop transitions, 2 changer transitions 0/213 dead transitions. [2023-12-05 21:08:56,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 213 transitions, 2259 flow [2023-12-05 21:08:56,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:56,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:56,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-12-05 21:08:56,528 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6241496598639455 [2023-12-05 21:08:56,528 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-12-05 21:08:56,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-12-05 21:08:56,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:56,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-12-05 21:08:56,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:56,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:56,531 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:56,531 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, -36 predicate places. [2023-12-05 21:08:56,531 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 213 transitions, 2259 flow [2023-12-05 21:08:56,531 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:56,531 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:56,531 INFO L233 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, 1, 1, 1, 1, 1, 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-12-05 21:08:56,532 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:08:56,532 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-12-05 21:08:56,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:56,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1199625388, now seen corresponding path program 1 times [2023-12-05 21:08:56,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:56,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412654348] [2023-12-05 21:08:56,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:56,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:56,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:56,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:56,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412654348] [2023-12-05 21:08:56,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412654348] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:56,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:56,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:56,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354910900] [2023-12-05 21:08:56,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:56,667 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:56,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:56,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:56,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:56,668 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 196 [2023-12-05 21:08:56,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 213 transitions, 2259 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:56,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:56,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 196 [2023-12-05 21:08:56,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:57,805 INFO L124 PetriNetUnfolderBase]: 3127/6727 cut-off events. [2023-12-05 21:08:57,805 INFO L125 PetriNetUnfolderBase]: For 31085/31675 co-relation queries the response was YES. [2023-12-05 21:08:57,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44109 conditions, 6727 events. 3127/6727 cut-off events. For 31085/31675 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 58611 event pairs, 126 based on Foata normal form. 0/5310 useless extension candidates. Maximal degree in co-relation 43972. Up to 4219 conditions per place. [2023-12-05 21:08:57,979 INFO L140 encePairwiseOnDemand]: 192/196 looper letters, 165 selfloop transitions, 12 changer transitions 0/292 dead transitions. [2023-12-05 21:08:57,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 292 transitions, 4041 flow [2023-12-05 21:08:57,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:57,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:57,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-12-05 21:08:57,981 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6904761904761905 [2023-12-05 21:08:57,981 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-12-05 21:08:57,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-12-05 21:08:57,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:57,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-12-05 21:08:57,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:57,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:57,983 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:57,983 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, -34 predicate places. [2023-12-05 21:08:57,984 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 292 transitions, 4041 flow [2023-12-05 21:08:57,984 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:57,984 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:57,984 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 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-12-05 21:08:57,984 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:08:57,984 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-12-05 21:08:57,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:57,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1394858275, now seen corresponding path program 1 times [2023-12-05 21:08:57,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:57,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933539966] [2023-12-05 21:08:57,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:57,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:58,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:58,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:58,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933539966] [2023-12-05 21:08:58,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933539966] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:58,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:58,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:08:58,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142462083] [2023-12-05 21:08:58,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:58,071 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:08:58,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:58,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:08:58,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:08:58,072 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 196 [2023-12-05 21:08:58,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 292 transitions, 4041 flow. Second operand has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:58,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:58,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 196 [2023-12-05 21:08:58,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:59,305 INFO L124 PetriNetUnfolderBase]: 3110/6698 cut-off events. [2023-12-05 21:08:59,306 INFO L125 PetriNetUnfolderBase]: For 39050/39714 co-relation queries the response was YES. [2023-12-05 21:08:59,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47791 conditions, 6698 events. 3110/6698 cut-off events. For 39050/39714 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 58057 event pairs, 117 based on Foata normal form. 0/5294 useless extension candidates. Maximal degree in co-relation 47643. Up to 4219 conditions per place. [2023-12-05 21:08:59,368 INFO L140 encePairwiseOnDemand]: 186/196 looper letters, 168 selfloop transitions, 34 changer transitions 0/300 dead transitions. [2023-12-05 21:08:59,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 300 transitions, 4557 flow [2023-12-05 21:08:59,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:08:59,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:08:59,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2023-12-05 21:08:59,370 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6160714285714286 [2023-12-05 21:08:59,370 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2023-12-05 21:08:59,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2023-12-05 21:08:59,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:59,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2023-12-05 21:08:59,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:59,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:59,373 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:59,373 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, -32 predicate places. [2023-12-05 21:08:59,373 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 300 transitions, 4557 flow [2023-12-05 21:08:59,374 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:59,374 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:59,374 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 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-12-05 21:08:59,374 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:08:59,374 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-12-05 21:08:59,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:59,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1394858276, now seen corresponding path program 1 times [2023-12-05 21:08:59,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:59,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808689736] [2023-12-05 21:08:59,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:59,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:59,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:59,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:59,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808689736] [2023-12-05 21:08:59,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808689736] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:59,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:59,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:08:59,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477336659] [2023-12-05 21:08:59,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:59,613 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:08:59,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:59,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:08:59,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:08:59,614 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 196 [2023-12-05 21:08:59,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 300 transitions, 4557 flow. Second operand has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:59,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:59,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 196 [2023-12-05 21:08:59,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:00,906 INFO L124 PetriNetUnfolderBase]: 3093/6669 cut-off events. [2023-12-05 21:09:00,906 INFO L125 PetriNetUnfolderBase]: For 48849/49587 co-relation queries the response was YES. [2023-12-05 21:09:00,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50894 conditions, 6669 events. 3093/6669 cut-off events. For 48849/49587 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 57981 event pairs, 108 based on Foata normal form. 2/5279 useless extension candidates. Maximal degree in co-relation 50736. Up to 4219 conditions per place. [2023-12-05 21:09:00,970 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 178 selfloop transitions, 12 changer transitions 0/299 dead transitions. [2023-12-05 21:09:00,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 299 transitions, 4915 flow [2023-12-05 21:09:00,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:09:00,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:09:00,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 484 transitions. [2023-12-05 21:09:00,973 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6173469387755102 [2023-12-05 21:09:00,973 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 484 transitions. [2023-12-05 21:09:00,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 484 transitions. [2023-12-05 21:09:00,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:00,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 484 transitions. [2023-12-05 21:09:00,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:00,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:00,976 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:00,976 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, -30 predicate places. [2023-12-05 21:09:00,976 INFO L500 AbstractCegarLoop]: Abstraction has has 170 places, 299 transitions, 4915 flow [2023-12-05 21:09:00,976 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:00,976 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:00,977 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-05 21:09:00,977 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:09:00,977 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-12-05 21:09:00,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:00,977 INFO L85 PathProgramCache]: Analyzing trace with hash -3521161, now seen corresponding path program 1 times [2023-12-05 21:09:00,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:00,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854336348] [2023-12-05 21:09:00,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:00,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:01,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:01,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854336348] [2023-12-05 21:09:01,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854336348] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:01,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:01,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:09:01,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80649754] [2023-12-05 21:09:01,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:01,113 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:09:01,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:01,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:09:01,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:09:01,114 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 196 [2023-12-05 21:09:01,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 299 transitions, 4915 flow. Second operand has 7 states, 7 states have (on average 103.85714285714286) internal successors, (727), 7 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:01,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:01,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 196 [2023-12-05 21:09:01,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:02,119 INFO L124 PetriNetUnfolderBase]: 2363/5197 cut-off events. [2023-12-05 21:09:02,120 INFO L125 PetriNetUnfolderBase]: For 51043/51853 co-relation queries the response was YES. [2023-12-05 21:09:02,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42890 conditions, 5197 events. 2363/5197 cut-off events. For 51043/51853 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 43529 event pairs, 108 based on Foata normal form. 0/4189 useless extension candidates. Maximal degree in co-relation 42721. Up to 3288 conditions per place. [2023-12-05 21:09:02,178 INFO L140 encePairwiseOnDemand]: 176/196 looper letters, 168 selfloop transitions, 44 changer transitions 0/306 dead transitions. [2023-12-05 21:09:02,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 306 transitions, 5507 flow [2023-12-05 21:09:02,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 21:09:02,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 21:09:02,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 679 transitions. [2023-12-05 21:09:02,180 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5773809523809523 [2023-12-05 21:09:02,180 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 679 transitions. [2023-12-05 21:09:02,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 679 transitions. [2023-12-05 21:09:02,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:02,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 679 transitions. [2023-12-05 21:09:02,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:02,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 196.0) internal successors, (1372), 7 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:02,183 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 196.0) internal successors, (1372), 7 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:02,184 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, -25 predicate places. [2023-12-05 21:09:02,184 INFO L500 AbstractCegarLoop]: Abstraction has has 175 places, 306 transitions, 5507 flow [2023-12-05 21:09:02,184 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 103.85714285714286) internal successors, (727), 7 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:02,184 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:02,184 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-05 21:09:02,184 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:09:02,185 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-12-05 21:09:02,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:02,185 INFO L85 PathProgramCache]: Analyzing trace with hash -2043782802, now seen corresponding path program 1 times [2023-12-05 21:09:02,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:02,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026003400] [2023-12-05 21:09:02,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:02,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:02,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:02,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:02,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026003400] [2023-12-05 21:09:02,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026003400] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:02,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:02,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-05 21:09:02,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616260562] [2023-12-05 21:09:02,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:02,568 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-05 21:09:02,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:02,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-05 21:09:02,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-05 21:09:02,570 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 196 [2023-12-05 21:09:02,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 306 transitions, 5507 flow. Second operand has 9 states, 9 states have (on average 101.44444444444444) internal successors, (913), 9 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:02,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:02,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 196 [2023-12-05 21:09:02,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:03,541 INFO L124 PetriNetUnfolderBase]: 1633/3934 cut-off events. [2023-12-05 21:09:03,541 INFO L125 PetriNetUnfolderBase]: For 42477/43363 co-relation queries the response was YES. [2023-12-05 21:09:03,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33481 conditions, 3934 events. 1633/3934 cut-off events. For 42477/43363 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 32061 event pairs, 108 based on Foata normal form. 0/3310 useless extension candidates. Maximal degree in co-relation 33301. Up to 2357 conditions per place. [2023-12-05 21:09:03,581 INFO L140 encePairwiseOnDemand]: 175/196 looper letters, 186 selfloop transitions, 34 changer transitions 0/313 dead transitions. [2023-12-05 21:09:03,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 313 transitions, 6129 flow [2023-12-05 21:09:03,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:09:03,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:09:03,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 872 transitions. [2023-12-05 21:09:03,584 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5561224489795918 [2023-12-05 21:09:03,584 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 872 transitions. [2023-12-05 21:09:03,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 872 transitions. [2023-12-05 21:09:03,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:03,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 872 transitions. [2023-12-05 21:09:03,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:03,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 196.0) internal successors, (1764), 9 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:03,588 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 196.0) internal successors, (1764), 9 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:03,589 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, -18 predicate places. [2023-12-05 21:09:03,589 INFO L500 AbstractCegarLoop]: Abstraction has has 182 places, 313 transitions, 6129 flow [2023-12-05 21:09:03,589 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 101.44444444444444) internal successors, (913), 9 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:03,589 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:03,589 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-05 21:09:03,589 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:09:03,589 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-12-05 21:09:03,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:03,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1276646916, now seen corresponding path program 1 times [2023-12-05 21:09:03,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:03,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105405357] [2023-12-05 21:09:03,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:03,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:03,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:03,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:03,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105405357] [2023-12-05 21:09:03,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105405357] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:03,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:03,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-05 21:09:03,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273896029] [2023-12-05 21:09:03,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:03,959 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-05 21:09:03,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:03,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-05 21:09:03,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-12-05 21:09:03,960 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 196 [2023-12-05 21:09:03,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 313 transitions, 6129 flow. Second operand has 13 states, 13 states have (on average 97.92307692307692) internal successors, (1273), 13 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:03,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:03,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 196 [2023-12-05 21:09:03,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:04,637 INFO L124 PetriNetUnfolderBase]: 739/1800 cut-off events. [2023-12-05 21:09:04,638 INFO L125 PetriNetUnfolderBase]: For 23041/25251 co-relation queries the response was YES. [2023-12-05 21:09:04,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16076 conditions, 1800 events. 739/1800 cut-off events. For 23041/25251 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 10805 event pairs, 26 based on Foata normal form. 2/1759 useless extension candidates. Maximal degree in co-relation 15884. Up to 862 conditions per place. [2023-12-05 21:09:04,647 INFO L140 encePairwiseOnDemand]: 175/196 looper letters, 0 selfloop transitions, 0 changer transitions 370/370 dead transitions. [2023-12-05 21:09:04,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 370 transitions, 8092 flow [2023-12-05 21:09:04,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-05 21:09:04,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-12-05 21:09:04,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1839 transitions. [2023-12-05 21:09:04,651 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5212585034013606 [2023-12-05 21:09:04,651 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1839 transitions. [2023-12-05 21:09:04,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1839 transitions. [2023-12-05 21:09:04,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:04,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1839 transitions. [2023-12-05 21:09:04,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 102.16666666666667) internal successors, (1839), 18 states have internal predecessors, (1839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:04,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 196.0) internal successors, (3724), 19 states have internal predecessors, (3724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:04,659 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 196.0) internal successors, (3724), 19 states have internal predecessors, (3724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:04,659 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, -9 predicate places. [2023-12-05 21:09:04,659 INFO L500 AbstractCegarLoop]: Abstraction has has 191 places, 370 transitions, 8092 flow [2023-12-05 21:09:04,660 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 97.92307692307692) internal successors, (1273), 13 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:04,677 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe001_power.oepc.i_BEv2_AllErrorsAtOnce [2023-12-05 21:09:04,707 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 107 remaining) [2023-12-05 21:09:04,708 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 107 remaining) [2023-12-05 21:09:04,708 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 107 remaining) [2023-12-05 21:09:04,708 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 107 remaining) [2023-12-05 21:09:04,708 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 107 remaining) [2023-12-05 21:09:04,708 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 107 remaining) [2023-12-05 21:09:04,709 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 107 remaining) [2023-12-05 21:09:04,709 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 107 remaining) [2023-12-05 21:09:04,709 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 107 remaining) [2023-12-05 21:09:04,709 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 107 remaining) [2023-12-05 21:09:04,709 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 107 remaining) [2023-12-05 21:09:04,709 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 107 remaining) [2023-12-05 21:09:04,709 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 107 remaining) [2023-12-05 21:09:04,709 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 107 remaining) [2023-12-05 21:09:04,710 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 107 remaining) [2023-12-05 21:09:04,710 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 107 remaining) [2023-12-05 21:09:04,710 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 107 remaining) [2023-12-05 21:09:04,710 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 107 remaining) [2023-12-05 21:09:04,710 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 107 remaining) [2023-12-05 21:09:04,710 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 107 remaining) [2023-12-05 21:09:04,710 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 107 remaining) [2023-12-05 21:09:04,710 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 107 remaining) [2023-12-05 21:09:04,711 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 107 remaining) [2023-12-05 21:09:04,711 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 107 remaining) [2023-12-05 21:09:04,711 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 107 remaining) [2023-12-05 21:09:04,711 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 107 remaining) [2023-12-05 21:09:04,711 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 107 remaining) [2023-12-05 21:09:04,711 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 107 remaining) [2023-12-05 21:09:04,711 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 107 remaining) [2023-12-05 21:09:04,711 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 107 remaining) [2023-12-05 21:09:04,712 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 107 remaining) [2023-12-05 21:09:04,712 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 107 remaining) [2023-12-05 21:09:04,712 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 107 remaining) [2023-12-05 21:09:04,712 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 107 remaining) [2023-12-05 21:09:04,712 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 107 remaining) [2023-12-05 21:09:04,712 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 107 remaining) [2023-12-05 21:09:04,712 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 107 remaining) [2023-12-05 21:09:04,712 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 107 remaining) [2023-12-05 21:09:04,713 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 107 remaining) [2023-12-05 21:09:04,713 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 107 remaining) [2023-12-05 21:09:04,713 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 107 remaining) [2023-12-05 21:09:04,713 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 107 remaining) [2023-12-05 21:09:04,713 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 107 remaining) [2023-12-05 21:09:04,713 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 107 remaining) [2023-12-05 21:09:04,713 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 107 remaining) [2023-12-05 21:09:04,713 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 107 remaining) [2023-12-05 21:09:04,714 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 107 remaining) [2023-12-05 21:09:04,714 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 107 remaining) [2023-12-05 21:09:04,714 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 107 remaining) [2023-12-05 21:09:04,714 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 107 remaining) [2023-12-05 21:09:04,714 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 107 remaining) [2023-12-05 21:09:04,714 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 107 remaining) [2023-12-05 21:09:04,714 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 107 remaining) [2023-12-05 21:09:04,714 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 107 remaining) [2023-12-05 21:09:04,714 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 107 remaining) [2023-12-05 21:09:04,715 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 107 remaining) [2023-12-05 21:09:04,715 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 107 remaining) [2023-12-05 21:09:04,715 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 107 remaining) [2023-12-05 21:09:04,715 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 107 remaining) [2023-12-05 21:09:04,715 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 107 remaining) [2023-12-05 21:09:04,715 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 107 remaining) [2023-12-05 21:09:04,715 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 107 remaining) [2023-12-05 21:09:04,715 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 107 remaining) [2023-12-05 21:09:04,716 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 107 remaining) [2023-12-05 21:09:04,716 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 107 remaining) [2023-12-05 21:09:04,716 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 107 remaining) [2023-12-05 21:09:04,716 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 107 remaining) [2023-12-05 21:09:04,716 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 107 remaining) [2023-12-05 21:09:04,716 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 107 remaining) [2023-12-05 21:09:04,716 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 107 remaining) [2023-12-05 21:09:04,716 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 107 remaining) [2023-12-05 21:09:04,717 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 107 remaining) [2023-12-05 21:09:04,717 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 107 remaining) [2023-12-05 21:09:04,717 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 107 remaining) [2023-12-05 21:09:04,717 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 107 remaining) [2023-12-05 21:09:04,717 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 107 remaining) [2023-12-05 21:09:04,717 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 107 remaining) [2023-12-05 21:09:04,717 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 107 remaining) [2023-12-05 21:09:04,717 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 107 remaining) [2023-12-05 21:09:04,718 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 107 remaining) [2023-12-05 21:09:04,718 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 107 remaining) [2023-12-05 21:09:04,718 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 107 remaining) [2023-12-05 21:09:04,718 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 107 remaining) [2023-12-05 21:09:04,718 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 107 remaining) [2023-12-05 21:09:04,718 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 107 remaining) [2023-12-05 21:09:04,718 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 107 remaining) [2023-12-05 21:09:04,718 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 107 remaining) [2023-12-05 21:09:04,719 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 107 remaining) [2023-12-05 21:09:04,719 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 107 remaining) [2023-12-05 21:09:04,719 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 107 remaining) [2023-12-05 21:09:04,719 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 107 remaining) [2023-12-05 21:09:04,719 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 107 remaining) [2023-12-05 21:09:04,719 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 107 remaining) [2023-12-05 21:09:04,719 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 107 remaining) [2023-12-05 21:09:04,719 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 107 remaining) [2023-12-05 21:09:04,720 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 107 remaining) [2023-12-05 21:09:04,720 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 107 remaining) [2023-12-05 21:09:04,720 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 107 remaining) [2023-12-05 21:09:04,720 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 107 remaining) [2023-12-05 21:09:04,720 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 107 remaining) [2023-12-05 21:09:04,720 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 107 remaining) [2023-12-05 21:09:04,720 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 107 remaining) [2023-12-05 21:09:04,720 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 107 remaining) [2023-12-05 21:09:04,721 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 107 remaining) [2023-12-05 21:09:04,721 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 107 remaining) [2023-12-05 21:09:04,721 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 107 remaining) [2023-12-05 21:09:04,721 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 107 remaining) [2023-12-05 21:09:04,721 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:09:04,722 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:04,726 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:09:04,726 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:09:04,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:09:04 BasicIcfg [2023-12-05 21:09:04,731 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:09:04,731 INFO L158 Benchmark]: Toolchain (without parser) took 32076.74ms. Allocated memory was 337.6MB in the beginning and 5.0GB in the end (delta: 4.7GB). Free memory was 290.8MB in the beginning and 3.1GB in the end (delta: -2.9GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2023-12-05 21:09:04,731 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 204.5MB. Free memory is still 154.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:09:04,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 691.93ms. Allocated memory is still 337.6MB. Free memory was 290.4MB in the beginning and 264.1MB in the end (delta: 26.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-12-05 21:09:04,732 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.34ms. Allocated memory is still 337.6MB. Free memory was 263.8MB in the beginning and 261.1MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-05 21:09:04,732 INFO L158 Benchmark]: Boogie Preprocessor took 49.51ms. Allocated memory is still 337.6MB. Free memory was 261.1MB in the beginning and 258.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:09:04,732 INFO L158 Benchmark]: RCFGBuilder took 1341.19ms. Allocated memory is still 337.6MB. Free memory was 258.3MB in the beginning and 205.8MB in the end (delta: 52.5MB). Peak memory consumption was 56.7MB. Max. memory is 8.0GB. [2023-12-05 21:09:04,740 INFO L158 Benchmark]: TraceAbstraction took 29910.78ms. Allocated memory was 337.6MB in the beginning and 5.0GB in the end (delta: 4.7GB). Free memory was 205.3MB in the beginning and 3.1GB in the end (delta: -2.9GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2023-12-05 21:09:04,741 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.12ms. Allocated memory is still 204.5MB. Free memory is still 154.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 691.93ms. Allocated memory is still 337.6MB. Free memory was 290.4MB in the beginning and 264.1MB in the end (delta: 26.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.34ms. Allocated memory is still 337.6MB. Free memory was 263.8MB in the beginning and 261.1MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.51ms. Allocated memory is still 337.6MB. Free memory was 261.1MB in the beginning and 258.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1341.19ms. Allocated memory is still 337.6MB. Free memory was 258.3MB in the beginning and 205.8MB in the end (delta: 52.5MB). Peak memory consumption was 56.7MB. Max. memory is 8.0GB. * TraceAbstraction took 29910.78ms. Allocated memory was 337.6MB in the beginning and 5.0GB in the end (delta: 4.7GB). Free memory was 205.3MB in the beginning and 3.1GB in the end (delta: -2.9GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 261 locations, 107 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: 29.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 27.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 770 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 770 mSDsluCounter, 211 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 216 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1332 IncrementalHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 216 mSolverCounterUnsat, 138 mSDtfsCounter, 1332 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8092occurred in iteration=14, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1028 NumberOfCodeBlocks, 1028 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1014 ConstructedInterpolants, 0 QuantifiedInterpolants, 4323 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 64 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:09:04,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...