/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:47:51,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:47:51,338 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 04:47:51,361 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:47:51,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:47:51,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:47:51,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:47:51,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:47:51,363 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:47:51,366 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:47:51,366 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:47:51,366 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:47:51,367 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:47:51,368 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:47:51,368 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:47:51,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:47:51,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:47:51,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:47:51,368 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:47:51,369 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:47:51,369 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:47:51,369 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:47:51,369 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:47:51,370 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:47:51,370 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:47:51,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:47:51,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:47:51,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:47:51,371 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:47:51,371 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:47:51,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:47:51,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:47:51,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:47:51,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-11-30 04:47:51,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:47:51,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:47:51,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:47:51,574 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:47:51,574 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:47:51,575 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2023-11-30 04:47:52,653 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:47:52,926 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:47:52,926 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2023-11-30 04:47:52,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1494b720/450a9287e01744b1aa849035fc27c0ac/FLAG5886ec68c [2023-11-30 04:47:53,268 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1494b720/450a9287e01744b1aa849035fc27c0ac [2023-11-30 04:47:53,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:47:53,270 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:47:53,272 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:47:53,272 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:47:53,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:47:53,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:47:53" (1/1) ... [2023-11-30 04:47:53,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a153d2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:53, skipping insertion in model container [2023-11-30 04:47:53,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:47:53" (1/1) ... [2023-11-30 04:47:53,391 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:47:53,732 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:47:53,766 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:47:53,876 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:47:53,916 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:47:53,916 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:47:53,921 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:47:53,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:53 WrapperNode [2023-11-30 04:47:53,922 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:47:53,930 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:47:53,930 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:47:53,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:47:53,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:53" (1/1) ... [2023-11-30 04:47:53,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:53" (1/1) ... [2023-11-30 04:47:53,999 INFO L138 Inliner]: procedures = 175, calls = 57, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 123 [2023-11-30 04:47:54,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:47:54,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:47:54,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:47:54,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:47:54,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:53" (1/1) ... [2023-11-30 04:47:54,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:53" (1/1) ... [2023-11-30 04:47:54,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:53" (1/1) ... [2023-11-30 04:47:54,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:53" (1/1) ... [2023-11-30 04:47:54,027 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:53" (1/1) ... [2023-11-30 04:47:54,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:53" (1/1) ... [2023-11-30 04:47:54,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:53" (1/1) ... [2023-11-30 04:47:54,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:53" (1/1) ... [2023-11-30 04:47:54,069 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:47:54,070 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:47:54,070 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:47:54,071 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:47:54,071 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:53" (1/1) ... [2023-11-30 04:47:54,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:47:54,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:47:54,121 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 04:47:54,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 04:47:54,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 04:47:54,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:47:54,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:47:54,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:47:54,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:47:54,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:47:54,213 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-30 04:47:54,213 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-30 04:47:54,213 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-30 04:47:54,213 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-30 04:47:54,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:47:54,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:47:54,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:47:54,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:47:54,214 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 04:47:54,397 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:47:54,399 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:47:54,747 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:47:55,286 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:47:55,286 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:47:55,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:47:55 BoogieIcfgContainer [2023-11-30 04:47:55,288 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:47:55,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:47:55,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:47:55,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:47:55,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:47:53" (1/3) ... [2023-11-30 04:47:55,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7669a004 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:47:55, skipping insertion in model container [2023-11-30 04:47:55,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:53" (2/3) ... [2023-11-30 04:47:55,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7669a004 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:47:55, skipping insertion in model container [2023-11-30 04:47:55,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:47:55" (3/3) ... [2023-11-30 04:47:55,293 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.oepc-thin000_power.oepc.i [2023-11-30 04:47:55,323 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:47:55,323 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2023-11-30 04:47:55,323 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:47:55,400 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:47:55,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 143 transitions, 294 flow [2023-11-30 04:47:55,486 INFO L124 PetriNetUnfolderBase]: 3/141 cut-off events. [2023-11-30 04:47:55,486 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:47:55,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 141 events. 3/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 198 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-11-30 04:47:55,490 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 143 transitions, 294 flow [2023-11-30 04:47:55,496 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 141 transitions, 288 flow [2023-11-30 04:47:55,506 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:47:55,511 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;@5009cd07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:47:55,511 INFO L363 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2023-11-30 04:47:55,529 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:47:55,529 INFO L124 PetriNetUnfolderBase]: 0/52 cut-off events. [2023-11-30 04:47:55,529 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:47:55,530 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:55,530 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:47:55,530 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-30 04:47:55,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:55,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1809092543, now seen corresponding path program 1 times [2023-11-30 04:47:55,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:55,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340776717] [2023-11-30 04:47:55,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:55,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:55,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:47:55,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:55,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340776717] [2023-11-30 04:47:55,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340776717] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:55,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:55,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:47:55,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601751182] [2023-11-30 04:47:55,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:55,830 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:47:55,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:55,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:47:55,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:47:55,854 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 143 [2023-11-30 04:47:55,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 141 transitions, 288 flow. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:55,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:55,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 143 [2023-11-30 04:47:55,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:56,263 INFO L124 PetriNetUnfolderBase]: 744/1895 cut-off events. [2023-11-30 04:47:56,263 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-30 04:47:56,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3145 conditions, 1895 events. 744/1895 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 13887 event pairs, 508 based on Foata normal form. 76/1118 useless extension candidates. Maximal degree in co-relation 3076. Up to 851 conditions per place. [2023-11-30 04:47:56,272 INFO L140 encePairwiseOnDemand]: 123/143 looper letters, 45 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2023-11-30 04:47:56,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 131 transitions, 362 flow [2023-11-30 04:47:56,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:47:56,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:47:56,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2023-11-30 04:47:56,281 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7995337995337995 [2023-11-30 04:47:56,281 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 343 transitions. [2023-11-30 04:47:56,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions. [2023-11-30 04:47:56,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:56,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions. [2023-11-30 04:47:56,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:56,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:56,288 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:56,290 INFO L307 CegarLoopForPetriNet]: 145 programPoint places, -16 predicate places. [2023-11-30 04:47:56,290 INFO L500 AbstractCegarLoop]: Abstraction has has 129 places, 131 transitions, 362 flow [2023-11-30 04:47:56,291 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:56,291 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:56,291 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:47:56,291 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:47:56,291 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-30 04:47:56,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:56,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1809092542, now seen corresponding path program 1 times [2023-11-30 04:47:56,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:56,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829503341] [2023-11-30 04:47:56,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:56,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:56,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:47:56,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:56,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829503341] [2023-11-30 04:47:56,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829503341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:56,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:56,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:47:56,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182258388] [2023-11-30 04:47:56,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:56,427 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:47:56,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:56,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:47:56,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:47:56,429 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 143 [2023-11-30 04:47:56,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 131 transitions, 362 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:56,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:56,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 143 [2023-11-30 04:47:56,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:56,737 INFO L124 PetriNetUnfolderBase]: 747/1905 cut-off events. [2023-11-30 04:47:56,738 INFO L125 PetriNetUnfolderBase]: For 148/460 co-relation queries the response was YES. [2023-11-30 04:47:56,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4359 conditions, 1905 events. 747/1905 cut-off events. For 148/460 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 14018 event pairs, 511 based on Foata normal form. 0/1049 useless extension candidates. Maximal degree in co-relation 4284. Up to 948 conditions per place. [2023-11-30 04:47:56,749 INFO L140 encePairwiseOnDemand]: 140/143 looper letters, 53 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2023-11-30 04:47:56,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 141 transitions, 512 flow [2023-11-30 04:47:56,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:47:56,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:47:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2023-11-30 04:47:56,751 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7342657342657343 [2023-11-30 04:47:56,751 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 315 transitions. [2023-11-30 04:47:56,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions. [2023-11-30 04:47:56,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:56,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions. [2023-11-30 04:47:56,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:56,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:56,754 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:56,754 INFO L307 CegarLoopForPetriNet]: 145 programPoint places, -15 predicate places. [2023-11-30 04:47:56,754 INFO L500 AbstractCegarLoop]: Abstraction has has 130 places, 141 transitions, 512 flow [2023-11-30 04:47:56,755 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:56,755 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:56,755 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:47:56,755 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:47:56,755 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-30 04:47:56,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:56,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1425623460, now seen corresponding path program 1 times [2023-11-30 04:47:56,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:56,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540044987] [2023-11-30 04:47:56,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:56,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:56,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:47:56,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:56,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540044987] [2023-11-30 04:47:56,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540044987] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:56,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:56,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:47:56,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461865425] [2023-11-30 04:47:56,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:56,902 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:47:56,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:56,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:47:56,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:47:56,906 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 143 [2023-11-30 04:47:56,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 141 transitions, 512 flow. Second operand has 6 states, 6 states have (on average 87.83333333333333) internal successors, (527), 6 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:56,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:56,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 143 [2023-11-30 04:47:56,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:57,298 INFO L124 PetriNetUnfolderBase]: 467/1402 cut-off events. [2023-11-30 04:47:57,298 INFO L125 PetriNetUnfolderBase]: For 314/560 co-relation queries the response was YES. [2023-11-30 04:47:57,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3880 conditions, 1402 events. 467/1402 cut-off events. For 314/560 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9928 event pairs, 193 based on Foata normal form. 0/956 useless extension candidates. Maximal degree in co-relation 3794. Up to 519 conditions per place. [2023-11-30 04:47:57,307 INFO L140 encePairwiseOnDemand]: 129/143 looper letters, 58 selfloop transitions, 12 changer transitions 0/152 dead transitions. [2023-11-30 04:47:57,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 152 transitions, 716 flow [2023-11-30 04:47:57,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 04:47:57,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 04:47:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 686 transitions. [2023-11-30 04:47:57,309 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6853146853146853 [2023-11-30 04:47:57,310 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 686 transitions. [2023-11-30 04:47:57,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 686 transitions. [2023-11-30 04:47:57,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:57,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 686 transitions. [2023-11-30 04:47:57,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:57,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 143.0) internal successors, (1144), 8 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:57,315 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 143.0) internal successors, (1144), 8 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:57,315 INFO L307 CegarLoopForPetriNet]: 145 programPoint places, -11 predicate places. [2023-11-30 04:47:57,316 INFO L500 AbstractCegarLoop]: Abstraction has has 134 places, 152 transitions, 716 flow [2023-11-30 04:47:57,316 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.83333333333333) internal successors, (527), 6 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:57,316 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:57,316 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:47:57,316 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:47:57,316 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-30 04:47:57,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:57,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1425623459, now seen corresponding path program 1 times [2023-11-30 04:47:57,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:57,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364869833] [2023-11-30 04:47:57,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:57,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:57,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-11-30 04:47:57,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:57,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364869833] [2023-11-30 04:47:57,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364869833] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:57,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:57,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:47:57,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646549568] [2023-11-30 04:47:57,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:57,613 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:47:57,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:57,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:47:57,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:47:57,614 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 143 [2023-11-30 04:47:57,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 152 transitions, 716 flow. Second operand has 6 states, 6 states have (on average 86.83333333333333) internal successors, (521), 6 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:57,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:57,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 143 [2023-11-30 04:47:57,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:57,789 INFO L124 PetriNetUnfolderBase]: 103/478 cut-off events. [2023-11-30 04:47:57,789 INFO L125 PetriNetUnfolderBase]: For 260/434 co-relation queries the response was YES. [2023-11-30 04:47:57,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1389 conditions, 478 events. 103/478 cut-off events. For 260/434 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2301 event pairs, 53 based on Foata normal form. 0/413 useless extension candidates. Maximal degree in co-relation 1292. Up to 152 conditions per place. [2023-11-30 04:47:57,792 INFO L140 encePairwiseOnDemand]: 128/143 looper letters, 42 selfloop transitions, 7 changer transitions 2/132 dead transitions. [2023-11-30 04:47:57,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 132 transitions, 658 flow [2023-11-30 04:47:57,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 04:47:57,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 04:47:57,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 568 transitions. [2023-11-30 04:47:57,794 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.662004662004662 [2023-11-30 04:47:57,794 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 568 transitions. [2023-11-30 04:47:57,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 568 transitions. [2023-11-30 04:47:57,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:57,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 568 transitions. [2023-11-30 04:47:57,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.66666666666667) internal successors, (568), 6 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:57,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 143.0) internal successors, (1001), 7 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:57,797 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 143.0) internal successors, (1001), 7 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:57,798 INFO L307 CegarLoopForPetriNet]: 145 programPoint places, -12 predicate places. [2023-11-30 04:47:57,798 INFO L500 AbstractCegarLoop]: Abstraction has has 133 places, 132 transitions, 658 flow [2023-11-30 04:47:57,798 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.83333333333333) internal successors, (521), 6 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:57,798 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:57,798 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:47:57,799 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:47:57,799 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-30 04:47:57,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:57,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1039686984, now seen corresponding path program 1 times [2023-11-30 04:47:57,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:57,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474795450] [2023-11-30 04:47:57,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:57,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:57,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:47:57,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:57,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474795450] [2023-11-30 04:47:57,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474795450] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:57,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:57,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:47:57,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762524476] [2023-11-30 04:47:57,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:57,890 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:47:57,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:57,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:47:57,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:47:57,892 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 143 [2023-11-30 04:47:57,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 132 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:57,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:57,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 143 [2023-11-30 04:47:57,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:58,172 INFO L124 PetriNetUnfolderBase]: 135/567 cut-off events. [2023-11-30 04:47:58,172 INFO L125 PetriNetUnfolderBase]: For 598/654 co-relation queries the response was YES. [2023-11-30 04:47:58,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1876 conditions, 567 events. 135/567 cut-off events. For 598/654 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2969 event pairs, 59 based on Foata normal form. 2/499 useless extension candidates. Maximal degree in co-relation 1770. Up to 206 conditions per place. [2023-11-30 04:47:58,175 INFO L140 encePairwiseOnDemand]: 140/143 looper letters, 44 selfloop transitions, 2 changer transitions 2/132 dead transitions. [2023-11-30 04:47:58,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 132 transitions, 756 flow [2023-11-30 04:47:58,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:47:58,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:47:58,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2023-11-30 04:47:58,177 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6876456876456877 [2023-11-30 04:47:58,177 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 295 transitions. [2023-11-30 04:47:58,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 295 transitions. [2023-11-30 04:47:58,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:58,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 295 transitions. [2023-11-30 04:47:58,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:58,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:58,179 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:58,181 INFO L307 CegarLoopForPetriNet]: 145 programPoint places, -11 predicate places. [2023-11-30 04:47:58,181 INFO L500 AbstractCegarLoop]: Abstraction has has 134 places, 132 transitions, 756 flow [2023-11-30 04:47:58,181 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:58,181 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:58,181 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:47:58,182 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:47:58,182 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-30 04:47:58,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:58,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1039686985, now seen corresponding path program 1 times [2023-11-30 04:47:58,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:58,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129461966] [2023-11-30 04:47:58,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:58,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:47:58,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:58,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129461966] [2023-11-30 04:47:58,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129461966] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:58,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:58,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:47:58,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764917262] [2023-11-30 04:47:58,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:58,256 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:47:58,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:58,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:47:58,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:47:58,257 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 143 [2023-11-30 04:47:58,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 132 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:58,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:58,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 143 [2023-11-30 04:47:58,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:58,365 INFO L124 PetriNetUnfolderBase]: 134/549 cut-off events. [2023-11-30 04:47:58,366 INFO L125 PetriNetUnfolderBase]: For 994/1064 co-relation queries the response was YES. [2023-11-30 04:47:58,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2113 conditions, 549 events. 134/549 cut-off events. For 994/1064 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2891 event pairs, 19 based on Foata normal form. 2/481 useless extension candidates. Maximal degree in co-relation 1999. Up to 206 conditions per place. [2023-11-30 04:47:58,369 INFO L140 encePairwiseOnDemand]: 140/143 looper letters, 49 selfloop transitions, 2 changer transitions 4/141 dead transitions. [2023-11-30 04:47:58,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 141 transitions, 978 flow [2023-11-30 04:47:58,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:47:58,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:47:58,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2023-11-30 04:47:58,370 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.703962703962704 [2023-11-30 04:47:58,370 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 302 transitions. [2023-11-30 04:47:58,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 302 transitions. [2023-11-30 04:47:58,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:58,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 302 transitions. [2023-11-30 04:47:58,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:58,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:58,372 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:58,373 INFO L307 CegarLoopForPetriNet]: 145 programPoint places, -10 predicate places. [2023-11-30 04:47:58,373 INFO L500 AbstractCegarLoop]: Abstraction has has 135 places, 141 transitions, 978 flow [2023-11-30 04:47:58,374 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:58,374 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:58,374 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:47:58,374 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:47:58,374 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-30 04:47:58,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:58,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1420047743, now seen corresponding path program 1 times [2023-11-30 04:47:58,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:58,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850869757] [2023-11-30 04:47:58,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:58,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:47:58,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:58,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850869757] [2023-11-30 04:47:58,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850869757] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:58,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:58,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:47:58,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699475710] [2023-11-30 04:47:58,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:58,448 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:47:58,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:58,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:47:58,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:47:58,449 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 143 [2023-11-30 04:47:58,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 141 transitions, 978 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:58,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:58,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 143 [2023-11-30 04:47:58,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:58,544 INFO L124 PetriNetUnfolderBase]: 124/528 cut-off events. [2023-11-30 04:47:58,544 INFO L125 PetriNetUnfolderBase]: For 1193/1275 co-relation queries the response was YES. [2023-11-30 04:47:58,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2170 conditions, 528 events. 124/528 cut-off events. For 1193/1275 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2769 event pairs, 15 based on Foata normal form. 0/464 useless extension candidates. Maximal degree in co-relation 2053. Up to 206 conditions per place. [2023-11-30 04:47:58,547 INFO L140 encePairwiseOnDemand]: 139/143 looper letters, 43 selfloop transitions, 9 changer transitions 14/164 dead transitions. [2023-11-30 04:47:58,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 164 transitions, 1435 flow [2023-11-30 04:47:58,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:47:58,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:47:58,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2023-11-30 04:47:58,549 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7762237762237763 [2023-11-30 04:47:58,549 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2023-11-30 04:47:58,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2023-11-30 04:47:58,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:58,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2023-11-30 04:47:58,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:58,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:58,550 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:58,551 INFO L307 CegarLoopForPetriNet]: 145 programPoint places, -8 predicate places. [2023-11-30 04:47:58,551 INFO L500 AbstractCegarLoop]: Abstraction has has 137 places, 164 transitions, 1435 flow [2023-11-30 04:47:58,551 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:58,551 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:58,551 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:47:58,551 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:47:58,551 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-30 04:47:58,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:58,552 INFO L85 PathProgramCache]: Analyzing trace with hash -2049876208, now seen corresponding path program 1 times [2023-11-30 04:47:58,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:58,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732466477] [2023-11-30 04:47:58,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:58,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:58,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:47:58,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:58,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732466477] [2023-11-30 04:47:58,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732466477] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:58,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:58,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 04:47:58,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569943002] [2023-11-30 04:47:58,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:58,662 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 04:47:58,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:58,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 04:47:58,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-30 04:47:58,663 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 143 [2023-11-30 04:47:58,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 164 transitions, 1435 flow. Second operand has 5 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:58,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:58,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 143 [2023-11-30 04:47:58,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:58,791 INFO L124 PetriNetUnfolderBase]: 122/523 cut-off events. [2023-11-30 04:47:58,791 INFO L125 PetriNetUnfolderBase]: For 1522/1618 co-relation queries the response was YES. [2023-11-30 04:47:58,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2328 conditions, 523 events. 122/523 cut-off events. For 1522/1618 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2724 event pairs, 13 based on Foata normal form. 0/463 useless extension candidates. Maximal degree in co-relation 2200. Up to 206 conditions per place. [2023-11-30 04:47:58,793 INFO L140 encePairwiseOnDemand]: 137/143 looper letters, 57 selfloop transitions, 12 changer transitions 14/168 dead transitions. [2023-11-30 04:47:58,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 168 transitions, 1649 flow [2023-11-30 04:47:58,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:47:58,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:47:58,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 397 transitions. [2023-11-30 04:47:58,795 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6940559440559441 [2023-11-30 04:47:58,795 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 397 transitions. [2023-11-30 04:47:58,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 397 transitions. [2023-11-30 04:47:58,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:58,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 397 transitions. [2023-11-30 04:47:58,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:58,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:58,797 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:58,797 INFO L307 CegarLoopForPetriNet]: 145 programPoint places, -6 predicate places. [2023-11-30 04:47:58,797 INFO L500 AbstractCegarLoop]: Abstraction has has 139 places, 168 transitions, 1649 flow [2023-11-30 04:47:58,797 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:58,797 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:58,798 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:47:58,798 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:47:58,798 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-30 04:47:58,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:58,798 INFO L85 PathProgramCache]: Analyzing trace with hash -2049876207, now seen corresponding path program 1 times [2023-11-30 04:47:58,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:58,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599032600] [2023-11-30 04:47:58,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:58,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:58,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:47:58,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:58,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599032600] [2023-11-30 04:47:58,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599032600] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:58,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:58,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:47:58,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821931143] [2023-11-30 04:47:58,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:58,994 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:47:58,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:58,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:47:58,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:47:58,995 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 143 [2023-11-30 04:47:58,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 168 transitions, 1649 flow. Second operand has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:58,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:58,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 143 [2023-11-30 04:47:58,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:59,119 INFO L124 PetriNetUnfolderBase]: 120/523 cut-off events. [2023-11-30 04:47:59,119 INFO L125 PetriNetUnfolderBase]: For 1893/2003 co-relation queries the response was YES. [2023-11-30 04:47:59,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2463 conditions, 523 events. 120/523 cut-off events. For 1893/2003 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2732 event pairs, 11 based on Foata normal form. 2/468 useless extension candidates. Maximal degree in co-relation 2325. Up to 206 conditions per place. [2023-11-30 04:47:59,122 INFO L140 encePairwiseOnDemand]: 140/143 looper letters, 51 selfloop transitions, 9 changer transitions 15/167 dead transitions. [2023-11-30 04:47:59,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 167 transitions, 1781 flow [2023-11-30 04:47:59,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:47:59,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:47:59,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 400 transitions. [2023-11-30 04:47:59,124 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6993006993006993 [2023-11-30 04:47:59,124 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 400 transitions. [2023-11-30 04:47:59,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 400 transitions. [2023-11-30 04:47:59,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:59,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 400 transitions. [2023-11-30 04:47:59,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:59,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:59,128 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:59,129 INFO L307 CegarLoopForPetriNet]: 145 programPoint places, -4 predicate places. [2023-11-30 04:47:59,129 INFO L500 AbstractCegarLoop]: Abstraction has has 141 places, 167 transitions, 1781 flow [2023-11-30 04:47:59,129 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:59,130 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:59,130 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:47:59,130 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 04:47:59,130 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-30 04:47:59,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:59,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1494422780, now seen corresponding path program 1 times [2023-11-30 04:47:59,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:59,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009705994] [2023-11-30 04:47:59,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:59,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:59,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:47:59,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:59,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009705994] [2023-11-30 04:47:59,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009705994] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:59,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:59,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-30 04:47:59,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771887473] [2023-11-30 04:47:59,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:59,402 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-30 04:47:59,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:59,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-30 04:47:59,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-11-30 04:47:59,404 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 143 [2023-11-30 04:47:59,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 167 transitions, 1781 flow. Second operand has 11 states, 11 states have (on average 83.81818181818181) internal successors, (922), 11 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:59,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:59,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 143 [2023-11-30 04:47:59,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:59,721 INFO L124 PetriNetUnfolderBase]: 206/793 cut-off events. [2023-11-30 04:47:59,721 INFO L125 PetriNetUnfolderBase]: For 3914/4393 co-relation queries the response was YES. [2023-11-30 04:47:59,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4214 conditions, 793 events. 206/793 cut-off events. For 3914/4393 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4804 event pairs, 5 based on Foata normal form. 4/735 useless extension candidates. Maximal degree in co-relation 4064. Up to 306 conditions per place. [2023-11-30 04:47:59,725 INFO L140 encePairwiseOnDemand]: 125/143 looper letters, 47 selfloop transitions, 27 changer transitions 92/244 dead transitions. [2023-11-30 04:47:59,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 244 transitions, 3433 flow [2023-11-30 04:47:59,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-30 04:47:59,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-30 04:47:59,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1226 transitions. [2023-11-30 04:47:59,728 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6123876123876124 [2023-11-30 04:47:59,728 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1226 transitions. [2023-11-30 04:47:59,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1226 transitions. [2023-11-30 04:47:59,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:59,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1226 transitions. [2023-11-30 04:47:59,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 87.57142857142857) internal successors, (1226), 14 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:59,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 143.0) internal successors, (2145), 15 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:59,734 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 143.0) internal successors, (2145), 15 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:59,734 INFO L307 CegarLoopForPetriNet]: 145 programPoint places, 9 predicate places. [2023-11-30 04:47:59,735 INFO L500 AbstractCegarLoop]: Abstraction has has 154 places, 244 transitions, 3433 flow [2023-11-30 04:47:59,735 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 83.81818181818181) internal successors, (922), 11 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:59,735 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:59,735 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:47:59,735 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 04:47:59,735 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-11-30 04:47:59,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:59,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1363183627, now seen corresponding path program 1 times [2023-11-30 04:47:59,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:59,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368397820] [2023-11-30 04:47:59,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:59,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:47:59,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:59,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368397820] [2023-11-30 04:47:59,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368397820] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:59,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:59,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-30 04:47:59,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711742797] [2023-11-30 04:47:59,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:59,974 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-30 04:47:59,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:59,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-30 04:47:59,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-11-30 04:47:59,976 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 143 [2023-11-30 04:47:59,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 244 transitions, 3433 flow. Second operand has 12 states, 12 states have (on average 81.83333333333333) internal successors, (982), 12 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:59,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:59,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 143 [2023-11-30 04:47:59,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:00,307 INFO L124 PetriNetUnfolderBase]: 331/1172 cut-off events. [2023-11-30 04:48:00,307 INFO L125 PetriNetUnfolderBase]: For 8044/9144 co-relation queries the response was YES. [2023-11-30 04:48:00,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6094 conditions, 1172 events. 331/1172 cut-off events. For 8044/9144 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7880 event pairs, 6 based on Foata normal form. 15/1150 useless extension candidates. Maximal degree in co-relation 5931. Up to 333 conditions per place. [2023-11-30 04:48:00,314 INFO L140 encePairwiseOnDemand]: 126/143 looper letters, 0 selfloop transitions, 0 changer transitions 351/351 dead transitions. [2023-11-30 04:48:00,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 351 transitions, 5791 flow [2023-11-30 04:48:00,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-30 04:48:00,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-30 04:48:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1139 transitions. [2023-11-30 04:48:00,318 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6126949973103819 [2023-11-30 04:48:00,318 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1139 transitions. [2023-11-30 04:48:00,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1139 transitions. [2023-11-30 04:48:00,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:00,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1139 transitions. [2023-11-30 04:48:00,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 87.61538461538461) internal successors, (1139), 13 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:00,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 143.0) internal successors, (2002), 14 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:00,323 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 143.0) internal successors, (2002), 14 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:00,323 INFO L307 CegarLoopForPetriNet]: 145 programPoint places, 17 predicate places. [2023-11-30 04:48:00,323 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 351 transitions, 5791 flow [2023-11-30 04:48:00,324 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 81.83333333333333) internal successors, (982), 12 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:00,332 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe006_power.oepc-thin000_power.oepc.i_BEv2_AllErrorsAtOnce [2023-11-30 04:48:00,376 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 56 remaining) [2023-11-30 04:48:00,377 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 56 remaining) [2023-11-30 04:48:00,377 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 56 remaining) [2023-11-30 04:48:00,377 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 56 remaining) [2023-11-30 04:48:00,377 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 56 remaining) [2023-11-30 04:48:00,377 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 56 remaining) [2023-11-30 04:48:00,377 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 56 remaining) [2023-11-30 04:48:00,377 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 56 remaining) [2023-11-30 04:48:00,378 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 56 remaining) [2023-11-30 04:48:00,378 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 56 remaining) [2023-11-30 04:48:00,378 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 56 remaining) [2023-11-30 04:48:00,378 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 56 remaining) [2023-11-30 04:48:00,378 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 56 remaining) [2023-11-30 04:48:00,378 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 56 remaining) [2023-11-30 04:48:00,378 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 56 remaining) [2023-11-30 04:48:00,378 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 56 remaining) [2023-11-30 04:48:00,378 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 56 remaining) [2023-11-30 04:48:00,378 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 56 remaining) [2023-11-30 04:48:00,378 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 56 remaining) [2023-11-30 04:48:00,378 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 56 remaining) [2023-11-30 04:48:00,379 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 56 remaining) [2023-11-30 04:48:00,379 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 56 remaining) [2023-11-30 04:48:00,379 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 56 remaining) [2023-11-30 04:48:00,379 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 56 remaining) [2023-11-30 04:48:00,379 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 56 remaining) [2023-11-30 04:48:00,379 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 56 remaining) [2023-11-30 04:48:00,379 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 56 remaining) [2023-11-30 04:48:00,379 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 56 remaining) [2023-11-30 04:48:00,379 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 56 remaining) [2023-11-30 04:48:00,379 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 56 remaining) [2023-11-30 04:48:00,379 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 56 remaining) [2023-11-30 04:48:00,379 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 56 remaining) [2023-11-30 04:48:00,379 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 56 remaining) [2023-11-30 04:48:00,380 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 56 remaining) [2023-11-30 04:48:00,380 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 56 remaining) [2023-11-30 04:48:00,380 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 56 remaining) [2023-11-30 04:48:00,380 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 56 remaining) [2023-11-30 04:48:00,380 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 56 remaining) [2023-11-30 04:48:00,380 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 56 remaining) [2023-11-30 04:48:00,380 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 56 remaining) [2023-11-30 04:48:00,380 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 56 remaining) [2023-11-30 04:48:00,380 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 56 remaining) [2023-11-30 04:48:00,380 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 56 remaining) [2023-11-30 04:48:00,380 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 56 remaining) [2023-11-30 04:48:00,380 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 56 remaining) [2023-11-30 04:48:00,381 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 56 remaining) [2023-11-30 04:48:00,381 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 56 remaining) [2023-11-30 04:48:00,381 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 56 remaining) [2023-11-30 04:48:00,381 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 56 remaining) [2023-11-30 04:48:00,381 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 56 remaining) [2023-11-30 04:48:00,381 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 56 remaining) [2023-11-30 04:48:00,381 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 56 remaining) [2023-11-30 04:48:00,381 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 56 remaining) [2023-11-30 04:48:00,381 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 56 remaining) [2023-11-30 04:48:00,381 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 56 remaining) [2023-11-30 04:48:00,381 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 56 remaining) [2023-11-30 04:48:00,381 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 04:48:00,382 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:00,385 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:48:00,385 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:48:00,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:48:00 BasicIcfg [2023-11-30 04:48:00,389 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:48:00,390 INFO L158 Benchmark]: Toolchain (without parser) took 7119.33ms. Allocated memory was 664.8MB in the beginning and 1.1GB in the end (delta: 427.8MB). Free memory was 618.0MB in the beginning and 949.9MB in the end (delta: -332.0MB). Peak memory consumption was 655.7MB. Max. memory is 16.0GB. [2023-11-30 04:48:00,390 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 356.5MB. Free memory was 304.4MB in the beginning and 304.3MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:48:00,390 INFO L158 Benchmark]: CACSL2BoogieTranslator took 649.37ms. Allocated memory is still 664.8MB. Free memory was 618.0MB in the beginning and 594.3MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-11-30 04:48:00,390 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.91ms. Allocated memory is still 664.8MB. Free memory was 594.3MB in the beginning and 592.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:48:00,390 INFO L158 Benchmark]: Boogie Preprocessor took 68.90ms. Allocated memory is still 664.8MB. Free memory was 592.2MB in the beginning and 590.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:48:00,390 INFO L158 Benchmark]: RCFGBuilder took 1217.98ms. Allocated memory is still 664.8MB. Free memory was 590.1MB in the beginning and 572.8MB in the end (delta: 17.3MB). Peak memory consumption was 75.5MB. Max. memory is 16.0GB. [2023-11-30 04:48:00,391 INFO L158 Benchmark]: TraceAbstraction took 5099.69ms. Allocated memory was 664.8MB in the beginning and 1.1GB in the end (delta: 427.8MB). Free memory was 571.8MB in the beginning and 949.9MB in the end (delta: -378.2MB). Peak memory consumption was 607.5MB. Max. memory is 16.0GB. [2023-11-30 04:48:00,391 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.10ms. Allocated memory is still 356.5MB. Free memory was 304.4MB in the beginning and 304.3MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 649.37ms. Allocated memory is still 664.8MB. Free memory was 618.0MB in the beginning and 594.3MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 69.91ms. Allocated memory is still 664.8MB. Free memory was 594.3MB in the beginning and 592.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 68.90ms. Allocated memory is still 664.8MB. Free memory was 592.2MB in the beginning and 590.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1217.98ms. Allocated memory is still 664.8MB. Free memory was 590.1MB in the beginning and 572.8MB in the end (delta: 17.3MB). Peak memory consumption was 75.5MB. Max. memory is 16.0GB. * TraceAbstraction took 5099.69ms. Allocated memory was 664.8MB in the beginning and 1.1GB in the end (delta: 427.8MB). Free memory was 571.8MB in the beginning and 949.9MB in the end (delta: -378.2MB). Peak memory consumption was 607.5MB. Max. memory is 16.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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 181 locations, 56 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: 5.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 421 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 421 mSDsluCounter, 199 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 96 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 821 IncrementalHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 103 mSDtfsCounter, 821 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5791occurred in iteration=11, InterpolantAutomatonStates: 63, 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.6s InterpolantComputationTime, 716 NumberOfCodeBlocks, 716 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 705 ConstructedInterpolants, 0 QuantifiedInterpolants, 3483 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 32 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 04:48:00,404 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...