/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-zilu/benchmark05_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:08:53,475 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:08:53,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:08:53,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:08:53,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:08:53,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:08:53,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:08:53,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:08:53,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:08:53,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:08:53,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:08:53,536 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:08:53,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:08:53,537 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:08:53,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:08:53,538 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:08:53,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:08:53,539 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:08:53,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:08:53,541 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:08:53,542 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:08:53,543 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:08:53,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:08:53,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:08:53,544 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:08:53,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:08:53,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:08:53,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:08:53,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:08:53,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:08:53,548 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:08:53,548 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:08:53,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:08:53,549 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:08:53,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:08:53,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:08:53,550 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:08:53,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:08:53,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:08:53,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:08:53,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:08:53,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:08:53,552 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:08:53,557 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:08:53,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:08:53,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:08:53,558 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:08:53,558 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:08:53,558 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:08:53,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:08:53,559 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:08:53,559 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:08:53,559 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:08:53,559 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:08:53,559 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:08:53,559 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:08:53,559 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:08:53,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:08:53,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:08:53,560 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:08:53,560 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:08:53,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:08:53,560 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:08:53,560 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:08:53,560 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:08:53,560 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:08:53,560 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:08:53,560 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:08:53,560 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 04:08:53,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:08:53,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:08:53,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:08:53,730 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:08:53,731 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:08:53,731 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark05_conjunctive.i [2022-04-28 04:08:53,774 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4a243e4d/5bdabf3ad590480fa0593efa817e9d21/FLAG55a5e1ba0 [2022-04-28 04:08:54,091 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:08:54,091 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark05_conjunctive.i [2022-04-28 04:08:54,096 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4a243e4d/5bdabf3ad590480fa0593efa817e9d21/FLAG55a5e1ba0 [2022-04-28 04:08:54,106 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4a243e4d/5bdabf3ad590480fa0593efa817e9d21 [2022-04-28 04:08:54,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:08:54,109 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:08:54,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:08:54,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:08:54,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:08:54,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:08:54" (1/1) ... [2022-04-28 04:08:54,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aad96cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:54, skipping insertion in model container [2022-04-28 04:08:54,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:08:54" (1/1) ... [2022-04-28 04:08:54,121 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:08:54,130 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:08:54,241 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark05_conjunctive.i[873,886] [2022-04-28 04:08:54,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:08:54,262 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:08:54,269 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark05_conjunctive.i[873,886] [2022-04-28 04:08:54,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:08:54,279 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:08:54,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:54 WrapperNode [2022-04-28 04:08:54,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:08:54,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:08:54,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:08:54,280 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:08:54,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:54" (1/1) ... [2022-04-28 04:08:54,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:54" (1/1) ... [2022-04-28 04:08:54,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:54" (1/1) ... [2022-04-28 04:08:54,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:54" (1/1) ... [2022-04-28 04:08:54,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:54" (1/1) ... [2022-04-28 04:08:54,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:54" (1/1) ... [2022-04-28 04:08:54,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:54" (1/1) ... [2022-04-28 04:08:54,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:08:54,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:08:54,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:08:54,303 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:08:54,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:54" (1/1) ... [2022-04-28 04:08:54,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:08:54,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:08:54,333 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 04:08:54,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 04:08:54,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:08:54,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:08:54,355 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:08:54,355 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:08:54,355 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:08:54,355 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:08:54,355 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 04:08:54,355 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 04:08:54,355 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:08:54,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:08:54,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 04:08:54,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-28 04:08:54,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:08:54,356 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:08:54,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:08:54,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:08:54,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:08:54,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:08:54,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:08:54,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:08:54,396 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:08:54,397 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:08:54,534 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:08:54,538 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:08:54,538 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 04:08:54,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:08:54 BoogieIcfgContainer [2022-04-28 04:08:54,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:08:54,540 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:08:54,540 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:08:54,554 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:08:54,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:08:54" (1/3) ... [2022-04-28 04:08:54,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@197b4991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:08:54, skipping insertion in model container [2022-04-28 04:08:54,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:54" (2/3) ... [2022-04-28 04:08:54,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@197b4991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:08:54, skipping insertion in model container [2022-04-28 04:08:54,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:08:54" (3/3) ... [2022-04-28 04:08:54,556 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark05_conjunctive.i [2022-04-28 04:08:54,564 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:08:54,564 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:08:54,627 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:08:54,631 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@755fe465, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@65de8bb3 [2022-04-28 04:08:54,632 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:08:54,636 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:08:54,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 04:08:54,645 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:54,645 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:54,645 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:54,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:54,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1005951186, now seen corresponding path program 1 times [2022-04-28 04:08:54,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:54,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1843582078] [2022-04-28 04:08:54,672 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:08:54,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1005951186, now seen corresponding path program 2 times [2022-04-28 04:08:54,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:54,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763321504] [2022-04-28 04:08:54,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:54,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:54,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:54,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {24#true} is VALID [2022-04-28 04:08:54,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 04:08:54,882 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #51#return; {24#true} is VALID [2022-04-28 04:08:54,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:54,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {24#true} is VALID [2022-04-28 04:08:54,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 04:08:54,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #51#return; {24#true} is VALID [2022-04-28 04:08:54,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret6 := main(); {24#true} is VALID [2022-04-28 04:08:54,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {24#true} is VALID [2022-04-28 04:08:54,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!((~x~0 >= 0 && ~x~0 <= ~y~0) && ~y~0 < ~n~0); {29#(<= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-28 04:08:54,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(<= (+ main_~x~0 1) main_~n~0)} assume !(~x~0 < ~n~0); {25#false} is VALID [2022-04-28 04:08:54,885 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1 else 0)); {25#false} is VALID [2022-04-28 04:08:54,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-28 04:08:54,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-28 04:08:54,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-28 04:08:54,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:08:54,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:54,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763321504] [2022-04-28 04:08:54,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763321504] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:54,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:54,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:54,889 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:54,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1843582078] [2022-04-28 04:08:54,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1843582078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:54,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:54,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:54,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256489053] [2022-04-28 04:08:54,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:54,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 04:08:54,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:54,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:54,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:54,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 04:08:54,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:54,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 04:08:54,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 04:08:54,933 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:55,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:55,064 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-28 04:08:55,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 04:08:55,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 04:08:55,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:55,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:55,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-28 04:08:55,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:55,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-28 04:08:55,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2022-04-28 04:08:55,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:55,137 INFO L225 Difference]: With dead ends: 34 [2022-04-28 04:08:55,137 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 04:08:55,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:08:55,144 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 14 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:55,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 30 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:08:55,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 04:08:55,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 04:08:55,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:55,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:55,171 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:55,171 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:55,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:55,174 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 04:08:55,175 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 04:08:55,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:55,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:55,176 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 04:08:55,176 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 04:08:55,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:55,178 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 04:08:55,178 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 04:08:55,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:55,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:55,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:55,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:55,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:55,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-28 04:08:55,186 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-28 04:08:55,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:55,187 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-28 04:08:55,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:55,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-28 04:08:55,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:55,211 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 04:08:55,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 04:08:55,211 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:55,212 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:55,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:08:55,212 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:55,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:55,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1392462319, now seen corresponding path program 1 times [2022-04-28 04:08:55,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:55,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1935362947] [2022-04-28 04:08:59,447 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:08:59,595 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:59,598 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:59,601 INFO L85 PathProgramCache]: Analyzing trace with hash -2110136851, now seen corresponding path program 1 times [2022-04-28 04:08:59,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:59,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835230055] [2022-04-28 04:08:59,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:59,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:59,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:59,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {173#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {163#true} is VALID [2022-04-28 04:08:59,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#true} assume true; {163#true} is VALID [2022-04-28 04:08:59,740 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {163#true} {163#true} #51#return; {163#true} is VALID [2022-04-28 04:08:59,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {163#true} call ULTIMATE.init(); {173#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:59,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {163#true} is VALID [2022-04-28 04:08:59,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#true} assume true; {163#true} is VALID [2022-04-28 04:08:59,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163#true} {163#true} #51#return; {163#true} is VALID [2022-04-28 04:08:59,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {163#true} call #t~ret6 := main(); {163#true} is VALID [2022-04-28 04:08:59,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {163#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {163#true} is VALID [2022-04-28 04:08:59,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {163#true} assume !!((~x~0 >= 0 && ~x~0 <= ~y~0) && ~y~0 < ~n~0); {168#(and (<= main_~x~0 main_~y~0) (<= (+ main_~x~0 1) main_~n~0))} is VALID [2022-04-28 04:08:59,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {168#(and (<= main_~x~0 main_~y~0) (<= (+ main_~x~0 1) main_~n~0))} [55] L26-2-->L24-2_primed: Formula: (let ((.cse0 (< v_main_~y~0_10 (+ v_main_~x~0_10 1))) (.cse1 (= v_main_~y~0_10 v_main_~y~0_9)) (.cse2 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse3 (= |v_main_#t~post4_4| |v_main_#t~post4_3|)) (.cse4 (= v_main_~x~0_10 v_main_~x~0_9))) (or (and .cse0 (= (+ v_main_~y~0_10 v_main_~x~0_9) (+ v_main_~x~0_10 v_main_~y~0_9)) (< v_main_~x~0_9 (+ v_main_~n~0_8 1)) (< v_main_~x~0_10 v_main_~x~0_9)) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_10 v_main_~n~0_8))) .cse2 .cse3 .cse4) (and .cse1 .cse2 (= v_main_~n~0_8 v_main_~n~0_8) .cse3 .cse4))) InVars {main_#t~post4=|v_main_#t~post4_4|, main_~y~0=v_main_~y~0_10, main_#t~post5=|v_main_#t~post5_4|, main_~n~0=v_main_~n~0_8, main_~x~0=v_main_~x~0_10} OutVars{main_#t~post4=|v_main_#t~post4_3|, main_#t~post5=|v_main_#t~post5_3|, main_~y~0=v_main_~y~0_9, main_~n~0=v_main_~n~0_8, main_~x~0=v_main_~x~0_9} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_#t~post5, main_~y~0] {169#(or (and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0)) (<= (+ main_~x~0 1) main_~n~0))} is VALID [2022-04-28 04:08:59,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {169#(or (and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0)) (<= (+ main_~x~0 1) main_~n~0))} [54] L24-2_primed-->L24-2: Formula: (not (< v_main_~x~0_1 v_main_~n~0_1)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {170#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} is VALID [2022-04-28 04:08:59,745 INFO L272 TraceCheckUtils]: 9: Hoare triple {170#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1 else 0)); {171#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:08:59,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {171#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {172#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:08:59,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {172#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {164#false} is VALID [2022-04-28 04:08:59,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {164#false} assume !false; {164#false} is VALID [2022-04-28 04:08:59,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:08:59,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:59,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835230055] [2022-04-28 04:08:59,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835230055] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:59,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:59,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:09:00,057 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:00,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1935362947] [2022-04-28 04:09:00,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1935362947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:00,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:00,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 04:09:00,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671916069] [2022-04-28 04:09:00,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:00,059 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 04:09:00,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:00,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:00,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:00,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 04:09:00,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:00,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 04:09:00,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-28 04:09:00,079 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:00,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:00,187 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-28 04:09:00,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 04:09:00,187 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 04:09:00,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:00,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:00,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2022-04-28 04:09:00,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:00,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2022-04-28 04:09:00,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 24 transitions. [2022-04-28 04:09:00,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:00,222 INFO L225 Difference]: With dead ends: 22 [2022-04-28 04:09:00,222 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 04:09:00,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-04-28 04:09:00,224 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:00,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 32 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 13 Unchecked, 0.0s Time] [2022-04-28 04:09:00,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 04:09:00,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-28 04:09:00,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:00,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:00,235 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:00,235 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:00,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:00,236 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 04:09:00,236 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 04:09:00,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:00,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:00,236 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 04:09:00,236 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 04:09:00,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:00,237 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 04:09:00,237 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 04:09:00,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:00,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:00,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:00,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:00,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:00,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-28 04:09:00,239 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 14 [2022-04-28 04:09:00,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:00,239 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-28 04:09:00,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:00,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-28 04:09:00,261 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-28 04:09:00,262 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 04:09:00,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 04:09:00,262 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:00,262 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:00,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 04:09:00,262 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:00,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:00,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1449720621, now seen corresponding path program 1 times [2022-04-28 04:09:00,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:00,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [804212911] [2022-04-28 04:09:00,498 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:00,499 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:09:00,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2051031507, now seen corresponding path program 1 times [2022-04-28 04:09:00,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:00,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804858015] [2022-04-28 04:09:00,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:00,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:00,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:00,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {302#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {295#true} is VALID [2022-04-28 04:09:00,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-28 04:09:00,569 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {295#true} {295#true} #51#return; {295#true} is VALID [2022-04-28 04:09:00,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {295#true} call ULTIMATE.init(); {302#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:09:00,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {302#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {295#true} is VALID [2022-04-28 04:09:00,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-28 04:09:00,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {295#true} {295#true} #51#return; {295#true} is VALID [2022-04-28 04:09:00,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {295#true} call #t~ret6 := main(); {295#true} is VALID [2022-04-28 04:09:00,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {295#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {295#true} is VALID [2022-04-28 04:09:00,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {295#true} assume !!((~x~0 >= 0 && ~x~0 <= ~y~0) && ~y~0 < ~n~0); {300#(and (<= (+ main_~y~0 1) main_~n~0) (<= (+ main_~x~0 1) main_~n~0))} is VALID [2022-04-28 04:09:00,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {300#(and (<= (+ main_~y~0 1) main_~n~0) (<= (+ main_~x~0 1) main_~n~0))} [57] L26-2-->L24-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_17 v_main_~x~0_16))) (or (and (< v_main_~x~0_17 v_main_~x~0_16) (<= v_main_~x~0_16 v_main_~y~0_16) (< v_main_~x~0_16 (+ v_main_~n~0_10 1))) (and (= |v_main_#t~post4_9| |v_main_#t~post4_10|) (or (< v_main_~y~0_16 (+ v_main_~x~0_17 1)) (not (< v_main_~x~0_17 v_main_~n~0_10))) .cse0) (and (= v_main_~y~0_16 v_main_~y~0_16) (= |v_main_#t~post4_10| |v_main_#t~post4_9|) (= v_main_~n~0_10 v_main_~n~0_10) .cse0))) InVars {main_#t~post4=|v_main_#t~post4_10|, main_~y~0=v_main_~y~0_16, main_~n~0=v_main_~n~0_10, main_~x~0=v_main_~x~0_17} OutVars{main_#t~post4=|v_main_#t~post4_9|, main_~y~0=v_main_~y~0_16, main_~n~0=v_main_~n~0_10, main_~x~0=v_main_~x~0_16} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {301#(<= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-28 04:09:00,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {301#(<= (+ main_~x~0 1) main_~n~0)} [56] L24-2_primed-->L24-2: Formula: (not (< v_main_~x~0_1 v_main_~n~0_1)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {296#false} is VALID [2022-04-28 04:09:00,578 INFO L272 TraceCheckUtils]: 9: Hoare triple {296#false} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1 else 0)); {296#false} is VALID [2022-04-28 04:09:00,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {296#false} ~cond := #in~cond; {296#false} is VALID [2022-04-28 04:09:00,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {296#false} assume 0 == ~cond; {296#false} is VALID [2022-04-28 04:09:00,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {296#false} assume !false; {296#false} is VALID [2022-04-28 04:09:00,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:09:00,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:00,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804858015] [2022-04-28 04:09:00,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804858015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:00,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:00,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:09:00,645 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:00,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [804212911] [2022-04-28 04:09:00,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [804212911] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:00,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:00,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:09:00,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327407063] [2022-04-28 04:09:00,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:00,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 04:09:00,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:00,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:00,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:00,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:09:00,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:00,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:09:00,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-04-28 04:09:00,656 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:00,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:00,736 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-28 04:09:00,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:09:00,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 04:09:00,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:00,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:00,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2022-04-28 04:09:00,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:00,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2022-04-28 04:09:00,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 23 transitions. [2022-04-28 04:09:00,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:00,755 INFO L225 Difference]: With dead ends: 25 [2022-04-28 04:09:00,755 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 04:09:00,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-28 04:09:00,756 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:00,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 19 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:09:00,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 04:09:00,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-28 04:09:00,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:00,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:00,777 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:00,778 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:00,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:00,779 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-28 04:09:00,779 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-28 04:09:00,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:00,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:00,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 04:09:00,779 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 04:09:00,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:00,780 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-28 04:09:00,780 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-28 04:09:00,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:00,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:00,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:00,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:00,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:00,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-04-28 04:09:00,781 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2022-04-28 04:09:00,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:00,781 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-04-28 04:09:00,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:00,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 24 transitions. [2022-04-28 04:09:00,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:00,814 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-28 04:09:00,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 04:09:00,815 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:00,815 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:00,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 04:09:00,815 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:00,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:00,815 INFO L85 PathProgramCache]: Analyzing trace with hash -775235318, now seen corresponding path program 1 times [2022-04-28 04:09:00,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:00,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1797521245] [2022-04-28 04:09:01,076 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:01,293 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:01,295 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:09:01,298 INFO L85 PathProgramCache]: Analyzing trace with hash -814733172, now seen corresponding path program 1 times [2022-04-28 04:09:01,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:01,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450676846] [2022-04-28 04:09:01,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:01,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:01,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:01,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {452#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {441#true} is VALID [2022-04-28 04:09:01,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {441#true} assume true; {441#true} is VALID [2022-04-28 04:09:01,461 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {441#true} {441#true} #51#return; {441#true} is VALID [2022-04-28 04:09:01,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {441#true} call ULTIMATE.init(); {452#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:09:01,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {452#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {441#true} is VALID [2022-04-28 04:09:01,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {441#true} assume true; {441#true} is VALID [2022-04-28 04:09:01,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {441#true} {441#true} #51#return; {441#true} is VALID [2022-04-28 04:09:01,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {441#true} call #t~ret6 := main(); {441#true} is VALID [2022-04-28 04:09:01,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {441#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {441#true} is VALID [2022-04-28 04:09:01,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {441#true} assume !!((~x~0 >= 0 && ~x~0 <= ~y~0) && ~y~0 < ~n~0); {446#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 04:09:01,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {446#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 main_~y~0))} [59] L26-2-->L24-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_16| |v_main_#t~post4_14|)) (.cse2 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse3 (= v_main_~x~0_24 v_main_~x~0_23)) (.cse4 (= v_main_~y~0_19 v_main_~y~0_18)) (.cse1 (< v_main_~y~0_19 (+ v_main_~x~0_24 1)))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_24 v_main_~n~0_12))) .cse2 .cse3 .cse4) (and .cse0 .cse2 (= v_main_~n~0_12 v_main_~n~0_12) .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_24 v_main_~y~0_18))) (and (< v_main_~y~0_19 v_main_~y~0_18) (< .cse5 (+ v_main_~n~0_12 v_main_~y~0_19 1)) .cse1 (= (+ v_main_~x~0_23 v_main_~y~0_19) .cse5))))) InVars {main_#t~post4=|v_main_#t~post4_16|, main_~y~0=v_main_~y~0_19, main_#t~post5=|v_main_#t~post5_9|, main_~n~0=v_main_~n~0_12, main_~x~0=v_main_~x~0_24} OutVars{main_#t~post4=|v_main_#t~post4_14|, main_#t~post5=|v_main_#t~post5_8|, main_~y~0=v_main_~y~0_18, main_~n~0=v_main_~n~0_12, main_~x~0=v_main_~x~0_23} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_#t~post5, main_~y~0] {447#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~n~0 1)))} is VALID [2022-04-28 04:09:01,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {447#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~n~0 1)))} [60] L24-2_primed-->L26-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {447#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~n~0 1)))} is VALID [2022-04-28 04:09:01,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {447#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~n~0 1)))} [61] L26-2-->L24-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_26 v_main_~x~0_25)) (.cse1 (= |v_main_#t~post4_19| |v_main_#t~post4_15|))) (or (and .cse0 (or (not (< v_main_~x~0_26 v_main_~n~0_13)) (< v_main_~y~0_20 (+ v_main_~x~0_26 1))) .cse1) (and .cse0 (= v_main_~n~0_13 v_main_~n~0_13) (= v_main_~y~0_20 v_main_~y~0_20) .cse1) (and (< v_main_~x~0_26 v_main_~x~0_25) (< v_main_~x~0_25 (+ v_main_~n~0_13 1)) (<= v_main_~x~0_25 v_main_~y~0_20)))) InVars {main_#t~post4=|v_main_#t~post4_19|, main_~y~0=v_main_~y~0_20, main_~n~0=v_main_~n~0_13, main_~x~0=v_main_~x~0_26} OutVars{main_#t~post4=|v_main_#t~post4_15|, main_~y~0=v_main_~y~0_20, main_~n~0=v_main_~n~0_13, main_~x~0=v_main_~x~0_25} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {448#(or (and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0)) (<= (+ main_~x~0 1) main_~n~0))} is VALID [2022-04-28 04:09:01,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {448#(or (and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0)) (<= (+ main_~x~0 1) main_~n~0))} [58] L24-2_primed-->L24-2: Formula: (not (< v_main_~x~0_1 v_main_~n~0_1)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {449#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} is VALID [2022-04-28 04:09:01,469 INFO L272 TraceCheckUtils]: 11: Hoare triple {449#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1 else 0)); {450#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:09:01,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {450#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {451#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:09:01,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {451#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {442#false} is VALID [2022-04-28 04:09:01,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {442#false} assume !false; {442#false} is VALID [2022-04-28 04:09:01,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:09:01,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:01,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450676846] [2022-04-28 04:09:01,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450676846] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:09:01,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5616056] [2022-04-28 04:09:01,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:01,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:09:01,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:09:01,472 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:09:01,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 04:09:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:01,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 04:09:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:01,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:09:02,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {441#true} call ULTIMATE.init(); {441#true} is VALID [2022-04-28 04:09:02,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {441#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {441#true} is VALID [2022-04-28 04:09:02,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {441#true} assume true; {441#true} is VALID [2022-04-28 04:09:02,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {441#true} {441#true} #51#return; {441#true} is VALID [2022-04-28 04:09:02,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {441#true} call #t~ret6 := main(); {441#true} is VALID [2022-04-28 04:09:02,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {441#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {441#true} is VALID [2022-04-28 04:09:02,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {441#true} assume !!((~x~0 >= 0 && ~x~0 <= ~y~0) && ~y~0 < ~n~0); {446#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 04:09:02,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {446#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 main_~y~0))} [59] L26-2-->L24-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_16| |v_main_#t~post4_14|)) (.cse2 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse3 (= v_main_~x~0_24 v_main_~x~0_23)) (.cse4 (= v_main_~y~0_19 v_main_~y~0_18)) (.cse1 (< v_main_~y~0_19 (+ v_main_~x~0_24 1)))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_24 v_main_~n~0_12))) .cse2 .cse3 .cse4) (and .cse0 .cse2 (= v_main_~n~0_12 v_main_~n~0_12) .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_24 v_main_~y~0_18))) (and (< v_main_~y~0_19 v_main_~y~0_18) (< .cse5 (+ v_main_~n~0_12 v_main_~y~0_19 1)) .cse1 (= (+ v_main_~x~0_23 v_main_~y~0_19) .cse5))))) InVars {main_#t~post4=|v_main_#t~post4_16|, main_~y~0=v_main_~y~0_19, main_#t~post5=|v_main_#t~post5_9|, main_~n~0=v_main_~n~0_12, main_~x~0=v_main_~x~0_24} OutVars{main_#t~post4=|v_main_#t~post4_14|, main_#t~post5=|v_main_#t~post5_8|, main_~y~0=v_main_~y~0_18, main_~n~0=v_main_~n~0_12, main_~x~0=v_main_~x~0_23} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_#t~post5, main_~y~0] {477#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 (+ main_~n~0 1)) (< main_~y~0 (+ main_~x~0 1))) (and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 main_~y~0)))} is VALID [2022-04-28 04:09:02,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {477#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 (+ main_~n~0 1)) (< main_~y~0 (+ main_~x~0 1))) (and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 main_~y~0)))} [60] L24-2_primed-->L26-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 (+ main_~n~0 1)) (< main_~y~0 (+ main_~x~0 1))) (and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 main_~y~0)))} is VALID [2022-04-28 04:09:02,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {477#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 (+ main_~n~0 1)) (< main_~y~0 (+ main_~x~0 1))) (and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 main_~y~0)))} [61] L26-2-->L24-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_26 v_main_~x~0_25)) (.cse1 (= |v_main_#t~post4_19| |v_main_#t~post4_15|))) (or (and .cse0 (or (not (< v_main_~x~0_26 v_main_~n~0_13)) (< v_main_~y~0_20 (+ v_main_~x~0_26 1))) .cse1) (and .cse0 (= v_main_~n~0_13 v_main_~n~0_13) (= v_main_~y~0_20 v_main_~y~0_20) .cse1) (and (< v_main_~x~0_26 v_main_~x~0_25) (< v_main_~x~0_25 (+ v_main_~n~0_13 1)) (<= v_main_~x~0_25 v_main_~y~0_20)))) InVars {main_#t~post4=|v_main_#t~post4_19|, main_~y~0=v_main_~y~0_20, main_~n~0=v_main_~n~0_13, main_~x~0=v_main_~x~0_26} OutVars{main_#t~post4=|v_main_#t~post4_15|, main_~y~0=v_main_~y~0_20, main_~n~0=v_main_~n~0_13, main_~x~0=v_main_~x~0_25} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {477#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 (+ main_~n~0 1)) (< main_~y~0 (+ main_~x~0 1))) (and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 main_~y~0)))} is VALID [2022-04-28 04:09:02,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {477#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 (+ main_~n~0 1)) (< main_~y~0 (+ main_~x~0 1))) (and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 main_~y~0)))} [58] L24-2_primed-->L24-2: Formula: (not (< v_main_~x~0_1 v_main_~n~0_1)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {449#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} is VALID [2022-04-28 04:09:02,090 INFO L272 TraceCheckUtils]: 11: Hoare triple {449#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1 else 0)); {490#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:09:02,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {490#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {494#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:09:02,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {494#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {442#false} is VALID [2022-04-28 04:09:02,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {442#false} assume !false; {442#false} is VALID [2022-04-28 04:09:02,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 04:09:02,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:09:02,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {442#false} assume !false; {442#false} is VALID [2022-04-28 04:09:02,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {494#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {442#false} is VALID [2022-04-28 04:09:02,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {490#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {494#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:09:02,498 INFO L272 TraceCheckUtils]: 11: Hoare triple {449#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1 else 0)); {490#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:09:02,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {448#(or (and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0)) (<= (+ main_~x~0 1) main_~n~0))} [58] L24-2_primed-->L24-2: Formula: (not (< v_main_~x~0_1 v_main_~n~0_1)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {449#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} is VALID [2022-04-28 04:09:02,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {516#(or (and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0)) (and (<= (+ main_~y~0 1) main_~n~0) (<= (+ main_~x~0 1) main_~n~0)))} [61] L26-2-->L24-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_26 v_main_~x~0_25)) (.cse1 (= |v_main_#t~post4_19| |v_main_#t~post4_15|))) (or (and .cse0 (or (not (< v_main_~x~0_26 v_main_~n~0_13)) (< v_main_~y~0_20 (+ v_main_~x~0_26 1))) .cse1) (and .cse0 (= v_main_~n~0_13 v_main_~n~0_13) (= v_main_~y~0_20 v_main_~y~0_20) .cse1) (and (< v_main_~x~0_26 v_main_~x~0_25) (< v_main_~x~0_25 (+ v_main_~n~0_13 1)) (<= v_main_~x~0_25 v_main_~y~0_20)))) InVars {main_#t~post4=|v_main_#t~post4_19|, main_~y~0=v_main_~y~0_20, main_~n~0=v_main_~n~0_13, main_~x~0=v_main_~x~0_26} OutVars{main_#t~post4=|v_main_#t~post4_15|, main_~y~0=v_main_~y~0_20, main_~n~0=v_main_~n~0_13, main_~x~0=v_main_~x~0_25} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {448#(or (and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0)) (<= (+ main_~x~0 1) main_~n~0))} is VALID [2022-04-28 04:09:02,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {516#(or (and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0)) (and (<= (+ main_~y~0 1) main_~n~0) (<= (+ main_~x~0 1) main_~n~0)))} [60] L24-2_primed-->L26-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {516#(or (and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0)) (and (<= (+ main_~y~0 1) main_~n~0) (<= (+ main_~x~0 1) main_~n~0)))} is VALID [2022-04-28 04:09:02,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {523#(and (or (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 main_~y~0)) (< main_~y~0 (+ main_~n~0 1)) (or (<= main_~x~0 main_~y~0) (<= main_~n~0 main_~x~0)))} [59] L26-2-->L24-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_16| |v_main_#t~post4_14|)) (.cse2 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse3 (= v_main_~x~0_24 v_main_~x~0_23)) (.cse4 (= v_main_~y~0_19 v_main_~y~0_18)) (.cse1 (< v_main_~y~0_19 (+ v_main_~x~0_24 1)))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_24 v_main_~n~0_12))) .cse2 .cse3 .cse4) (and .cse0 .cse2 (= v_main_~n~0_12 v_main_~n~0_12) .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_24 v_main_~y~0_18))) (and (< v_main_~y~0_19 v_main_~y~0_18) (< .cse5 (+ v_main_~n~0_12 v_main_~y~0_19 1)) .cse1 (= (+ v_main_~x~0_23 v_main_~y~0_19) .cse5))))) InVars {main_#t~post4=|v_main_#t~post4_16|, main_~y~0=v_main_~y~0_19, main_#t~post5=|v_main_#t~post5_9|, main_~n~0=v_main_~n~0_12, main_~x~0=v_main_~x~0_24} OutVars{main_#t~post4=|v_main_#t~post4_14|, main_#t~post5=|v_main_#t~post5_8|, main_~y~0=v_main_~y~0_18, main_~n~0=v_main_~n~0_12, main_~x~0=v_main_~x~0_23} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_#t~post5, main_~y~0] {516#(or (and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0)) (and (<= (+ main_~y~0 1) main_~n~0) (<= (+ main_~x~0 1) main_~n~0)))} is VALID [2022-04-28 04:09:02,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {441#true} assume !!((~x~0 >= 0 && ~x~0 <= ~y~0) && ~y~0 < ~n~0); {523#(and (or (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 main_~y~0)) (< main_~y~0 (+ main_~n~0 1)) (or (<= main_~x~0 main_~y~0) (<= main_~n~0 main_~x~0)))} is VALID [2022-04-28 04:09:02,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {441#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {441#true} is VALID [2022-04-28 04:09:02,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {441#true} call #t~ret6 := main(); {441#true} is VALID [2022-04-28 04:09:02,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {441#true} {441#true} #51#return; {441#true} is VALID [2022-04-28 04:09:02,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {441#true} assume true; {441#true} is VALID [2022-04-28 04:09:02,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {441#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {441#true} is VALID [2022-04-28 04:09:02,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {441#true} call ULTIMATE.init(); {441#true} is VALID [2022-04-28 04:09:02,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:09:02,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5616056] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:09:02,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:09:02,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 14 [2022-04-28 04:09:02,663 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:02,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1797521245] [2022-04-28 04:09:02,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1797521245] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:02,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:02,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 04:09:02,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688871759] [2022-04-28 04:09:02,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:02,664 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 04:09:02,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:02,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:02,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:02,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 04:09:02,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:02,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 04:09:02,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-04-28 04:09:02,680 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:02,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:02,901 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-28 04:09:02,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 04:09:02,901 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 04:09:02,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:02,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:02,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 25 transitions. [2022-04-28 04:09:02,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:02,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 25 transitions. [2022-04-28 04:09:02,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 25 transitions. [2022-04-28 04:09:02,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:02,921 INFO L225 Difference]: With dead ends: 25 [2022-04-28 04:09:02,922 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 04:09:02,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2022-04-28 04:09:02,922 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:02,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 35 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:09:02,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 04:09:02,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 04:09:02,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:02,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 04:09:02,923 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 04:09:02,923 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 04:09:02,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:02,924 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 04:09:02,924 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:09:02,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:02,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:02,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 04:09:02,924 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 04:09:02,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:02,924 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 04:09:02,924 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:09:02,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:02,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:02,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:02,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:02,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 04:09:02,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 04:09:02,924 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2022-04-28 04:09:02,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:02,924 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 04:09:02,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:02,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 04:09:02,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:02,925 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:09:02,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:02,927 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 04:09:02,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 04:09:03,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:09:03,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 04:09:03,323 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 11) no Hoare annotation was computed. [2022-04-28 04:09:03,324 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 11) no Hoare annotation was computed. [2022-04-28 04:09:03,324 INFO L899 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2022-04-28 04:09:03,324 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 30) the Hoare annotation is: true [2022-04-28 04:09:03,324 INFO L902 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2022-04-28 04:09:03,324 INFO L895 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (let ((.cse0 (+ main_~y~0 1))) (and (<= .cse0 main_~n~0) (<= main_~x~0 .cse0))) [2022-04-28 04:09:03,324 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 19 30) the Hoare annotation is: true [2022-04-28 04:09:03,324 INFO L895 garLoopResultBuilder]: At program point L26-2(lines 24 27) the Hoare annotation is: (or (and (< main_~y~0 (+ main_~x~0 1)) (exists ((|v_main_#t~post5_7| Int) (|v_main_#t~post4_7| Int) (v_main_~y~0_14 Int) (v_main_~x~0_14 Int)) (let ((.cse4 (+ v_main_~x~0_14 1))) (and (let ((.cse0 (= v_main_~y~0_14 main_~y~0)) (.cse1 (= v_main_~x~0_14 main_~x~0)) (.cse2 (= |main_#t~post4| |v_main_#t~post4_7|)) (.cse3 (= |main_#t~post5| |v_main_#t~post5_7|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< main_~x~0 (+ main_~n~0 1)) (< v_main_~x~0_14 main_~x~0) (= (+ v_main_~x~0_14 main_~y~0) (+ v_main_~y~0_14 main_~x~0)) (< v_main_~y~0_14 .cse4)) (and (<= .cse4 v_main_~y~0_14) .cse0 .cse1 .cse2 .cse3))) (<= .cse4 main_~n~0) (<= v_main_~x~0_14 v_main_~y~0_14))))) (and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 main_~y~0))) [2022-04-28 04:09:03,324 INFO L902 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: true [2022-04-28 04:09:03,324 INFO L895 garLoopResultBuilder]: At program point L24-2(lines 24 27) the Hoare annotation is: (and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0)) [2022-04-28 04:09:03,324 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 19 30) the Hoare annotation is: true [2022-04-28 04:09:03,324 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 04:09:03,324 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 04:09:03,324 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 04:09:03,325 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 04:09:03,325 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 04:09:03,325 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 04:09:03,325 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 04:09:03,325 INFO L895 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 04:09:03,325 INFO L895 garLoopResultBuilder]: At program point L15(lines 15 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 04:09:03,325 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-28 04:09:03,325 INFO L902 garLoopResultBuilder]: At program point L15-2(lines 14 18) the Hoare annotation is: true [2022-04-28 04:09:03,325 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 18) the Hoare annotation is: true [2022-04-28 04:09:03,325 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 04:09:03,327 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:03,328 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 04:09:03,330 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 04:09:03,330 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 04:09:03,332 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2022-04-28 04:09:03,343 INFO L163 areAnnotationChecker]: CFG has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 04:09:03,347 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] [2022-04-28 04:09:03,348 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,348 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post4_7,QUANTIFIED] [2022-04-28 04:09:03,348 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post5_7,QUANTIFIED] [2022-04-28 04:09:03,348 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,348 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,348 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] [2022-04-28 04:09:03,348 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] [2022-04-28 04:09:03,348 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,348 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,348 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] [2022-04-28 04:09:03,349 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] [2022-04-28 04:09:03,349 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,349 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post4_7,QUANTIFIED] [2022-04-28 04:09:03,349 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post5_7,QUANTIFIED] [2022-04-28 04:09:03,349 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,349 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,349 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] [2022-04-28 04:09:03,355 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] [2022-04-28 04:09:03,355 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,355 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post4_7,QUANTIFIED] [2022-04-28 04:09:03,355 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post5_7,QUANTIFIED] [2022-04-28 04:09:03,355 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,355 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,356 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] [2022-04-28 04:09:03,356 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] [2022-04-28 04:09:03,356 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,356 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,356 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] [2022-04-28 04:09:03,356 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] [2022-04-28 04:09:03,356 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,356 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post4_7,QUANTIFIED] [2022-04-28 04:09:03,356 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post5_7,QUANTIFIED] [2022-04-28 04:09:03,356 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,356 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,356 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] [2022-04-28 04:09:03,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 04:09:03 BoogieIcfgContainer [2022-04-28 04:09:03,358 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 04:09:03,359 INFO L158 Benchmark]: Toolchain (without parser) took 9249.66ms. Allocated memory was 176.2MB in the beginning and 229.6MB in the end (delta: 53.5MB). Free memory was 126.9MB in the beginning and 90.9MB in the end (delta: 36.0MB). Peak memory consumption was 90.9MB. Max. memory is 8.0GB. [2022-04-28 04:09:03,360 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 176.2MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 04:09:03,360 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.73ms. Allocated memory is still 176.2MB. Free memory was 126.7MB in the beginning and 152.2MB in the end (delta: -25.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 04:09:03,360 INFO L158 Benchmark]: Boogie Preprocessor took 22.77ms. Allocated memory is still 176.2MB. Free memory was 152.2MB in the beginning and 150.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 04:09:03,361 INFO L158 Benchmark]: RCFGBuilder took 235.99ms. Allocated memory is still 176.2MB. Free memory was 150.5MB in the beginning and 139.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 04:09:03,361 INFO L158 Benchmark]: TraceAbstraction took 8817.98ms. Allocated memory was 176.2MB in the beginning and 229.6MB in the end (delta: 53.5MB). Free memory was 138.5MB in the beginning and 90.9MB in the end (delta: 47.7MB). Peak memory consumption was 102.6MB. Max. memory is 8.0GB. [2022-04-28 04:09:03,362 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.09ms. Allocated memory is still 176.2MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 169.73ms. Allocated memory is still 176.2MB. Free memory was 126.7MB in the beginning and 152.2MB in the end (delta: -25.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.77ms. Allocated memory is still 176.2MB. Free memory was 152.2MB in the beginning and 150.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 235.99ms. Allocated memory is still 176.2MB. Free memory was 150.5MB in the beginning and 139.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 8817.98ms. Allocated memory was 176.2MB in the beginning and 229.6MB in the end (delta: 53.5MB). Free memory was 138.5MB in the beginning and 90.9MB in the end (delta: 47.7MB). Peak memory consumption was 102.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post4_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post5_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post4_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post5_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post4_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post5_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post4_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post5_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] * 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: 16]: 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 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.7s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 116 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 13 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 105 IncrementalHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 51 mSDtfsCounter, 105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 28, 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, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 45 PreInvPairs, 68 NumberOfFragments, 134 HoareAnnotationTreeSize, 45 FomulaSimplifications, 17 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 411 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant [2022-04-28 04:09:03,367 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] [2022-04-28 04:09:03,367 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,367 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post4_7,QUANTIFIED] [2022-04-28 04:09:03,367 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post5_7,QUANTIFIED] [2022-04-28 04:09:03,367 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,367 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,367 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] [2022-04-28 04:09:03,367 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] [2022-04-28 04:09:03,367 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,368 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,368 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] [2022-04-28 04:09:03,368 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] [2022-04-28 04:09:03,368 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,368 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post4_7,QUANTIFIED] [2022-04-28 04:09:03,368 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post5_7,QUANTIFIED] [2022-04-28 04:09:03,368 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,368 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,370 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] [2022-04-28 04:09:03,370 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] [2022-04-28 04:09:03,370 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,370 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post4_7,QUANTIFIED] [2022-04-28 04:09:03,370 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post5_7,QUANTIFIED] [2022-04-28 04:09:03,370 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,370 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,370 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] [2022-04-28 04:09:03,370 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] [2022-04-28 04:09:03,370 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,370 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,370 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] [2022-04-28 04:09:03,370 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] [2022-04-28 04:09:03,371 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,371 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post4_7,QUANTIFIED] [2022-04-28 04:09:03,371 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post5_7,QUANTIFIED] [2022-04-28 04:09:03,371 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,371 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_14,QUANTIFIED] [2022-04-28 04:09:03,371 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_14,QUANTIFIED] Derived loop invariant: (y < x + 1 && (\exists v_main_#t~post5_7 : int, v_main_#t~post4_7 : int, v_main_~y~0_14 : int, v_main_~x~0_14 : int :: ((((((v_main_~y~0_14 == y && v_main_~x~0_14 == x) && aux-x++-aux == v_main_#t~post4_7) && aux-y++-aux == v_main_#t~post5_7) || (((x < n + 1 && v_main_~x~0_14 < x) && v_main_~x~0_14 + y == v_main_~y~0_14 + x) && v_main_~y~0_14 < v_main_~x~0_14 + 1)) || ((((v_main_~x~0_14 + 1 <= v_main_~y~0_14 && v_main_~y~0_14 == y) && v_main_~x~0_14 == x) && aux-x++-aux == v_main_#t~post4_7) && aux-y++-aux == v_main_#t~post5_7)) && v_main_~x~0_14 + 1 <= n) && v_main_~x~0_14 <= v_main_~y~0_14)) || (y + 1 <= n && x <= y) - ProcedureContractResult [Line: 19]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 04:09:03,385 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...