/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:49:08,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:49:08,652 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 04:49:08,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:49:08,656 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:49:08,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:49:08,677 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:49:08,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:49:08,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:49:08,680 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:49:08,680 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:49:08,681 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:49:08,681 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:49:08,682 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:49:08,682 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:49:08,682 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:49:08,683 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:49:08,683 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:49:08,683 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:49:08,683 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:49:08,684 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:49:08,684 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:49:08,684 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:49:08,684 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:49:08,684 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:49:08,685 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:49:08,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:49:08,685 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:49:08,685 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:49:08,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:49:08,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:49:08,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:49:08,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:49:08,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:49:08,687 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:49:08,687 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:49:08,687 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:49:08,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:49:08,687 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:49:08,687 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:49:08,687 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:49:08,687 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:49:08,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:49:08,687 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 04:49:08,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:49:08,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:49:08,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:49:08,883 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:49:08,883 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:49:08,884 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2023-12-16 04:49:09,867 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:49:10,011 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:49:10,011 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2023-12-16 04:49:10,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d11165a55/1190cda4d1524614929174f2835b6a2e/FLAG05bfb2e2d [2023-12-16 04:49:10,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d11165a55/1190cda4d1524614929174f2835b6a2e [2023-12-16 04:49:10,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:49:10,027 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:49:10,027 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:49:10,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:49:10,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:49:10,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:49:10" (1/1) ... [2023-12-16 04:49:10,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a8cbb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:10, skipping insertion in model container [2023-12-16 04:49:10,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:49:10" (1/1) ... [2023-12-16 04:49:10,049 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:49:10,145 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i[893,906] [2023-12-16 04:49:10,157 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:49:10,167 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:49:10,176 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i[893,906] [2023-12-16 04:49:10,181 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:49:10,190 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:49:10,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:10 WrapperNode [2023-12-16 04:49:10,190 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:49:10,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:49:10,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:49:10,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:49:10,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:10" (1/1) ... [2023-12-16 04:49:10,199 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:10" (1/1) ... [2023-12-16 04:49:10,215 INFO L138 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2023-12-16 04:49:10,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:49:10,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:49:10,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:49:10,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:49:10,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:10" (1/1) ... [2023-12-16 04:49:10,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:10" (1/1) ... [2023-12-16 04:49:10,224 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:10" (1/1) ... [2023-12-16 04:49:10,231 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 04:49:10,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:10" (1/1) ... [2023-12-16 04:49:10,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:10" (1/1) ... [2023-12-16 04:49:10,233 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:10" (1/1) ... [2023-12-16 04:49:10,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:10" (1/1) ... [2023-12-16 04:49:10,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:10" (1/1) ... [2023-12-16 04:49:10,236 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:10" (1/1) ... [2023-12-16 04:49:10,237 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:49:10,238 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:49:10,238 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:49:10,238 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:49:10,238 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:10" (1/1) ... [2023-12-16 04:49:10,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:49:10,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:49:10,266 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 04:49:10,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 04:49:10,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:49:10,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:49:10,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:49:10,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:49:10,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-16 04:49:10,286 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-16 04:49:10,333 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:49:10,336 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:49:10,514 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:49:10,530 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:49:10,530 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 04:49:10,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:49:10 BoogieIcfgContainer [2023-12-16 04:49:10,531 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:49:10,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:49:10,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:49:10,537 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:49:10,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:49:10" (1/3) ... [2023-12-16 04:49:10,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecd25d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:49:10, skipping insertion in model container [2023-12-16 04:49:10,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:10" (2/3) ... [2023-12-16 04:49:10,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecd25d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:49:10, skipping insertion in model container [2023-12-16 04:49:10,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:49:10" (3/3) ... [2023-12-16 04:49:10,541 INFO L112 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2023-12-16 04:49:10,556 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:49:10,556 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:49:10,596 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:49:10,602 INFO L357 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;@113fe82e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:49:10,602 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:49:10,606 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 04:49:10,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-16 04:49:10,611 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:10,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:10,612 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:49:10,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:10,617 INFO L85 PathProgramCache]: Analyzing trace with hash -998756722, now seen corresponding path program 1 times [2023-12-16 04:49:10,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:10,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559752033] [2023-12-16 04:49:10,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:10,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:10,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:49:10,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:10,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559752033] [2023-12-16 04:49:10,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559752033] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:10,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:10,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:49:10,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825679905] [2023-12-16 04:49:10,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:10,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:49:10,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:10,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:49:10,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:49:10,845 INFO L87 Difference]: Start difference. First operand has 36 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:10,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:10,954 INFO L93 Difference]: Finished difference Result 76 states and 139 transitions. [2023-12-16 04:49:10,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:49:10,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-16 04:49:10,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:10,961 INFO L225 Difference]: With dead ends: 76 [2023-12-16 04:49:10,961 INFO L226 Difference]: Without dead ends: 39 [2023-12-16 04:49:10,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:49:10,969 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 11 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:10,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 140 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:49:10,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-16 04:49:10,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2023-12-16 04:49:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 04:49:10,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2023-12-16 04:49:11,000 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 9 [2023-12-16 04:49:11,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:11,000 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2023-12-16 04:49:11,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:11,000 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2023-12-16 04:49:11,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-16 04:49:11,001 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:11,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:11,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:49:11,001 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:49:11,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:11,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1020712689, now seen corresponding path program 1 times [2023-12-16 04:49:11,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:11,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37932248] [2023-12-16 04:49:11,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:11,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:11,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:49:11,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:11,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37932248] [2023-12-16 04:49:11,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37932248] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:11,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:11,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:49:11,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075097548] [2023-12-16 04:49:11,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:11,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:49:11,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:11,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:49:11,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:49:11,125 INFO L87 Difference]: Start difference. First operand 37 states and 54 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:11,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:11,210 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2023-12-16 04:49:11,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:49:11,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-16 04:49:11,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:11,212 INFO L225 Difference]: With dead ends: 52 [2023-12-16 04:49:11,212 INFO L226 Difference]: Without dead ends: 50 [2023-12-16 04:49:11,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:49:11,213 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 7 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:11,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 175 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:49:11,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-16 04:49:11,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2023-12-16 04:49:11,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 04:49:11,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2023-12-16 04:49:11,231 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 9 [2023-12-16 04:49:11,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:11,232 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2023-12-16 04:49:11,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:11,233 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2023-12-16 04:49:11,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-16 04:49:11,234 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:11,234 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:11,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:49:11,234 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:49:11,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:11,237 INFO L85 PathProgramCache]: Analyzing trace with hash -827859626, now seen corresponding path program 1 times [2023-12-16 04:49:11,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:11,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863434298] [2023-12-16 04:49:11,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:11,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:11,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 04:49:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:11,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:49:11,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:11,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863434298] [2023-12-16 04:49:11,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863434298] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:11,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:11,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:49:11,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538033288] [2023-12-16 04:49:11,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:11,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:49:11,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:11,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:49:11,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:49:11,310 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 04:49:11,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:11,386 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2023-12-16 04:49:11,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:49:11,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-12-16 04:49:11,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:11,392 INFO L225 Difference]: With dead ends: 52 [2023-12-16 04:49:11,393 INFO L226 Difference]: Without dead ends: 50 [2023-12-16 04:49:11,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:49:11,397 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 10 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:11,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 116 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:49:11,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-16 04:49:11,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-12-16 04:49:11,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 04:49:11,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2023-12-16 04:49:11,414 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 14 [2023-12-16 04:49:11,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:11,414 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2023-12-16 04:49:11,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 04:49:11,414 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2023-12-16 04:49:11,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-16 04:49:11,415 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:11,415 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:11,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:49:11,415 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:49:11,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:11,415 INFO L85 PathProgramCache]: Analyzing trace with hash 175850318, now seen corresponding path program 1 times [2023-12-16 04:49:11,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:11,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148999264] [2023-12-16 04:49:11,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:11,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:11,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 04:49:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:11,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-16 04:49:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:11,503 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 04:49:11,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:11,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148999264] [2023-12-16 04:49:11,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148999264] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:11,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:11,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:49:11,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159140649] [2023-12-16 04:49:11,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:11,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:49:11,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:11,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:49:11,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:49:11,505 INFO L87 Difference]: Start difference. First operand 50 states and 65 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 04:49:11,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:11,604 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2023-12-16 04:49:11,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:49:11,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-12-16 04:49:11,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:11,608 INFO L225 Difference]: With dead ends: 56 [2023-12-16 04:49:11,608 INFO L226 Difference]: Without dead ends: 54 [2023-12-16 04:49:11,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:49:11,616 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 19 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:11,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 156 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:49:11,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-16 04:49:11,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-12-16 04:49:11,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 04:49:11,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2023-12-16 04:49:11,634 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 19 [2023-12-16 04:49:11,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:11,634 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2023-12-16 04:49:11,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 04:49:11,634 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2023-12-16 04:49:11,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 04:49:11,635 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:11,635 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:11,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 04:49:11,635 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:49:11,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:11,635 INFO L85 PathProgramCache]: Analyzing trace with hash 994963478, now seen corresponding path program 1 times [2023-12-16 04:49:11,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:11,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557970678] [2023-12-16 04:49:11,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:11,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:11,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 04:49:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:11,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-16 04:49:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:11,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-16 04:49:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:11,687 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 04:49:11,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:11,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557970678] [2023-12-16 04:49:11,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557970678] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:11,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:11,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:49:11,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479070642] [2023-12-16 04:49:11,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:11,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:49:11,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:11,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:49:11,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:49:11,689 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 04:49:11,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:11,746 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2023-12-16 04:49:11,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:49:11,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2023-12-16 04:49:11,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:11,747 INFO L225 Difference]: With dead ends: 61 [2023-12-16 04:49:11,747 INFO L226 Difference]: Without dead ends: 59 [2023-12-16 04:49:11,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:49:11,748 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 9 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:11,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 126 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:49:11,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-16 04:49:11,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2023-12-16 04:49:11,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 04:49:11,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2023-12-16 04:49:11,762 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 24 [2023-12-16 04:49:11,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:11,763 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2023-12-16 04:49:11,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 04:49:11,764 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2023-12-16 04:49:11,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-16 04:49:11,765 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:11,765 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:11,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 04:49:11,765 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:49:11,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:11,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1250005993, now seen corresponding path program 1 times [2023-12-16 04:49:11,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:11,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381693692] [2023-12-16 04:49:11,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:11,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:11,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 04:49:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:11,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-16 04:49:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:11,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 04:49:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:11,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-16 04:49:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:11,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-16 04:49:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:11,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:49:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:11,879 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 04:49:11,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:11,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381693692] [2023-12-16 04:49:11,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381693692] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:11,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:11,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:49:11,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613172090] [2023-12-16 04:49:11,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:11,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:49:11,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:11,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:49:11,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:49:11,885 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-16 04:49:11,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:11,955 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2023-12-16 04:49:11,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:49:11,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2023-12-16 04:49:11,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:11,957 INFO L225 Difference]: With dead ends: 70 [2023-12-16 04:49:11,957 INFO L226 Difference]: Without dead ends: 68 [2023-12-16 04:49:11,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:49:11,958 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 11 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:11,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 137 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:49:11,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-12-16 04:49:11,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2023-12-16 04:49:11,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 17 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 04:49:11,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2023-12-16 04:49:11,978 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 42 [2023-12-16 04:49:11,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:11,979 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2023-12-16 04:49:11,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-16 04:49:11,979 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2023-12-16 04:49:11,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-16 04:49:11,983 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:11,983 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:11,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 04:49:11,983 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:49:11,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:11,984 INFO L85 PathProgramCache]: Analyzing trace with hash 432071401, now seen corresponding path program 1 times [2023-12-16 04:49:11,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:11,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143551564] [2023-12-16 04:49:11,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:11,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:12,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 04:49:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:12,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-16 04:49:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:12,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 04:49:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:12,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-16 04:49:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:12,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-16 04:49:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:12,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:49:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:12,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:49:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:12,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 04:49:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:12,071 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 04:49:12,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:12,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143551564] [2023-12-16 04:49:12,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143551564] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:12,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:12,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:49:12,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137548673] [2023-12-16 04:49:12,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:12,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:49:12,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:12,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:49:12,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:49:12,073 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 04:49:12,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:12,168 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2023-12-16 04:49:12,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:49:12,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 52 [2023-12-16 04:49:12,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:12,171 INFO L225 Difference]: With dead ends: 70 [2023-12-16 04:49:12,171 INFO L226 Difference]: Without dead ends: 68 [2023-12-16 04:49:12,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:49:12,172 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 18 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:12,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 175 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:49:12,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-12-16 04:49:12,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2023-12-16 04:49:12,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 40 states have internal predecessors, (43), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 04:49:12,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2023-12-16 04:49:12,185 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 52 [2023-12-16 04:49:12,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:12,185 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2023-12-16 04:49:12,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 04:49:12,185 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2023-12-16 04:49:12,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-16 04:49:12,187 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:12,187 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:12,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 04:49:12,188 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:49:12,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:12,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1667354039, now seen corresponding path program 1 times [2023-12-16 04:49:12,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:12,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404878403] [2023-12-16 04:49:12,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:12,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:12,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 04:49:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:12,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-16 04:49:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:12,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 04:49:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:12,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-16 04:49:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:12,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-16 04:49:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:12,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:49:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:12,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:49:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:12,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 04:49:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:12,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-16 04:49:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:12,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:49:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:12,318 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-16 04:49:12,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:12,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404878403] [2023-12-16 04:49:12,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404878403] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:12,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:12,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 04:49:12,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896655427] [2023-12-16 04:49:12,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:12,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:49:12,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:12,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:49:12,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:49:12,319 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-16 04:49:12,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:12,425 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2023-12-16 04:49:12,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:49:12,426 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 63 [2023-12-16 04:49:12,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:12,426 INFO L225 Difference]: With dead ends: 68 [2023-12-16 04:49:12,426 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 04:49:12,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:49:12,427 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 18 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:12,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 178 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:49:12,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 04:49:12,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 04:49:12,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 04:49:12,428 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2023-12-16 04:49:12,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:12,428 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 04:49:12,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-16 04:49:12,428 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 04:49:12,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 04:49:12,430 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:49:12,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 04:49:12,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 04:49:12,667 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 35 64) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-12-16 04:49:12,667 INFO L899 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2023-12-16 04:49:12,668 INFO L899 garLoopResultBuilder]: For program point L60(line 60) no Hoare annotation was computed. [2023-12-16 04:49:12,668 INFO L895 garLoopResultBuilder]: At program point L56(lines 36 63) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-12-16 04:49:12,668 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-12-16 04:49:12,668 INFO L895 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (and (<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-12-16 04:49:12,668 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-12-16 04:49:12,668 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 24 67) no Hoare annotation was computed. [2023-12-16 04:49:12,675 INFO L895 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-12-16 04:49:12,676 INFO L895 garLoopResultBuilder]: At program point L40-1(line 40) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-12-16 04:49:12,676 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 63) no Hoare annotation was computed. [2023-12-16 04:49:12,676 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-12-16 04:49:12,676 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-12-16 04:49:12,676 INFO L899 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2023-12-16 04:49:12,676 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-12-16 04:49:12,676 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-12-16 04:49:12,677 INFO L895 garLoopResultBuilder]: At program point L37-1(line 37) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-12-16 04:49:12,677 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 04:49:12,677 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-12-16 04:49:12,677 INFO L895 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-12-16 04:49:12,677 INFO L895 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-12-16 04:49:12,677 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-12-16 04:49:12,677 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 04:49:12,677 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2023-12-16 04:49:12,677 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 65) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-12-16 04:49:12,677 INFO L899 garLoopResultBuilder]: For program point L34-3(lines 34 65) no Hoare annotation was computed. [2023-12-16 04:49:12,678 INFO L895 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-12-16 04:49:12,678 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-12-16 04:49:12,678 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2023-12-16 04:49:12,678 INFO L899 garLoopResultBuilder]: For program point L39(line 39) no Hoare annotation was computed. [2023-12-16 04:49:12,678 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2023-12-16 04:49:12,678 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2023-12-16 04:49:12,678 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 17 22) the Hoare annotation is: true [2023-12-16 04:49:12,678 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-16 04:49:12,678 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-16 04:49:12,678 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2023-12-16 04:49:12,681 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:12,683 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:49:12,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:49:12 BoogieIcfgContainer [2023-12-16 04:49:12,694 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:49:12,694 INFO L158 Benchmark]: Toolchain (without parser) took 2667.48ms. Allocated memory was 245.4MB in the beginning and 294.6MB in the end (delta: 49.3MB). Free memory was 202.0MB in the beginning and 249.9MB in the end (delta: -47.9MB). Peak memory consumption was 101.2MB. Max. memory is 8.0GB. [2023-12-16 04:49:12,694 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 204.5MB. Free memory is still 154.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:49:12,695 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.92ms. Allocated memory is still 245.4MB. Free memory was 201.6MB in the beginning and 190.4MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 04:49:12,695 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.99ms. Allocated memory is still 245.4MB. Free memory was 190.4MB in the beginning and 188.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 04:49:12,695 INFO L158 Benchmark]: Boogie Preprocessor took 20.82ms. Allocated memory is still 245.4MB. Free memory was 188.7MB in the beginning and 187.0MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 04:49:12,695 INFO L158 Benchmark]: RCFGBuilder took 293.41ms. Allocated memory is still 245.4MB. Free memory was 187.0MB in the beginning and 174.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 04:49:12,695 INFO L158 Benchmark]: TraceAbstraction took 2158.76ms. Allocated memory was 245.4MB in the beginning and 294.6MB in the end (delta: 49.3MB). Free memory was 173.7MB in the beginning and 249.9MB in the end (delta: -76.2MB). Peak memory consumption was 72.9MB. Max. memory is 8.0GB. [2023-12-16 04:49:12,697 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 204.5MB. Free memory is still 154.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 162.92ms. Allocated memory is still 245.4MB. Free memory was 201.6MB in the beginning and 190.4MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.99ms. Allocated memory is still 245.4MB. Free memory was 190.4MB in the beginning and 188.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.82ms. Allocated memory is still 245.4MB. Free memory was 188.7MB in the beginning and 187.0MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 293.41ms. Allocated memory is still 245.4MB. Free memory was 187.0MB in the beginning and 174.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 2158.76ms. Allocated memory was 245.4MB in the beginning and 294.6MB in the end (delta: 49.3MB). Free memory was 173.7MB in the beginning and 249.9MB in the end (delta: -76.2MB). Peak memory consumption was 72.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 171 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 1203 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 851 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 550 IncrementalHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 352 mSDtfsCounter, 550 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=7, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 51 PreInvPairs, 72 NumberOfFragments, 364 HoareAnnotationTreeSize, 51 FormulaSimplifications, 677 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 19 FormulaSimplificationsInter, 152 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 224 ConstructedInterpolants, 0 QuantifiedInterpolants, 522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 428/428 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 1 specifications checked. All of them hold - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((i + 1) <= len) && (0 <= j)) && ((5 + j) <= bufsize)) && (0 <= i)) && ((limit + 4) <= bufsize)) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((0 <= j) && (0 <= i)) && ((limit + 4) <= bufsize)) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((0 <= i) && ((limit + 4) <= bufsize)) RESULT: Ultimate proved your program to be correct! [2023-12-16 04:49:12,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...