/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 18:46:10,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 18:46:10,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 18:46:11,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 18:46:11,005 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 18:46:11,007 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 18:46:11,009 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 18:46:11,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 18:46:11,017 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 18:46:11,019 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 18:46:11,020 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 18:46:11,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 18:46:11,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 18:46:11,025 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 18:46:11,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 18:46:11,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 18:46:11,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 18:46:11,031 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 18:46:11,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 18:46:11,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 18:46:11,045 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 18:46:11,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 18:46:11,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 18:46:11,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 18:46:11,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 18:46:11,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 18:46:11,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 18:46:11,054 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 18:46:11,056 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 18:46:11,058 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 18:46:11,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 18:46:11,059 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 18:46:11,061 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 18:46:11,061 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 18:46:11,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 18:46:11,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 18:46:11,068 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 18:46:11,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 18:46:11,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 18:46:11,072 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 18:46:11,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 18:46:11,075 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 18:46:11,090 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 18:46:11,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 18:46:11,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 18:46:11,093 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 18:46:11,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 18:46:11,093 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 18:46:11,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 18:46:11,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 18:46:11,094 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 18:46:11,094 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 18:46:11,095 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 18:46:11,095 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 18:46:11,095 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 18:46:11,096 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 18:46:11,096 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 18:46:11,096 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 18:46:11,097 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 18:46:11,097 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 18:46:11,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 18:46:11,097 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 18:46:11,097 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 18:46:11,098 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 18:46:11,098 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 18:46:11,352 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 18:46:11,364 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 18:46:11,368 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 18:46:11,371 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 18:46:11,371 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 18:46:11,372 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2020-07-10 18:46:11,446 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ebeb77ca/b9c8d56c79d74427b8bfa9e6ac04fb8e/FLAGa8b86be60 [2020-07-10 18:46:11,965 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 18:46:11,966 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2020-07-10 18:46:11,972 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ebeb77ca/b9c8d56c79d74427b8bfa9e6ac04fb8e/FLAGa8b86be60 [2020-07-10 18:46:12,314 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ebeb77ca/b9c8d56c79d74427b8bfa9e6ac04fb8e [2020-07-10 18:46:12,324 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 18:46:12,326 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 18:46:12,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 18:46:12,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 18:46:12,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 18:46:12,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:46:12" (1/1) ... [2020-07-10 18:46:12,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18966d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:46:12, skipping insertion in model container [2020-07-10 18:46:12,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:46:12" (1/1) ... [2020-07-10 18:46:12,342 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 18:46:12,360 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 18:46:12,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:46:12,575 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 18:46:12,602 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:46:12,710 INFO L208 MainTranslator]: Completed translation [2020-07-10 18:46:12,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:46:12 WrapperNode [2020-07-10 18:46:12,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 18:46:12,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 18:46:12,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 18:46:12,712 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 18:46:12,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:46:12" (1/1) ... [2020-07-10 18:46:12,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:46:12" (1/1) ... [2020-07-10 18:46:12,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:46:12" (1/1) ... [2020-07-10 18:46:12,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:46:12" (1/1) ... [2020-07-10 18:46:12,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:46:12" (1/1) ... [2020-07-10 18:46:12,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:46:12" (1/1) ... [2020-07-10 18:46:12,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:46:12" (1/1) ... [2020-07-10 18:46:12,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 18:46:12,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 18:46:12,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 18:46:12,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 18:46:12,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:46:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 18:46:12,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 18:46:12,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 18:46:12,829 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 18:46:12,829 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 18:46:12,829 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-10 18:46:12,829 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 18:46:12,829 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-10 18:46:12,830 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 18:46:12,830 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 18:46:12,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 18:46:12,830 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 18:46:12,830 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 18:46:12,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 18:46:12,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 18:46:12,831 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-10 18:46:12,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 18:46:12,831 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 18:46:12,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 18:46:12,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-10 18:46:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 18:46:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 18:46:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 18:46:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 18:46:13,358 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 18:46:13,358 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 18:46:13,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:46:13 BoogieIcfgContainer [2020-07-10 18:46:13,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 18:46:13,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 18:46:13,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 18:46:13,368 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 18:46:13,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 06:46:12" (1/3) ... [2020-07-10 18:46:13,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b25e49d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:46:13, skipping insertion in model container [2020-07-10 18:46:13,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:46:12" (2/3) ... [2020-07-10 18:46:13,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b25e49d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:46:13, skipping insertion in model container [2020-07-10 18:46:13,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:46:13" (3/3) ... [2020-07-10 18:46:13,372 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2020-07-10 18:46:13,384 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 18:46:13,393 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 18:46:13,406 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 18:46:13,427 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 18:46:13,427 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 18:46:13,427 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 18:46:13,428 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 18:46:13,428 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 18:46:13,428 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 18:46:13,429 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 18:46:13,429 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 18:46:13,447 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2020-07-10 18:46:13,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-10 18:46:13,459 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:46:13,460 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:46:13,461 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:46:13,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:46:13,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1228919024, now seen corresponding path program 1 times [2020-07-10 18:46:13,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:46:13,475 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1591276424] [2020-07-10 18:46:13,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:46:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:13,964 INFO L280 TraceCheckUtils]: 0: Hoare triple {114#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {90#true} is VALID [2020-07-10 18:46:13,965 INFO L280 TraceCheckUtils]: 1: Hoare triple {90#true} #valid := #valid[0 := 0]; {90#true} is VALID [2020-07-10 18:46:13,966 INFO L280 TraceCheckUtils]: 2: Hoare triple {90#true} assume 0 < #StackHeapBarrier; {90#true} is VALID [2020-07-10 18:46:13,966 INFO L280 TraceCheckUtils]: 3: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-10 18:46:13,967 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {90#true} {90#true} #117#return; {90#true} is VALID [2020-07-10 18:46:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:13,980 INFO L280 TraceCheckUtils]: 0: Hoare triple {90#true} ~cond := #in~cond; {90#true} is VALID [2020-07-10 18:46:13,981 INFO L280 TraceCheckUtils]: 1: Hoare triple {90#true} assume !(0 == ~cond); {90#true} is VALID [2020-07-10 18:46:13,982 INFO L280 TraceCheckUtils]: 2: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-10 18:46:13,982 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {90#true} {90#true} #99#return; {90#true} is VALID [2020-07-10 18:46:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:13,994 INFO L280 TraceCheckUtils]: 0: Hoare triple {90#true} ~cond := #in~cond; {90#true} is VALID [2020-07-10 18:46:13,995 INFO L280 TraceCheckUtils]: 1: Hoare triple {90#true} assume !(0 == ~cond); {90#true} is VALID [2020-07-10 18:46:13,995 INFO L280 TraceCheckUtils]: 2: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-10 18:46:13,996 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {90#true} {90#true} #101#return; {90#true} is VALID [2020-07-10 18:46:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:14,020 INFO L280 TraceCheckUtils]: 0: Hoare triple {115#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {90#true} is VALID [2020-07-10 18:46:14,021 INFO L280 TraceCheckUtils]: 1: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-10 18:46:14,021 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {90#true} {90#true} #103#return; {90#true} is VALID [2020-07-10 18:46:14,023 INFO L263 TraceCheckUtils]: 0: Hoare triple {90#true} call ULTIMATE.init(); {114#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 18:46:14,024 INFO L280 TraceCheckUtils]: 1: Hoare triple {114#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {90#true} is VALID [2020-07-10 18:46:14,024 INFO L280 TraceCheckUtils]: 2: Hoare triple {90#true} #valid := #valid[0 := 0]; {90#true} is VALID [2020-07-10 18:46:14,025 INFO L280 TraceCheckUtils]: 3: Hoare triple {90#true} assume 0 < #StackHeapBarrier; {90#true} is VALID [2020-07-10 18:46:14,025 INFO L280 TraceCheckUtils]: 4: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-10 18:46:14,025 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {90#true} {90#true} #117#return; {90#true} is VALID [2020-07-10 18:46:14,026 INFO L263 TraceCheckUtils]: 6: Hoare triple {90#true} call #t~ret14 := main(); {90#true} is VALID [2020-07-10 18:46:14,026 INFO L280 TraceCheckUtils]: 7: Hoare triple {90#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {90#true} is VALID [2020-07-10 18:46:14,027 INFO L280 TraceCheckUtils]: 8: Hoare triple {90#true} ~n~0 := #t~nondet8; {90#true} is VALID [2020-07-10 18:46:14,027 INFO L280 TraceCheckUtils]: 9: Hoare triple {90#true} havoc #t~nondet8; {90#true} is VALID [2020-07-10 18:46:14,027 INFO L263 TraceCheckUtils]: 10: Hoare triple {90#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {90#true} is VALID [2020-07-10 18:46:14,028 INFO L280 TraceCheckUtils]: 11: Hoare triple {90#true} ~cond := #in~cond; {90#true} is VALID [2020-07-10 18:46:14,028 INFO L280 TraceCheckUtils]: 12: Hoare triple {90#true} assume !(0 == ~cond); {90#true} is VALID [2020-07-10 18:46:14,029 INFO L280 TraceCheckUtils]: 13: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-10 18:46:14,029 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {90#true} {90#true} #99#return; {90#true} is VALID [2020-07-10 18:46:14,029 INFO L280 TraceCheckUtils]: 15: Hoare triple {90#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {90#true} is VALID [2020-07-10 18:46:14,030 INFO L280 TraceCheckUtils]: 16: Hoare triple {90#true} ~i~0 := #t~nondet9; {90#true} is VALID [2020-07-10 18:46:14,030 INFO L280 TraceCheckUtils]: 17: Hoare triple {90#true} havoc #t~nondet9; {90#true} is VALID [2020-07-10 18:46:14,031 INFO L263 TraceCheckUtils]: 18: Hoare triple {90#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {90#true} is VALID [2020-07-10 18:46:14,031 INFO L280 TraceCheckUtils]: 19: Hoare triple {90#true} ~cond := #in~cond; {90#true} is VALID [2020-07-10 18:46:14,031 INFO L280 TraceCheckUtils]: 20: Hoare triple {90#true} assume !(0 == ~cond); {90#true} is VALID [2020-07-10 18:46:14,032 INFO L280 TraceCheckUtils]: 21: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-10 18:46:14,032 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {90#true} {90#true} #101#return; {90#true} is VALID [2020-07-10 18:46:14,033 INFO L280 TraceCheckUtils]: 23: Hoare triple {90#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {90#true} is VALID [2020-07-10 18:46:14,035 INFO L263 TraceCheckUtils]: 24: Hoare triple {90#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {115#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 18:46:14,036 INFO L280 TraceCheckUtils]: 25: Hoare triple {115#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {90#true} is VALID [2020-07-10 18:46:14,036 INFO L280 TraceCheckUtils]: 26: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-10 18:46:14,036 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {90#true} {90#true} #103#return; {90#true} is VALID [2020-07-10 18:46:14,037 INFO L280 TraceCheckUtils]: 28: Hoare triple {90#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {90#true} is VALID [2020-07-10 18:46:14,039 INFO L263 TraceCheckUtils]: 29: Hoare triple {90#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {108#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-10 18:46:14,041 INFO L280 TraceCheckUtils]: 30: Hoare triple {108#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} ~x := #in~x; {109#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-10 18:46:14,042 INFO L280 TraceCheckUtils]: 31: Hoare triple {109#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {110#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-10 18:46:14,043 INFO L280 TraceCheckUtils]: 32: Hoare triple {110#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {110#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-10 18:46:14,044 INFO L280 TraceCheckUtils]: 33: Hoare triple {110#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~i := #in~i; {110#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-10 18:46:14,046 INFO L280 TraceCheckUtils]: 34: Hoare triple {110#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~n := #in~n; {111#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:14,047 INFO L280 TraceCheckUtils]: 35: Hoare triple {111#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {111#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:14,050 INFO L263 TraceCheckUtils]: 36: Hoare triple {111#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {112#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 18:46:14,051 INFO L280 TraceCheckUtils]: 37: Hoare triple {112#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {113#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 18:46:14,052 INFO L280 TraceCheckUtils]: 38: Hoare triple {113#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {91#false} is VALID [2020-07-10 18:46:14,052 INFO L280 TraceCheckUtils]: 39: Hoare triple {91#false} assume !false; {91#false} is VALID [2020-07-10 18:46:14,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 18:46:14,060 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:46:14,062 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1591276424] [2020-07-10 18:46:14,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:46:14,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-10 18:46:14,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581173623] [2020-07-10 18:46:14,072 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2020-07-10 18:46:14,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:46:14,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 18:46:14,172 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:46:14,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 18:46:14,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:46:14,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 18:46:14,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-07-10 18:46:14,186 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 10 states. [2020-07-10 18:46:17,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:46:17,405 INFO L93 Difference]: Finished difference Result 221 states and 257 transitions. [2020-07-10 18:46:17,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 18:46:17,405 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2020-07-10 18:46:17,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:46:17,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 18:46:17,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 257 transitions. [2020-07-10 18:46:17,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 18:46:17,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 257 transitions. [2020-07-10 18:46:17,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 257 transitions. [2020-07-10 18:46:17,891 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:46:17,912 INFO L225 Difference]: With dead ends: 221 [2020-07-10 18:46:17,912 INFO L226 Difference]: Without dead ends: 138 [2020-07-10 18:46:17,920 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2020-07-10 18:46:17,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-07-10 18:46:18,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2020-07-10 18:46:18,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:46:18,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 122 states. [2020-07-10 18:46:18,257 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 122 states. [2020-07-10 18:46:18,257 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 122 states. [2020-07-10 18:46:18,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:46:18,270 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2020-07-10 18:46:18,271 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2020-07-10 18:46:18,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:46:18,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:46:18,274 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 138 states. [2020-07-10 18:46:18,275 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 138 states. [2020-07-10 18:46:18,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:46:18,285 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2020-07-10 18:46:18,286 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2020-07-10 18:46:18,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:46:18,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:46:18,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:46:18,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:46:18,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-07-10 18:46:18,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2020-07-10 18:46:18,299 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 40 [2020-07-10 18:46:18,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:46:18,299 INFO L479 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2020-07-10 18:46:18,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 18:46:18,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 122 states and 132 transitions. [2020-07-10 18:46:18,505 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:46:18,505 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2020-07-10 18:46:18,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-10 18:46:18,508 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:46:18,508 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:46:18,509 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 18:46:18,509 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:46:18,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:46:18,509 INFO L82 PathProgramCache]: Analyzing trace with hash -2013393660, now seen corresponding path program 1 times [2020-07-10 18:46:18,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:46:18,510 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [146436387] [2020-07-10 18:46:18,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:46:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:18,788 INFO L280 TraceCheckUtils]: 0: Hoare triple {1132#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1097#true} is VALID [2020-07-10 18:46:18,789 INFO L280 TraceCheckUtils]: 1: Hoare triple {1097#true} #valid := #valid[0 := 0]; {1097#true} is VALID [2020-07-10 18:46:18,789 INFO L280 TraceCheckUtils]: 2: Hoare triple {1097#true} assume 0 < #StackHeapBarrier; {1097#true} is VALID [2020-07-10 18:46:18,790 INFO L280 TraceCheckUtils]: 3: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-10 18:46:18,790 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1097#true} {1097#true} #117#return; {1097#true} is VALID [2020-07-10 18:46:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:18,805 INFO L280 TraceCheckUtils]: 0: Hoare triple {1097#true} ~cond := #in~cond; {1097#true} is VALID [2020-07-10 18:46:18,807 INFO L280 TraceCheckUtils]: 1: Hoare triple {1097#true} assume !(0 == ~cond); {1097#true} is VALID [2020-07-10 18:46:18,808 INFO L280 TraceCheckUtils]: 2: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-10 18:46:18,808 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1097#true} {1097#true} #99#return; {1097#true} is VALID [2020-07-10 18:46:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:18,820 INFO L280 TraceCheckUtils]: 0: Hoare triple {1097#true} ~cond := #in~cond; {1097#true} is VALID [2020-07-10 18:46:18,821 INFO L280 TraceCheckUtils]: 1: Hoare triple {1097#true} assume !(0 == ~cond); {1097#true} is VALID [2020-07-10 18:46:18,821 INFO L280 TraceCheckUtils]: 2: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-10 18:46:18,822 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1097#true} {1097#true} #101#return; {1097#true} is VALID [2020-07-10 18:46:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:18,863 INFO L280 TraceCheckUtils]: 0: Hoare triple {1133#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1134#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 18:46:18,864 INFO L280 TraceCheckUtils]: 1: Hoare triple {1134#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {1134#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 18:46:18,866 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1134#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {1097#true} #103#return; {1115#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-10 18:46:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:18,876 INFO L280 TraceCheckUtils]: 0: Hoare triple {1097#true} ~x := #in~x; {1097#true} is VALID [2020-07-10 18:46:18,877 INFO L280 TraceCheckUtils]: 1: Hoare triple {1097#true} ~y := #in~y; {1097#true} is VALID [2020-07-10 18:46:18,877 INFO L280 TraceCheckUtils]: 2: Hoare triple {1097#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {1097#true} is VALID [2020-07-10 18:46:18,877 INFO L280 TraceCheckUtils]: 3: Hoare triple {1097#true} ~i := #in~i; {1097#true} is VALID [2020-07-10 18:46:18,878 INFO L280 TraceCheckUtils]: 4: Hoare triple {1097#true} ~n := #in~n; {1097#true} is VALID [2020-07-10 18:46:18,878 INFO L280 TraceCheckUtils]: 5: Hoare triple {1097#true} assume ~x >= ~y; {1097#true} is VALID [2020-07-10 18:46:18,878 INFO L280 TraceCheckUtils]: 6: Hoare triple {1097#true} #res := ~x; {1097#true} is VALID [2020-07-10 18:46:18,878 INFO L280 TraceCheckUtils]: 7: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-10 18:46:18,880 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1097#true} {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} #105#return; {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-10 18:46:18,881 INFO L263 TraceCheckUtils]: 0: Hoare triple {1097#true} call ULTIMATE.init(); {1132#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 18:46:18,882 INFO L280 TraceCheckUtils]: 1: Hoare triple {1132#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1097#true} is VALID [2020-07-10 18:46:18,882 INFO L280 TraceCheckUtils]: 2: Hoare triple {1097#true} #valid := #valid[0 := 0]; {1097#true} is VALID [2020-07-10 18:46:18,882 INFO L280 TraceCheckUtils]: 3: Hoare triple {1097#true} assume 0 < #StackHeapBarrier; {1097#true} is VALID [2020-07-10 18:46:18,882 INFO L280 TraceCheckUtils]: 4: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-10 18:46:18,883 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1097#true} {1097#true} #117#return; {1097#true} is VALID [2020-07-10 18:46:18,883 INFO L263 TraceCheckUtils]: 6: Hoare triple {1097#true} call #t~ret14 := main(); {1097#true} is VALID [2020-07-10 18:46:18,883 INFO L280 TraceCheckUtils]: 7: Hoare triple {1097#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {1097#true} is VALID [2020-07-10 18:46:18,884 INFO L280 TraceCheckUtils]: 8: Hoare triple {1097#true} ~n~0 := #t~nondet8; {1097#true} is VALID [2020-07-10 18:46:18,884 INFO L280 TraceCheckUtils]: 9: Hoare triple {1097#true} havoc #t~nondet8; {1097#true} is VALID [2020-07-10 18:46:18,884 INFO L263 TraceCheckUtils]: 10: Hoare triple {1097#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {1097#true} is VALID [2020-07-10 18:46:18,885 INFO L280 TraceCheckUtils]: 11: Hoare triple {1097#true} ~cond := #in~cond; {1097#true} is VALID [2020-07-10 18:46:18,885 INFO L280 TraceCheckUtils]: 12: Hoare triple {1097#true} assume !(0 == ~cond); {1097#true} is VALID [2020-07-10 18:46:18,885 INFO L280 TraceCheckUtils]: 13: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-10 18:46:18,885 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1097#true} {1097#true} #99#return; {1097#true} is VALID [2020-07-10 18:46:18,886 INFO L280 TraceCheckUtils]: 15: Hoare triple {1097#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {1097#true} is VALID [2020-07-10 18:46:18,886 INFO L280 TraceCheckUtils]: 16: Hoare triple {1097#true} ~i~0 := #t~nondet9; {1097#true} is VALID [2020-07-10 18:46:18,886 INFO L280 TraceCheckUtils]: 17: Hoare triple {1097#true} havoc #t~nondet9; {1097#true} is VALID [2020-07-10 18:46:18,887 INFO L263 TraceCheckUtils]: 18: Hoare triple {1097#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {1097#true} is VALID [2020-07-10 18:46:18,887 INFO L280 TraceCheckUtils]: 19: Hoare triple {1097#true} ~cond := #in~cond; {1097#true} is VALID [2020-07-10 18:46:18,887 INFO L280 TraceCheckUtils]: 20: Hoare triple {1097#true} assume !(0 == ~cond); {1097#true} is VALID [2020-07-10 18:46:18,887 INFO L280 TraceCheckUtils]: 21: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-10 18:46:18,888 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1097#true} {1097#true} #101#return; {1097#true} is VALID [2020-07-10 18:46:18,888 INFO L280 TraceCheckUtils]: 23: Hoare triple {1097#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {1097#true} is VALID [2020-07-10 18:46:18,890 INFO L263 TraceCheckUtils]: 24: Hoare triple {1097#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {1133#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 18:46:18,891 INFO L280 TraceCheckUtils]: 25: Hoare triple {1133#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1134#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 18:46:18,893 INFO L280 TraceCheckUtils]: 26: Hoare triple {1134#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {1134#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 18:46:18,894 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1134#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {1097#true} #103#return; {1115#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-10 18:46:18,895 INFO L280 TraceCheckUtils]: 28: Hoare triple {1115#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-10 18:46:18,895 INFO L263 TraceCheckUtils]: 29: Hoare triple {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {1097#true} is VALID [2020-07-10 18:46:18,896 INFO L280 TraceCheckUtils]: 30: Hoare triple {1097#true} ~x := #in~x; {1097#true} is VALID [2020-07-10 18:46:18,896 INFO L280 TraceCheckUtils]: 31: Hoare triple {1097#true} ~y := #in~y; {1097#true} is VALID [2020-07-10 18:46:18,896 INFO L280 TraceCheckUtils]: 32: Hoare triple {1097#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {1097#true} is VALID [2020-07-10 18:46:18,896 INFO L280 TraceCheckUtils]: 33: Hoare triple {1097#true} ~i := #in~i; {1097#true} is VALID [2020-07-10 18:46:18,897 INFO L280 TraceCheckUtils]: 34: Hoare triple {1097#true} ~n := #in~n; {1097#true} is VALID [2020-07-10 18:46:18,897 INFO L280 TraceCheckUtils]: 35: Hoare triple {1097#true} assume ~x >= ~y; {1097#true} is VALID [2020-07-10 18:46:18,897 INFO L280 TraceCheckUtils]: 36: Hoare triple {1097#true} #res := ~x; {1097#true} is VALID [2020-07-10 18:46:18,898 INFO L280 TraceCheckUtils]: 37: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-10 18:46:18,899 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1097#true} {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} #105#return; {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-10 18:46:18,900 INFO L280 TraceCheckUtils]: 39: Hoare triple {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-10 18:46:18,901 INFO L280 TraceCheckUtils]: 40: Hoare triple {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} ~x~0 := #t~ret11; {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-10 18:46:18,901 INFO L280 TraceCheckUtils]: 41: Hoare triple {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} havoc #t~ret11; {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-10 18:46:18,902 INFO L280 TraceCheckUtils]: 42: Hoare triple {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} SUMMARY for call #t~mem12 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L46 {1126#(and (= |main_#t~mem12| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base)))} is VALID [2020-07-10 18:46:18,903 INFO L280 TraceCheckUtils]: 43: Hoare triple {1126#(and (= |main_#t~mem12| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base)))} ~ai~1 := #t~mem12; {1127#(and (= 0 main_~ai~1) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base)))} is VALID [2020-07-10 18:46:18,904 INFO L280 TraceCheckUtils]: 44: Hoare triple {1127#(and (= 0 main_~ai~1) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base)))} havoc #t~mem12; {1127#(and (= 0 main_~ai~1) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base)))} is VALID [2020-07-10 18:46:18,905 INFO L280 TraceCheckUtils]: 45: Hoare triple {1127#(and (= 0 main_~ai~1) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base)))} SUMMARY for call #t~mem13 := read~int(~a~0.base, ~a~0.offset + 4 * ~x~0, 4); srcloc: L47 {1128#(and (= |main_#t~mem13| 0) (= 0 main_~ai~1))} is VALID [2020-07-10 18:46:18,906 INFO L280 TraceCheckUtils]: 46: Hoare triple {1128#(and (= |main_#t~mem13| 0) (= 0 main_~ai~1))} ~ax~1 := #t~mem13; {1129#(<= main_~ai~1 main_~ax~1)} is VALID [2020-07-10 18:46:18,906 INFO L280 TraceCheckUtils]: 47: Hoare triple {1129#(<= main_~ai~1 main_~ax~1)} havoc #t~mem13; {1129#(<= main_~ai~1 main_~ax~1)} is VALID [2020-07-10 18:46:18,907 INFO L263 TraceCheckUtils]: 48: Hoare triple {1129#(<= main_~ai~1 main_~ax~1)} call __VERIFIER_assert((if ~ai~1 <= ~ax~1 then 1 else 0)); {1130#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 18:46:18,908 INFO L280 TraceCheckUtils]: 49: Hoare triple {1130#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1131#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 18:46:18,909 INFO L280 TraceCheckUtils]: 50: Hoare triple {1131#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1098#false} is VALID [2020-07-10 18:46:18,909 INFO L280 TraceCheckUtils]: 51: Hoare triple {1098#false} assume !false; {1098#false} is VALID [2020-07-10 18:46:18,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 18:46:18,914 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:46:18,914 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [146436387] [2020-07-10 18:46:18,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:46:18,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-10 18:46:18,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034263577] [2020-07-10 18:46:18,916 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2020-07-10 18:46:18,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:46:18,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 18:46:18,991 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:46:18,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 18:46:18,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:46:18,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 18:46:18,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-07-10 18:46:18,993 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 13 states. [2020-07-10 18:46:21,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:46:21,834 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2020-07-10 18:46:21,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-10 18:46:21,835 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2020-07-10 18:46:21,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:46:21,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 18:46:21,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 91 transitions. [2020-07-10 18:46:21,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 18:46:21,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 91 transitions. [2020-07-10 18:46:21,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 91 transitions. [2020-07-10 18:46:21,961 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:46:21,969 INFO L225 Difference]: With dead ends: 128 [2020-07-10 18:46:21,970 INFO L226 Difference]: Without dead ends: 108 [2020-07-10 18:46:21,974 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2020-07-10 18:46:21,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-07-10 18:46:22,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2020-07-10 18:46:22,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:46:22,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 108 states. [2020-07-10 18:46:22,224 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 108 states. [2020-07-10 18:46:22,224 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 108 states. [2020-07-10 18:46:22,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:46:22,233 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2020-07-10 18:46:22,233 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2020-07-10 18:46:22,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:46:22,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:46:22,235 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 108 states. [2020-07-10 18:46:22,236 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 108 states. [2020-07-10 18:46:22,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:46:22,243 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2020-07-10 18:46:22,243 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2020-07-10 18:46:22,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:46:22,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:46:22,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:46:22,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:46:22,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-07-10 18:46:22,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2020-07-10 18:46:22,252 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 52 [2020-07-10 18:46:22,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:46:22,253 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2020-07-10 18:46:22,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 18:46:22,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 108 states and 116 transitions. [2020-07-10 18:46:22,466 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:46:22,467 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2020-07-10 18:46:22,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-10 18:46:22,469 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:46:22,469 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:46:22,469 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 18:46:22,470 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:46:22,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:46:22,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1709597342, now seen corresponding path program 1 times [2020-07-10 18:46:22,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:46:22,471 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [932101205] [2020-07-10 18:46:22,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:46:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:22,854 INFO L280 TraceCheckUtils]: 0: Hoare triple {1887#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1850#true} is VALID [2020-07-10 18:46:22,854 INFO L280 TraceCheckUtils]: 1: Hoare triple {1850#true} #valid := #valid[0 := 0]; {1850#true} is VALID [2020-07-10 18:46:22,854 INFO L280 TraceCheckUtils]: 2: Hoare triple {1850#true} assume 0 < #StackHeapBarrier; {1850#true} is VALID [2020-07-10 18:46:22,854 INFO L280 TraceCheckUtils]: 3: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-10 18:46:22,855 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1850#true} {1850#true} #117#return; {1850#true} is VALID [2020-07-10 18:46:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:22,863 INFO L280 TraceCheckUtils]: 0: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-10 18:46:22,863 INFO L280 TraceCheckUtils]: 1: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-10 18:46:22,864 INFO L280 TraceCheckUtils]: 2: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-10 18:46:22,864 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1850#true} {1850#true} #99#return; {1850#true} is VALID [2020-07-10 18:46:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:22,874 INFO L280 TraceCheckUtils]: 0: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-10 18:46:22,875 INFO L280 TraceCheckUtils]: 1: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-10 18:46:22,875 INFO L280 TraceCheckUtils]: 2: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-10 18:46:22,878 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1850#true} {1850#true} #101#return; {1850#true} is VALID [2020-07-10 18:46:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:22,906 INFO L280 TraceCheckUtils]: 0: Hoare triple {1888#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1850#true} is VALID [2020-07-10 18:46:22,907 INFO L280 TraceCheckUtils]: 1: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-10 18:46:22,907 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1850#true} {1850#true} #103#return; {1850#true} is VALID [2020-07-10 18:46:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:22,932 INFO L280 TraceCheckUtils]: 0: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-10 18:46:22,933 INFO L280 TraceCheckUtils]: 1: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-10 18:46:22,933 INFO L280 TraceCheckUtils]: 2: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-10 18:46:22,934 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1850#true} {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:22,946 INFO L280 TraceCheckUtils]: 0: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-10 18:46:22,947 INFO L280 TraceCheckUtils]: 1: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-10 18:46:22,947 INFO L280 TraceCheckUtils]: 2: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-10 18:46:22,948 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1850#true} {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:22,948 INFO L263 TraceCheckUtils]: 0: Hoare triple {1850#true} call ULTIMATE.init(); {1887#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 18:46:22,949 INFO L280 TraceCheckUtils]: 1: Hoare triple {1887#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1850#true} is VALID [2020-07-10 18:46:22,949 INFO L280 TraceCheckUtils]: 2: Hoare triple {1850#true} #valid := #valid[0 := 0]; {1850#true} is VALID [2020-07-10 18:46:22,949 INFO L280 TraceCheckUtils]: 3: Hoare triple {1850#true} assume 0 < #StackHeapBarrier; {1850#true} is VALID [2020-07-10 18:46:22,949 INFO L280 TraceCheckUtils]: 4: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-10 18:46:22,949 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1850#true} {1850#true} #117#return; {1850#true} is VALID [2020-07-10 18:46:22,950 INFO L263 TraceCheckUtils]: 6: Hoare triple {1850#true} call #t~ret14 := main(); {1850#true} is VALID [2020-07-10 18:46:22,950 INFO L280 TraceCheckUtils]: 7: Hoare triple {1850#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {1850#true} is VALID [2020-07-10 18:46:22,950 INFO L280 TraceCheckUtils]: 8: Hoare triple {1850#true} ~n~0 := #t~nondet8; {1850#true} is VALID [2020-07-10 18:46:22,950 INFO L280 TraceCheckUtils]: 9: Hoare triple {1850#true} havoc #t~nondet8; {1850#true} is VALID [2020-07-10 18:46:22,951 INFO L263 TraceCheckUtils]: 10: Hoare triple {1850#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {1850#true} is VALID [2020-07-10 18:46:22,951 INFO L280 TraceCheckUtils]: 11: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-10 18:46:22,951 INFO L280 TraceCheckUtils]: 12: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-10 18:46:22,952 INFO L280 TraceCheckUtils]: 13: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-10 18:46:22,952 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1850#true} {1850#true} #99#return; {1850#true} is VALID [2020-07-10 18:46:22,952 INFO L280 TraceCheckUtils]: 15: Hoare triple {1850#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {1850#true} is VALID [2020-07-10 18:46:22,952 INFO L280 TraceCheckUtils]: 16: Hoare triple {1850#true} ~i~0 := #t~nondet9; {1850#true} is VALID [2020-07-10 18:46:22,952 INFO L280 TraceCheckUtils]: 17: Hoare triple {1850#true} havoc #t~nondet9; {1850#true} is VALID [2020-07-10 18:46:22,953 INFO L263 TraceCheckUtils]: 18: Hoare triple {1850#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {1850#true} is VALID [2020-07-10 18:46:22,953 INFO L280 TraceCheckUtils]: 19: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-10 18:46:22,953 INFO L280 TraceCheckUtils]: 20: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-10 18:46:22,953 INFO L280 TraceCheckUtils]: 21: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-10 18:46:22,954 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1850#true} {1850#true} #101#return; {1850#true} is VALID [2020-07-10 18:46:22,954 INFO L280 TraceCheckUtils]: 23: Hoare triple {1850#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {1850#true} is VALID [2020-07-10 18:46:22,960 INFO L263 TraceCheckUtils]: 24: Hoare triple {1850#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {1888#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 18:46:22,961 INFO L280 TraceCheckUtils]: 25: Hoare triple {1888#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1850#true} is VALID [2020-07-10 18:46:22,961 INFO L280 TraceCheckUtils]: 26: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-10 18:46:22,961 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1850#true} {1850#true} #103#return; {1850#true} is VALID [2020-07-10 18:46:22,961 INFO L280 TraceCheckUtils]: 28: Hoare triple {1850#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {1850#true} is VALID [2020-07-10 18:46:22,962 INFO L263 TraceCheckUtils]: 29: Hoare triple {1850#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {1868#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-10 18:46:22,963 INFO L280 TraceCheckUtils]: 30: Hoare triple {1868#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} ~x := #in~x; {1869#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-10 18:46:22,964 INFO L280 TraceCheckUtils]: 31: Hoare triple {1869#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {1870#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-10 18:46:22,964 INFO L280 TraceCheckUtils]: 32: Hoare triple {1870#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {1870#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-10 18:46:22,965 INFO L280 TraceCheckUtils]: 33: Hoare triple {1870#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~i := #in~i; {1870#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-10 18:46:22,967 INFO L280 TraceCheckUtils]: 34: Hoare triple {1870#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~n := #in~n; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:22,968 INFO L280 TraceCheckUtils]: 35: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:22,969 INFO L263 TraceCheckUtils]: 36: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {1850#true} is VALID [2020-07-10 18:46:22,969 INFO L280 TraceCheckUtils]: 37: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-10 18:46:22,969 INFO L280 TraceCheckUtils]: 38: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-10 18:46:22,970 INFO L280 TraceCheckUtils]: 39: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-10 18:46:22,971 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {1850#true} {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:22,971 INFO L263 TraceCheckUtils]: 41: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {1850#true} is VALID [2020-07-10 18:46:22,971 INFO L280 TraceCheckUtils]: 42: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-10 18:46:22,971 INFO L280 TraceCheckUtils]: 43: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-10 18:46:22,972 INFO L280 TraceCheckUtils]: 44: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-10 18:46:22,973 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1850#true} {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:22,973 INFO L280 TraceCheckUtils]: 46: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~x0~0 := ~x; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:22,974 INFO L280 TraceCheckUtils]: 47: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~y0~0 := ~y; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:22,975 INFO L280 TraceCheckUtils]: 48: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:22,976 INFO L280 TraceCheckUtils]: 49: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:22,977 INFO L280 TraceCheckUtils]: 50: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume #t~mem1 <= #t~mem2; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:22,977 INFO L280 TraceCheckUtils]: 51: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem1; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:22,978 INFO L280 TraceCheckUtils]: 52: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem2; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:22,979 INFO L280 TraceCheckUtils]: 53: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #t~post3 := ~x; {1880#(and (= 0 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:22,980 INFO L280 TraceCheckUtils]: 54: Hoare triple {1880#(and (= 0 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} ~x := 1 + #t~post3; {1881#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:22,980 INFO L280 TraceCheckUtils]: 55: Hoare triple {1881#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~post3; {1881#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:22,982 INFO L263 TraceCheckUtils]: 56: Hoare triple {1881#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {1882#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-10 18:46:22,982 INFO L280 TraceCheckUtils]: 57: Hoare triple {1882#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~x := #in~x; {1883#(and (<= 1 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-10 18:46:22,983 INFO L280 TraceCheckUtils]: 58: Hoare triple {1883#(and (<= 1 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {1884#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-10 18:46:22,984 INFO L280 TraceCheckUtils]: 59: Hoare triple {1884#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {1884#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-10 18:46:22,986 INFO L280 TraceCheckUtils]: 60: Hoare triple {1884#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~i := #in~i; {1884#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-10 18:46:22,986 INFO L280 TraceCheckUtils]: 61: Hoare triple {1884#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~n := #in~n; {1881#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:22,987 INFO L280 TraceCheckUtils]: 62: Hoare triple {1881#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume !(~x >= ~y); {1881#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:22,988 INFO L263 TraceCheckUtils]: 63: Hoare triple {1881#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {1885#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 18:46:22,990 INFO L280 TraceCheckUtils]: 64: Hoare triple {1885#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1886#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 18:46:22,991 INFO L280 TraceCheckUtils]: 65: Hoare triple {1886#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1851#false} is VALID [2020-07-10 18:46:22,991 INFO L280 TraceCheckUtils]: 66: Hoare triple {1851#false} assume !false; {1851#false} is VALID [2020-07-10 18:46:22,998 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-10 18:46:22,998 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:46:22,999 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [932101205] [2020-07-10 18:46:22,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:46:22,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-10 18:46:22,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722617469] [2020-07-10 18:46:23,000 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-07-10 18:46:23,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:46:23,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-10 18:46:23,064 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:46:23,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-10 18:46:23,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:46:23,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-10 18:46:23,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-07-10 18:46:23,066 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 15 states. [2020-07-10 18:46:28,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:46:28,784 INFO L93 Difference]: Finished difference Result 179 states and 194 transitions. [2020-07-10 18:46:28,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-10 18:46:28,784 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-07-10 18:46:28,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:46:28,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 18:46:28,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 191 transitions. [2020-07-10 18:46:28,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 18:46:28,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 191 transitions. [2020-07-10 18:46:28,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 191 transitions. [2020-07-10 18:46:29,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:46:29,143 INFO L225 Difference]: With dead ends: 179 [2020-07-10 18:46:29,143 INFO L226 Difference]: Without dead ends: 177 [2020-07-10 18:46:29,144 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2020-07-10 18:46:29,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-07-10 18:46:29,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 151. [2020-07-10 18:46:29,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:46:29,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand 151 states. [2020-07-10 18:46:29,541 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 151 states. [2020-07-10 18:46:29,542 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 151 states. [2020-07-10 18:46:29,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:46:29,550 INFO L93 Difference]: Finished difference Result 177 states and 192 transitions. [2020-07-10 18:46:29,550 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 192 transitions. [2020-07-10 18:46:29,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:46:29,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:46:29,551 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 177 states. [2020-07-10 18:46:29,552 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 177 states. [2020-07-10 18:46:29,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:46:29,560 INFO L93 Difference]: Finished difference Result 177 states and 192 transitions. [2020-07-10 18:46:29,560 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 192 transitions. [2020-07-10 18:46:29,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:46:29,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:46:29,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:46:29,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:46:29,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-07-10 18:46:29,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 164 transitions. [2020-07-10 18:46:29,568 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 164 transitions. Word has length 67 [2020-07-10 18:46:29,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:46:29,568 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 164 transitions. [2020-07-10 18:46:29,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-10 18:46:29,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 151 states and 164 transitions. [2020-07-10 18:46:29,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:46:29,860 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 164 transitions. [2020-07-10 18:46:29,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-10 18:46:29,862 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:46:29,862 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:46:29,862 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 18:46:29,862 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:46:29,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:46:29,863 INFO L82 PathProgramCache]: Analyzing trace with hash 587834366, now seen corresponding path program 1 times [2020-07-10 18:46:29,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:46:29,863 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1304043073] [2020-07-10 18:46:29,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:46:29,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:30,175 INFO L280 TraceCheckUtils]: 0: Hoare triple {2974#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2937#true} is VALID [2020-07-10 18:46:30,175 INFO L280 TraceCheckUtils]: 1: Hoare triple {2937#true} #valid := #valid[0 := 0]; {2937#true} is VALID [2020-07-10 18:46:30,175 INFO L280 TraceCheckUtils]: 2: Hoare triple {2937#true} assume 0 < #StackHeapBarrier; {2937#true} is VALID [2020-07-10 18:46:30,176 INFO L280 TraceCheckUtils]: 3: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-10 18:46:30,176 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2937#true} {2937#true} #117#return; {2937#true} is VALID [2020-07-10 18:46:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:30,188 INFO L280 TraceCheckUtils]: 0: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-10 18:46:30,189 INFO L280 TraceCheckUtils]: 1: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-10 18:46:30,190 INFO L280 TraceCheckUtils]: 2: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-10 18:46:30,190 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2937#true} {2937#true} #99#return; {2937#true} is VALID [2020-07-10 18:46:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:30,198 INFO L280 TraceCheckUtils]: 0: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-10 18:46:30,198 INFO L280 TraceCheckUtils]: 1: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-10 18:46:30,198 INFO L280 TraceCheckUtils]: 2: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-10 18:46:30,199 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2937#true} {2937#true} #101#return; {2937#true} is VALID [2020-07-10 18:46:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:30,219 INFO L280 TraceCheckUtils]: 0: Hoare triple {2975#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2937#true} is VALID [2020-07-10 18:46:30,220 INFO L280 TraceCheckUtils]: 1: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-10 18:46:30,220 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2937#true} {2937#true} #103#return; {2937#true} is VALID [2020-07-10 18:46:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:30,227 INFO L280 TraceCheckUtils]: 0: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-10 18:46:30,227 INFO L280 TraceCheckUtils]: 1: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-10 18:46:30,227 INFO L280 TraceCheckUtils]: 2: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-10 18:46:30,228 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2937#true} {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:30,236 INFO L280 TraceCheckUtils]: 0: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-10 18:46:30,236 INFO L280 TraceCheckUtils]: 1: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-10 18:46:30,236 INFO L280 TraceCheckUtils]: 2: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-10 18:46:30,237 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2937#true} {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:30,240 INFO L263 TraceCheckUtils]: 0: Hoare triple {2937#true} call ULTIMATE.init(); {2974#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 18:46:30,241 INFO L280 TraceCheckUtils]: 1: Hoare triple {2974#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2937#true} is VALID [2020-07-10 18:46:30,241 INFO L280 TraceCheckUtils]: 2: Hoare triple {2937#true} #valid := #valid[0 := 0]; {2937#true} is VALID [2020-07-10 18:46:30,241 INFO L280 TraceCheckUtils]: 3: Hoare triple {2937#true} assume 0 < #StackHeapBarrier; {2937#true} is VALID [2020-07-10 18:46:30,241 INFO L280 TraceCheckUtils]: 4: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-10 18:46:30,242 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2937#true} {2937#true} #117#return; {2937#true} is VALID [2020-07-10 18:46:30,242 INFO L263 TraceCheckUtils]: 6: Hoare triple {2937#true} call #t~ret14 := main(); {2937#true} is VALID [2020-07-10 18:46:30,242 INFO L280 TraceCheckUtils]: 7: Hoare triple {2937#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2937#true} is VALID [2020-07-10 18:46:30,243 INFO L280 TraceCheckUtils]: 8: Hoare triple {2937#true} ~n~0 := #t~nondet8; {2937#true} is VALID [2020-07-10 18:46:30,243 INFO L280 TraceCheckUtils]: 9: Hoare triple {2937#true} havoc #t~nondet8; {2937#true} is VALID [2020-07-10 18:46:30,243 INFO L263 TraceCheckUtils]: 10: Hoare triple {2937#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {2937#true} is VALID [2020-07-10 18:46:30,243 INFO L280 TraceCheckUtils]: 11: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-10 18:46:30,244 INFO L280 TraceCheckUtils]: 12: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-10 18:46:30,244 INFO L280 TraceCheckUtils]: 13: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-10 18:46:30,244 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2937#true} {2937#true} #99#return; {2937#true} is VALID [2020-07-10 18:46:30,244 INFO L280 TraceCheckUtils]: 15: Hoare triple {2937#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {2937#true} is VALID [2020-07-10 18:46:30,245 INFO L280 TraceCheckUtils]: 16: Hoare triple {2937#true} ~i~0 := #t~nondet9; {2937#true} is VALID [2020-07-10 18:46:30,245 INFO L280 TraceCheckUtils]: 17: Hoare triple {2937#true} havoc #t~nondet9; {2937#true} is VALID [2020-07-10 18:46:30,245 INFO L263 TraceCheckUtils]: 18: Hoare triple {2937#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {2937#true} is VALID [2020-07-10 18:46:30,245 INFO L280 TraceCheckUtils]: 19: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-10 18:46:30,245 INFO L280 TraceCheckUtils]: 20: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-10 18:46:30,246 INFO L280 TraceCheckUtils]: 21: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-10 18:46:30,246 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2937#true} {2937#true} #101#return; {2937#true} is VALID [2020-07-10 18:46:30,246 INFO L280 TraceCheckUtils]: 23: Hoare triple {2937#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {2937#true} is VALID [2020-07-10 18:46:30,252 INFO L263 TraceCheckUtils]: 24: Hoare triple {2937#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {2975#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 18:46:30,252 INFO L280 TraceCheckUtils]: 25: Hoare triple {2975#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2937#true} is VALID [2020-07-10 18:46:30,253 INFO L280 TraceCheckUtils]: 26: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-10 18:46:30,253 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2937#true} {2937#true} #103#return; {2937#true} is VALID [2020-07-10 18:46:30,253 INFO L280 TraceCheckUtils]: 28: Hoare triple {2937#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {2937#true} is VALID [2020-07-10 18:46:30,254 INFO L263 TraceCheckUtils]: 29: Hoare triple {2937#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {2955#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-10 18:46:30,255 INFO L280 TraceCheckUtils]: 30: Hoare triple {2955#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} ~x := #in~x; {2956#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-10 18:46:30,256 INFO L280 TraceCheckUtils]: 31: Hoare triple {2956#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {2957#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-10 18:46:30,256 INFO L280 TraceCheckUtils]: 32: Hoare triple {2957#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {2957#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-10 18:46:30,257 INFO L280 TraceCheckUtils]: 33: Hoare triple {2957#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~i := #in~i; {2957#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-10 18:46:30,258 INFO L280 TraceCheckUtils]: 34: Hoare triple {2957#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~n := #in~n; {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:30,258 INFO L280 TraceCheckUtils]: 35: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:30,259 INFO L263 TraceCheckUtils]: 36: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {2937#true} is VALID [2020-07-10 18:46:30,259 INFO L280 TraceCheckUtils]: 37: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-10 18:46:30,259 INFO L280 TraceCheckUtils]: 38: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-10 18:46:30,259 INFO L280 TraceCheckUtils]: 39: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-10 18:46:30,260 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2937#true} {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:30,260 INFO L263 TraceCheckUtils]: 41: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {2937#true} is VALID [2020-07-10 18:46:30,261 INFO L280 TraceCheckUtils]: 42: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-10 18:46:30,261 INFO L280 TraceCheckUtils]: 43: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-10 18:46:30,261 INFO L280 TraceCheckUtils]: 44: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-10 18:46:30,262 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {2937#true} {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:30,263 INFO L280 TraceCheckUtils]: 46: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~x0~0 := ~x; {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:30,263 INFO L280 TraceCheckUtils]: 47: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~y0~0 := ~y; {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:30,264 INFO L280 TraceCheckUtils]: 48: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:30,265 INFO L280 TraceCheckUtils]: 49: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:30,265 INFO L280 TraceCheckUtils]: 50: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(#t~mem1 <= #t~mem2); {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:30,266 INFO L280 TraceCheckUtils]: 51: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem1; {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:30,267 INFO L280 TraceCheckUtils]: 52: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem2; {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:30,268 INFO L280 TraceCheckUtils]: 53: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #t~post4 := ~y; {2967#(and (= 0 check_~x) (<= (+ |check_#t~post4| 1) check_~n))} is VALID [2020-07-10 18:46:30,276 INFO L280 TraceCheckUtils]: 54: Hoare triple {2967#(and (= 0 check_~x) (<= (+ |check_#t~post4| 1) check_~n))} ~y := #t~post4 - 1; {2968#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-10 18:46:30,277 INFO L280 TraceCheckUtils]: 55: Hoare triple {2968#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} havoc #t~post4; {2968#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-10 18:46:30,279 INFO L263 TraceCheckUtils]: 56: Hoare triple {2968#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {2969#(and (= 0 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} is VALID [2020-07-10 18:46:30,280 INFO L280 TraceCheckUtils]: 57: Hoare triple {2969#(and (= 0 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} ~x := #in~x; {2970#(and (= 0 check_~x) (<= (+ |check_#in~y| 2) |check_#in~n|))} is VALID [2020-07-10 18:46:30,282 INFO L280 TraceCheckUtils]: 58: Hoare triple {2970#(and (= 0 check_~x) (<= (+ |check_#in~y| 2) |check_#in~n|))} ~y := #in~y; {2971#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-10 18:46:30,283 INFO L280 TraceCheckUtils]: 59: Hoare triple {2971#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {2971#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-10 18:46:30,283 INFO L280 TraceCheckUtils]: 60: Hoare triple {2971#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~i := #in~i; {2971#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-10 18:46:30,284 INFO L280 TraceCheckUtils]: 61: Hoare triple {2971#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~n := #in~n; {2968#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-10 18:46:30,285 INFO L280 TraceCheckUtils]: 62: Hoare triple {2968#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} assume !(~x >= ~y); {2968#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-10 18:46:30,286 INFO L263 TraceCheckUtils]: 63: Hoare triple {2968#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {2972#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 18:46:30,287 INFO L280 TraceCheckUtils]: 64: Hoare triple {2972#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2973#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 18:46:30,287 INFO L280 TraceCheckUtils]: 65: Hoare triple {2973#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2938#false} is VALID [2020-07-10 18:46:30,287 INFO L280 TraceCheckUtils]: 66: Hoare triple {2938#false} assume !false; {2938#false} is VALID [2020-07-10 18:46:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-10 18:46:30,295 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:46:30,295 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1304043073] [2020-07-10 18:46:30,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:46:30,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-10 18:46:30,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609701235] [2020-07-10 18:46:30,297 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-07-10 18:46:30,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:46:30,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-10 18:46:30,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:46:30,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-10 18:46:30,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:46:30,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-10 18:46:30,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-07-10 18:46:30,360 INFO L87 Difference]: Start difference. First operand 151 states and 164 transitions. Second operand 15 states. [2020-07-10 18:46:35,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:46:35,325 INFO L93 Difference]: Finished difference Result 221 states and 242 transitions. [2020-07-10 18:46:35,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-10 18:46:35,326 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-07-10 18:46:35,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:46:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 18:46:35,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 193 transitions. [2020-07-10 18:46:35,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 18:46:35,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 193 transitions. [2020-07-10 18:46:35,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 193 transitions. [2020-07-10 18:46:35,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:46:35,687 INFO L225 Difference]: With dead ends: 221 [2020-07-10 18:46:35,687 INFO L226 Difference]: Without dead ends: 219 [2020-07-10 18:46:35,688 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=250, Invalid=806, Unknown=0, NotChecked=0, Total=1056 [2020-07-10 18:46:35,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-07-10 18:46:36,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 194. [2020-07-10 18:46:36,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:46:36,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand 194 states. [2020-07-10 18:46:36,283 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand 194 states. [2020-07-10 18:46:36,283 INFO L87 Difference]: Start difference. First operand 219 states. Second operand 194 states. [2020-07-10 18:46:36,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:46:36,293 INFO L93 Difference]: Finished difference Result 219 states and 240 transitions. [2020-07-10 18:46:36,293 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 240 transitions. [2020-07-10 18:46:36,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:46:36,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:46:36,294 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 219 states. [2020-07-10 18:46:36,295 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 219 states. [2020-07-10 18:46:36,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:46:36,305 INFO L93 Difference]: Finished difference Result 219 states and 240 transitions. [2020-07-10 18:46:36,305 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 240 transitions. [2020-07-10 18:46:36,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:46:36,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:46:36,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:46:36,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:46:36,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-07-10 18:46:36,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 212 transitions. [2020-07-10 18:46:36,315 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 212 transitions. Word has length 67 [2020-07-10 18:46:36,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:46:36,316 INFO L479 AbstractCegarLoop]: Abstraction has 194 states and 212 transitions. [2020-07-10 18:46:36,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-10 18:46:36,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 194 states and 212 transitions. [2020-07-10 18:46:36,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:46:36,721 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 212 transitions. [2020-07-10 18:46:36,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-07-10 18:46:36,723 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:46:36,723 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:46:36,724 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 18:46:36,724 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:46:36,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:46:36,724 INFO L82 PathProgramCache]: Analyzing trace with hash 687369648, now seen corresponding path program 1 times [2020-07-10 18:46:36,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:46:36,725 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1603343575] [2020-07-10 18:46:36,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:46:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:36,954 INFO L280 TraceCheckUtils]: 0: Hoare triple {4328#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4283#true} is VALID [2020-07-10 18:46:36,954 INFO L280 TraceCheckUtils]: 1: Hoare triple {4283#true} #valid := #valid[0 := 0]; {4283#true} is VALID [2020-07-10 18:46:36,954 INFO L280 TraceCheckUtils]: 2: Hoare triple {4283#true} assume 0 < #StackHeapBarrier; {4283#true} is VALID [2020-07-10 18:46:36,954 INFO L280 TraceCheckUtils]: 3: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-10 18:46:36,955 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4283#true} {4283#true} #117#return; {4283#true} is VALID [2020-07-10 18:46:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:36,958 INFO L280 TraceCheckUtils]: 0: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-10 18:46:36,959 INFO L280 TraceCheckUtils]: 1: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-10 18:46:36,959 INFO L280 TraceCheckUtils]: 2: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-10 18:46:36,959 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4283#true} {4283#true} #99#return; {4283#true} is VALID [2020-07-10 18:46:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:36,967 INFO L280 TraceCheckUtils]: 0: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-10 18:46:36,967 INFO L280 TraceCheckUtils]: 1: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-10 18:46:36,967 INFO L280 TraceCheckUtils]: 2: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-10 18:46:36,968 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4283#true} {4283#true} #101#return; {4283#true} is VALID [2020-07-10 18:46:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:37,008 INFO L280 TraceCheckUtils]: 0: Hoare triple {4329#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4330#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 18:46:37,009 INFO L280 TraceCheckUtils]: 1: Hoare triple {4330#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {4330#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 18:46:37,011 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4330#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {4283#true} #103#return; {4301#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-10 18:46:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:37,020 INFO L280 TraceCheckUtils]: 0: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-10 18:46:37,020 INFO L280 TraceCheckUtils]: 1: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-10 18:46:37,021 INFO L280 TraceCheckUtils]: 2: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-10 18:46:37,021 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4283#true} {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #109#return; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:46:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:37,026 INFO L280 TraceCheckUtils]: 0: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-10 18:46:37,027 INFO L280 TraceCheckUtils]: 1: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-10 18:46:37,027 INFO L280 TraceCheckUtils]: 2: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-10 18:46:37,028 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4283#true} {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #111#return; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:46:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:37,034 INFO L280 TraceCheckUtils]: 0: Hoare triple {4283#true} ~x := #in~x; {4283#true} is VALID [2020-07-10 18:46:37,035 INFO L280 TraceCheckUtils]: 1: Hoare triple {4283#true} ~y := #in~y; {4283#true} is VALID [2020-07-10 18:46:37,035 INFO L280 TraceCheckUtils]: 2: Hoare triple {4283#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {4283#true} is VALID [2020-07-10 18:46:37,035 INFO L280 TraceCheckUtils]: 3: Hoare triple {4283#true} ~i := #in~i; {4283#true} is VALID [2020-07-10 18:46:37,036 INFO L280 TraceCheckUtils]: 4: Hoare triple {4283#true} ~n := #in~n; {4283#true} is VALID [2020-07-10 18:46:37,036 INFO L280 TraceCheckUtils]: 5: Hoare triple {4283#true} assume ~x >= ~y; {4283#true} is VALID [2020-07-10 18:46:37,036 INFO L280 TraceCheckUtils]: 6: Hoare triple {4283#true} #res := ~x; {4283#true} is VALID [2020-07-10 18:46:37,037 INFO L280 TraceCheckUtils]: 7: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-10 18:46:37,038 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {4283#true} {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #113#return; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:46:37,039 INFO L263 TraceCheckUtils]: 0: Hoare triple {4283#true} call ULTIMATE.init(); {4328#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 18:46:37,039 INFO L280 TraceCheckUtils]: 1: Hoare triple {4328#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4283#true} is VALID [2020-07-10 18:46:37,039 INFO L280 TraceCheckUtils]: 2: Hoare triple {4283#true} #valid := #valid[0 := 0]; {4283#true} is VALID [2020-07-10 18:46:37,040 INFO L280 TraceCheckUtils]: 3: Hoare triple {4283#true} assume 0 < #StackHeapBarrier; {4283#true} is VALID [2020-07-10 18:46:37,040 INFO L280 TraceCheckUtils]: 4: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-10 18:46:37,040 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4283#true} {4283#true} #117#return; {4283#true} is VALID [2020-07-10 18:46:37,040 INFO L263 TraceCheckUtils]: 6: Hoare triple {4283#true} call #t~ret14 := main(); {4283#true} is VALID [2020-07-10 18:46:37,041 INFO L280 TraceCheckUtils]: 7: Hoare triple {4283#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {4283#true} is VALID [2020-07-10 18:46:37,041 INFO L280 TraceCheckUtils]: 8: Hoare triple {4283#true} ~n~0 := #t~nondet8; {4283#true} is VALID [2020-07-10 18:46:37,041 INFO L280 TraceCheckUtils]: 9: Hoare triple {4283#true} havoc #t~nondet8; {4283#true} is VALID [2020-07-10 18:46:37,041 INFO L263 TraceCheckUtils]: 10: Hoare triple {4283#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {4283#true} is VALID [2020-07-10 18:46:37,042 INFO L280 TraceCheckUtils]: 11: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-10 18:46:37,042 INFO L280 TraceCheckUtils]: 12: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-10 18:46:37,042 INFO L280 TraceCheckUtils]: 13: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-10 18:46:37,042 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {4283#true} {4283#true} #99#return; {4283#true} is VALID [2020-07-10 18:46:37,043 INFO L280 TraceCheckUtils]: 15: Hoare triple {4283#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {4283#true} is VALID [2020-07-10 18:46:37,043 INFO L280 TraceCheckUtils]: 16: Hoare triple {4283#true} ~i~0 := #t~nondet9; {4283#true} is VALID [2020-07-10 18:46:37,043 INFO L280 TraceCheckUtils]: 17: Hoare triple {4283#true} havoc #t~nondet9; {4283#true} is VALID [2020-07-10 18:46:37,043 INFO L263 TraceCheckUtils]: 18: Hoare triple {4283#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {4283#true} is VALID [2020-07-10 18:46:37,043 INFO L280 TraceCheckUtils]: 19: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-10 18:46:37,044 INFO L280 TraceCheckUtils]: 20: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-10 18:46:37,044 INFO L280 TraceCheckUtils]: 21: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-10 18:46:37,044 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {4283#true} {4283#true} #101#return; {4283#true} is VALID [2020-07-10 18:46:37,044 INFO L280 TraceCheckUtils]: 23: Hoare triple {4283#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {4283#true} is VALID [2020-07-10 18:46:37,046 INFO L263 TraceCheckUtils]: 24: Hoare triple {4283#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {4329#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 18:46:37,046 INFO L280 TraceCheckUtils]: 25: Hoare triple {4329#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4330#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 18:46:37,047 INFO L280 TraceCheckUtils]: 26: Hoare triple {4330#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {4330#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 18:46:37,048 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {4330#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {4283#true} #103#return; {4301#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-10 18:46:37,049 INFO L280 TraceCheckUtils]: 28: Hoare triple {4301#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {4302#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-10 18:46:37,050 INFO L263 TraceCheckUtils]: 29: Hoare triple {4302#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {4303#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-10 18:46:37,051 INFO L280 TraceCheckUtils]: 30: Hoare triple {4303#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~x := #in~x; {4303#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-10 18:46:37,052 INFO L280 TraceCheckUtils]: 31: Hoare triple {4303#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~y := #in~y; {4303#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-10 18:46:37,052 INFO L280 TraceCheckUtils]: 32: Hoare triple {4303#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:46:37,053 INFO L280 TraceCheckUtils]: 33: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~i := #in~i; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:46:37,060 INFO L280 TraceCheckUtils]: 34: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~n := #in~n; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:46:37,063 INFO L280 TraceCheckUtils]: 35: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume !(~x >= ~y); {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:46:37,063 INFO L263 TraceCheckUtils]: 36: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {4283#true} is VALID [2020-07-10 18:46:37,063 INFO L280 TraceCheckUtils]: 37: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-10 18:46:37,063 INFO L280 TraceCheckUtils]: 38: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-10 18:46:37,064 INFO L280 TraceCheckUtils]: 39: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-10 18:46:37,079 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {4283#true} {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #109#return; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:46:37,079 INFO L263 TraceCheckUtils]: 41: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {4283#true} is VALID [2020-07-10 18:46:37,079 INFO L280 TraceCheckUtils]: 42: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-10 18:46:37,080 INFO L280 TraceCheckUtils]: 43: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-10 18:46:37,080 INFO L280 TraceCheckUtils]: 44: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-10 18:46:37,082 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {4283#true} {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #111#return; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:46:37,083 INFO L280 TraceCheckUtils]: 46: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~x0~0 := ~x; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:46:37,083 INFO L280 TraceCheckUtils]: 47: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~y0~0 := ~y; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:46:37,084 INFO L280 TraceCheckUtils]: 48: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:46:37,085 INFO L280 TraceCheckUtils]: 49: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:46:37,085 INFO L280 TraceCheckUtils]: 50: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume #t~mem1 <= #t~mem2; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:46:37,086 INFO L280 TraceCheckUtils]: 51: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} havoc #t~mem1; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:46:37,091 INFO L280 TraceCheckUtils]: 52: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} havoc #t~mem2; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:46:37,092 INFO L280 TraceCheckUtils]: 53: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #t~post3 := ~x; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:46:37,092 INFO L280 TraceCheckUtils]: 54: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~x := 1 + #t~post3; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:46:37,093 INFO L280 TraceCheckUtils]: 55: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} havoc #t~post3; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:46:37,093 INFO L263 TraceCheckUtils]: 56: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {4283#true} is VALID [2020-07-10 18:46:37,093 INFO L280 TraceCheckUtils]: 57: Hoare triple {4283#true} ~x := #in~x; {4283#true} is VALID [2020-07-10 18:46:37,093 INFO L280 TraceCheckUtils]: 58: Hoare triple {4283#true} ~y := #in~y; {4283#true} is VALID [2020-07-10 18:46:37,094 INFO L280 TraceCheckUtils]: 59: Hoare triple {4283#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {4283#true} is VALID [2020-07-10 18:46:37,094 INFO L280 TraceCheckUtils]: 60: Hoare triple {4283#true} ~i := #in~i; {4283#true} is VALID [2020-07-10 18:46:37,094 INFO L280 TraceCheckUtils]: 61: Hoare triple {4283#true} ~n := #in~n; {4283#true} is VALID [2020-07-10 18:46:37,094 INFO L280 TraceCheckUtils]: 62: Hoare triple {4283#true} assume ~x >= ~y; {4283#true} is VALID [2020-07-10 18:46:37,094 INFO L280 TraceCheckUtils]: 63: Hoare triple {4283#true} #res := ~x; {4283#true} is VALID [2020-07-10 18:46:37,095 INFO L280 TraceCheckUtils]: 64: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-10 18:46:37,097 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {4283#true} {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #113#return; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:46:37,098 INFO L280 TraceCheckUtils]: 66: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:46:37,098 INFO L280 TraceCheckUtils]: 67: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~x1~0 := #t~ret5; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:46:37,099 INFO L280 TraceCheckUtils]: 68: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} havoc #t~ret5; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:46:37,100 INFO L280 TraceCheckUtils]: 69: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} SUMMARY for call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~i, 4); srcloc: L31 {4322#(and (= 0 |check_#t~mem6|) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)))} is VALID [2020-07-10 18:46:37,101 INFO L280 TraceCheckUtils]: 70: Hoare triple {4322#(and (= 0 |check_#t~mem6|) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)))} ~ai~0 := #t~mem6; {4323#(and (= 0 check_~ai~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)))} is VALID [2020-07-10 18:46:37,102 INFO L280 TraceCheckUtils]: 71: Hoare triple {4323#(and (= 0 check_~ai~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)))} havoc #t~mem6; {4323#(and (= 0 check_~ai~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)))} is VALID [2020-07-10 18:46:37,103 INFO L280 TraceCheckUtils]: 72: Hoare triple {4323#(and (= 0 check_~ai~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)))} SUMMARY for call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~x1~0, 4); srcloc: L32 {4324#(and (= 0 check_~ai~0) (= 0 |check_#t~mem7|))} is VALID [2020-07-10 18:46:37,104 INFO L280 TraceCheckUtils]: 73: Hoare triple {4324#(and (= 0 check_~ai~0) (= 0 |check_#t~mem7|))} ~ax~0 := #t~mem7; {4325#(and (= 0 check_~ax~0) (= 0 check_~ai~0))} is VALID [2020-07-10 18:46:37,105 INFO L280 TraceCheckUtils]: 74: Hoare triple {4325#(and (= 0 check_~ax~0) (= 0 check_~ai~0))} havoc #t~mem7; {4325#(and (= 0 check_~ax~0) (= 0 check_~ai~0))} is VALID [2020-07-10 18:46:37,106 INFO L263 TraceCheckUtils]: 75: Hoare triple {4325#(and (= 0 check_~ax~0) (= 0 check_~ai~0))} call __VERIFIER_assert((if ~ai~0 <= ~ax~0 then 1 else 0)); {4326#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 18:46:37,107 INFO L280 TraceCheckUtils]: 76: Hoare triple {4326#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {4327#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 18:46:37,108 INFO L280 TraceCheckUtils]: 77: Hoare triple {4327#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4284#false} is VALID [2020-07-10 18:46:37,108 INFO L280 TraceCheckUtils]: 78: Hoare triple {4284#false} assume !false; {4284#false} is VALID [2020-07-10 18:46:37,118 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-10 18:46:37,118 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:46:37,119 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1603343575] [2020-07-10 18:46:37,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:46:37,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-10 18:46:37,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299705801] [2020-07-10 18:46:37,121 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 79 [2020-07-10 18:46:37,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:46:37,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-10 18:46:37,214 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:46:37,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-10 18:46:37,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:46:37,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-10 18:46:37,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2020-07-10 18:46:37,215 INFO L87 Difference]: Start difference. First operand 194 states and 212 transitions. Second operand 15 states. [2020-07-10 18:46:40,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:46:40,591 INFO L93 Difference]: Finished difference Result 206 states and 226 transitions. [2020-07-10 18:46:40,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-10 18:46:40,592 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 79 [2020-07-10 18:46:40,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:46:40,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 18:46:40,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions. [2020-07-10 18:46:40,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 18:46:40,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions. [2020-07-10 18:46:40,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 82 transitions. [2020-07-10 18:46:40,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:46:40,746 INFO L225 Difference]: With dead ends: 206 [2020-07-10 18:46:40,746 INFO L226 Difference]: Without dead ends: 142 [2020-07-10 18:46:40,751 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2020-07-10 18:46:40,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-07-10 18:46:41,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2020-07-10 18:46:41,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:46:41,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 113 states. [2020-07-10 18:46:41,196 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 113 states. [2020-07-10 18:46:41,196 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 113 states. [2020-07-10 18:46:41,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:46:41,202 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2020-07-10 18:46:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2020-07-10 18:46:41,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:46:41,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:46:41,204 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 142 states. [2020-07-10 18:46:41,204 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 142 states. [2020-07-10 18:46:41,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:46:41,217 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2020-07-10 18:46:41,217 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2020-07-10 18:46:41,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:46:41,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:46:41,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:46:41,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:46:41,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-07-10 18:46:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2020-07-10 18:46:41,226 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 79 [2020-07-10 18:46:41,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:46:41,227 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2020-07-10 18:46:41,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-10 18:46:41,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 113 states and 120 transitions. [2020-07-10 18:46:41,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:46:41,456 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2020-07-10 18:46:41,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-07-10 18:46:41,457 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:46:41,458 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:46:41,458 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 18:46:41,458 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:46:41,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:46:41,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1486199216, now seen corresponding path program 2 times [2020-07-10 18:46:41,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:46:41,461 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1148040972] [2020-07-10 18:46:41,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:46:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:41,975 INFO L280 TraceCheckUtils]: 0: Hoare triple {5337#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5287#true} is VALID [2020-07-10 18:46:41,975 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} #valid := #valid[0 := 0]; {5287#true} is VALID [2020-07-10 18:46:41,975 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} assume 0 < #StackHeapBarrier; {5287#true} is VALID [2020-07-10 18:46:41,975 INFO L280 TraceCheckUtils]: 3: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-10 18:46:41,976 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5287#true} {5287#true} #117#return; {5287#true} is VALID [2020-07-10 18:46:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:41,981 INFO L280 TraceCheckUtils]: 0: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-10 18:46:41,981 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-10 18:46:41,981 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-10 18:46:41,982 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5287#true} {5287#true} #99#return; {5287#true} is VALID [2020-07-10 18:46:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:41,991 INFO L280 TraceCheckUtils]: 0: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-10 18:46:41,992 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-10 18:46:41,992 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-10 18:46:41,992 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5287#true} {5287#true} #101#return; {5287#true} is VALID [2020-07-10 18:46:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:42,017 INFO L280 TraceCheckUtils]: 0: Hoare triple {5338#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5287#true} is VALID [2020-07-10 18:46:42,017 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-10 18:46:42,017 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5287#true} {5287#true} #103#return; {5287#true} is VALID [2020-07-10 18:46:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:42,037 INFO L280 TraceCheckUtils]: 0: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-10 18:46:42,038 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-10 18:46:42,038 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-10 18:46:42,039 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5287#true} {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:42,045 INFO L280 TraceCheckUtils]: 0: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-10 18:46:42,046 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-10 18:46:42,046 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-10 18:46:42,047 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5287#true} {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:42,053 INFO L280 TraceCheckUtils]: 0: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-10 18:46:42,054 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-10 18:46:42,054 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-10 18:46:42,055 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5287#true} {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #109#return; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:42,063 INFO L280 TraceCheckUtils]: 0: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-10 18:46:42,064 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-10 18:46:42,064 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-10 18:46:42,065 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5287#true} {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #111#return; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:42,066 INFO L263 TraceCheckUtils]: 0: Hoare triple {5287#true} call ULTIMATE.init(); {5337#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 18:46:42,066 INFO L280 TraceCheckUtils]: 1: Hoare triple {5337#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5287#true} is VALID [2020-07-10 18:46:42,066 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} #valid := #valid[0 := 0]; {5287#true} is VALID [2020-07-10 18:46:42,066 INFO L280 TraceCheckUtils]: 3: Hoare triple {5287#true} assume 0 < #StackHeapBarrier; {5287#true} is VALID [2020-07-10 18:46:42,066 INFO L280 TraceCheckUtils]: 4: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-10 18:46:42,067 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {5287#true} {5287#true} #117#return; {5287#true} is VALID [2020-07-10 18:46:42,067 INFO L263 TraceCheckUtils]: 6: Hoare triple {5287#true} call #t~ret14 := main(); {5287#true} is VALID [2020-07-10 18:46:42,067 INFO L280 TraceCheckUtils]: 7: Hoare triple {5287#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {5287#true} is VALID [2020-07-10 18:46:42,067 INFO L280 TraceCheckUtils]: 8: Hoare triple {5287#true} ~n~0 := #t~nondet8; {5287#true} is VALID [2020-07-10 18:46:42,067 INFO L280 TraceCheckUtils]: 9: Hoare triple {5287#true} havoc #t~nondet8; {5287#true} is VALID [2020-07-10 18:46:42,068 INFO L263 TraceCheckUtils]: 10: Hoare triple {5287#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {5287#true} is VALID [2020-07-10 18:46:42,068 INFO L280 TraceCheckUtils]: 11: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-10 18:46:42,068 INFO L280 TraceCheckUtils]: 12: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-10 18:46:42,068 INFO L280 TraceCheckUtils]: 13: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-10 18:46:42,068 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {5287#true} {5287#true} #99#return; {5287#true} is VALID [2020-07-10 18:46:42,069 INFO L280 TraceCheckUtils]: 15: Hoare triple {5287#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {5287#true} is VALID [2020-07-10 18:46:42,069 INFO L280 TraceCheckUtils]: 16: Hoare triple {5287#true} ~i~0 := #t~nondet9; {5287#true} is VALID [2020-07-10 18:46:42,069 INFO L280 TraceCheckUtils]: 17: Hoare triple {5287#true} havoc #t~nondet9; {5287#true} is VALID [2020-07-10 18:46:42,069 INFO L263 TraceCheckUtils]: 18: Hoare triple {5287#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {5287#true} is VALID [2020-07-10 18:46:42,069 INFO L280 TraceCheckUtils]: 19: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-10 18:46:42,070 INFO L280 TraceCheckUtils]: 20: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-10 18:46:42,070 INFO L280 TraceCheckUtils]: 21: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-10 18:46:42,070 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {5287#true} {5287#true} #101#return; {5287#true} is VALID [2020-07-10 18:46:42,070 INFO L280 TraceCheckUtils]: 23: Hoare triple {5287#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {5287#true} is VALID [2020-07-10 18:46:42,072 INFO L263 TraceCheckUtils]: 24: Hoare triple {5287#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {5338#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 18:46:42,072 INFO L280 TraceCheckUtils]: 25: Hoare triple {5338#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5287#true} is VALID [2020-07-10 18:46:42,073 INFO L280 TraceCheckUtils]: 26: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-10 18:46:42,073 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {5287#true} {5287#true} #103#return; {5287#true} is VALID [2020-07-10 18:46:42,073 INFO L280 TraceCheckUtils]: 28: Hoare triple {5287#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {5287#true} is VALID [2020-07-10 18:46:42,074 INFO L263 TraceCheckUtils]: 29: Hoare triple {5287#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {5305#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-10 18:46:42,075 INFO L280 TraceCheckUtils]: 30: Hoare triple {5305#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} ~x := #in~x; {5306#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-10 18:46:42,076 INFO L280 TraceCheckUtils]: 31: Hoare triple {5306#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {5307#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-10 18:46:42,077 INFO L280 TraceCheckUtils]: 32: Hoare triple {5307#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {5307#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-10 18:46:42,077 INFO L280 TraceCheckUtils]: 33: Hoare triple {5307#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~i := #in~i; {5307#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-10 18:46:42,078 INFO L280 TraceCheckUtils]: 34: Hoare triple {5307#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~n := #in~n; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:42,079 INFO L280 TraceCheckUtils]: 35: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:42,079 INFO L263 TraceCheckUtils]: 36: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {5287#true} is VALID [2020-07-10 18:46:42,079 INFO L280 TraceCheckUtils]: 37: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-10 18:46:42,079 INFO L280 TraceCheckUtils]: 38: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-10 18:46:42,080 INFO L280 TraceCheckUtils]: 39: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-10 18:46:42,080 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {5287#true} {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:42,081 INFO L263 TraceCheckUtils]: 41: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {5287#true} is VALID [2020-07-10 18:46:42,081 INFO L280 TraceCheckUtils]: 42: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-10 18:46:42,081 INFO L280 TraceCheckUtils]: 43: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-10 18:46:42,081 INFO L280 TraceCheckUtils]: 44: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-10 18:46:42,082 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {5287#true} {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:42,083 INFO L280 TraceCheckUtils]: 46: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~x0~0 := ~x; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:42,083 INFO L280 TraceCheckUtils]: 47: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~y0~0 := ~y; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:42,085 INFO L280 TraceCheckUtils]: 48: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:42,085 INFO L280 TraceCheckUtils]: 49: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:42,086 INFO L280 TraceCheckUtils]: 50: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume #t~mem1 <= #t~mem2; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:42,087 INFO L280 TraceCheckUtils]: 51: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem1; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:42,088 INFO L280 TraceCheckUtils]: 52: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem2; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:42,090 INFO L280 TraceCheckUtils]: 53: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #t~post3 := ~x; {5317#(and (= 0 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:42,091 INFO L280 TraceCheckUtils]: 54: Hoare triple {5317#(and (= 0 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} ~x := 1 + #t~post3; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:42,092 INFO L280 TraceCheckUtils]: 55: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~post3; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:42,093 INFO L263 TraceCheckUtils]: 56: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {5319#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-10 18:46:42,095 INFO L280 TraceCheckUtils]: 57: Hoare triple {5319#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~x := #in~x; {5320#(and (<= 1 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-10 18:46:42,095 INFO L280 TraceCheckUtils]: 58: Hoare triple {5320#(and (<= 1 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {5321#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-10 18:46:42,096 INFO L280 TraceCheckUtils]: 59: Hoare triple {5321#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {5321#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-10 18:46:42,097 INFO L280 TraceCheckUtils]: 60: Hoare triple {5321#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~i := #in~i; {5321#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-10 18:46:42,098 INFO L280 TraceCheckUtils]: 61: Hoare triple {5321#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~n := #in~n; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:42,098 INFO L280 TraceCheckUtils]: 62: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume !(~x >= ~y); {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:42,099 INFO L263 TraceCheckUtils]: 63: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {5287#true} is VALID [2020-07-10 18:46:42,099 INFO L280 TraceCheckUtils]: 64: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-10 18:46:42,099 INFO L280 TraceCheckUtils]: 65: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-10 18:46:42,099 INFO L280 TraceCheckUtils]: 66: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-10 18:46:42,100 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {5287#true} {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #109#return; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:42,101 INFO L263 TraceCheckUtils]: 68: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {5287#true} is VALID [2020-07-10 18:46:42,101 INFO L280 TraceCheckUtils]: 69: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-10 18:46:42,101 INFO L280 TraceCheckUtils]: 70: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-10 18:46:42,101 INFO L280 TraceCheckUtils]: 71: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-10 18:46:42,117 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {5287#true} {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #111#return; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:42,118 INFO L280 TraceCheckUtils]: 73: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} ~x0~0 := ~x; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:42,118 INFO L280 TraceCheckUtils]: 74: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} ~y0~0 := ~y; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:42,119 INFO L280 TraceCheckUtils]: 75: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:42,120 INFO L280 TraceCheckUtils]: 76: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:42,121 INFO L280 TraceCheckUtils]: 77: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume #t~mem1 <= #t~mem2; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:42,121 INFO L280 TraceCheckUtils]: 78: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~mem1; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:42,122 INFO L280 TraceCheckUtils]: 79: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~mem2; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:42,122 INFO L280 TraceCheckUtils]: 80: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #t~post3 := ~x; {5330#(and (<= 1 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:42,123 INFO L280 TraceCheckUtils]: 81: Hoare triple {5330#(and (<= 1 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} ~x := 1 + #t~post3; {5331#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-10 18:46:42,124 INFO L280 TraceCheckUtils]: 82: Hoare triple {5331#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} havoc #t~post3; {5331#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-10 18:46:42,125 INFO L263 TraceCheckUtils]: 83: Hoare triple {5331#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {5332#(and (<= 2 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-10 18:46:42,126 INFO L280 TraceCheckUtils]: 84: Hoare triple {5332#(and (<= 2 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~x := #in~x; {5333#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-10 18:46:42,127 INFO L280 TraceCheckUtils]: 85: Hoare triple {5333#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (<= 2 check_~x))} ~y := #in~y; {5334#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-10 18:46:42,127 INFO L280 TraceCheckUtils]: 86: Hoare triple {5334#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {5334#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-10 18:46:42,128 INFO L280 TraceCheckUtils]: 87: Hoare triple {5334#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} ~i := #in~i; {5334#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-10 18:46:42,129 INFO L280 TraceCheckUtils]: 88: Hoare triple {5334#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} ~n := #in~n; {5331#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-10 18:46:42,129 INFO L280 TraceCheckUtils]: 89: Hoare triple {5331#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} assume !(~x >= ~y); {5331#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-10 18:46:42,130 INFO L263 TraceCheckUtils]: 90: Hoare triple {5331#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {5335#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 18:46:42,131 INFO L280 TraceCheckUtils]: 91: Hoare triple {5335#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {5336#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 18:46:42,131 INFO L280 TraceCheckUtils]: 92: Hoare triple {5336#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {5288#false} is VALID [2020-07-10 18:46:42,131 INFO L280 TraceCheckUtils]: 93: Hoare triple {5288#false} assume !false; {5288#false} is VALID [2020-07-10 18:46:42,152 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-10 18:46:42,152 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:46:42,153 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1148040972] [2020-07-10 18:46:42,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:46:42,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-07-10 18:46:42,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842422526] [2020-07-10 18:46:42,154 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-10 18:46:42,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:46:42,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-10 18:46:42,264 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:46:42,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-10 18:46:42,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:46:42,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-10 18:46:42,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-07-10 18:46:42,266 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 20 states. [2020-07-10 18:46:49,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:46:49,008 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2020-07-10 18:46:49,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-10 18:46:49,008 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-10 18:46:49,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:46:49,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 18:46:49,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 148 transitions. [2020-07-10 18:46:49,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 18:46:49,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 148 transitions. [2020-07-10 18:46:49,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 148 transitions. [2020-07-10 18:46:49,266 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:46:49,272 INFO L225 Difference]: With dead ends: 168 [2020-07-10 18:46:49,273 INFO L226 Difference]: Without dead ends: 166 [2020-07-10 18:46:49,274 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=305, Invalid=1501, Unknown=0, NotChecked=0, Total=1806 [2020-07-10 18:46:49,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-07-10 18:46:49,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 119. [2020-07-10 18:46:49,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:46:49,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 119 states. [2020-07-10 18:46:49,704 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 119 states. [2020-07-10 18:46:49,704 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 119 states. [2020-07-10 18:46:49,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:46:49,711 INFO L93 Difference]: Finished difference Result 166 states and 177 transitions. [2020-07-10 18:46:49,711 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 177 transitions. [2020-07-10 18:46:49,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:46:49,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:46:49,712 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 166 states. [2020-07-10 18:46:49,712 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 166 states. [2020-07-10 18:46:49,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:46:49,718 INFO L93 Difference]: Finished difference Result 166 states and 177 transitions. [2020-07-10 18:46:49,718 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 177 transitions. [2020-07-10 18:46:49,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:46:49,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:46:49,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:46:49,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:46:49,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-07-10 18:46:49,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2020-07-10 18:46:49,724 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 94 [2020-07-10 18:46:49,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:46:49,724 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2020-07-10 18:46:49,724 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-10 18:46:49,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 119 states and 128 transitions. [2020-07-10 18:46:50,006 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:46:50,006 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2020-07-10 18:46:50,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-07-10 18:46:50,008 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:46:50,008 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:46:50,009 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 18:46:50,009 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:46:50,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:46:50,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1687005104, now seen corresponding path program 1 times [2020-07-10 18:46:50,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:46:50,010 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1319297904] [2020-07-10 18:46:50,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:46:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:50,494 INFO L280 TraceCheckUtils]: 0: Hoare triple {6344#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6294#true} is VALID [2020-07-10 18:46:50,495 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} #valid := #valid[0 := 0]; {6294#true} is VALID [2020-07-10 18:46:50,495 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} assume 0 < #StackHeapBarrier; {6294#true} is VALID [2020-07-10 18:46:50,495 INFO L280 TraceCheckUtils]: 3: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-10 18:46:50,495 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {6294#true} {6294#true} #117#return; {6294#true} is VALID [2020-07-10 18:46:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:50,505 INFO L280 TraceCheckUtils]: 0: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-10 18:46:50,506 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-10 18:46:50,506 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-10 18:46:50,506 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6294#true} {6294#true} #99#return; {6294#true} is VALID [2020-07-10 18:46:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:50,513 INFO L280 TraceCheckUtils]: 0: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-10 18:46:50,513 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-10 18:46:50,513 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-10 18:46:50,514 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6294#true} {6294#true} #101#return; {6294#true} is VALID [2020-07-10 18:46:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:50,543 INFO L280 TraceCheckUtils]: 0: Hoare triple {6345#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6294#true} is VALID [2020-07-10 18:46:50,543 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-10 18:46:50,543 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6294#true} {6294#true} #103#return; {6294#true} is VALID [2020-07-10 18:46:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:50,554 INFO L280 TraceCheckUtils]: 0: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-10 18:46:50,555 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-10 18:46:50,555 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-10 18:46:50,556 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6294#true} {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:50,561 INFO L280 TraceCheckUtils]: 0: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-10 18:46:50,561 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-10 18:46:50,562 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-10 18:46:50,562 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6294#true} {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:50,567 INFO L280 TraceCheckUtils]: 0: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-10 18:46:50,568 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-10 18:46:50,568 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-10 18:46:50,569 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6294#true} {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #109#return; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:50,573 INFO L280 TraceCheckUtils]: 0: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-10 18:46:50,574 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-10 18:46:50,574 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-10 18:46:50,575 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6294#true} {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #111#return; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:50,575 INFO L263 TraceCheckUtils]: 0: Hoare triple {6294#true} call ULTIMATE.init(); {6344#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 18:46:50,575 INFO L280 TraceCheckUtils]: 1: Hoare triple {6344#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6294#true} is VALID [2020-07-10 18:46:50,575 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} #valid := #valid[0 := 0]; {6294#true} is VALID [2020-07-10 18:46:50,576 INFO L280 TraceCheckUtils]: 3: Hoare triple {6294#true} assume 0 < #StackHeapBarrier; {6294#true} is VALID [2020-07-10 18:46:50,576 INFO L280 TraceCheckUtils]: 4: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-10 18:46:50,576 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {6294#true} {6294#true} #117#return; {6294#true} is VALID [2020-07-10 18:46:50,576 INFO L263 TraceCheckUtils]: 6: Hoare triple {6294#true} call #t~ret14 := main(); {6294#true} is VALID [2020-07-10 18:46:50,576 INFO L280 TraceCheckUtils]: 7: Hoare triple {6294#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {6294#true} is VALID [2020-07-10 18:46:50,576 INFO L280 TraceCheckUtils]: 8: Hoare triple {6294#true} ~n~0 := #t~nondet8; {6294#true} is VALID [2020-07-10 18:46:50,576 INFO L280 TraceCheckUtils]: 9: Hoare triple {6294#true} havoc #t~nondet8; {6294#true} is VALID [2020-07-10 18:46:50,577 INFO L263 TraceCheckUtils]: 10: Hoare triple {6294#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {6294#true} is VALID [2020-07-10 18:46:50,577 INFO L280 TraceCheckUtils]: 11: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-10 18:46:50,577 INFO L280 TraceCheckUtils]: 12: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-10 18:46:50,577 INFO L280 TraceCheckUtils]: 13: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-10 18:46:50,577 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {6294#true} {6294#true} #99#return; {6294#true} is VALID [2020-07-10 18:46:50,577 INFO L280 TraceCheckUtils]: 15: Hoare triple {6294#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {6294#true} is VALID [2020-07-10 18:46:50,577 INFO L280 TraceCheckUtils]: 16: Hoare triple {6294#true} ~i~0 := #t~nondet9; {6294#true} is VALID [2020-07-10 18:46:50,578 INFO L280 TraceCheckUtils]: 17: Hoare triple {6294#true} havoc #t~nondet9; {6294#true} is VALID [2020-07-10 18:46:50,578 INFO L263 TraceCheckUtils]: 18: Hoare triple {6294#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {6294#true} is VALID [2020-07-10 18:46:50,578 INFO L280 TraceCheckUtils]: 19: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-10 18:46:50,578 INFO L280 TraceCheckUtils]: 20: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-10 18:46:50,578 INFO L280 TraceCheckUtils]: 21: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-10 18:46:50,578 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {6294#true} {6294#true} #101#return; {6294#true} is VALID [2020-07-10 18:46:50,578 INFO L280 TraceCheckUtils]: 23: Hoare triple {6294#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {6294#true} is VALID [2020-07-10 18:46:50,579 INFO L263 TraceCheckUtils]: 24: Hoare triple {6294#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {6345#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 18:46:50,579 INFO L280 TraceCheckUtils]: 25: Hoare triple {6345#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6294#true} is VALID [2020-07-10 18:46:50,580 INFO L280 TraceCheckUtils]: 26: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-10 18:46:50,580 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {6294#true} {6294#true} #103#return; {6294#true} is VALID [2020-07-10 18:46:50,580 INFO L280 TraceCheckUtils]: 28: Hoare triple {6294#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {6294#true} is VALID [2020-07-10 18:46:50,581 INFO L263 TraceCheckUtils]: 29: Hoare triple {6294#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {6312#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-10 18:46:50,581 INFO L280 TraceCheckUtils]: 30: Hoare triple {6312#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} ~x := #in~x; {6313#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-10 18:46:50,582 INFO L280 TraceCheckUtils]: 31: Hoare triple {6313#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {6314#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-10 18:46:50,583 INFO L280 TraceCheckUtils]: 32: Hoare triple {6314#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {6314#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-10 18:46:50,584 INFO L280 TraceCheckUtils]: 33: Hoare triple {6314#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~i := #in~i; {6314#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-10 18:46:50,584 INFO L280 TraceCheckUtils]: 34: Hoare triple {6314#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~n := #in~n; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:50,585 INFO L280 TraceCheckUtils]: 35: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:50,585 INFO L263 TraceCheckUtils]: 36: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {6294#true} is VALID [2020-07-10 18:46:50,585 INFO L280 TraceCheckUtils]: 37: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-10 18:46:50,585 INFO L280 TraceCheckUtils]: 38: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-10 18:46:50,585 INFO L280 TraceCheckUtils]: 39: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-10 18:46:50,586 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {6294#true} {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:50,586 INFO L263 TraceCheckUtils]: 41: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {6294#true} is VALID [2020-07-10 18:46:50,587 INFO L280 TraceCheckUtils]: 42: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-10 18:46:50,587 INFO L280 TraceCheckUtils]: 43: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-10 18:46:50,587 INFO L280 TraceCheckUtils]: 44: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-10 18:46:50,588 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {6294#true} {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:50,589 INFO L280 TraceCheckUtils]: 46: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~x0~0 := ~x; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:50,589 INFO L280 TraceCheckUtils]: 47: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~y0~0 := ~y; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:50,590 INFO L280 TraceCheckUtils]: 48: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:50,590 INFO L280 TraceCheckUtils]: 49: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:50,591 INFO L280 TraceCheckUtils]: 50: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume #t~mem1 <= #t~mem2; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:50,591 INFO L280 TraceCheckUtils]: 51: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem1; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:50,592 INFO L280 TraceCheckUtils]: 52: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem2; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:50,592 INFO L280 TraceCheckUtils]: 53: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #t~post3 := ~x; {6324#(and (= 0 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:50,593 INFO L280 TraceCheckUtils]: 54: Hoare triple {6324#(and (= 0 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} ~x := 1 + #t~post3; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:50,593 INFO L280 TraceCheckUtils]: 55: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~post3; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:50,594 INFO L263 TraceCheckUtils]: 56: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {6326#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-10 18:46:50,595 INFO L280 TraceCheckUtils]: 57: Hoare triple {6326#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~x := #in~x; {6327#(and (<= 1 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-10 18:46:50,595 INFO L280 TraceCheckUtils]: 58: Hoare triple {6327#(and (<= 1 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {6328#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-10 18:46:50,596 INFO L280 TraceCheckUtils]: 59: Hoare triple {6328#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {6328#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-10 18:46:50,596 INFO L280 TraceCheckUtils]: 60: Hoare triple {6328#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~i := #in~i; {6328#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-10 18:46:50,597 INFO L280 TraceCheckUtils]: 61: Hoare triple {6328#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~n := #in~n; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:50,597 INFO L280 TraceCheckUtils]: 62: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume !(~x >= ~y); {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:50,598 INFO L263 TraceCheckUtils]: 63: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {6294#true} is VALID [2020-07-10 18:46:50,598 INFO L280 TraceCheckUtils]: 64: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-10 18:46:50,598 INFO L280 TraceCheckUtils]: 65: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-10 18:46:50,598 INFO L280 TraceCheckUtils]: 66: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-10 18:46:50,604 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {6294#true} {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #109#return; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:50,604 INFO L263 TraceCheckUtils]: 68: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {6294#true} is VALID [2020-07-10 18:46:50,604 INFO L280 TraceCheckUtils]: 69: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-10 18:46:50,605 INFO L280 TraceCheckUtils]: 70: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-10 18:46:50,605 INFO L280 TraceCheckUtils]: 71: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-10 18:46:50,606 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {6294#true} {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #111#return; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:50,606 INFO L280 TraceCheckUtils]: 73: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} ~x0~0 := ~x; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:50,607 INFO L280 TraceCheckUtils]: 74: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} ~y0~0 := ~y; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:50,608 INFO L280 TraceCheckUtils]: 75: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:50,608 INFO L280 TraceCheckUtils]: 76: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:50,609 INFO L280 TraceCheckUtils]: 77: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume !(#t~mem1 <= #t~mem2); {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:50,610 INFO L280 TraceCheckUtils]: 78: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~mem1; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:50,610 INFO L280 TraceCheckUtils]: 79: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~mem2; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:46:50,611 INFO L280 TraceCheckUtils]: 80: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #t~post4 := ~y; {6337#(and (<= 1 check_~x) (<= (+ |check_#t~post4| 1) check_~n))} is VALID [2020-07-10 18:46:50,612 INFO L280 TraceCheckUtils]: 81: Hoare triple {6337#(and (<= 1 check_~x) (<= (+ |check_#t~post4| 1) check_~n))} ~y := #t~post4 - 1; {6338#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-10 18:46:50,613 INFO L280 TraceCheckUtils]: 82: Hoare triple {6338#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} havoc #t~post4; {6338#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-10 18:46:50,614 INFO L263 TraceCheckUtils]: 83: Hoare triple {6338#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {6339#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} is VALID [2020-07-10 18:46:50,615 INFO L280 TraceCheckUtils]: 84: Hoare triple {6339#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} ~x := #in~x; {6340#(and (<= 1 check_~x) (<= (+ |check_#in~y| 2) |check_#in~n|))} is VALID [2020-07-10 18:46:50,615 INFO L280 TraceCheckUtils]: 85: Hoare triple {6340#(and (<= 1 check_~x) (<= (+ |check_#in~y| 2) |check_#in~n|))} ~y := #in~y; {6341#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-10 18:46:50,616 INFO L280 TraceCheckUtils]: 86: Hoare triple {6341#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {6341#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-10 18:46:50,617 INFO L280 TraceCheckUtils]: 87: Hoare triple {6341#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~i := #in~i; {6341#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-10 18:46:50,617 INFO L280 TraceCheckUtils]: 88: Hoare triple {6341#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~n := #in~n; {6338#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-10 18:46:50,618 INFO L280 TraceCheckUtils]: 89: Hoare triple {6338#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} assume !(~x >= ~y); {6338#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-10 18:46:50,619 INFO L263 TraceCheckUtils]: 90: Hoare triple {6338#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {6342#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 18:46:50,620 INFO L280 TraceCheckUtils]: 91: Hoare triple {6342#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {6343#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 18:46:50,620 INFO L280 TraceCheckUtils]: 92: Hoare triple {6343#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {6295#false} is VALID [2020-07-10 18:46:50,620 INFO L280 TraceCheckUtils]: 93: Hoare triple {6295#false} assume !false; {6295#false} is VALID [2020-07-10 18:46:50,633 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-10 18:46:50,634 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:46:50,634 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1319297904] [2020-07-10 18:46:50,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:46:50,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-07-10 18:46:50,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656947421] [2020-07-10 18:46:50,635 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-10 18:46:50,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:46:50,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-10 18:46:50,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:46:50,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-10 18:46:50,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:46:50,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-10 18:46:50,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-07-10 18:46:50,738 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand 20 states. [2020-07-10 18:46:57,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:46:57,554 INFO L93 Difference]: Finished difference Result 191 states and 204 transitions. [2020-07-10 18:46:57,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-07-10 18:46:57,555 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-10 18:46:57,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:46:57,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 18:46:57,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 148 transitions. [2020-07-10 18:46:57,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 18:46:57,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 148 transitions. [2020-07-10 18:46:57,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 148 transitions. [2020-07-10 18:46:57,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:46:57,837 INFO L225 Difference]: With dead ends: 191 [2020-07-10 18:46:57,837 INFO L226 Difference]: Without dead ends: 189 [2020-07-10 18:46:57,838 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2020-07-10 18:46:57,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-07-10 18:46:58,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 142. [2020-07-10 18:46:58,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:46:58,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand 142 states. [2020-07-10 18:46:58,359 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand 142 states. [2020-07-10 18:46:58,359 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 142 states. [2020-07-10 18:46:58,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:46:58,366 INFO L93 Difference]: Finished difference Result 189 states and 202 transitions. [2020-07-10 18:46:58,366 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 202 transitions. [2020-07-10 18:46:58,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:46:58,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:46:58,367 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 189 states. [2020-07-10 18:46:58,367 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 189 states. [2020-07-10 18:46:58,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:46:58,374 INFO L93 Difference]: Finished difference Result 189 states and 202 transitions. [2020-07-10 18:46:58,375 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 202 transitions. [2020-07-10 18:46:58,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:46:58,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:46:58,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:46:58,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:46:58,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-07-10 18:46:58,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2020-07-10 18:46:58,381 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 94 [2020-07-10 18:46:58,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:46:58,381 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2020-07-10 18:46:58,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-10 18:46:58,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 142 states and 153 transitions. [2020-07-10 18:46:58,771 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:46:58,771 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2020-07-10 18:46:58,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-07-10 18:46:58,773 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:46:58,773 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:46:58,774 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 18:46:58,774 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:46:58,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:46:58,774 INFO L82 PathProgramCache]: Analyzing trace with hash 766068976, now seen corresponding path program 2 times [2020-07-10 18:46:58,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:46:58,774 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [307970796] [2020-07-10 18:46:58,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:46:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:59,238 INFO L280 TraceCheckUtils]: 0: Hoare triple {7493#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {7443#true} is VALID [2020-07-10 18:46:59,238 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} #valid := #valid[0 := 0]; {7443#true} is VALID [2020-07-10 18:46:59,238 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} assume 0 < #StackHeapBarrier; {7443#true} is VALID [2020-07-10 18:46:59,238 INFO L280 TraceCheckUtils]: 3: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-10 18:46:59,239 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {7443#true} {7443#true} #117#return; {7443#true} is VALID [2020-07-10 18:46:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:59,242 INFO L280 TraceCheckUtils]: 0: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-10 18:46:59,242 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-10 18:46:59,243 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-10 18:46:59,243 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7443#true} {7443#true} #99#return; {7443#true} is VALID [2020-07-10 18:46:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:59,247 INFO L280 TraceCheckUtils]: 0: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-10 18:46:59,248 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-10 18:46:59,248 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-10 18:46:59,248 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7443#true} {7443#true} #101#return; {7443#true} is VALID [2020-07-10 18:46:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:59,275 INFO L280 TraceCheckUtils]: 0: Hoare triple {7494#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {7443#true} is VALID [2020-07-10 18:46:59,275 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-10 18:46:59,275 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7443#true} {7443#true} #103#return; {7443#true} is VALID [2020-07-10 18:46:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:59,281 INFO L280 TraceCheckUtils]: 0: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-10 18:46:59,282 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-10 18:46:59,282 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-10 18:46:59,282 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7443#true} {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:59,291 INFO L280 TraceCheckUtils]: 0: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-10 18:46:59,292 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-10 18:46:59,292 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-10 18:46:59,293 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7443#true} {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:59,297 INFO L280 TraceCheckUtils]: 0: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-10 18:46:59,298 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-10 18:46:59,298 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-10 18:46:59,299 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7443#true} {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} #109#return; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-10 18:46:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:46:59,303 INFO L280 TraceCheckUtils]: 0: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-10 18:46:59,304 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-10 18:46:59,304 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-10 18:46:59,305 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7443#true} {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} #111#return; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-10 18:46:59,305 INFO L263 TraceCheckUtils]: 0: Hoare triple {7443#true} call ULTIMATE.init(); {7493#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 18:46:59,306 INFO L280 TraceCheckUtils]: 1: Hoare triple {7493#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {7443#true} is VALID [2020-07-10 18:46:59,306 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} #valid := #valid[0 := 0]; {7443#true} is VALID [2020-07-10 18:46:59,306 INFO L280 TraceCheckUtils]: 3: Hoare triple {7443#true} assume 0 < #StackHeapBarrier; {7443#true} is VALID [2020-07-10 18:46:59,306 INFO L280 TraceCheckUtils]: 4: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-10 18:46:59,306 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {7443#true} {7443#true} #117#return; {7443#true} is VALID [2020-07-10 18:46:59,307 INFO L263 TraceCheckUtils]: 6: Hoare triple {7443#true} call #t~ret14 := main(); {7443#true} is VALID [2020-07-10 18:46:59,307 INFO L280 TraceCheckUtils]: 7: Hoare triple {7443#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {7443#true} is VALID [2020-07-10 18:46:59,307 INFO L280 TraceCheckUtils]: 8: Hoare triple {7443#true} ~n~0 := #t~nondet8; {7443#true} is VALID [2020-07-10 18:46:59,307 INFO L280 TraceCheckUtils]: 9: Hoare triple {7443#true} havoc #t~nondet8; {7443#true} is VALID [2020-07-10 18:46:59,307 INFO L263 TraceCheckUtils]: 10: Hoare triple {7443#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {7443#true} is VALID [2020-07-10 18:46:59,308 INFO L280 TraceCheckUtils]: 11: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-10 18:46:59,308 INFO L280 TraceCheckUtils]: 12: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-10 18:46:59,308 INFO L280 TraceCheckUtils]: 13: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-10 18:46:59,308 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {7443#true} {7443#true} #99#return; {7443#true} is VALID [2020-07-10 18:46:59,308 INFO L280 TraceCheckUtils]: 15: Hoare triple {7443#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {7443#true} is VALID [2020-07-10 18:46:59,309 INFO L280 TraceCheckUtils]: 16: Hoare triple {7443#true} ~i~0 := #t~nondet9; {7443#true} is VALID [2020-07-10 18:46:59,309 INFO L280 TraceCheckUtils]: 17: Hoare triple {7443#true} havoc #t~nondet9; {7443#true} is VALID [2020-07-10 18:46:59,309 INFO L263 TraceCheckUtils]: 18: Hoare triple {7443#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {7443#true} is VALID [2020-07-10 18:46:59,309 INFO L280 TraceCheckUtils]: 19: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-10 18:46:59,309 INFO L280 TraceCheckUtils]: 20: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-10 18:46:59,310 INFO L280 TraceCheckUtils]: 21: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-10 18:46:59,310 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {7443#true} {7443#true} #101#return; {7443#true} is VALID [2020-07-10 18:46:59,310 INFO L280 TraceCheckUtils]: 23: Hoare triple {7443#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {7443#true} is VALID [2020-07-10 18:46:59,311 INFO L263 TraceCheckUtils]: 24: Hoare triple {7443#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {7494#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 18:46:59,312 INFO L280 TraceCheckUtils]: 25: Hoare triple {7494#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {7443#true} is VALID [2020-07-10 18:46:59,312 INFO L280 TraceCheckUtils]: 26: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-10 18:46:59,312 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {7443#true} {7443#true} #103#return; {7443#true} is VALID [2020-07-10 18:46:59,312 INFO L280 TraceCheckUtils]: 28: Hoare triple {7443#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {7443#true} is VALID [2020-07-10 18:46:59,313 INFO L263 TraceCheckUtils]: 29: Hoare triple {7443#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {7461#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-10 18:46:59,314 INFO L280 TraceCheckUtils]: 30: Hoare triple {7461#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} ~x := #in~x; {7462#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-10 18:46:59,315 INFO L280 TraceCheckUtils]: 31: Hoare triple {7462#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {7463#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-10 18:46:59,315 INFO L280 TraceCheckUtils]: 32: Hoare triple {7463#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {7463#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-10 18:46:59,316 INFO L280 TraceCheckUtils]: 33: Hoare triple {7463#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~i := #in~i; {7463#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-10 18:46:59,316 INFO L280 TraceCheckUtils]: 34: Hoare triple {7463#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~n := #in~n; {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:59,317 INFO L280 TraceCheckUtils]: 35: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:59,317 INFO L263 TraceCheckUtils]: 36: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {7443#true} is VALID [2020-07-10 18:46:59,317 INFO L280 TraceCheckUtils]: 37: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-10 18:46:59,317 INFO L280 TraceCheckUtils]: 38: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-10 18:46:59,317 INFO L280 TraceCheckUtils]: 39: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-10 18:46:59,318 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {7443#true} {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:59,318 INFO L263 TraceCheckUtils]: 41: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {7443#true} is VALID [2020-07-10 18:46:59,318 INFO L280 TraceCheckUtils]: 42: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-10 18:46:59,318 INFO L280 TraceCheckUtils]: 43: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-10 18:46:59,318 INFO L280 TraceCheckUtils]: 44: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-10 18:46:59,319 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {7443#true} {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:59,320 INFO L280 TraceCheckUtils]: 46: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~x0~0 := ~x; {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:59,320 INFO L280 TraceCheckUtils]: 47: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~y0~0 := ~y; {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:59,321 INFO L280 TraceCheckUtils]: 48: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:59,321 INFO L280 TraceCheckUtils]: 49: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:59,322 INFO L280 TraceCheckUtils]: 50: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(#t~mem1 <= #t~mem2); {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:59,323 INFO L280 TraceCheckUtils]: 51: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem1; {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:59,323 INFO L280 TraceCheckUtils]: 52: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem2; {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:46:59,324 INFO L280 TraceCheckUtils]: 53: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #t~post4 := ~y; {7473#(and (= 0 check_~x) (<= (+ |check_#t~post4| 1) check_~n))} is VALID [2020-07-10 18:46:59,325 INFO L280 TraceCheckUtils]: 54: Hoare triple {7473#(and (= 0 check_~x) (<= (+ |check_#t~post4| 1) check_~n))} ~y := #t~post4 - 1; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-10 18:46:59,326 INFO L280 TraceCheckUtils]: 55: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} havoc #t~post4; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-10 18:46:59,327 INFO L263 TraceCheckUtils]: 56: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {7475#(and (= 0 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} is VALID [2020-07-10 18:46:59,328 INFO L280 TraceCheckUtils]: 57: Hoare triple {7475#(and (= 0 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} ~x := #in~x; {7476#(and (= 0 check_~x) (<= (+ |check_#in~y| 2) |check_#in~n|))} is VALID [2020-07-10 18:46:59,328 INFO L280 TraceCheckUtils]: 58: Hoare triple {7476#(and (= 0 check_~x) (<= (+ |check_#in~y| 2) |check_#in~n|))} ~y := #in~y; {7477#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-10 18:46:59,329 INFO L280 TraceCheckUtils]: 59: Hoare triple {7477#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {7477#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-10 18:46:59,329 INFO L280 TraceCheckUtils]: 60: Hoare triple {7477#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~i := #in~i; {7477#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-10 18:46:59,330 INFO L280 TraceCheckUtils]: 61: Hoare triple {7477#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~n := #in~n; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-10 18:46:59,331 INFO L280 TraceCheckUtils]: 62: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} assume !(~x >= ~y); {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-10 18:46:59,331 INFO L263 TraceCheckUtils]: 63: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {7443#true} is VALID [2020-07-10 18:46:59,331 INFO L280 TraceCheckUtils]: 64: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-10 18:46:59,331 INFO L280 TraceCheckUtils]: 65: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-10 18:46:59,331 INFO L280 TraceCheckUtils]: 66: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-10 18:46:59,332 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {7443#true} {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} #109#return; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-10 18:46:59,332 INFO L263 TraceCheckUtils]: 68: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {7443#true} is VALID [2020-07-10 18:46:59,332 INFO L280 TraceCheckUtils]: 69: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-10 18:46:59,333 INFO L280 TraceCheckUtils]: 70: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-10 18:46:59,333 INFO L280 TraceCheckUtils]: 71: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-10 18:46:59,341 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {7443#true} {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} #111#return; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-10 18:46:59,342 INFO L280 TraceCheckUtils]: 73: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} ~x0~0 := ~x; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-10 18:46:59,342 INFO L280 TraceCheckUtils]: 74: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} ~y0~0 := ~y; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-10 18:46:59,343 INFO L280 TraceCheckUtils]: 75: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-10 18:46:59,344 INFO L280 TraceCheckUtils]: 76: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-10 18:46:59,345 INFO L280 TraceCheckUtils]: 77: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} assume #t~mem1 <= #t~mem2; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-10 18:46:59,345 INFO L280 TraceCheckUtils]: 78: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} havoc #t~mem1; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-10 18:46:59,346 INFO L280 TraceCheckUtils]: 79: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} havoc #t~mem2; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-10 18:46:59,347 INFO L280 TraceCheckUtils]: 80: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} #t~post3 := ~x; {7486#(and (= 0 |check_#t~post3|) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-10 18:46:59,348 INFO L280 TraceCheckUtils]: 81: Hoare triple {7486#(and (= 0 |check_#t~post3|) (<= (+ check_~y 2) check_~n))} ~x := 1 + #t~post3; {7487#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-10 18:46:59,348 INFO L280 TraceCheckUtils]: 82: Hoare triple {7487#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} havoc #t~post3; {7487#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-10 18:46:59,350 INFO L263 TraceCheckUtils]: 83: Hoare triple {7487#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {7488#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} is VALID [2020-07-10 18:46:59,350 INFO L280 TraceCheckUtils]: 84: Hoare triple {7488#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} ~x := #in~x; {7489#(and (<= 1 check_~x) (<= (+ |check_#in~y| 2) |check_#in~n|))} is VALID [2020-07-10 18:46:59,351 INFO L280 TraceCheckUtils]: 85: Hoare triple {7489#(and (<= 1 check_~x) (<= (+ |check_#in~y| 2) |check_#in~n|))} ~y := #in~y; {7490#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-10 18:46:59,352 INFO L280 TraceCheckUtils]: 86: Hoare triple {7490#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {7490#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-10 18:46:59,353 INFO L280 TraceCheckUtils]: 87: Hoare triple {7490#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~i := #in~i; {7490#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-10 18:46:59,353 INFO L280 TraceCheckUtils]: 88: Hoare triple {7490#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~n := #in~n; {7487#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-10 18:46:59,354 INFO L280 TraceCheckUtils]: 89: Hoare triple {7487#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} assume !(~x >= ~y); {7487#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-10 18:46:59,355 INFO L263 TraceCheckUtils]: 90: Hoare triple {7487#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {7491#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 18:46:59,356 INFO L280 TraceCheckUtils]: 91: Hoare triple {7491#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {7492#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 18:46:59,356 INFO L280 TraceCheckUtils]: 92: Hoare triple {7492#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {7444#false} is VALID [2020-07-10 18:46:59,357 INFO L280 TraceCheckUtils]: 93: Hoare triple {7444#false} assume !false; {7444#false} is VALID [2020-07-10 18:46:59,370 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-10 18:46:59,370 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:46:59,371 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [307970796] [2020-07-10 18:46:59,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:46:59,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-07-10 18:46:59,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185587301] [2020-07-10 18:46:59,372 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-10 18:46:59,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:46:59,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-10 18:46:59,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:46:59,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-10 18:46:59,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:46:59,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-10 18:46:59,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-07-10 18:46:59,482 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 20 states. [2020-07-10 18:47:05,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:47:05,849 INFO L93 Difference]: Finished difference Result 208 states and 223 transitions. [2020-07-10 18:47:05,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-07-10 18:47:05,849 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-10 18:47:05,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:47:05,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 18:47:05,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 148 transitions. [2020-07-10 18:47:05,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 18:47:05,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 148 transitions. [2020-07-10 18:47:05,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 148 transitions. [2020-07-10 18:47:06,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:47:06,139 INFO L225 Difference]: With dead ends: 208 [2020-07-10 18:47:06,139 INFO L226 Difference]: Without dead ends: 206 [2020-07-10 18:47:06,141 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=346, Invalid=1634, Unknown=0, NotChecked=0, Total=1980 [2020-07-10 18:47:06,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-07-10 18:47:06,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 182. [2020-07-10 18:47:06,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:47:06,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand 182 states. [2020-07-10 18:47:06,890 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 182 states. [2020-07-10 18:47:06,890 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 182 states. [2020-07-10 18:47:06,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:47:06,897 INFO L93 Difference]: Finished difference Result 206 states and 221 transitions. [2020-07-10 18:47:06,898 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 221 transitions. [2020-07-10 18:47:06,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:47:06,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:47:06,899 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 206 states. [2020-07-10 18:47:06,899 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 206 states. [2020-07-10 18:47:06,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:47:06,905 INFO L93 Difference]: Finished difference Result 206 states and 221 transitions. [2020-07-10 18:47:06,905 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 221 transitions. [2020-07-10 18:47:06,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:47:06,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:47:06,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:47:06,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:47:06,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-07-10 18:47:06,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 195 transitions. [2020-07-10 18:47:06,911 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 195 transitions. Word has length 94 [2020-07-10 18:47:06,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:47:06,911 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 195 transitions. [2020-07-10 18:47:06,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-10 18:47:06,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 182 states and 195 transitions. [2020-07-10 18:47:07,445 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:47:07,446 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 195 transitions. [2020-07-10 18:47:07,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-07-10 18:47:07,448 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:47:07,448 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:47:07,448 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 18:47:07,449 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:47:07,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:47:07,449 INFO L82 PathProgramCache]: Analyzing trace with hash 888595646, now seen corresponding path program 3 times [2020-07-10 18:47:07,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:47:07,449 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1402252764] [2020-07-10 18:47:07,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:47:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:47:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:47:08,177 INFO L280 TraceCheckUtils]: 0: Hoare triple {8804#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {8741#true} is VALID [2020-07-10 18:47:08,177 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} #valid := #valid[0 := 0]; {8741#true} is VALID [2020-07-10 18:47:08,178 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume 0 < #StackHeapBarrier; {8741#true} is VALID [2020-07-10 18:47:08,178 INFO L280 TraceCheckUtils]: 3: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-10 18:47:08,178 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {8741#true} {8741#true} #117#return; {8741#true} is VALID [2020-07-10 18:47:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:47:08,182 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-10 18:47:08,182 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-10 18:47:08,182 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-10 18:47:08,183 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8741#true} {8741#true} #99#return; {8741#true} is VALID [2020-07-10 18:47:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:47:08,187 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-10 18:47:08,188 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-10 18:47:08,188 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-10 18:47:08,188 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8741#true} {8741#true} #101#return; {8741#true} is VALID [2020-07-10 18:47:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:47:08,216 INFO L280 TraceCheckUtils]: 0: Hoare triple {8805#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8741#true} is VALID [2020-07-10 18:47:08,216 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-10 18:47:08,216 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8741#true} {8741#true} #103#return; {8741#true} is VALID [2020-07-10 18:47:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:47:08,222 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-10 18:47:08,223 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-10 18:47:08,223 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-10 18:47:08,224 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8741#true} {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:47:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:47:08,234 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-10 18:47:08,234 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-10 18:47:08,234 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-10 18:47:08,236 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8741#true} {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:47:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:47:08,241 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-10 18:47:08,242 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-10 18:47:08,242 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-10 18:47:08,243 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8741#true} {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #109#return; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:47:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:47:08,248 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-10 18:47:08,248 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-10 18:47:08,248 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-10 18:47:08,250 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8741#true} {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #111#return; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:47:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:47:08,261 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-10 18:47:08,262 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-10 18:47:08,262 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-10 18:47:08,263 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8741#true} {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} #109#return; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-10 18:47:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:47:08,268 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-10 18:47:08,268 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-10 18:47:08,269 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-10 18:47:08,270 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8741#true} {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} #111#return; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-10 18:47:08,271 INFO L263 TraceCheckUtils]: 0: Hoare triple {8741#true} call ULTIMATE.init(); {8804#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 18:47:08,271 INFO L280 TraceCheckUtils]: 1: Hoare triple {8804#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {8741#true} is VALID [2020-07-10 18:47:08,271 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} #valid := #valid[0 := 0]; {8741#true} is VALID [2020-07-10 18:47:08,272 INFO L280 TraceCheckUtils]: 3: Hoare triple {8741#true} assume 0 < #StackHeapBarrier; {8741#true} is VALID [2020-07-10 18:47:08,272 INFO L280 TraceCheckUtils]: 4: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-10 18:47:08,272 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {8741#true} {8741#true} #117#return; {8741#true} is VALID [2020-07-10 18:47:08,272 INFO L263 TraceCheckUtils]: 6: Hoare triple {8741#true} call #t~ret14 := main(); {8741#true} is VALID [2020-07-10 18:47:08,272 INFO L280 TraceCheckUtils]: 7: Hoare triple {8741#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {8741#true} is VALID [2020-07-10 18:47:08,272 INFO L280 TraceCheckUtils]: 8: Hoare triple {8741#true} ~n~0 := #t~nondet8; {8741#true} is VALID [2020-07-10 18:47:08,273 INFO L280 TraceCheckUtils]: 9: Hoare triple {8741#true} havoc #t~nondet8; {8741#true} is VALID [2020-07-10 18:47:08,273 INFO L263 TraceCheckUtils]: 10: Hoare triple {8741#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {8741#true} is VALID [2020-07-10 18:47:08,273 INFO L280 TraceCheckUtils]: 11: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-10 18:47:08,273 INFO L280 TraceCheckUtils]: 12: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-10 18:47:08,273 INFO L280 TraceCheckUtils]: 13: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-10 18:47:08,274 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {8741#true} {8741#true} #99#return; {8741#true} is VALID [2020-07-10 18:47:08,274 INFO L280 TraceCheckUtils]: 15: Hoare triple {8741#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {8741#true} is VALID [2020-07-10 18:47:08,274 INFO L280 TraceCheckUtils]: 16: Hoare triple {8741#true} ~i~0 := #t~nondet9; {8741#true} is VALID [2020-07-10 18:47:08,274 INFO L280 TraceCheckUtils]: 17: Hoare triple {8741#true} havoc #t~nondet9; {8741#true} is VALID [2020-07-10 18:47:08,274 INFO L263 TraceCheckUtils]: 18: Hoare triple {8741#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {8741#true} is VALID [2020-07-10 18:47:08,274 INFO L280 TraceCheckUtils]: 19: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-10 18:47:08,275 INFO L280 TraceCheckUtils]: 20: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-10 18:47:08,275 INFO L280 TraceCheckUtils]: 21: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-10 18:47:08,275 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {8741#true} {8741#true} #101#return; {8741#true} is VALID [2020-07-10 18:47:08,275 INFO L280 TraceCheckUtils]: 23: Hoare triple {8741#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {8741#true} is VALID [2020-07-10 18:47:08,277 INFO L263 TraceCheckUtils]: 24: Hoare triple {8741#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {8805#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 18:47:08,277 INFO L280 TraceCheckUtils]: 25: Hoare triple {8805#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8741#true} is VALID [2020-07-10 18:47:08,277 INFO L280 TraceCheckUtils]: 26: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-10 18:47:08,277 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {8741#true} {8741#true} #103#return; {8741#true} is VALID [2020-07-10 18:47:08,277 INFO L280 TraceCheckUtils]: 28: Hoare triple {8741#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {8741#true} is VALID [2020-07-10 18:47:08,279 INFO L263 TraceCheckUtils]: 29: Hoare triple {8741#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {8759#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-10 18:47:08,280 INFO L280 TraceCheckUtils]: 30: Hoare triple {8759#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} ~x := #in~x; {8760#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-10 18:47:08,280 INFO L280 TraceCheckUtils]: 31: Hoare triple {8760#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {8761#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-10 18:47:08,281 INFO L280 TraceCheckUtils]: 32: Hoare triple {8761#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {8761#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-10 18:47:08,282 INFO L280 TraceCheckUtils]: 33: Hoare triple {8761#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~i := #in~i; {8761#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-10 18:47:08,282 INFO L280 TraceCheckUtils]: 34: Hoare triple {8761#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~n := #in~n; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:47:08,283 INFO L280 TraceCheckUtils]: 35: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:47:08,283 INFO L263 TraceCheckUtils]: 36: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {8741#true} is VALID [2020-07-10 18:47:08,283 INFO L280 TraceCheckUtils]: 37: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-10 18:47:08,284 INFO L280 TraceCheckUtils]: 38: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-10 18:47:08,284 INFO L280 TraceCheckUtils]: 39: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-10 18:47:08,285 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {8741#true} {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:47:08,285 INFO L263 TraceCheckUtils]: 41: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {8741#true} is VALID [2020-07-10 18:47:08,285 INFO L280 TraceCheckUtils]: 42: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-10 18:47:08,285 INFO L280 TraceCheckUtils]: 43: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-10 18:47:08,285 INFO L280 TraceCheckUtils]: 44: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-10 18:47:08,286 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {8741#true} {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:47:08,287 INFO L280 TraceCheckUtils]: 46: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~x0~0 := ~x; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:47:08,289 INFO L280 TraceCheckUtils]: 47: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~y0~0 := ~y; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:47:08,289 INFO L280 TraceCheckUtils]: 48: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:47:08,290 INFO L280 TraceCheckUtils]: 49: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:47:08,291 INFO L280 TraceCheckUtils]: 50: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume #t~mem1 <= #t~mem2; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:47:08,291 INFO L280 TraceCheckUtils]: 51: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem1; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:47:08,292 INFO L280 TraceCheckUtils]: 52: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem2; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:47:08,293 INFO L280 TraceCheckUtils]: 53: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #t~post3 := ~x; {8771#(and (= 0 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:47:08,294 INFO L280 TraceCheckUtils]: 54: Hoare triple {8771#(and (= 0 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} ~x := 1 + #t~post3; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:47:08,294 INFO L280 TraceCheckUtils]: 55: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~post3; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:47:08,295 INFO L263 TraceCheckUtils]: 56: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {8773#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-10 18:47:08,296 INFO L280 TraceCheckUtils]: 57: Hoare triple {8773#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~x := #in~x; {8774#(and (<= 1 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-10 18:47:08,297 INFO L280 TraceCheckUtils]: 58: Hoare triple {8774#(and (<= 1 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {8775#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-10 18:47:08,298 INFO L280 TraceCheckUtils]: 59: Hoare triple {8775#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {8775#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-10 18:47:08,298 INFO L280 TraceCheckUtils]: 60: Hoare triple {8775#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~i := #in~i; {8775#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-10 18:47:08,299 INFO L280 TraceCheckUtils]: 61: Hoare triple {8775#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~n := #in~n; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:47:08,300 INFO L280 TraceCheckUtils]: 62: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume !(~x >= ~y); {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:47:08,300 INFO L263 TraceCheckUtils]: 63: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {8741#true} is VALID [2020-07-10 18:47:08,300 INFO L280 TraceCheckUtils]: 64: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-10 18:47:08,300 INFO L280 TraceCheckUtils]: 65: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-10 18:47:08,300 INFO L280 TraceCheckUtils]: 66: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-10 18:47:08,301 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {8741#true} {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #109#return; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:47:08,301 INFO L263 TraceCheckUtils]: 68: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {8741#true} is VALID [2020-07-10 18:47:08,302 INFO L280 TraceCheckUtils]: 69: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-10 18:47:08,302 INFO L280 TraceCheckUtils]: 70: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-10 18:47:08,302 INFO L280 TraceCheckUtils]: 71: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-10 18:47:08,303 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {8741#true} {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #111#return; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:47:08,303 INFO L280 TraceCheckUtils]: 73: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} ~x0~0 := ~x; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:47:08,304 INFO L280 TraceCheckUtils]: 74: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} ~y0~0 := ~y; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:47:08,305 INFO L280 TraceCheckUtils]: 75: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:47:08,306 INFO L280 TraceCheckUtils]: 76: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:47:08,306 INFO L280 TraceCheckUtils]: 77: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume #t~mem1 <= #t~mem2; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:47:08,307 INFO L280 TraceCheckUtils]: 78: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~mem1; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:47:08,308 INFO L280 TraceCheckUtils]: 79: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~mem2; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 18:47:08,308 INFO L280 TraceCheckUtils]: 80: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #t~post3 := ~x; {8784#(and (<= 1 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 18:47:08,309 INFO L280 TraceCheckUtils]: 81: Hoare triple {8784#(and (<= 1 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} ~x := 1 + #t~post3; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-10 18:47:08,310 INFO L280 TraceCheckUtils]: 82: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} havoc #t~post3; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-10 18:47:08,312 INFO L263 TraceCheckUtils]: 83: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {8786#(and (<= 2 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-10 18:47:08,312 INFO L280 TraceCheckUtils]: 84: Hoare triple {8786#(and (<= 2 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~x := #in~x; {8787#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-10 18:47:08,313 INFO L280 TraceCheckUtils]: 85: Hoare triple {8787#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (<= 2 check_~x))} ~y := #in~y; {8788#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-10 18:47:08,314 INFO L280 TraceCheckUtils]: 86: Hoare triple {8788#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {8788#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-10 18:47:08,314 INFO L280 TraceCheckUtils]: 87: Hoare triple {8788#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} ~i := #in~i; {8788#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-10 18:47:08,315 INFO L280 TraceCheckUtils]: 88: Hoare triple {8788#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} ~n := #in~n; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-10 18:47:08,316 INFO L280 TraceCheckUtils]: 89: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} assume !(~x >= ~y); {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-10 18:47:08,317 INFO L263 TraceCheckUtils]: 90: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {8741#true} is VALID [2020-07-10 18:47:08,317 INFO L280 TraceCheckUtils]: 91: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-10 18:47:08,317 INFO L280 TraceCheckUtils]: 92: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-10 18:47:08,317 INFO L280 TraceCheckUtils]: 93: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-10 18:47:08,318 INFO L275 TraceCheckUtils]: 94: Hoare quadruple {8741#true} {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} #109#return; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-10 18:47:08,318 INFO L263 TraceCheckUtils]: 95: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {8741#true} is VALID [2020-07-10 18:47:08,318 INFO L280 TraceCheckUtils]: 96: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-10 18:47:08,318 INFO L280 TraceCheckUtils]: 97: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-10 18:47:08,318 INFO L280 TraceCheckUtils]: 98: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-10 18:47:08,319 INFO L275 TraceCheckUtils]: 99: Hoare quadruple {8741#true} {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} #111#return; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-10 18:47:08,320 INFO L280 TraceCheckUtils]: 100: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} ~x0~0 := ~x; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-10 18:47:08,321 INFO L280 TraceCheckUtils]: 101: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} ~y0~0 := ~y; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-10 18:47:08,322 INFO L280 TraceCheckUtils]: 102: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-10 18:47:08,323 INFO L280 TraceCheckUtils]: 103: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-10 18:47:08,323 INFO L280 TraceCheckUtils]: 104: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} assume !(#t~mem1 <= #t~mem2); {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-10 18:47:08,324 INFO L280 TraceCheckUtils]: 105: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} havoc #t~mem1; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-10 18:47:08,324 INFO L280 TraceCheckUtils]: 106: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} havoc #t~mem2; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-10 18:47:08,325 INFO L280 TraceCheckUtils]: 107: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} #t~post4 := ~y; {8797#(and (<= (+ |check_#t~post4| 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-10 18:47:08,325 INFO L280 TraceCheckUtils]: 108: Hoare triple {8797#(and (<= (+ |check_#t~post4| 1) check_~n) (<= 2 check_~x))} ~y := #t~post4 - 1; {8798#(and (<= (+ check_~y 2) check_~n) (<= 2 check_~x))} is VALID [2020-07-10 18:47:08,326 INFO L280 TraceCheckUtils]: 109: Hoare triple {8798#(and (<= (+ check_~y 2) check_~n) (<= 2 check_~x))} havoc #t~post4; {8798#(and (<= (+ check_~y 2) check_~n) (<= 2 check_~x))} is VALID [2020-07-10 18:47:08,327 INFO L263 TraceCheckUtils]: 110: Hoare triple {8798#(and (<= (+ check_~y 2) check_~n) (<= 2 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {8799#(and (<= 2 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} is VALID [2020-07-10 18:47:08,328 INFO L280 TraceCheckUtils]: 111: Hoare triple {8799#(and (<= 2 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} ~x := #in~x; {8800#(and (<= (+ |check_#in~y| 2) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-10 18:47:08,329 INFO L280 TraceCheckUtils]: 112: Hoare triple {8800#(and (<= (+ |check_#in~y| 2) |check_#in~n|) (<= 2 check_~x))} ~y := #in~y; {8801#(and (<= (+ check_~y 2) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-10 18:47:08,329 INFO L280 TraceCheckUtils]: 113: Hoare triple {8801#(and (<= (+ check_~y 2) |check_#in~n|) (<= 2 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {8801#(and (<= (+ check_~y 2) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-10 18:47:08,330 INFO L280 TraceCheckUtils]: 114: Hoare triple {8801#(and (<= (+ check_~y 2) |check_#in~n|) (<= 2 check_~x))} ~i := #in~i; {8801#(and (<= (+ check_~y 2) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-10 18:47:08,330 INFO L280 TraceCheckUtils]: 115: Hoare triple {8801#(and (<= (+ check_~y 2) |check_#in~n|) (<= 2 check_~x))} ~n := #in~n; {8798#(and (<= (+ check_~y 2) check_~n) (<= 2 check_~x))} is VALID [2020-07-10 18:47:08,331 INFO L280 TraceCheckUtils]: 116: Hoare triple {8798#(and (<= (+ check_~y 2) check_~n) (<= 2 check_~x))} assume !(~x >= ~y); {8798#(and (<= (+ check_~y 2) check_~n) (<= 2 check_~x))} is VALID [2020-07-10 18:47:08,332 INFO L263 TraceCheckUtils]: 117: Hoare triple {8798#(and (<= (+ check_~y 2) check_~n) (<= 2 check_~x))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {8802#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 18:47:08,332 INFO L280 TraceCheckUtils]: 118: Hoare triple {8802#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {8803#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 18:47:08,333 INFO L280 TraceCheckUtils]: 119: Hoare triple {8803#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {8742#false} is VALID [2020-07-10 18:47:08,333 INFO L280 TraceCheckUtils]: 120: Hoare triple {8742#false} assume !false; {8742#false} is VALID [2020-07-10 18:47:08,352 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-10 18:47:08,352 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:47:08,352 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1402252764] [2020-07-10 18:47:08,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:47:08,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-07-10 18:47:08,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500540771] [2020-07-10 18:47:08,353 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 121 [2020-07-10 18:47:08,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:47:08,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2020-07-10 18:47:08,500 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:47:08,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-10 18:47:08,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:47:08,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-10 18:47:08,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2020-07-10 18:47:08,501 INFO L87 Difference]: Start difference. First operand 182 states and 195 transitions. Second operand 25 states. [2020-07-10 18:47:17,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:47:17,773 INFO L93 Difference]: Finished difference Result 237 states and 252 transitions. [2020-07-10 18:47:17,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-07-10 18:47:17,773 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 121 [2020-07-10 18:47:17,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:47:17,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 18:47:17,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 176 transitions. [2020-07-10 18:47:17,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 18:47:17,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 176 transitions. [2020-07-10 18:47:17,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 176 transitions. [2020-07-10 18:47:18,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:47:18,116 INFO L225 Difference]: With dead ends: 237 [2020-07-10 18:47:18,117 INFO L226 Difference]: Without dead ends: 171 [2020-07-10 18:47:18,119 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=576, Invalid=2846, Unknown=0, NotChecked=0, Total=3422 [2020-07-10 18:47:18,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-07-10 18:47:18,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 159. [2020-07-10 18:47:18,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:47:18,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand 159 states. [2020-07-10 18:47:18,750 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand 159 states. [2020-07-10 18:47:18,750 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 159 states. [2020-07-10 18:47:18,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:47:18,756 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2020-07-10 18:47:18,756 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 181 transitions. [2020-07-10 18:47:18,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:47:18,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:47:18,757 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 171 states. [2020-07-10 18:47:18,757 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 171 states. [2020-07-10 18:47:18,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:47:18,762 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2020-07-10 18:47:18,762 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 181 transitions. [2020-07-10 18:47:18,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:47:18,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:47:18,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:47:18,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:47:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-07-10 18:47:18,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2020-07-10 18:47:18,768 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 121 [2020-07-10 18:47:18,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:47:18,769 INFO L479 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2020-07-10 18:47:18,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-10 18:47:18,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 159 states and 169 transitions. [2020-07-10 18:47:19,253 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:47:19,253 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2020-07-10 18:47:19,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-07-10 18:47:19,255 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:47:19,255 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:47:19,256 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-10 18:47:19,256 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:47:19,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:47:19,256 INFO L82 PathProgramCache]: Analyzing trace with hash -32340482, now seen corresponding path program 4 times [2020-07-10 18:47:19,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:47:19,257 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1411574100] [2020-07-10 18:47:19,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:47:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:47:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:47:19,460 INFO L280 TraceCheckUtils]: 0: Hoare triple {10059#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {10011#true} is VALID [2020-07-10 18:47:19,460 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} #valid := #valid[0 := 0]; {10011#true} is VALID [2020-07-10 18:47:19,460 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume 0 < #StackHeapBarrier; {10011#true} is VALID [2020-07-10 18:47:19,461 INFO L280 TraceCheckUtils]: 3: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-10 18:47:19,461 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {10011#true} {10011#true} #117#return; {10011#true} is VALID [2020-07-10 18:47:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:47:19,465 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-10 18:47:19,465 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-10 18:47:19,466 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-10 18:47:19,466 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10011#true} {10011#true} #99#return; {10011#true} is VALID [2020-07-10 18:47:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:47:19,470 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-10 18:47:19,470 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-10 18:47:19,470 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-10 18:47:19,471 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10011#true} {10011#true} #101#return; {10011#true} is VALID [2020-07-10 18:47:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:47:19,504 INFO L280 TraceCheckUtils]: 0: Hoare triple {10060#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {10061#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 18:47:19,505 INFO L280 TraceCheckUtils]: 1: Hoare triple {10061#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {10061#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 18:47:19,506 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {10061#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {10011#true} #103#return; {10029#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-10 18:47:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:47:19,510 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-10 18:47:19,511 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-10 18:47:19,511 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-10 18:47:19,512 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10011#true} {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #109#return; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:47:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:47:19,516 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-10 18:47:19,516 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-10 18:47:19,516 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-10 18:47:19,517 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10011#true} {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #111#return; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:47:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:47:19,521 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-10 18:47:19,521 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-10 18:47:19,522 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-10 18:47:19,523 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10011#true} {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #109#return; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:47:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:47:19,527 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-10 18:47:19,527 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-10 18:47:19,527 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-10 18:47:19,528 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10011#true} {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #111#return; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:47:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:47:19,532 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-10 18:47:19,532 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-10 18:47:19,532 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-10 18:47:19,532 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10011#true} {10012#false} #109#return; {10012#false} is VALID [2020-07-10 18:47:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:47:19,537 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-10 18:47:19,538 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-10 18:47:19,538 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-10 18:47:19,538 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10011#true} {10012#false} #111#return; {10012#false} is VALID [2020-07-10 18:47:19,539 INFO L263 TraceCheckUtils]: 0: Hoare triple {10011#true} call ULTIMATE.init(); {10059#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 18:47:19,539 INFO L280 TraceCheckUtils]: 1: Hoare triple {10059#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {10011#true} is VALID [2020-07-10 18:47:19,539 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} #valid := #valid[0 := 0]; {10011#true} is VALID [2020-07-10 18:47:19,540 INFO L280 TraceCheckUtils]: 3: Hoare triple {10011#true} assume 0 < #StackHeapBarrier; {10011#true} is VALID [2020-07-10 18:47:19,540 INFO L280 TraceCheckUtils]: 4: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-10 18:47:19,540 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {10011#true} {10011#true} #117#return; {10011#true} is VALID [2020-07-10 18:47:19,540 INFO L263 TraceCheckUtils]: 6: Hoare triple {10011#true} call #t~ret14 := main(); {10011#true} is VALID [2020-07-10 18:47:19,540 INFO L280 TraceCheckUtils]: 7: Hoare triple {10011#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {10011#true} is VALID [2020-07-10 18:47:19,541 INFO L280 TraceCheckUtils]: 8: Hoare triple {10011#true} ~n~0 := #t~nondet8; {10011#true} is VALID [2020-07-10 18:47:19,541 INFO L280 TraceCheckUtils]: 9: Hoare triple {10011#true} havoc #t~nondet8; {10011#true} is VALID [2020-07-10 18:47:19,541 INFO L263 TraceCheckUtils]: 10: Hoare triple {10011#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {10011#true} is VALID [2020-07-10 18:47:19,541 INFO L280 TraceCheckUtils]: 11: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-10 18:47:19,541 INFO L280 TraceCheckUtils]: 12: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-10 18:47:19,541 INFO L280 TraceCheckUtils]: 13: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-10 18:47:19,542 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {10011#true} {10011#true} #99#return; {10011#true} is VALID [2020-07-10 18:47:19,542 INFO L280 TraceCheckUtils]: 15: Hoare triple {10011#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {10011#true} is VALID [2020-07-10 18:47:19,542 INFO L280 TraceCheckUtils]: 16: Hoare triple {10011#true} ~i~0 := #t~nondet9; {10011#true} is VALID [2020-07-10 18:47:19,542 INFO L280 TraceCheckUtils]: 17: Hoare triple {10011#true} havoc #t~nondet9; {10011#true} is VALID [2020-07-10 18:47:19,542 INFO L263 TraceCheckUtils]: 18: Hoare triple {10011#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {10011#true} is VALID [2020-07-10 18:47:19,543 INFO L280 TraceCheckUtils]: 19: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-10 18:47:19,543 INFO L280 TraceCheckUtils]: 20: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-10 18:47:19,543 INFO L280 TraceCheckUtils]: 21: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-10 18:47:19,543 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {10011#true} {10011#true} #101#return; {10011#true} is VALID [2020-07-10 18:47:19,543 INFO L280 TraceCheckUtils]: 23: Hoare triple {10011#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {10011#true} is VALID [2020-07-10 18:47:19,545 INFO L263 TraceCheckUtils]: 24: Hoare triple {10011#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {10060#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 18:47:19,546 INFO L280 TraceCheckUtils]: 25: Hoare triple {10060#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {10061#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 18:47:19,547 INFO L280 TraceCheckUtils]: 26: Hoare triple {10061#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {10061#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 18:47:19,549 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {10061#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {10011#true} #103#return; {10029#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-10 18:47:19,550 INFO L280 TraceCheckUtils]: 28: Hoare triple {10029#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {10030#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-10 18:47:19,552 INFO L263 TraceCheckUtils]: 29: Hoare triple {10030#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-10 18:47:19,553 INFO L280 TraceCheckUtils]: 30: Hoare triple {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~x := #in~x; {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-10 18:47:19,554 INFO L280 TraceCheckUtils]: 31: Hoare triple {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~y := #in~y; {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-10 18:47:19,554 INFO L280 TraceCheckUtils]: 32: Hoare triple {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:47:19,555 INFO L280 TraceCheckUtils]: 33: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~i := #in~i; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:47:19,556 INFO L280 TraceCheckUtils]: 34: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~n := #in~n; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:47:19,556 INFO L280 TraceCheckUtils]: 35: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume !(~x >= ~y); {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:47:19,557 INFO L263 TraceCheckUtils]: 36: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {10011#true} is VALID [2020-07-10 18:47:19,557 INFO L280 TraceCheckUtils]: 37: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-10 18:47:19,557 INFO L280 TraceCheckUtils]: 38: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-10 18:47:19,557 INFO L280 TraceCheckUtils]: 39: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-10 18:47:19,559 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {10011#true} {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #109#return; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:47:19,559 INFO L263 TraceCheckUtils]: 41: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {10011#true} is VALID [2020-07-10 18:47:19,559 INFO L280 TraceCheckUtils]: 42: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-10 18:47:19,559 INFO L280 TraceCheckUtils]: 43: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-10 18:47:19,560 INFO L280 TraceCheckUtils]: 44: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-10 18:47:19,561 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {10011#true} {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #111#return; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:47:19,561 INFO L280 TraceCheckUtils]: 46: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~x0~0 := ~x; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:47:19,563 INFO L280 TraceCheckUtils]: 47: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~y0~0 := ~y; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:47:19,563 INFO L280 TraceCheckUtils]: 48: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:47:19,564 INFO L280 TraceCheckUtils]: 49: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:47:19,564 INFO L280 TraceCheckUtils]: 50: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume #t~mem1 <= #t~mem2; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:47:19,565 INFO L280 TraceCheckUtils]: 51: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} havoc #t~mem1; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:47:19,565 INFO L280 TraceCheckUtils]: 52: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} havoc #t~mem2; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:47:19,566 INFO L280 TraceCheckUtils]: 53: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #t~post3 := ~x; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:47:19,567 INFO L280 TraceCheckUtils]: 54: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~x := 1 + #t~post3; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:47:19,567 INFO L280 TraceCheckUtils]: 55: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} havoc #t~post3; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:47:19,569 INFO L263 TraceCheckUtils]: 56: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-10 18:47:19,569 INFO L280 TraceCheckUtils]: 57: Hoare triple {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~x := #in~x; {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-10 18:47:19,570 INFO L280 TraceCheckUtils]: 58: Hoare triple {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~y := #in~y; {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-10 18:47:19,571 INFO L280 TraceCheckUtils]: 59: Hoare triple {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:47:19,571 INFO L280 TraceCheckUtils]: 60: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~i := #in~i; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:47:19,572 INFO L280 TraceCheckUtils]: 61: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~n := #in~n; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:47:19,573 INFO L280 TraceCheckUtils]: 62: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume !(~x >= ~y); {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:47:19,573 INFO L263 TraceCheckUtils]: 63: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {10011#true} is VALID [2020-07-10 18:47:19,573 INFO L280 TraceCheckUtils]: 64: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-10 18:47:19,573 INFO L280 TraceCheckUtils]: 65: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-10 18:47:19,573 INFO L280 TraceCheckUtils]: 66: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-10 18:47:19,574 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {10011#true} {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #109#return; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:47:19,575 INFO L263 TraceCheckUtils]: 68: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {10011#true} is VALID [2020-07-10 18:47:19,575 INFO L280 TraceCheckUtils]: 69: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-10 18:47:19,575 INFO L280 TraceCheckUtils]: 70: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-10 18:47:19,575 INFO L280 TraceCheckUtils]: 71: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-10 18:47:19,576 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {10011#true} {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #111#return; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:47:19,577 INFO L280 TraceCheckUtils]: 73: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~x0~0 := ~x; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:47:19,577 INFO L280 TraceCheckUtils]: 74: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~y0~0 := ~y; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 18:47:19,578 INFO L280 TraceCheckUtils]: 75: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {10049#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)) (= 0 |check_#t~mem1|))} is VALID [2020-07-10 18:47:19,579 INFO L280 TraceCheckUtils]: 76: Hoare triple {10049#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)) (= 0 |check_#t~mem1|))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {10050#(and (= 0 |check_#t~mem1|) (= 0 |check_#t~mem2|))} is VALID [2020-07-10 18:47:19,580 INFO L280 TraceCheckUtils]: 77: Hoare triple {10050#(and (= 0 |check_#t~mem1|) (= 0 |check_#t~mem2|))} assume !(#t~mem1 <= #t~mem2); {10012#false} is VALID [2020-07-10 18:47:19,580 INFO L280 TraceCheckUtils]: 78: Hoare triple {10012#false} havoc #t~mem1; {10012#false} is VALID [2020-07-10 18:47:19,580 INFO L280 TraceCheckUtils]: 79: Hoare triple {10012#false} havoc #t~mem2; {10012#false} is VALID [2020-07-10 18:47:19,581 INFO L280 TraceCheckUtils]: 80: Hoare triple {10012#false} #t~post4 := ~y; {10012#false} is VALID [2020-07-10 18:47:19,581 INFO L280 TraceCheckUtils]: 81: Hoare triple {10012#false} ~y := #t~post4 - 1; {10012#false} is VALID [2020-07-10 18:47:19,581 INFO L280 TraceCheckUtils]: 82: Hoare triple {10012#false} havoc #t~post4; {10012#false} is VALID [2020-07-10 18:47:19,581 INFO L263 TraceCheckUtils]: 83: Hoare triple {10012#false} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {10012#false} is VALID [2020-07-10 18:47:19,581 INFO L280 TraceCheckUtils]: 84: Hoare triple {10012#false} ~x := #in~x; {10012#false} is VALID [2020-07-10 18:47:19,582 INFO L280 TraceCheckUtils]: 85: Hoare triple {10012#false} ~y := #in~y; {10012#false} is VALID [2020-07-10 18:47:19,582 INFO L280 TraceCheckUtils]: 86: Hoare triple {10012#false} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {10012#false} is VALID [2020-07-10 18:47:19,582 INFO L280 TraceCheckUtils]: 87: Hoare triple {10012#false} ~i := #in~i; {10012#false} is VALID [2020-07-10 18:47:19,582 INFO L280 TraceCheckUtils]: 88: Hoare triple {10012#false} ~n := #in~n; {10012#false} is VALID [2020-07-10 18:47:19,583 INFO L280 TraceCheckUtils]: 89: Hoare triple {10012#false} assume !(~x >= ~y); {10012#false} is VALID [2020-07-10 18:47:19,583 INFO L263 TraceCheckUtils]: 90: Hoare triple {10012#false} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {10011#true} is VALID [2020-07-10 18:47:19,583 INFO L280 TraceCheckUtils]: 91: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-10 18:47:19,583 INFO L280 TraceCheckUtils]: 92: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-10 18:47:19,583 INFO L280 TraceCheckUtils]: 93: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-10 18:47:19,584 INFO L275 TraceCheckUtils]: 94: Hoare quadruple {10011#true} {10012#false} #109#return; {10012#false} is VALID [2020-07-10 18:47:19,584 INFO L263 TraceCheckUtils]: 95: Hoare triple {10012#false} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {10011#true} is VALID [2020-07-10 18:47:19,584 INFO L280 TraceCheckUtils]: 96: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-10 18:47:19,585 INFO L280 TraceCheckUtils]: 97: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-10 18:47:19,585 INFO L280 TraceCheckUtils]: 98: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-10 18:47:19,585 INFO L275 TraceCheckUtils]: 99: Hoare quadruple {10011#true} {10012#false} #111#return; {10012#false} is VALID [2020-07-10 18:47:19,585 INFO L280 TraceCheckUtils]: 100: Hoare triple {10012#false} ~x0~0 := ~x; {10012#false} is VALID [2020-07-10 18:47:19,585 INFO L280 TraceCheckUtils]: 101: Hoare triple {10012#false} ~y0~0 := ~y; {10012#false} is VALID [2020-07-10 18:47:19,586 INFO L280 TraceCheckUtils]: 102: Hoare triple {10012#false} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {10012#false} is VALID [2020-07-10 18:47:19,586 INFO L280 TraceCheckUtils]: 103: Hoare triple {10012#false} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {10012#false} is VALID [2020-07-10 18:47:19,586 INFO L280 TraceCheckUtils]: 104: Hoare triple {10012#false} assume #t~mem1 <= #t~mem2; {10012#false} is VALID [2020-07-10 18:47:19,586 INFO L280 TraceCheckUtils]: 105: Hoare triple {10012#false} havoc #t~mem1; {10012#false} is VALID [2020-07-10 18:47:19,586 INFO L280 TraceCheckUtils]: 106: Hoare triple {10012#false} havoc #t~mem2; {10012#false} is VALID [2020-07-10 18:47:19,586 INFO L280 TraceCheckUtils]: 107: Hoare triple {10012#false} #t~post3 := ~x; {10012#false} is VALID [2020-07-10 18:47:19,587 INFO L280 TraceCheckUtils]: 108: Hoare triple {10012#false} ~x := 1 + #t~post3; {10012#false} is VALID [2020-07-10 18:47:19,587 INFO L280 TraceCheckUtils]: 109: Hoare triple {10012#false} havoc #t~post3; {10012#false} is VALID [2020-07-10 18:47:19,587 INFO L263 TraceCheckUtils]: 110: Hoare triple {10012#false} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {10012#false} is VALID [2020-07-10 18:47:19,587 INFO L280 TraceCheckUtils]: 111: Hoare triple {10012#false} ~x := #in~x; {10012#false} is VALID [2020-07-10 18:47:19,587 INFO L280 TraceCheckUtils]: 112: Hoare triple {10012#false} ~y := #in~y; {10012#false} is VALID [2020-07-10 18:47:19,588 INFO L280 TraceCheckUtils]: 113: Hoare triple {10012#false} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {10012#false} is VALID [2020-07-10 18:47:19,588 INFO L280 TraceCheckUtils]: 114: Hoare triple {10012#false} ~i := #in~i; {10012#false} is VALID [2020-07-10 18:47:19,588 INFO L280 TraceCheckUtils]: 115: Hoare triple {10012#false} ~n := #in~n; {10012#false} is VALID [2020-07-10 18:47:19,588 INFO L280 TraceCheckUtils]: 116: Hoare triple {10012#false} assume !(~x >= ~y); {10012#false} is VALID [2020-07-10 18:47:19,588 INFO L263 TraceCheckUtils]: 117: Hoare triple {10012#false} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {10012#false} is VALID [2020-07-10 18:47:19,589 INFO L280 TraceCheckUtils]: 118: Hoare triple {10012#false} ~cond := #in~cond; {10012#false} is VALID [2020-07-10 18:47:19,589 INFO L280 TraceCheckUtils]: 119: Hoare triple {10012#false} assume 0 == ~cond; {10012#false} is VALID [2020-07-10 18:47:19,589 INFO L280 TraceCheckUtils]: 120: Hoare triple {10012#false} assume !false; {10012#false} is VALID [2020-07-10 18:47:19,607 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-10 18:47:19,608 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:47:19,608 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1411574100] [2020-07-10 18:47:19,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:47:19,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-10 18:47:19,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727186895] [2020-07-10 18:47:19,609 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 121 [2020-07-10 18:47:19,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:47:19,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 18:47:19,717 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:47:19,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 18:47:19,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:47:19,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 18:47:19,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-07-10 18:47:19,718 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 11 states. [2020-07-10 18:47:21,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:47:21,159 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2020-07-10 18:47:21,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 18:47:21,160 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 121 [2020-07-10 18:47:21,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:47:21,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 18:47:21,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 87 transitions. [2020-07-10 18:47:21,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 18:47:21,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 87 transitions. [2020-07-10 18:47:21,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 87 transitions. [2020-07-10 18:47:21,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:47:21,297 INFO L225 Difference]: With dead ends: 163 [2020-07-10 18:47:21,297 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 18:47:21,298 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-07-10 18:47:21,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 18:47:21,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 18:47:21,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:47:21,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 18:47:21,299 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 18:47:21,299 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 18:47:21,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:47:21,300 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 18:47:21,300 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 18:47:21,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:47:21,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:47:21,301 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 18:47:21,301 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 18:47:21,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:47:21,301 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 18:47:21,301 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 18:47:21,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:47:21,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:47:21,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:47:21,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:47:21,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 18:47:21,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 18:47:21,303 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2020-07-10 18:47:21,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:47:21,303 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 18:47:21,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 18:47:21,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 18:47:21,303 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:47:21,303 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 18:47:21,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:47:21,304 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-10 18:47:21,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 18:47:24,190 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2020-07-10 18:47:24,407 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2020-07-10 18:47:24,770 WARN L193 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2020-07-10 18:47:25,053 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2020-07-10 18:47:25,260 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-07-10 18:47:25,497 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2020-07-10 18:47:25,813 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-07-10 18:47:26,138 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-10 18:47:26,521 WARN L193 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2020-07-10 18:47:26,893 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2020-07-10 18:47:27,268 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2020-07-10 18:47:27,469 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-07-10 18:47:27,834 WARN L193 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2020-07-10 18:47:28,108 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2020-07-10 18:47:28,543 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 29 [2020-07-10 18:47:28,935 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2020-07-10 18:47:29,303 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2020-07-10 18:47:29,536 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2020-07-10 18:47:29,836 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2020-07-10 18:47:30,097 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2020-07-10 18:47:30,480 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-10 18:47:30,807 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-10 18:47:31,048 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2020-07-10 18:47:31,186 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 25 [2020-07-10 18:47:31,552 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-10 18:47:31,793 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2020-07-10 18:47:32,226 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-10 18:47:32,594 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-10 18:47:32,921 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-07-10 18:47:33,172 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2020-07-10 18:47:33,213 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 18:47:33,213 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-10 18:47:33,213 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 18:47:33,213 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-10 18:47:33,213 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 18:47:33,213 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 18:47:33,214 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 18:47:33,214 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 18:47:33,214 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 18:47:33,214 INFO L271 CegarLoopResult]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2020-07-10 18:47:33,214 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-10 18:47:33,214 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-10 18:47:33,214 INFO L271 CegarLoopResult]: At program point L6-3(lines 5 7) the Hoare annotation is: true [2020-07-10 18:47:33,214 INFO L271 CegarLoopResult]: At program point assume_abort_if_notEXIT(lines 5 7) the Hoare annotation is: true [2020-07-10 18:47:33,214 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 38 52) the Hoare annotation is: true [2020-07-10 18:47:33,214 INFO L271 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: true [2020-07-10 18:47:33,215 INFO L264 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (<= main_~ai~1 main_~ax~1) (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= 0 main_~ai~1) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-10 18:47:33,215 INFO L271 CegarLoopResult]: At program point L48-1(line 48) the Hoare annotation is: true [2020-07-10 18:47:33,215 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-10 18:47:33,215 INFO L264 CegarLoopResult]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= |main_#t~mem12| 0) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-10 18:47:33,215 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 38 52) the Hoare annotation is: true [2020-07-10 18:47:33,215 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-10 18:47:33,215 INFO L264 CegarLoopResult]: At program point L46-2(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= 0 main_~ai~1) (= |main_#t~mem12| 0) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-10 18:47:33,215 INFO L264 CegarLoopResult]: At program point L44-1(line 44) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|)) [2020-07-10 18:47:33,215 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-10 18:47:33,215 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-10 18:47:33,215 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 38 52) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-10 18:47:33,216 INFO L264 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= 0 main_~ai~1) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-10 18:47:33,216 INFO L264 CegarLoopResult]: At program point L47-1(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |main_#t~mem13| 0) (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= 0 main_~ai~1) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-10 18:47:33,216 INFO L264 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-10 18:47:33,216 INFO L264 CegarLoopResult]: At program point L47-2(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |main_#t~mem13| 0) (<= main_~ai~1 main_~ax~1) (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= 0 main_~ai~1) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-10 18:47:33,216 INFO L264 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-10 18:47:33,216 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-10 18:47:33,216 INFO L264 CegarLoopResult]: At program point L45-2(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-10 18:47:33,216 INFO L264 CegarLoopResult]: At program point L43-1(line 43) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-10 18:47:33,216 INFO L264 CegarLoopResult]: At program point L45-3(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-10 18:47:33,217 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-10 18:47:33,217 INFO L264 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-10 18:47:33,217 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-10 18:47:33,217 INFO L264 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-10 18:47:33,217 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (= 0 check_~ax~0)) (.cse1 (= 0 check_~ai~0)) (.cse2 (= .cse6 (select |#memory_int| check_~a.base))) (.cse4 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= .cse6 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1 .cse2 (or (= 0 check_~x) (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))))) .cse4 .cse5 (not (= 0 |check_#in~x|))) (or (and .cse0 .cse1 .cse2) (not (<= 1 |check_#in~x|)) .cse4 .cse5)))) [2020-07-10 18:47:33,218 INFO L264 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (and (= 0 check_~ax~0) (= 0 check_~ai~0) (= .cse0 (select |#memory_int| check_~a.base))) (not (<= 1 |check_#in~x|)) (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (= .cse0 (select |#memory_int| |check_#in~a.base|))))) [2020-07-10 18:47:33,218 INFO L271 CegarLoopResult]: At program point checkENTRY(lines 14 36) the Hoare annotation is: true [2020-07-10 18:47:33,218 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-10 18:47:33,218 INFO L264 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (= 0 |check_#t~mem6|)) (.cse1 (= .cse5 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1) (not (<= 1 |check_#in~x|)) .cse2 .cse3) (or (and .cse0 .cse1 (or (= 0 check_~x) (let ((.cse4 (+ check_~y 1))) (and (<= .cse4 |check_#in~n|) (<= .cse4 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|)))))) [2020-07-10 18:47:33,218 INFO L264 CegarLoopResult]: At program point L31-2(line 31) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (= 0 check_~ai~0)) (.cse1 (= 0 |check_#t~mem6|)) (.cse2 (= .cse6 (select |#memory_int| check_~a.base))) (.cse4 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= .cse6 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1 .cse2 (or (= 0 check_~x) (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))))) .cse4 .cse5 (not (= 0 |check_#in~x|))) (or (and .cse0 .cse1 .cse2) (not (<= 1 |check_#in~x|)) .cse4 .cse5)))) [2020-07-10 18:47:33,218 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-10 18:47:33,219 INFO L264 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-10 18:47:33,219 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-10 18:47:33,219 INFO L264 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-10 18:47:33,219 INFO L264 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-10 18:47:33,219 INFO L264 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-10 18:47:33,219 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-10 18:47:33,220 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-10 18:47:33,220 INFO L264 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (let ((.cse1 ((as const (Array Int Int)) 0)) (.cse5 (+ check_~y 1))) (let ((.cse0 (<= .cse5 |check_#in~n|)) (.cse2 (<= .cse5 check_~n)) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse1 (select |#memory_int| |check_#in~a.base|))))) (and (or (not (<= 1 |check_#in~x|)) (and .cse0 (= .cse1 (select |#memory_int| check_~a.base)) .cse2 (<= 1 check_~x)) .cse3 .cse4) (or (and .cse0 (= 0 check_~x) .cse2) .cse3 .cse4 (not (= 0 |check_#in~x|)))))) [2020-07-10 18:47:33,220 INFO L264 CegarLoopResult]: At program point checkFINAL(lines 14 36) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= 1 |check_#in~x|)) (= .cse0 (select |#memory_int| check_~a.base)) (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (= .cse0 (select |#memory_int| |check_#in~a.base|))))) [2020-07-10 18:47:33,220 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (= 0 check_~ai~0)) (.cse1 (= .cse5 (select |#memory_int| check_~a.base))) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1 (or (= 0 check_~x) (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) (<= 1 check_~x))))) .cse3 .cse4 (not (= 0 |check_#in~x|))) (or (and .cse0 .cse1) (not (<= 1 |check_#in~x|)) .cse3 .cse4)))) [2020-07-10 18:47:33,220 INFO L264 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse1 (= 0 check_~ai~0)) (.cse2 (= .cse6 (select |#memory_int| check_~a.base))) (.cse3 (= 0 |check_#t~mem7|)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse6 (select |#memory_int| |check_#in~a.base|))))) (and (or (not (<= 1 |check_#in~x|)) .cse0 (and .cse1 .cse2 .cse3) .cse4) (or (and .cse1 .cse2 (or (= 0 check_~x) (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n) (<= 1 check_~x)))) .cse3) .cse0 .cse4 (not (= 0 |check_#in~x|)))))) [2020-07-10 18:47:33,220 INFO L264 CegarLoopResult]: At program point L32-2(line 32) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (= 0 check_~ax~0)) (.cse1 (= 0 check_~ai~0)) (.cse2 (= .cse7 (select |#memory_int| check_~a.base))) (.cse3 (= 0 |check_#t~mem7|)) (.cse4 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1 .cse2 .cse3) (not (<= 1 |check_#in~x|)) .cse4 .cse5) (or (and .cse0 .cse1 .cse2 (or (= 0 check_~x) (let ((.cse6 (+ check_~y 1))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n) (<= 1 check_~x)))) .cse3) .cse4 .cse5 (not (= 0 |check_#in~x|)))))) [2020-07-10 18:47:33,221 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-10 18:47:33,221 INFO L264 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: (let ((.cse8 ((as const (Array Int Int)) 0)) (.cse9 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse4 (<= .cse9 |check_#in~n|)) (.cse5 (= .cse8 (select |#memory_int| check_~a.base))) (.cse6 (<= .cse9 check_~n)) (.cse7 (= 0 |check_#t~mem1|)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse8 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse3 (+ check_~y 2))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n))) .cse2 .cse1) (or (and .cse4 (= 0 check_~x) .cse5 .cse6 .cse7) .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (and .cse4 .cse5 (<= 1 check_~x) .cse6 .cse7) (not (<= 1 |check_#in~x|)) .cse0 .cse1)))) [2020-07-10 18:47:33,221 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-10 18:47:33,222 INFO L264 CegarLoopResult]: At program point L24-2(lines 24 25) the Hoare annotation is: (let ((.cse9 ((as const (Array Int Int)) 0)) (.cse10 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse4 (<= .cse10 |check_#in~n|)) (.cse5 (= .cse9 (select |#memory_int| check_~a.base))) (.cse6 (<= .cse10 check_~n)) (.cse7 (= 0 |check_#t~mem1|)) (.cse8 (= 0 |check_#t~mem2|)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse9 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse3 (+ check_~y 2))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n))) .cse2 .cse1) (or (not (<= 1 |check_#in~x|)) .cse0 (and .cse4 .cse5 (<= 1 check_~x) .cse6 .cse7 .cse8) .cse1) (or (and .cse4 (= 0 check_~x) .cse5 .cse6 .cse7 .cse8) .cse0 .cse1 (not (= 0 |check_#in~x|)))))) [2020-07-10 18:47:33,222 INFO L264 CegarLoopResult]: At program point L24-3(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (= .cse7 (select |#memory_int| check_~a.base))) (.cse5 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse2 .cse1) (or (and .cse3 (= 0 check_~x) .cse4 .cse5 (= 0 |check_#t~mem1|) (= 0 |check_#t~mem2|)) .cse0 .cse1 (not (= 0 |check_#in~x|)))))) [2020-07-10 18:47:33,222 INFO L264 CegarLoopResult]: At program point L24-4(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-10 18:47:33,222 INFO L264 CegarLoopResult]: At program point L24-5(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-10 18:47:33,222 INFO L264 CegarLoopResult]: At program point checkEXIT(lines 14 36) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= 1 |check_#in~x|)) (= .cse0 (select |#memory_int| check_~a.base)) (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (= .cse0 (select |#memory_int| |check_#in~a.base|))))) [2020-07-10 18:47:33,223 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-10 18:47:33,223 INFO L264 CegarLoopResult]: At program point L24-6(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse0 (<= .cse8 |check_#in~n|)) (.cse1 (= .cse7 (select |#memory_int| check_~a.base))) (.cse2 (<= .cse8 check_~n)) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse4 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or (not (<= 1 |check_#in~x|)) (and .cse0 .cse1 (<= 1 |check_#t~post3|) .cse2 (<= 1 check_~x)) .cse3 .cse4) (or .cse3 .cse4 .cse5 (<= 2 check_~x)) (or (and (= 0 |check_#t~post3|) .cse0 (= 0 check_~x) .cse1 .cse2) .cse3 .cse4 (not (= 0 |check_#in~x|))) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse4)))) [2020-07-10 18:47:33,223 INFO L264 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-10 18:47:33,223 INFO L264 CegarLoopResult]: At program point L24-7(line 24) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0)) (.cse7 (+ check_~y 1))) (let ((.cse0 (<= .cse7 |check_#in~n|)) (.cse1 (= .cse6 (select |#memory_int| check_~a.base))) (.cse2 (<= .cse7 check_~n)) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse6 (select |#memory_int| |check_#in~a.base|))))) (and (or (and (= 0 |check_#t~post3|) .cse0 .cse1 (<= 1 check_~x) .cse2) .cse3 .cse4 (not (= 0 |check_#in~x|))) (or (and .cse0 .cse1 (<= 1 |check_#t~post3|) .cse2 (<= 2 check_~x)) (not (<= 1 |check_#in~x|)) .cse3 .cse4) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n))) (not (<= 2 |check_#in~x|)) .cse4)))) [2020-07-10 18:47:33,223 INFO L264 CegarLoopResult]: At program point L24-9(line 24) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-10 18:47:33,224 INFO L264 CegarLoopResult]: At program point L14(lines 14 36) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (= 0 check_~x) .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) (<= 1 check_~x) .cse0 .cse1))) [2020-07-10 18:47:33,224 INFO L264 CegarLoopResult]: At program point L24-10(line 24) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-10 18:47:33,224 INFO L264 CegarLoopResult]: At program point L14-1(lines 14 36) the Hoare annotation is: (let ((.cse3 (<= (+ check_~y 1) |check_#in~n|)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (not (<= 2 |check_#in~x|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 (= 0 check_~x)) .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (and .cse3 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse2 .cse1 (<= (+ check_~y 2) |check_#in~n|)))) [2020-07-10 18:47:33,224 INFO L264 CegarLoopResult]: At program point L24-11(lines 24 25) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse0 (<= .cse6 |check_#in~n|)) (.cse1 (= .cse5 (select |#memory_int| check_~a.base))) (.cse2 (<= .cse6 check_~n)) (.cse4 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1 .cse2 (<= 1 check_~x)) .cse3 .cse4 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse3 (and .cse0 .cse1 .cse2 (<= 2 check_~x)) .cse4) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (not (<= 2 |check_#in~x|)) .cse4 (<= (+ check_~y 2) check_~n))))) [2020-07-10 18:47:33,224 INFO L264 CegarLoopResult]: At program point L14-2(lines 14 36) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= (+ check_~y 1) |check_#in~n|)) (.cse4 (= .cse5 (select |#memory_int| check_~a.base))) (.cse2 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 (= 0 check_~x) .cse4) .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 (and .cse3 .cse4 (<= 1 check_~x)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse2 .cse1 (<= (+ check_~y 2) |check_#in~n|))))) [2020-07-10 18:47:33,225 INFO L264 CegarLoopResult]: At program point L14-3(lines 14 36) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= (+ check_~y 1) |check_#in~n|)) (.cse4 (= .cse5 (select |#memory_int| check_~a.base))) (.cse2 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 (= 0 check_~x) .cse4) .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 (and .cse3 .cse4 (<= 1 check_~x)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse2 .cse1 (<= (+ check_~y 2) |check_#in~n|))))) [2020-07-10 18:47:33,225 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 8 10) the Hoare annotation is: true [2020-07-10 18:47:33,225 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 8 10) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 18:47:33,225 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 18:47:33,225 INFO L264 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 18:47:33,225 INFO L264 CegarLoopResult]: At program point L9-3(lines 8 10) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 18:47:33,225 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 18:47:33,225 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-10 18:47:33,225 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitEXIT(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2020-07-10 18:47:33,225 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitFINAL(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2020-07-10 18:47:33,321 INFO L163 areAnnotationChecker]: CFG has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 18:47:33,335 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.getLongDescription(ProcedureContractResult.java:74) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createProcedureContractResults(TraceAbstractionStarter.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-10 18:47:33,345 INFO L168 Benchmark]: Toolchain (without parser) took 81014.68 ms. Allocated memory was 138.4 MB in the beginning and 551.6 MB in the end (delta: 413.1 MB). Free memory was 102.2 MB in the beginning and 171.3 MB in the end (delta: -69.1 MB). Peak memory consumption was 344.1 MB. Max. memory is 7.1 GB. [2020-07-10 18:47:33,346 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 138.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 18:47:33,346 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.32 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.8 MB in the beginning and 182.0 MB in the end (delta: -80.2 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2020-07-10 18:47:33,347 INFO L168 Benchmark]: Boogie Preprocessor took 47.37 ms. Allocated memory is still 202.9 MB. Free memory was 182.0 MB in the beginning and 179.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2020-07-10 18:47:33,348 INFO L168 Benchmark]: RCFGBuilder took 603.88 ms. Allocated memory is still 202.9 MB. Free memory was 179.6 MB in the beginning and 142.6 MB in the end (delta: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 7.1 GB. [2020-07-10 18:47:33,353 INFO L168 Benchmark]: TraceAbstraction took 79973.14 ms. Allocated memory was 202.9 MB in the beginning and 551.6 MB in the end (delta: 348.7 MB). Free memory was 142.6 MB in the beginning and 171.3 MB in the end (delta: -28.7 MB). Peak memory consumption was 319.3 MB. Max. memory is 7.1 GB. [2020-07-10 18:47:33,360 INFO L336 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.28 ms. Allocated memory is still 138.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 384.32 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.8 MB in the beginning and 182.0 MB in the end (delta: -80.2 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.37 ms. Allocated memory is still 202.9 MB. Free memory was 182.0 MB in the beginning and 179.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 603.88 ms. Allocated memory is still 202.9 MB. Free memory was 179.6 MB in the beginning and 142.6 MB in the end (delta: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 79973.14 ms. Allocated memory was 202.9 MB in the beginning and 551.6 MB in the end (delta: 348.7 MB). Free memory was 142.6 MB in the beginning and 171.3 MB in the end (delta: -28.7 MB). Peak memory consumption was 319.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 5]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 38]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...