/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-lit/gsv2008.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:41:19,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:41:19,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:41:20,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:41:20,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:41:20,034 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:41:20,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:41:20,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:41:20,038 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:41:20,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:41:20,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:41:20,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:41:20,041 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:41:20,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:41:20,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:41:20,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:41:20,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:41:20,045 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:41:20,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:41:20,055 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:41:20,060 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:41:20,064 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:41:20,066 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:41:20,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:41:20,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:41:20,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:41:20,070 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:41:20,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:41:20,071 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:41:20,071 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:41:20,072 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:41:20,072 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:41:20,073 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:41:20,073 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:41:20,074 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:41:20,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:41:20,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:41:20,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:41:20,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:41:20,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:41:20,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:41:20,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:41:20,085 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:41:20,092 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:41:20,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:41:20,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:41:20,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:41:20,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:41:20,094 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:41:20,094 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:41:20,094 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:41:20,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:41:20,094 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:41:20,094 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:41:20,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:41:20,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:41:20,095 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:41:20,095 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:41:20,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:41:20,095 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:41:20,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:41:20,096 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:41:20,096 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:41:20,096 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:41:20,096 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:41:20,096 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 09:41:20,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:41:20,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:41:20,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:41:20,320 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:41:20,321 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:41:20,322 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gsv2008.i [2022-04-28 09:41:20,367 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e619646e/2d56f1a225a64fb3a8216b8561ba2d5b/FLAG4046c72e6 [2022-04-28 09:41:20,754 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:41:20,754 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.i [2022-04-28 09:41:20,760 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e619646e/2d56f1a225a64fb3a8216b8561ba2d5b/FLAG4046c72e6 [2022-04-28 09:41:20,776 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e619646e/2d56f1a225a64fb3a8216b8561ba2d5b [2022-04-28 09:41:20,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:41:20,781 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:41:20,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:41:20,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:41:20,788 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:41:20,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:41:20" (1/1) ... [2022-04-28 09:41:20,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@417dc749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:20, skipping insertion in model container [2022-04-28 09:41:20,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:41:20" (1/1) ... [2022-04-28 09:41:20,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:41:20,813 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:41:20,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.i[895,908] [2022-04-28 09:41:20,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:41:20,965 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:41:20,975 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.i[895,908] [2022-04-28 09:41:20,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:41:20,991 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:41:20,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:20 WrapperNode [2022-04-28 09:41:20,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:41:20,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:41:20,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:41:20,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:41:21,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:20" (1/1) ... [2022-04-28 09:41:21,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:20" (1/1) ... [2022-04-28 09:41:21,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:20" (1/1) ... [2022-04-28 09:41:21,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:20" (1/1) ... [2022-04-28 09:41:21,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:20" (1/1) ... [2022-04-28 09:41:21,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:20" (1/1) ... [2022-04-28 09:41:21,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:20" (1/1) ... [2022-04-28 09:41:21,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:41:21,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:41:21,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:41:21,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:41:21,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:20" (1/1) ... [2022-04-28 09:41:21,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:41:21,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:41:21,062 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 09:41:21,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 09:41:21,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:41:21,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:41:21,095 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:41:21,095 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 09:41:21,096 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:41:21,096 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:41:21,096 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:41:21,096 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:41:21,096 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 09:41:21,097 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 09:41:21,097 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:41:21,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:41:21,098 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 09:41:21,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:41:21,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 09:41:21,099 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:41:21,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:41:21,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:41:21,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:41:21,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:41:21,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:41:21,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:41:21,145 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:41:21,146 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:41:21,243 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:41:21,248 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:41:21,249 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 09:41:21,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:41:21 BoogieIcfgContainer [2022-04-28 09:41:21,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:41:21,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:41:21,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:41:21,255 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:41:21,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:41:20" (1/3) ... [2022-04-28 09:41:21,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dab4c97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:41:21, skipping insertion in model container [2022-04-28 09:41:21,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:20" (2/3) ... [2022-04-28 09:41:21,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dab4c97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:41:21, skipping insertion in model container [2022-04-28 09:41:21,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:41:21" (3/3) ... [2022-04-28 09:41:21,257 INFO L111 eAbstractionObserver]: Analyzing ICFG gsv2008.i [2022-04-28 09:41:21,268 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:41:21,269 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:41:21,304 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:41:21,309 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@62697a48, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@19b2bd45 [2022-04-28 09:41:21,310 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:41:21,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:41:21,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 09:41:21,321 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:41:21,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:41:21,322 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:41:21,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:41:21,326 INFO L85 PathProgramCache]: Analyzing trace with hash 253912119, now seen corresponding path program 1 times [2022-04-28 09:41:21,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:21,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [385811346] [2022-04-28 09:41:21,342 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:41:21,342 INFO L85 PathProgramCache]: Analyzing trace with hash 253912119, now seen corresponding path program 2 times [2022-04-28 09:41:21,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:41:21,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55620207] [2022-04-28 09:41:21,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:41:21,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:41:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:21,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:41:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:21,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {23#true} is VALID [2022-04-28 09:41:21,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 09:41:21,574 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #54#return; {23#true} is VALID [2022-04-28 09:41:21,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:41:21,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {23#true} is VALID [2022-04-28 09:41:21,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 09:41:21,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #54#return; {23#true} is VALID [2022-04-28 09:41:21,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2022-04-28 09:41:21,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} havoc ~x~0;havoc ~y~0;~x~0 := -50;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; {28#(<= (+ main_~x~0 50) 0)} is VALID [2022-04-28 09:41:21,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {28#(<= (+ main_~x~0 50) 0)} is VALID [2022-04-28 09:41:21,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(<= (+ main_~x~0 50) 0)} assume !(~x~0 < 0); {24#false} is VALID [2022-04-28 09:41:21,579 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {24#false} is VALID [2022-04-28 09:41:21,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-28 09:41:21,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-28 09:41:21,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-28 09:41:21,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:41:21,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:41:21,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55620207] [2022-04-28 09:41:21,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55620207] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:21,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:21,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:41:21,584 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:41:21,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [385811346] [2022-04-28 09:41:21,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [385811346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:21,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:21,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:41:21,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874387941] [2022-04-28 09:41:21,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:41:21,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 09:41:21,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:41:21,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:21,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:21,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:41:21,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:21,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:41:21,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:41:21,631 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:21,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:21,759 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-28 09:41:21,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:41:21,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 09:41:21,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:41:21,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:21,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-28 09:41:21,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:21,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-28 09:41:21,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2022-04-28 09:41:21,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:21,845 INFO L225 Difference]: With dead ends: 35 [2022-04-28 09:41:21,845 INFO L226 Difference]: Without dead ends: 14 [2022-04-28 09:41:21,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:41:21,854 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:41:21,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 28 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:41:21,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-28 09:41:21,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-28 09:41:21,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:41:21,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:21,885 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:21,885 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:21,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:21,888 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 09:41:21,888 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 09:41:21,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:21,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:21,889 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 09:41:21,889 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 09:41:21,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:21,891 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 09:41:21,891 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 09:41:21,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:21,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:21,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:41:21,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:41:21,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:21,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-28 09:41:21,894 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-28 09:41:21,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:41:21,895 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-28 09:41:21,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:21,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-28 09:41:21,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:21,917 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 09:41:21,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 09:41:21,920 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:41:21,920 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:41:21,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:41:21,921 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:41:21,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:41:21,922 INFO L85 PathProgramCache]: Analyzing trace with hash -684163825, now seen corresponding path program 1 times [2022-04-28 09:41:21,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:21,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [206514459] [2022-04-28 09:41:21,937 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:41:21,937 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:41:21,937 INFO L85 PathProgramCache]: Analyzing trace with hash -684163825, now seen corresponding path program 2 times [2022-04-28 09:41:21,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:41:21,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997489093] [2022-04-28 09:41:21,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:41:21,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:41:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:22,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:41:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:22,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {160#true} is VALID [2022-04-28 09:41:22,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {160#true} assume true; {160#true} is VALID [2022-04-28 09:41:22,089 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {160#true} {160#true} #54#return; {160#true} is VALID [2022-04-28 09:41:22,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {160#true} call ULTIMATE.init(); {170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:41:22,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {160#true} is VALID [2022-04-28 09:41:22,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {160#true} assume true; {160#true} is VALID [2022-04-28 09:41:22,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160#true} {160#true} #54#return; {160#true} is VALID [2022-04-28 09:41:22,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {160#true} call #t~ret3 := main(); {160#true} is VALID [2022-04-28 09:41:22,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {160#true} havoc ~x~0;havoc ~y~0;~x~0 := -50;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; {165#(<= (+ main_~x~0 50) 0)} is VALID [2022-04-28 09:41:22,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {165#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {165#(<= (+ main_~x~0 50) 0)} is VALID [2022-04-28 09:41:22,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {165#(<= (+ main_~x~0 50) 0)} assume !!(~x~0 < 0);~x~0 := ~x~0 + ~y~0;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {166#(<= (+ 51 main_~x~0) main_~y~0)} is VALID [2022-04-28 09:41:22,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {166#(<= (+ 51 main_~x~0) main_~y~0)} assume !(~x~0 < 0); {167#(<= 51 main_~y~0)} is VALID [2022-04-28 09:41:22,096 INFO L272 TraceCheckUtils]: 9: Hoare triple {167#(<= 51 main_~y~0)} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {168#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:41:22,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {168#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {169#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:41:22,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {169#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {161#false} is VALID [2022-04-28 09:41:22,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {161#false} assume !false; {161#false} is VALID [2022-04-28 09:41:22,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:41:22,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:41:22,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997489093] [2022-04-28 09:41:22,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997489093] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:41:22,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783434195] [2022-04-28 09:41:22,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:41:22,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:41:22,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:41:22,106 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:41:22,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 09:41:22,156 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:41:22,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:41:22,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 09:41:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:22,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:41:22,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {160#true} call ULTIMATE.init(); {160#true} is VALID [2022-04-28 09:41:22,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {160#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {160#true} is VALID [2022-04-28 09:41:22,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {160#true} assume true; {160#true} is VALID [2022-04-28 09:41:22,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160#true} {160#true} #54#return; {160#true} is VALID [2022-04-28 09:41:22,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {160#true} call #t~ret3 := main(); {160#true} is VALID [2022-04-28 09:41:22,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {160#true} havoc ~x~0;havoc ~y~0;~x~0 := -50;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; {165#(<= (+ main_~x~0 50) 0)} is VALID [2022-04-28 09:41:22,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {165#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {165#(<= (+ main_~x~0 50) 0)} is VALID [2022-04-28 09:41:22,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {165#(<= (+ main_~x~0 50) 0)} assume !!(~x~0 < 0);~x~0 := ~x~0 + ~y~0;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {166#(<= (+ 51 main_~x~0) main_~y~0)} is VALID [2022-04-28 09:41:22,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {166#(<= (+ 51 main_~x~0) main_~y~0)} assume !(~x~0 < 0); {167#(<= 51 main_~y~0)} is VALID [2022-04-28 09:41:22,396 INFO L272 TraceCheckUtils]: 9: Hoare triple {167#(<= 51 main_~y~0)} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {201#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:41:22,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {201#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {205#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:41:22,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {205#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {161#false} is VALID [2022-04-28 09:41:22,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {161#false} assume !false; {161#false} is VALID [2022-04-28 09:41:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:41:22,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:41:22,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {161#false} assume !false; {161#false} is VALID [2022-04-28 09:41:22,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {205#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {161#false} is VALID [2022-04-28 09:41:22,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {201#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {205#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:41:22,597 INFO L272 TraceCheckUtils]: 9: Hoare triple {221#(< 0 main_~y~0)} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {201#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:41:22,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {225#(or (< main_~x~0 0) (< 0 main_~y~0))} assume !(~x~0 < 0); {221#(< 0 main_~y~0)} is VALID [2022-04-28 09:41:22,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {229#(< main_~x~0 1)} assume !!(~x~0 < 0);~x~0 := ~x~0 + ~y~0;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {225#(or (< main_~x~0 0) (< 0 main_~y~0))} is VALID [2022-04-28 09:41:22,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {229#(< main_~x~0 1)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {229#(< main_~x~0 1)} is VALID [2022-04-28 09:41:22,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {160#true} havoc ~x~0;havoc ~y~0;~x~0 := -50;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; {229#(< main_~x~0 1)} is VALID [2022-04-28 09:41:22,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {160#true} call #t~ret3 := main(); {160#true} is VALID [2022-04-28 09:41:22,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160#true} {160#true} #54#return; {160#true} is VALID [2022-04-28 09:41:22,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {160#true} assume true; {160#true} is VALID [2022-04-28 09:41:22,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {160#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {160#true} is VALID [2022-04-28 09:41:22,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {160#true} call ULTIMATE.init(); {160#true} is VALID [2022-04-28 09:41:22,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:41:22,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783434195] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:41:22,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:41:22,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-04-28 09:41:22,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:41:22,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [206514459] [2022-04-28 09:41:22,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [206514459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:22,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:22,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:41:22,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524593799] [2022-04-28 09:41:22,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:41:22,604 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 09:41:22,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:41:22,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:22,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:22,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:41:22,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:22,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:41:22,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-28 09:41:22,618 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:22,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:22,781 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 09:41:22,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:41:22,781 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 09:41:22,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:41:22,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:22,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2022-04-28 09:41:22,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:22,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2022-04-28 09:41:22,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 20 transitions. [2022-04-28 09:41:22,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:22,805 INFO L225 Difference]: With dead ends: 20 [2022-04-28 09:41:22,805 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 09:41:22,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-04-28 09:41:22,807 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:41:22,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 37 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:41:22,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 09:41:22,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 09:41:22,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:41:22,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:22,813 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:22,814 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:22,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:22,815 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 09:41:22,815 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 09:41:22,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:22,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:22,816 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 09:41:22,817 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 09:41:22,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:22,818 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 09:41:22,818 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 09:41:22,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:22,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:22,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:41:22,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:41:22,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:22,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 09:41:22,820 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-28 09:41:22,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:41:22,820 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 09:41:22,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:22,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 09:41:22,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:22,854 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 09:41:22,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 09:41:22,854 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:41:22,854 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:41:22,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 09:41:23,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:41:23,078 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:41:23,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:41:23,079 INFO L85 PathProgramCache]: Analyzing trace with hash 300252983, now seen corresponding path program 3 times [2022-04-28 09:41:23,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:23,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1485074502] [2022-04-28 09:41:23,097 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:41:23,098 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:41:23,098 INFO L85 PathProgramCache]: Analyzing trace with hash 300252983, now seen corresponding path program 4 times [2022-04-28 09:41:23,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:41:23,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776227955] [2022-04-28 09:41:23,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:41:23,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:41:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:23,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:41:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:23,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {363#true} is VALID [2022-04-28 09:41:23,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {363#true} assume true; {363#true} is VALID [2022-04-28 09:41:23,197 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {363#true} {363#true} #54#return; {363#true} is VALID [2022-04-28 09:41:23,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {363#true} call ULTIMATE.init(); {374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:41:23,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {363#true} is VALID [2022-04-28 09:41:23,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {363#true} assume true; {363#true} is VALID [2022-04-28 09:41:23,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {363#true} {363#true} #54#return; {363#true} is VALID [2022-04-28 09:41:23,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {363#true} call #t~ret3 := main(); {363#true} is VALID [2022-04-28 09:41:23,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {363#true} havoc ~x~0;havoc ~y~0;~x~0 := -50;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; {368#(<= (+ main_~x~0 50) 0)} is VALID [2022-04-28 09:41:23,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {368#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {368#(<= (+ main_~x~0 50) 0)} is VALID [2022-04-28 09:41:23,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {368#(<= (+ main_~x~0 50) 0)} assume !!(~x~0 < 0);~x~0 := ~x~0 + ~y~0;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {369#(<= (+ 51 main_~x~0) main_~y~0)} is VALID [2022-04-28 09:41:23,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {369#(<= (+ 51 main_~x~0) main_~y~0)} assume !!(~x~0 < 0);~x~0 := ~x~0 + ~y~0;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {370#(<= (+ 53 main_~x~0) (* main_~y~0 2))} is VALID [2022-04-28 09:41:23,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {370#(<= (+ 53 main_~x~0) (* main_~y~0 2))} assume !(~x~0 < 0); {371#(<= 27 main_~y~0)} is VALID [2022-04-28 09:41:23,202 INFO L272 TraceCheckUtils]: 10: Hoare triple {371#(<= 27 main_~y~0)} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {372#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:41:23,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {372#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {373#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:41:23,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {373#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {364#false} is VALID [2022-04-28 09:41:23,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {364#false} assume !false; {364#false} is VALID [2022-04-28 09:41:23,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:41:23,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:41:23,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776227955] [2022-04-28 09:41:23,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776227955] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:41:23,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377320045] [2022-04-28 09:41:23,204 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:41:23,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:41:23,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:41:23,206 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:41:23,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 09:41:23,252 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:41:23,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:41:23,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 09:41:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:23,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:41:23,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {363#true} call ULTIMATE.init(); {363#true} is VALID [2022-04-28 09:41:23,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {363#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {363#true} is VALID [2022-04-28 09:41:23,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {363#true} assume true; {363#true} is VALID [2022-04-28 09:41:23,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {363#true} {363#true} #54#return; {363#true} is VALID [2022-04-28 09:41:23,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {363#true} call #t~ret3 := main(); {363#true} is VALID [2022-04-28 09:41:23,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {363#true} havoc ~x~0;havoc ~y~0;~x~0 := -50;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; {363#true} is VALID [2022-04-28 09:41:23,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {363#true} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {363#true} is VALID [2022-04-28 09:41:23,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {363#true} assume !!(~x~0 < 0);~x~0 := ~x~0 + ~y~0;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {399#(< (+ main_~x~0 1) main_~y~0)} is VALID [2022-04-28 09:41:23,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {399#(< (+ main_~x~0 1) main_~y~0)} assume !!(~x~0 < 0);~x~0 := ~x~0 + ~y~0;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {403#(< (div (+ (- 2) (* (- 1) main_~x~0)) (- 2)) main_~y~0)} is VALID [2022-04-28 09:41:23,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {403#(< (div (+ (- 2) (* (- 1) main_~x~0)) (- 2)) main_~y~0)} assume !(~x~0 < 0); {407#(< 1 main_~y~0)} is VALID [2022-04-28 09:41:23,538 INFO L272 TraceCheckUtils]: 10: Hoare triple {407#(< 1 main_~y~0)} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {411#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:41:23,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {411#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {415#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:41:23,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {415#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {364#false} is VALID [2022-04-28 09:41:23,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {364#false} assume !false; {364#false} is VALID [2022-04-28 09:41:23,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:41:23,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:41:23,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {364#false} assume !false; {364#false} is VALID [2022-04-28 09:41:23,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {415#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {364#false} is VALID [2022-04-28 09:41:23,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {411#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {415#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:41:23,733 INFO L272 TraceCheckUtils]: 10: Hoare triple {431#(< 0 main_~y~0)} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {411#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:41:23,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {435#(or (< main_~x~0 0) (< 0 main_~y~0))} assume !(~x~0 < 0); {431#(< 0 main_~y~0)} is VALID [2022-04-28 09:41:23,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {439#(or (< (+ main_~y~0 main_~x~0) 0) (< 0 (+ main_~y~0 1)))} assume !!(~x~0 < 0);~x~0 := ~x~0 + ~y~0;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {435#(or (< main_~x~0 0) (< 0 main_~y~0))} is VALID [2022-04-28 09:41:23,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {363#true} assume !!(~x~0 < 0);~x~0 := ~x~0 + ~y~0;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {439#(or (< (+ main_~y~0 main_~x~0) 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 09:41:23,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {363#true} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {363#true} is VALID [2022-04-28 09:41:23,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {363#true} havoc ~x~0;havoc ~y~0;~x~0 := -50;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; {363#true} is VALID [2022-04-28 09:41:23,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {363#true} call #t~ret3 := main(); {363#true} is VALID [2022-04-28 09:41:23,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {363#true} {363#true} #54#return; {363#true} is VALID [2022-04-28 09:41:23,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {363#true} assume true; {363#true} is VALID [2022-04-28 09:41:23,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {363#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {363#true} is VALID [2022-04-28 09:41:23,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {363#true} call ULTIMATE.init(); {363#true} is VALID [2022-04-28 09:41:23,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:41:23,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377320045] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 09:41:23,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:41:23,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 17 [2022-04-28 09:41:23,737 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:41:23,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1485074502] [2022-04-28 09:41:23,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1485074502] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:23,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:23,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:41:23,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439557426] [2022-04-28 09:41:23,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:41:23,738 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 09:41:23,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:41:23,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:23,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:23,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:41:23,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:23,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:41:23,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-04-28 09:41:23,750 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:23,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:23,812 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 09:41:23,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:41:23,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 09:41:23,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:41:23,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:23,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2022-04-28 09:41:23,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:23,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2022-04-28 09:41:23,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 13 transitions. [2022-04-28 09:41:23,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:23,828 INFO L225 Difference]: With dead ends: 15 [2022-04-28 09:41:23,828 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 09:41:23,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-04-28 09:41:23,830 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:41:23,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 29 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:41:23,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 09:41:23,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 09:41:23,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:41:23,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second 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) [2022-04-28 09:41:23,831 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second 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) [2022-04-28 09:41:23,832 INFO L87 Difference]: Start difference. First operand 0 states. Second 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) [2022-04-28 09:41:23,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:23,832 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:41:23,832 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:41:23,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:23,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:23,832 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-04-28 09:41:23,832 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-04-28 09:41:23,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:23,833 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:41:23,833 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:41:23,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:23,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:23,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:41:23,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:41:23,833 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) [2022-04-28 09:41:23,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 09:41:23,833 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-28 09:41:23,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:41:23,834 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 09:41:23,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:23,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 09:41:23,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:23,834 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:41:23,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:23,837 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:41:23,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 09:41:24,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 09:41:24,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 09:41:24,161 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-28 09:41:24,161 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-28 09:41:24,161 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-28 09:41:24,161 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-28 09:41:24,161 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:41:24,161 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:41:24,161 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:41:24,162 INFO L902 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: true [2022-04-28 09:41:24,162 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 35) the Hoare annotation is: true [2022-04-28 09:41:24,162 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (<= (+ main_~x~0 50) 0) [2022-04-28 09:41:24,162 INFO L895 garLoopResultBuilder]: At program point L29-2(lines 29 32) the Hoare annotation is: (or (< main_~x~0 0) (< 0 main_~y~0)) [2022-04-28 09:41:24,162 INFO L895 garLoopResultBuilder]: At program point L29-3(lines 29 32) the Hoare annotation is: (< 0 main_~y~0) [2022-04-28 09:41:24,162 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 24 35) the Hoare annotation is: true [2022-04-28 09:41:24,162 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 24 35) the Hoare annotation is: true [2022-04-28 09:41:24,162 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:41:24,162 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 09:41:24,163 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:41:24,163 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:41:24,163 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 09:41:24,163 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 09:41:24,163 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:41:24,163 INFO L902 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2022-04-28 09:41:24,163 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-28 09:41:24,163 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: true [2022-04-28 09:41:24,163 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:41:24,164 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:41:24,164 INFO L895 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 09:41:24,166 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2] [2022-04-28 09:41:24,168 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:41:24,171 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:41:24,171 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:41:24,172 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 09:41:24,173 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 09:41:24,173 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:41:24,173 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:41:24,174 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 09:41:24,177 INFO L163 areAnnotationChecker]: CFG has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 09:41:24,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:41:24 BoogieIcfgContainer [2022-04-28 09:41:24,183 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:41:24,184 INFO L158 Benchmark]: Toolchain (without parser) took 3403.06ms. Allocated memory was 191.9MB in the beginning and 240.1MB in the end (delta: 48.2MB). Free memory was 143.0MB in the beginning and 147.1MB in the end (delta: -4.1MB). Peak memory consumption was 44.8MB. Max. memory is 8.0GB. [2022-04-28 09:41:24,184 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory was 159.0MB in the beginning and 159.0MB in the end (delta: 74.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:41:24,185 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.86ms. Allocated memory is still 191.9MB. Free memory was 142.8MB in the beginning and 168.2MB in the end (delta: -25.4MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. [2022-04-28 09:41:24,185 INFO L158 Benchmark]: Boogie Preprocessor took 41.93ms. Allocated memory is still 191.9MB. Free memory was 168.2MB in the beginning and 166.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 09:41:24,185 INFO L158 Benchmark]: RCFGBuilder took 215.44ms. Allocated memory is still 191.9MB. Free memory was 166.7MB in the beginning and 155.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 09:41:24,186 INFO L158 Benchmark]: TraceAbstraction took 2931.39ms. Allocated memory was 191.9MB in the beginning and 240.1MB in the end (delta: 48.2MB). Free memory was 155.1MB in the beginning and 147.1MB in the end (delta: 8.0MB). Peak memory consumption was 56.8MB. Max. memory is 8.0GB. [2022-04-28 09:41:24,187 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory was 159.0MB in the beginning and 159.0MB in the end (delta: 74.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 206.86ms. Allocated memory is still 191.9MB. Free memory was 142.8MB in the beginning and 168.2MB in the end (delta: -25.4MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.93ms. Allocated memory is still 191.9MB. Free memory was 168.2MB in the beginning and 166.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 215.44ms. Allocated memory is still 191.9MB. Free memory was 166.7MB in the beginning and 155.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2931.39ms. Allocated memory was 191.9MB in the beginning and 240.1MB in the end (delta: 48.2MB). Free memory was 155.1MB in the beginning and 147.1MB in the end (delta: 8.0MB). Peak memory consumption was 56.8MB. 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]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 94 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 81 IncrementalHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 36 mSDtfsCounter, 81 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 32 PreInvPairs, 47 NumberOfFragments, 58 HoareAnnotationTreeSize, 32 FomulaSimplifications, 14 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 47 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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: 29]: Loop Invariant Derived loop invariant: x < 0 || 0 < y - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 09:41:24,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...