/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops/n.c40.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:56:32,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:56:32,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:56:32,192 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:56:32,192 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:56:32,193 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:56:32,194 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:56:32,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:56:32,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:56:32,212 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:56:32,213 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:56:32,214 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:56:32,214 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:56:32,215 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:56:32,216 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:56:32,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:56:32,217 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:56:32,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:56:32,219 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:56:32,220 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:56:32,221 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:56:32,228 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:56:32,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:56:32,233 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:56:32,236 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:56:32,243 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:56:32,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:56:32,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:56:32,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:56:32,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:56:32,245 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:56:32,245 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:56:32,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:56:32,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:56:32,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:56:32,247 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:56:32,248 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:56:32,248 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:56:32,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:56:32,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:56:32,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:56:32,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:56:32,253 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 15:56:32,264 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:56:32,265 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:56:32,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:56:32,266 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:56:32,266 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:56:32,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:56:32,266 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:56:32,267 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:56:32,267 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:56:32,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:56:32,268 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:56:32,268 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:56:32,268 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:56:32,268 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:56:32,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:56:32,268 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:56:32,269 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 15:56:32,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:56:32,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:56:32,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:56:32,269 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:56:32,271 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 15:56:32,271 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-27 15:56:32,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:56:32,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:56:32,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:56:32,533 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:56:32,534 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:56:32,535 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/n.c40.c [2022-04-27 15:56:32,603 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ff07e58e/c92a57ba2f214f85a2f7c119056ff9ed/FLAG36646186d [2022-04-27 15:56:32,978 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:56:32,978 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/n.c40.c [2022-04-27 15:56:32,984 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ff07e58e/c92a57ba2f214f85a2f7c119056ff9ed/FLAG36646186d [2022-04-27 15:56:33,001 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ff07e58e/c92a57ba2f214f85a2f7c119056ff9ed [2022-04-27 15:56:33,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:56:33,005 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 15:56:33,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:56:33,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:56:33,009 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:56:33,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:56:33" (1/1) ... [2022-04-27 15:56:33,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ace95a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:33, skipping insertion in model container [2022-04-27 15:56:33,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:56:33" (1/1) ... [2022-04-27 15:56:33,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:56:33,033 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:56:33,167 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/n.c40.c[498,511] [2022-04-27 15:56:33,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:56:33,177 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:56:33,191 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/n.c40.c[498,511] [2022-04-27 15:56:33,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:56:33,203 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:56:33,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:33 WrapperNode [2022-04-27 15:56:33,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:56:33,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:56:33,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:56:33,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:56:33,212 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:33" (1/1) ... [2022-04-27 15:56:33,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:33" (1/1) ... [2022-04-27 15:56:33,217 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:33" (1/1) ... [2022-04-27 15:56:33,217 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:33" (1/1) ... [2022-04-27 15:56:33,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:33" (1/1) ... [2022-04-27 15:56:33,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:33" (1/1) ... [2022-04-27 15:56:33,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:33" (1/1) ... [2022-04-27 15:56:33,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:56:33,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:56:33,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:56:33,229 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:56:33,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:33" (1/1) ... [2022-04-27 15:56:33,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:56:33,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:56:33,256 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-27 15:56:33,258 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-27 15:56:33,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:56:33,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:56:33,282 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:56:33,282 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:56:33,282 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:56:33,282 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:56:33,283 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:56:33,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:56:33,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:56:33,283 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:56:33,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:56:33,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:56:33,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:56:33,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:56:33,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:56:33,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:56:33,343 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:56:33,344 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:56:33,492 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:56:33,503 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:56:33,503 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:56:33,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:56:33 BoogieIcfgContainer [2022-04-27 15:56:33,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:56:33,505 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 15:56:33,506 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 15:56:33,510 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 15:56:33,512 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:56:33" (1/1) ... [2022-04-27 15:56:33,514 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 15:56:33,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 03:56:33 BasicIcfg [2022-04-27 15:56:33,536 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 15:56:33,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:56:33,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:56:33,540 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:56:33,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:56:33" (1/4) ... [2022-04-27 15:56:33,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64247fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:56:33, skipping insertion in model container [2022-04-27 15:56:33,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:33" (2/4) ... [2022-04-27 15:56:33,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64247fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:56:33, skipping insertion in model container [2022-04-27 15:56:33,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:56:33" (3/4) ... [2022-04-27 15:56:33,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64247fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:56:33, skipping insertion in model container [2022-04-27 15:56:33,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 03:56:33" (4/4) ... [2022-04-27 15:56:33,542 INFO L111 eAbstractionObserver]: Analyzing ICFG n.c40.cJordan [2022-04-27 15:56:33,553 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:56:33,554 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:56:33,585 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:56:33,590 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, 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@7549d9c6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1ce2695c [2022-04-27 15:56:33,590 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:56:33,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:56:33,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 15:56:33,609 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:33,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:33,610 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:33,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:33,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1525854499, now seen corresponding path program 1 times [2022-04-27 15:56:33,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:33,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998078386] [2022-04-27 15:56:33,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:33,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:33,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:33,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [45] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= (select |v_#valid_1| 5) 1) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#x~0.offset_1| 0) (= v_~j~0_1 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_~#y~0.offset_1| 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 5 |v_~#y~0.base_1|) (= 100 (select |v_#length_1| 4)) (= v_~i~0_1 0) (= v_~k~0_1 0) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_1| 5) 100) (= (let ((.cse1 ((as const (Array Int Int)) 0))) (store (store |v_#memory_int_3| |v_~#x~0.base_1| .cse1) |v_~#y~0.base_1| .cse1)) |v_#memory_int_1|) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_~#x~0.base_1| 4) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~k~0=v_~k~0_1, ~j~0=v_~j~0_1, ~#y~0.offset=|v_~#y~0.offset_1|, ~i~0=v_~i~0_1, ~#x~0.offset=|v_~#x~0.offset_1|, #NULL.offset=|v_#NULL.offset_1|, ~#y~0.base=|v_~#y~0.base_1|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, ~#x~0.base=|v_~#x~0.base_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~k~0, ~j~0, ~#y~0.offset, ~i~0, ~#x~0.offset, #memory_int, ~#x~0.base, #NULL.offset, ~#y~0.base, #NULL.base] {21#true} is VALID [2022-04-27 15:56:33,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} [48] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 15:56:33,866 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} [62] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 15:56:33,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} [43] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:56:33,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [45] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= (select |v_#valid_1| 5) 1) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#x~0.offset_1| 0) (= v_~j~0_1 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_~#y~0.offset_1| 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 5 |v_~#y~0.base_1|) (= 100 (select |v_#length_1| 4)) (= v_~i~0_1 0) (= v_~k~0_1 0) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_1| 5) 100) (= (let ((.cse1 ((as const (Array Int Int)) 0))) (store (store |v_#memory_int_3| |v_~#x~0.base_1| .cse1) |v_~#y~0.base_1| .cse1)) |v_#memory_int_1|) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_~#x~0.base_1| 4) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~k~0=v_~k~0_1, ~j~0=v_~j~0_1, ~#y~0.offset=|v_~#y~0.offset_1|, ~i~0=v_~i~0_1, ~#x~0.offset=|v_~#x~0.offset_1|, #NULL.offset=|v_#NULL.offset_1|, ~#y~0.base=|v_~#y~0.base_1|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, ~#x~0.base=|v_~#x~0.base_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~k~0, ~j~0, ~#y~0.offset, ~i~0, ~#x~0.offset, #memory_int, ~#x~0.base, #NULL.offset, ~#y~0.base, #NULL.base] {21#true} is VALID [2022-04-27 15:56:33,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} [48] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 15:56:33,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} [62] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 15:56:33,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} [44] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 15:56:33,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} [47] mainENTRY-->L14-3: Formula: (and (= |v_main_#t~nondet4_2| v_~k~0_7) (= v_~i~0_7 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{~k~0=v_~k~0_7, ~i~0=v_~i~0_7} AuxVars[] AssignedVars[~k~0, main_#t~nondet4, ~i~0] {21#true} is VALID [2022-04-27 15:56:33,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} [49] L14-3-->L14-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-27 15:56:33,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {22#false} [51] L14-4-->L20: Formula: (= (store |v_#memory_int_12| |v_~#y~0.base_5| (store (select |v_#memory_int_12| |v_~#y~0.base_5|) (+ v_~i~0_11 |v_~#y~0.offset_5|) 0)) |v_#memory_int_11|) InVars {#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_5|, ~#y~0.base=|v_~#y~0.base_5|, ~i~0=v_~i~0_11} OutVars{#memory_int=|v_#memory_int_11|, ~#y~0.offset=|v_~#y~0.offset_5|, ~#y~0.base=|v_~#y~0.base_5|, ~i~0=v_~i~0_11} AuxVars[] AssignedVars[#memory_int] {22#false} is VALID [2022-04-27 15:56:33,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} [54] L20-->L21: Formula: (and (< v_~k~0_8 v_~i~0_12) (= |v_main_#t~mem8_3| (select (select |v_#memory_int_13| |v_~#y~0.base_6|) (+ |v_~#y~0.offset_6| v_~k~0_8))) (<= 0 v_~k~0_8)) InVars {~k~0=v_~k~0_8, #memory_int=|v_#memory_int_13|, ~#y~0.offset=|v_~#y~0.offset_6|, ~#y~0.base=|v_~#y~0.base_6|, ~i~0=v_~i~0_12} OutVars{~k~0=v_~k~0_8, ~#y~0.offset=|v_~#y~0.offset_6|, ~i~0=v_~i~0_12, #memory_int=|v_#memory_int_13|, main_#t~mem8=|v_main_#t~mem8_3|, ~#y~0.base=|v_~#y~0.base_6|} AuxVars[] AssignedVars[main_#t~mem8] {22#false} is VALID [2022-04-27 15:56:33,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} [56] L21-->L22: Formula: (= |v_main_#t~mem8_5| 0) InVars {main_#t~mem8=|v_main_#t~mem8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem8] {22#false} is VALID [2022-04-27 15:56:33,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} [59] L22-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-27 15:56:33,876 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-27 15:56:33,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:33,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998078386] [2022-04-27 15:56:33,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998078386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:56:33,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:56:33,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 15:56:33,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495110922] [2022-04-27 15:56:33,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:56:33,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 15:56:33,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:33,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:33,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:33,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 15:56:33,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:33,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 15:56:33,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 15:56:33,931 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:34,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:34,022 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-27 15:56:34,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 15:56:34,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 15:56:34,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:34,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:34,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-04-27 15:56:34,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:34,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-04-27 15:56:34,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 21 transitions. [2022-04-27 15:56:34,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:34,075 INFO L225 Difference]: With dead ends: 18 [2022-04-27 15:56:34,076 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 15:56:34,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 15:56:34,084 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:34,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:56:34,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 15:56:34,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 15:56:34,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:34,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:34,108 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:34,108 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:34,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:34,110 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 15:56:34,110 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 15:56:34,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:34,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:34,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 15:56:34,112 INFO L87 Difference]: Start difference. First operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 15:56:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:34,119 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 15:56:34,120 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 15:56:34,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:34,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:34,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:34,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:34,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:34,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-27 15:56:34,125 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-27 15:56:34,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:34,126 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-27 15:56:34,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:34,126 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 15:56:34,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 15:56:34,127 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:34,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:34,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:56:34,128 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:34,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:34,131 INFO L85 PathProgramCache]: Analyzing trace with hash 86310556, now seen corresponding path program 1 times [2022-04-27 15:56:34,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:34,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676786726] [2022-04-27 15:56:34,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:34,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:34,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:34,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {92#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [45] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= (select |v_#valid_1| 5) 1) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#x~0.offset_1| 0) (= v_~j~0_1 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_~#y~0.offset_1| 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 5 |v_~#y~0.base_1|) (= 100 (select |v_#length_1| 4)) (= v_~i~0_1 0) (= v_~k~0_1 0) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_1| 5) 100) (= (let ((.cse1 ((as const (Array Int Int)) 0))) (store (store |v_#memory_int_3| |v_~#x~0.base_1| .cse1) |v_~#y~0.base_1| .cse1)) |v_#memory_int_1|) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_~#x~0.base_1| 4) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~k~0=v_~k~0_1, ~j~0=v_~j~0_1, ~#y~0.offset=|v_~#y~0.offset_1|, ~i~0=v_~i~0_1, ~#x~0.offset=|v_~#x~0.offset_1|, #NULL.offset=|v_#NULL.offset_1|, ~#y~0.base=|v_~#y~0.base_1|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, ~#x~0.base=|v_~#x~0.base_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~k~0, ~j~0, ~#y~0.offset, ~i~0, ~#x~0.offset, #memory_int, ~#x~0.base, #NULL.offset, ~#y~0.base, #NULL.base] {86#true} is VALID [2022-04-27 15:56:34,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {86#true} [48] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86#true} is VALID [2022-04-27 15:56:34,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86#true} {86#true} [62] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86#true} is VALID [2022-04-27 15:56:34,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {86#true} [43] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {92#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:56:34,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {92#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [45] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= (select |v_#valid_1| 5) 1) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#x~0.offset_1| 0) (= v_~j~0_1 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_~#y~0.offset_1| 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 5 |v_~#y~0.base_1|) (= 100 (select |v_#length_1| 4)) (= v_~i~0_1 0) (= v_~k~0_1 0) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_1| 5) 100) (= (let ((.cse1 ((as const (Array Int Int)) 0))) (store (store |v_#memory_int_3| |v_~#x~0.base_1| .cse1) |v_~#y~0.base_1| .cse1)) |v_#memory_int_1|) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_~#x~0.base_1| 4) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~k~0=v_~k~0_1, ~j~0=v_~j~0_1, ~#y~0.offset=|v_~#y~0.offset_1|, ~i~0=v_~i~0_1, ~#x~0.offset=|v_~#x~0.offset_1|, #NULL.offset=|v_#NULL.offset_1|, ~#y~0.base=|v_~#y~0.base_1|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, ~#x~0.base=|v_~#x~0.base_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~k~0, ~j~0, ~#y~0.offset, ~i~0, ~#x~0.offset, #memory_int, ~#x~0.base, #NULL.offset, ~#y~0.base, #NULL.base] {86#true} is VALID [2022-04-27 15:56:34,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {86#true} [48] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86#true} is VALID [2022-04-27 15:56:34,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86#true} {86#true} [62] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86#true} is VALID [2022-04-27 15:56:34,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {86#true} [44] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86#true} is VALID [2022-04-27 15:56:34,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {86#true} [47] mainENTRY-->L14-3: Formula: (and (= |v_main_#t~nondet4_2| v_~k~0_7) (= v_~i~0_7 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{~k~0=v_~k~0_7, ~i~0=v_~i~0_7} AuxVars[] AssignedVars[~k~0, main_#t~nondet4, ~i~0] {91#(= ~i~0 0)} is VALID [2022-04-27 15:56:34,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {91#(= ~i~0 0)} [50] L14-3-->L14-1: Formula: (= |v_main_#t~mem5_1| (select (select |v_#memory_int_8| |v_~#x~0.base_4|) (+ |v_~#x~0.offset_4| v_~i~0_8))) InVars {~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_8|, ~#x~0.offset=|v_~#x~0.offset_4|, ~i~0=v_~i~0_8} OutVars{~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_8|, main_#t~mem5=|v_main_#t~mem5_1|, ~#x~0.offset=|v_~#x~0.offset_4|, ~i~0=v_~i~0_8} AuxVars[] AssignedVars[main_#t~mem5] {91#(= ~i~0 0)} is VALID [2022-04-27 15:56:34,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {91#(= ~i~0 0)} [52] L14-1-->L14-4: Formula: (= |v_main_#t~mem5_3| 0) InVars {main_#t~mem5=|v_main_#t~mem5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem5] {91#(= ~i~0 0)} is VALID [2022-04-27 15:56:34,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {91#(= ~i~0 0)} [51] L14-4-->L20: Formula: (= (store |v_#memory_int_12| |v_~#y~0.base_5| (store (select |v_#memory_int_12| |v_~#y~0.base_5|) (+ v_~i~0_11 |v_~#y~0.offset_5|) 0)) |v_#memory_int_11|) InVars {#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_5|, ~#y~0.base=|v_~#y~0.base_5|, ~i~0=v_~i~0_11} OutVars{#memory_int=|v_#memory_int_11|, ~#y~0.offset=|v_~#y~0.offset_5|, ~#y~0.base=|v_~#y~0.base_5|, ~i~0=v_~i~0_11} AuxVars[] AssignedVars[#memory_int] {91#(= ~i~0 0)} is VALID [2022-04-27 15:56:34,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {91#(= ~i~0 0)} [54] L20-->L21: Formula: (and (< v_~k~0_8 v_~i~0_12) (= |v_main_#t~mem8_3| (select (select |v_#memory_int_13| |v_~#y~0.base_6|) (+ |v_~#y~0.offset_6| v_~k~0_8))) (<= 0 v_~k~0_8)) InVars {~k~0=v_~k~0_8, #memory_int=|v_#memory_int_13|, ~#y~0.offset=|v_~#y~0.offset_6|, ~#y~0.base=|v_~#y~0.base_6|, ~i~0=v_~i~0_12} OutVars{~k~0=v_~k~0_8, ~#y~0.offset=|v_~#y~0.offset_6|, ~i~0=v_~i~0_12, #memory_int=|v_#memory_int_13|, main_#t~mem8=|v_main_#t~mem8_3|, ~#y~0.base=|v_~#y~0.base_6|} AuxVars[] AssignedVars[main_#t~mem8] {87#false} is VALID [2022-04-27 15:56:34,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {87#false} [56] L21-->L22: Formula: (= |v_main_#t~mem8_5| 0) InVars {main_#t~mem8=|v_main_#t~mem8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem8] {87#false} is VALID [2022-04-27 15:56:34,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {87#false} [59] L22-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87#false} is VALID [2022-04-27 15:56:34,317 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-27 15:56:34,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:34,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676786726] [2022-04-27 15:56:34,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676786726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:56:34,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:56:34,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:56:34,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658298359] [2022-04-27 15:56:34,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:56:34,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 15:56:34,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:34,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:34,336 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-27 15:56:34,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:56:34,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:34,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:56:34,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:56:34,338 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:34,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:34,428 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-27 15:56:34,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:56:34,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 15:56:34,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:34,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:34,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-04-27 15:56:34,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:34,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-04-27 15:56:34,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 18 transitions. [2022-04-27 15:56:34,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:34,457 INFO L225 Difference]: With dead ends: 17 [2022-04-27 15:56:34,457 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 15:56:34,457 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-27 15:56:34,459 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:34,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 14 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:56:34,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 15:56:34,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 15:56:34,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:34,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:34,466 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:34,466 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:34,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:34,474 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 15:56:34,474 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 15:56:34,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:34,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:34,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 15:56:34,479 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 15:56:34,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:34,481 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 15:56:34,481 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 15:56:34,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:34,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:34,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:34,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:34,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:34,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-27 15:56:34,485 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-27 15:56:34,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:34,485 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-27 15:56:34,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:34,486 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 15:56:34,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 15:56:34,486 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:34,486 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:34,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:56:34,488 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:34,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:34,489 INFO L85 PathProgramCache]: Analyzing trace with hash -2098026081, now seen corresponding path program 1 times [2022-04-27 15:56:34,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:34,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322042572] [2022-04-27 15:56:34,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:34,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:34,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:34,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {167#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [45] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= (select |v_#valid_1| 5) 1) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#x~0.offset_1| 0) (= v_~j~0_1 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_~#y~0.offset_1| 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 5 |v_~#y~0.base_1|) (= 100 (select |v_#length_1| 4)) (= v_~i~0_1 0) (= v_~k~0_1 0) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_1| 5) 100) (= (let ((.cse1 ((as const (Array Int Int)) 0))) (store (store |v_#memory_int_3| |v_~#x~0.base_1| .cse1) |v_~#y~0.base_1| .cse1)) |v_#memory_int_1|) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_~#x~0.base_1| 4) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~k~0=v_~k~0_1, ~j~0=v_~j~0_1, ~#y~0.offset=|v_~#y~0.offset_1|, ~i~0=v_~i~0_1, ~#x~0.offset=|v_~#x~0.offset_1|, #NULL.offset=|v_#NULL.offset_1|, ~#y~0.base=|v_~#y~0.base_1|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, ~#x~0.base=|v_~#x~0.base_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~k~0, ~j~0, ~#y~0.offset, ~i~0, ~#x~0.offset, #memory_int, ~#x~0.base, #NULL.offset, ~#y~0.base, #NULL.base] {168#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (= 5 |~#y~0.base|) (= |~#x~0.base| 4))} is VALID [2022-04-27 15:56:34,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (= 5 |~#y~0.base|) (= |~#x~0.base| 4))} [48] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {168#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (= 5 |~#y~0.base|) (= |~#x~0.base| 4))} is VALID [2022-04-27 15:56:34,754 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {168#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (= 5 |~#y~0.base|) (= |~#x~0.base| 4))} {159#true} [62] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {164#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)) (not (= |~#x~0.base| 5)))} is VALID [2022-04-27 15:56:34,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {159#true} [43] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {167#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:56:34,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {167#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [45] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= (select |v_#valid_1| 5) 1) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#x~0.offset_1| 0) (= v_~j~0_1 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_~#y~0.offset_1| 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 5 |v_~#y~0.base_1|) (= 100 (select |v_#length_1| 4)) (= v_~i~0_1 0) (= v_~k~0_1 0) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_1| 5) 100) (= (let ((.cse1 ((as const (Array Int Int)) 0))) (store (store |v_#memory_int_3| |v_~#x~0.base_1| .cse1) |v_~#y~0.base_1| .cse1)) |v_#memory_int_1|) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_~#x~0.base_1| 4) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~k~0=v_~k~0_1, ~j~0=v_~j~0_1, ~#y~0.offset=|v_~#y~0.offset_1|, ~i~0=v_~i~0_1, ~#x~0.offset=|v_~#x~0.offset_1|, #NULL.offset=|v_#NULL.offset_1|, ~#y~0.base=|v_~#y~0.base_1|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, ~#x~0.base=|v_~#x~0.base_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~k~0, ~j~0, ~#y~0.offset, ~i~0, ~#x~0.offset, #memory_int, ~#x~0.base, #NULL.offset, ~#y~0.base, #NULL.base] {168#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (= 5 |~#y~0.base|) (= |~#x~0.base| 4))} is VALID [2022-04-27 15:56:34,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {168#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (= 5 |~#y~0.base|) (= |~#x~0.base| 4))} [48] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {168#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (= 5 |~#y~0.base|) (= |~#x~0.base| 4))} is VALID [2022-04-27 15:56:34,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {168#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (= 5 |~#y~0.base|) (= |~#x~0.base| 4))} {159#true} [62] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {164#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)) (not (= |~#x~0.base| 5)))} is VALID [2022-04-27 15:56:34,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {164#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)) (not (= |~#x~0.base| 5)))} [44] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {164#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)) (not (= |~#x~0.base| 5)))} is VALID [2022-04-27 15:56:34,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {164#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)) (not (= |~#x~0.base| 5)))} [47] mainENTRY-->L14-3: Formula: (and (= |v_main_#t~nondet4_2| v_~k~0_7) (= v_~i~0_7 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{~k~0=v_~k~0_7, ~i~0=v_~i~0_7} AuxVars[] AssignedVars[~k~0, main_#t~nondet4, ~i~0] {165#(and (= (select (select |#memory_int| |~#x~0.base|) (+ ~i~0 |~#x~0.offset|)) 0) (not (= |~#x~0.base| |~#y~0.base|)) (not (= |~#x~0.base| 5)))} is VALID [2022-04-27 15:56:34,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {165#(and (= (select (select |#memory_int| |~#x~0.base|) (+ ~i~0 |~#x~0.offset|)) 0) (not (= |~#x~0.base| |~#y~0.base|)) (not (= |~#x~0.base| 5)))} [50] L14-3-->L14-1: Formula: (= |v_main_#t~mem5_1| (select (select |v_#memory_int_8| |v_~#x~0.base_4|) (+ |v_~#x~0.offset_4| v_~i~0_8))) InVars {~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_8|, ~#x~0.offset=|v_~#x~0.offset_4|, ~i~0=v_~i~0_8} OutVars{~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_8|, main_#t~mem5=|v_main_#t~mem5_1|, ~#x~0.offset=|v_~#x~0.offset_4|, ~i~0=v_~i~0_8} AuxVars[] AssignedVars[main_#t~mem5] {166#(and (= (select (select |#memory_int| |~#x~0.base|) (+ ~i~0 |~#x~0.offset|)) 0) (not (= |~#x~0.base| |~#y~0.base|)) (= |main_#t~mem5| 0) (not (= |~#x~0.base| 5)))} is VALID [2022-04-27 15:56:34,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {166#(and (= (select (select |#memory_int| |~#x~0.base|) (+ ~i~0 |~#x~0.offset|)) 0) (not (= |~#x~0.base| |~#y~0.base|)) (= |main_#t~mem5| 0) (not (= |~#x~0.base| 5)))} [53] L14-1-->L14-3: Formula: (and (= (store |v_#memory_int_10| |v_~#y~0.base_4| (store (select |v_#memory_int_10| |v_~#y~0.base_4|) (+ v_~i~0_10 |v_~#y~0.offset_4|) (select (select |v_#memory_int_10| |v_~#x~0.base_5|) (+ v_~i~0_10 |v_~#x~0.offset_5|)))) |v_#memory_int_9|) (not (= |v_main_#t~mem5_5| 0)) (= (+ v_~i~0_10 1) v_~i~0_9)) InVars {~#y~0.offset=|v_~#y~0.offset_4|, ~i~0=v_~i~0_10, ~#x~0.offset=|v_~#x~0.offset_5|, #memory_int=|v_#memory_int_10|, ~#x~0.base=|v_~#x~0.base_5|, main_#t~mem5=|v_main_#t~mem5_5|, ~#y~0.base=|v_~#y~0.base_4|} OutVars{~#y~0.offset=|v_~#y~0.offset_4|, ~i~0=v_~i~0_9, ~#x~0.offset=|v_~#x~0.offset_5|, #memory_int=|v_#memory_int_9|, ~#x~0.base=|v_~#x~0.base_5|, main_#t~mem6=|v_main_#t~mem6_1|, ~#y~0.base=|v_~#y~0.base_4|, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~i~0, #memory_int, main_#t~mem5, main_#t~mem6, main_#t~post7] {160#false} is VALID [2022-04-27 15:56:34,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {160#false} [50] L14-3-->L14-1: Formula: (= |v_main_#t~mem5_1| (select (select |v_#memory_int_8| |v_~#x~0.base_4|) (+ |v_~#x~0.offset_4| v_~i~0_8))) InVars {~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_8|, ~#x~0.offset=|v_~#x~0.offset_4|, ~i~0=v_~i~0_8} OutVars{~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_8|, main_#t~mem5=|v_main_#t~mem5_1|, ~#x~0.offset=|v_~#x~0.offset_4|, ~i~0=v_~i~0_8} AuxVars[] AssignedVars[main_#t~mem5] {160#false} is VALID [2022-04-27 15:56:34,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {160#false} [52] L14-1-->L14-4: Formula: (= |v_main_#t~mem5_3| 0) InVars {main_#t~mem5=|v_main_#t~mem5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem5] {160#false} is VALID [2022-04-27 15:56:34,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {160#false} [51] L14-4-->L20: Formula: (= (store |v_#memory_int_12| |v_~#y~0.base_5| (store (select |v_#memory_int_12| |v_~#y~0.base_5|) (+ v_~i~0_11 |v_~#y~0.offset_5|) 0)) |v_#memory_int_11|) InVars {#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_5|, ~#y~0.base=|v_~#y~0.base_5|, ~i~0=v_~i~0_11} OutVars{#memory_int=|v_#memory_int_11|, ~#y~0.offset=|v_~#y~0.offset_5|, ~#y~0.base=|v_~#y~0.base_5|, ~i~0=v_~i~0_11} AuxVars[] AssignedVars[#memory_int] {160#false} is VALID [2022-04-27 15:56:34,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {160#false} [54] L20-->L21: Formula: (and (< v_~k~0_8 v_~i~0_12) (= |v_main_#t~mem8_3| (select (select |v_#memory_int_13| |v_~#y~0.base_6|) (+ |v_~#y~0.offset_6| v_~k~0_8))) (<= 0 v_~k~0_8)) InVars {~k~0=v_~k~0_8, #memory_int=|v_#memory_int_13|, ~#y~0.offset=|v_~#y~0.offset_6|, ~#y~0.base=|v_~#y~0.base_6|, ~i~0=v_~i~0_12} OutVars{~k~0=v_~k~0_8, ~#y~0.offset=|v_~#y~0.offset_6|, ~i~0=v_~i~0_12, #memory_int=|v_#memory_int_13|, main_#t~mem8=|v_main_#t~mem8_3|, ~#y~0.base=|v_~#y~0.base_6|} AuxVars[] AssignedVars[main_#t~mem8] {160#false} is VALID [2022-04-27 15:56:34,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {160#false} [56] L21-->L22: Formula: (= |v_main_#t~mem8_5| 0) InVars {main_#t~mem8=|v_main_#t~mem8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem8] {160#false} is VALID [2022-04-27 15:56:34,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {160#false} [59] L22-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {160#false} is VALID [2022-04-27 15:56:34,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:56:34,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:34,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322042572] [2022-04-27 15:56:34,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322042572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:56:34,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:56:34,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 15:56:34,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089048827] [2022-04-27 15:56:34,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:56:34,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 15:56:34,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:34,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:34,782 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-27 15:56:34,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 15:56:34,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:34,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 15:56:34,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-27 15:56:34,784 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:34,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:34,877 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2022-04-27 15:56:34,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 15:56:34,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 15:56:34,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:34,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:34,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2022-04-27 15:56:34,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:34,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2022-04-27 15:56:34,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 8 transitions. [2022-04-27 15:56:34,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:34,892 INFO L225 Difference]: With dead ends: 8 [2022-04-27 15:56:34,892 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 15:56:34,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-27 15:56:34,896 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:34,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 9 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:56:34,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 15:56:34,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 15:56:34,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:34,899 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-27 15:56:34,899 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-27 15:56:34,899 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-27 15:56:34,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:34,899 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 15:56:34,899 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:56:34,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:34,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:34,899 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-27 15:56:34,900 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-27 15:56:34,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:34,900 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 15:56:34,900 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:56:34,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:34,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:34,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:34,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:34,900 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-27 15:56:34,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 15:56:34,901 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-27 15:56:34,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:34,901 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 15:56:34,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:34,901 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:56:34,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:34,904 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 15:56:34,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:56:34,907 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 15:56:34,909 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 15:56:34,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:56:34 BasicIcfg [2022-04-27 15:56:34,917 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 15:56:34,918 INFO L158 Benchmark]: Toolchain (without parser) took 1913.51ms. Allocated memory is still 190.8MB. Free memory was 139.2MB in the beginning and 121.0MB in the end (delta: 18.1MB). Peak memory consumption was 18.0MB. Max. memory is 8.0GB. [2022-04-27 15:56:34,919 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 190.8MB. Free memory is still 155.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:56:34,919 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.44ms. Allocated memory is still 190.8MB. Free memory was 139.1MB in the beginning and 166.6MB in the end (delta: -27.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 15:56:34,919 INFO L158 Benchmark]: Boogie Preprocessor took 23.51ms. Allocated memory is still 190.8MB. Free memory was 166.5MB in the beginning and 164.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 15:56:34,919 INFO L158 Benchmark]: RCFGBuilder took 275.99ms. Allocated memory is still 190.8MB. Free memory was 164.9MB in the beginning and 154.1MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 15:56:34,919 INFO L158 Benchmark]: IcfgTransformer took 30.36ms. Allocated memory is still 190.8MB. Free memory was 154.0MB in the beginning and 152.7MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 15:56:34,920 INFO L158 Benchmark]: TraceAbstraction took 1380.01ms. Allocated memory is still 190.8MB. Free memory was 152.2MB in the beginning and 121.0MB in the end (delta: 31.1MB). Peak memory consumption was 30.6MB. Max. memory is 8.0GB. [2022-04-27 15:56:34,921 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.12ms. Allocated memory is still 190.8MB. Free memory is still 155.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 198.44ms. Allocated memory is still 190.8MB. Free memory was 139.1MB in the beginning and 166.6MB in the end (delta: -27.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.51ms. Allocated memory is still 190.8MB. Free memory was 166.5MB in the beginning and 164.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 275.99ms. Allocated memory is still 190.8MB. Free memory was 164.9MB in the beginning and 154.1MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 30.36ms. Allocated memory is still 190.8MB. Free memory was 154.0MB in the beginning and 152.7MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1380.01ms. Allocated memory is still 190.8MB. Free memory was 152.2MB in the beginning and 121.0MB in the end (delta: 31.1MB). Peak memory consumption was 30.6MB. 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: 22]: 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 3 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 32 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 221 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 15:56:34,957 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...