/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/verifythis/elimination_max_rec.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:01:07,984 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:01:07,987 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:01:08,002 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:01:08,003 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:01:08,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:01:08,005 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:01:08,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:01:08,008 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:01:08,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:01:08,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:01:08,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:01:08,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:01:08,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:01:08,013 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:01:08,014 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:01:08,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:01:08,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:01:08,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:01:08,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:01:08,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:01:08,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:01:08,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:01:08,024 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:01:08,026 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:01:08,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:01:08,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:01:08,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:01:08,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:01:08,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:01:08,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:01:08,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:01:08,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:01:08,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:01:08,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:01:08,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:01:08,034 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:01:08,034 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:01:08,034 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:01:08,035 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:01:08,035 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:01:08,036 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:01:08,051 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:01:08,051 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:01:08,052 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:01:08,052 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:01:08,053 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:01:08,053 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:01:08,053 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:01:08,053 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:01:08,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:01:08,054 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:01:08,054 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:01:08,054 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:01:08,054 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:01:08,054 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:01:08,054 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:01:08,055 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:01:08,055 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:01:08,055 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:01:08,055 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:01:08,055 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:01:08,056 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:01:08,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:01:08,056 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:01:08,056 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:01:08,056 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:01:08,057 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:01:08,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:01:08,057 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:01:08,057 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:01:08,057 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:01:08,313 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:01:08,325 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:01:08,328 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:01:08,329 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:01:08,329 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:01:08,330 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max_rec.c [2020-07-10 15:01:08,403 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/571de33fc/163181399c6343bead07a044ee0c29e3/FLAG6f39c9624 [2020-07-10 15:01:08,876 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:01:08,876 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec.c [2020-07-10 15:01:08,883 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/571de33fc/163181399c6343bead07a044ee0c29e3/FLAG6f39c9624 [2020-07-10 15:01:09,238 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/571de33fc/163181399c6343bead07a044ee0c29e3 [2020-07-10 15:01:09,247 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:01:09,249 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:01:09,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:01:09,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:01:09,253 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:01:09,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:01:09" (1/1) ... [2020-07-10 15:01:09,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@117fc913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:01:09, skipping insertion in model container [2020-07-10 15:01:09,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:01:09" (1/1) ... [2020-07-10 15:01:09,266 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:01:09,284 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:01:09,474 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:01:09,491 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:01:09,515 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:01:09,643 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:01:09,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:01:09 WrapperNode [2020-07-10 15:01:09,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:01:09,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:01:09,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:01:09,645 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:01:09,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:01:09" (1/1) ... [2020-07-10 15:01:09,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:01:09" (1/1) ... [2020-07-10 15:01:09,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:01:09" (1/1) ... [2020-07-10 15:01:09,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:01:09" (1/1) ... [2020-07-10 15:01:09,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:01:09" (1/1) ... [2020-07-10 15:01:09,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:01:09" (1/1) ... [2020-07-10 15:01:09,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:01:09" (1/1) ... [2020-07-10 15:01:09,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:01:09,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:01:09,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:01:09,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:01:09,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:01:09" (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 15:01:09,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:01:09,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:01:09,778 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:01:09,778 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:01:09,778 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-10 15:01:09,778 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:01:09,778 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-10 15:01:09,778 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 15:01:09,778 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 15:01:09,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:01:09,779 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:01:09,779 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:01:09,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:01:09,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:01:09,780 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-10 15:01:09,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:01:09,780 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:01:09,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:01:09,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-10 15:01:09,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:01:09,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:01:09,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:01:09,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:01:10,207 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:01:10,208 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 15:01:10,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:01:10 BoogieIcfgContainer [2020-07-10 15:01:10,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:01:10,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:01:10,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:01:10,216 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:01:10,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:01:09" (1/3) ... [2020-07-10 15:01:10,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aff6b8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:01:10, skipping insertion in model container [2020-07-10 15:01:10,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:01:09" (2/3) ... [2020-07-10 15:01:10,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aff6b8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:01:10, skipping insertion in model container [2020-07-10 15:01:10,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:01:10" (3/3) ... [2020-07-10 15:01:10,220 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2020-07-10 15:01:10,231 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:01:10,238 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:01:10,253 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:01:10,277 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:01:10,278 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:01:10,278 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:01:10,278 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:01:10,278 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:01:10,278 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:01:10,279 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:01:10,279 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:01:10,297 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2020-07-10 15:01:10,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:01:10,302 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:01:10,303 INFO L422 BasicCegarLoop]: trace histogram [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 15:01:10,304 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:01:10,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:01:10,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1882906983, now seen corresponding path program 1 times [2020-07-10 15:01:10,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:01:10,321 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173421018] [2020-07-10 15:01:10,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:01:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:10,547 INFO L280 TraceCheckUtils]: 0: Hoare triple {57#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {45#true} is VALID [2020-07-10 15:01:10,547 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#true} assume true; {45#true} is VALID [2020-07-10 15:01:10,548 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {45#true} {45#true} #68#return; {45#true} is VALID [2020-07-10 15:01:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:10,558 INFO L280 TraceCheckUtils]: 0: Hoare triple {45#true} ~cond := #in~cond; {45#true} is VALID [2020-07-10 15:01:10,560 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#true} assume 0 == ~cond;assume false; {46#false} is VALID [2020-07-10 15:01:10,560 INFO L280 TraceCheckUtils]: 2: Hoare triple {46#false} assume true; {46#false} is VALID [2020-07-10 15:01:10,561 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {46#false} {45#true} #54#return; {46#false} is VALID [2020-07-10 15:01:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:10,582 INFO L280 TraceCheckUtils]: 0: Hoare triple {58#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {45#true} is VALID [2020-07-10 15:01:10,583 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#true} assume true; {45#true} is VALID [2020-07-10 15:01:10,583 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {45#true} {46#false} #56#return; {46#false} is VALID [2020-07-10 15:01:10,585 INFO L263 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {57#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:01:10,586 INFO L280 TraceCheckUtils]: 1: Hoare triple {57#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {45#true} is VALID [2020-07-10 15:01:10,586 INFO L280 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2020-07-10 15:01:10,587 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #68#return; {45#true} is VALID [2020-07-10 15:01:10,587 INFO L263 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret12 := main(); {45#true} is VALID [2020-07-10 15:01:10,588 INFO L280 TraceCheckUtils]: 5: Hoare triple {45#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~n~0 := #t~nondet9;havoc #t~nondet9; {45#true} is VALID [2020-07-10 15:01:10,589 INFO L263 TraceCheckUtils]: 6: Hoare triple {45#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {45#true} is VALID [2020-07-10 15:01:10,589 INFO L280 TraceCheckUtils]: 7: Hoare triple {45#true} ~cond := #in~cond; {45#true} is VALID [2020-07-10 15:01:10,590 INFO L280 TraceCheckUtils]: 8: Hoare triple {45#true} assume 0 == ~cond;assume false; {46#false} is VALID [2020-07-10 15:01:10,591 INFO L280 TraceCheckUtils]: 9: Hoare triple {46#false} assume true; {46#false} is VALID [2020-07-10 15:01:10,591 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {46#false} {45#true} #54#return; {46#false} is VALID [2020-07-10 15:01:10,591 INFO L280 TraceCheckUtils]: 11: Hoare triple {46#false} call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); {46#false} is VALID [2020-07-10 15:01:10,592 INFO L263 TraceCheckUtils]: 12: Hoare triple {46#false} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {58#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:01:10,592 INFO L280 TraceCheckUtils]: 13: Hoare triple {58#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {45#true} is VALID [2020-07-10 15:01:10,593 INFO L280 TraceCheckUtils]: 14: Hoare triple {45#true} assume true; {45#true} is VALID [2020-07-10 15:01:10,593 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {45#true} {46#false} #56#return; {46#false} is VALID [2020-07-10 15:01:10,594 INFO L280 TraceCheckUtils]: 16: Hoare triple {46#false} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {46#false} is VALID [2020-07-10 15:01:10,594 INFO L263 TraceCheckUtils]: 17: Hoare triple {46#false} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~n~0); {46#false} is VALID [2020-07-10 15:01:10,595 INFO L280 TraceCheckUtils]: 18: Hoare triple {46#false} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; {46#false} is VALID [2020-07-10 15:01:10,595 INFO L280 TraceCheckUtils]: 19: Hoare triple {46#false} assume !(~x >= ~y); {46#false} is VALID [2020-07-10 15:01:10,595 INFO L263 TraceCheckUtils]: 20: Hoare triple {46#false} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {46#false} is VALID [2020-07-10 15:01:10,596 INFO L280 TraceCheckUtils]: 21: Hoare triple {46#false} ~cond := #in~cond; {46#false} is VALID [2020-07-10 15:01:10,596 INFO L280 TraceCheckUtils]: 22: Hoare triple {46#false} assume 0 == ~cond; {46#false} is VALID [2020-07-10 15:01:10,597 INFO L280 TraceCheckUtils]: 23: Hoare triple {46#false} assume !false; {46#false} is VALID [2020-07-10 15:01:10,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:01:10,602 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173421018] [2020-07-10 15:01:10,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:01:10,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:01:10,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348775570] [2020-07-10 15:01:10,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-10 15:01:10,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:01:10,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:01:10,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:01:10,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:01:10,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:01:10,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:01:10,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:01:10,690 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 4 states. [2020-07-10 15:01:11,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:11,129 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2020-07-10 15:01:11,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:01:11,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-10 15:01:11,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:01:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:01:11,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2020-07-10 15:01:11,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:01:11,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2020-07-10 15:01:11,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 94 transitions. [2020-07-10 15:01:11,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:01:11,323 INFO L225 Difference]: With dead ends: 77 [2020-07-10 15:01:11,323 INFO L226 Difference]: Without dead ends: 37 [2020-07-10 15:01:11,327 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:01:11,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-10 15:01:11,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-10 15:01:11,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:01:11,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2020-07-10 15:01:11,399 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-10 15:01:11,399 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-10 15:01:11,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:11,405 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-10 15:01:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-07-10 15:01:11,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:01:11,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:01:11,407 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-10 15:01:11,407 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-10 15:01:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:11,413 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-10 15:01:11,413 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-07-10 15:01:11,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:01:11,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:01:11,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:01:11,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:01:11,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-10 15:01:11,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-07-10 15:01:11,420 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 24 [2020-07-10 15:01:11,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:01:11,420 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-07-10 15:01:11,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:01:11,421 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-07-10 15:01:11,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:01:11,422 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:01:11,422 INFO L422 BasicCegarLoop]: trace histogram [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 15:01:11,422 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:01:11,423 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:01:11,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:01:11,423 INFO L82 PathProgramCache]: Analyzing trace with hash 861838629, now seen corresponding path program 1 times [2020-07-10 15:01:11,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:01:11,424 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36508447] [2020-07-10 15:01:11,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:01:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:11,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:11,620 INFO L280 TraceCheckUtils]: 0: Hoare triple {308#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {292#true} is VALID [2020-07-10 15:01:11,620 INFO L280 TraceCheckUtils]: 1: Hoare triple {292#true} assume true; {292#true} is VALID [2020-07-10 15:01:11,621 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {292#true} {292#true} #68#return; {292#true} is VALID [2020-07-10 15:01:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:11,626 INFO L280 TraceCheckUtils]: 0: Hoare triple {292#true} ~cond := #in~cond; {292#true} is VALID [2020-07-10 15:01:11,627 INFO L280 TraceCheckUtils]: 1: Hoare triple {292#true} assume !(0 == ~cond); {292#true} is VALID [2020-07-10 15:01:11,627 INFO L280 TraceCheckUtils]: 2: Hoare triple {292#true} assume true; {292#true} is VALID [2020-07-10 15:01:11,627 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {292#true} {292#true} #54#return; {292#true} is VALID [2020-07-10 15:01:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:11,644 INFO L280 TraceCheckUtils]: 0: Hoare triple {309#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {292#true} is VALID [2020-07-10 15:01:11,645 INFO L280 TraceCheckUtils]: 1: Hoare triple {292#true} assume true; {292#true} is VALID [2020-07-10 15:01:11,645 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {292#true} {292#true} #56#return; {292#true} is VALID [2020-07-10 15:01:11,646 INFO L263 TraceCheckUtils]: 0: Hoare triple {292#true} call ULTIMATE.init(); {308#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:01:11,647 INFO L280 TraceCheckUtils]: 1: Hoare triple {308#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {292#true} is VALID [2020-07-10 15:01:11,647 INFO L280 TraceCheckUtils]: 2: Hoare triple {292#true} assume true; {292#true} is VALID [2020-07-10 15:01:11,647 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {292#true} {292#true} #68#return; {292#true} is VALID [2020-07-10 15:01:11,648 INFO L263 TraceCheckUtils]: 4: Hoare triple {292#true} call #t~ret12 := main(); {292#true} is VALID [2020-07-10 15:01:11,648 INFO L280 TraceCheckUtils]: 5: Hoare triple {292#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~n~0 := #t~nondet9;havoc #t~nondet9; {292#true} is VALID [2020-07-10 15:01:11,648 INFO L263 TraceCheckUtils]: 6: Hoare triple {292#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {292#true} is VALID [2020-07-10 15:01:11,649 INFO L280 TraceCheckUtils]: 7: Hoare triple {292#true} ~cond := #in~cond; {292#true} is VALID [2020-07-10 15:01:11,649 INFO L280 TraceCheckUtils]: 8: Hoare triple {292#true} assume !(0 == ~cond); {292#true} is VALID [2020-07-10 15:01:11,649 INFO L280 TraceCheckUtils]: 9: Hoare triple {292#true} assume true; {292#true} is VALID [2020-07-10 15:01:11,650 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {292#true} {292#true} #54#return; {292#true} is VALID [2020-07-10 15:01:11,650 INFO L280 TraceCheckUtils]: 11: Hoare triple {292#true} call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); {292#true} is VALID [2020-07-10 15:01:11,652 INFO L263 TraceCheckUtils]: 12: Hoare triple {292#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {309#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:01:11,652 INFO L280 TraceCheckUtils]: 13: Hoare triple {309#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {292#true} is VALID [2020-07-10 15:01:11,652 INFO L280 TraceCheckUtils]: 14: Hoare triple {292#true} assume true; {292#true} is VALID [2020-07-10 15:01:11,653 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {292#true} {292#true} #56#return; {292#true} is VALID [2020-07-10 15:01:11,653 INFO L280 TraceCheckUtils]: 16: Hoare triple {292#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {292#true} is VALID [2020-07-10 15:01:11,655 INFO L263 TraceCheckUtils]: 17: Hoare triple {292#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~n~0); {304#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-10 15:01:11,656 INFO L280 TraceCheckUtils]: 18: Hoare triple {304#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; {305#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 15:01:11,656 INFO L280 TraceCheckUtils]: 19: Hoare triple {305#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {305#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 15:01:11,658 INFO L263 TraceCheckUtils]: 20: Hoare triple {305#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {306#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:01:11,659 INFO L280 TraceCheckUtils]: 21: Hoare triple {306#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {307#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:01:11,659 INFO L280 TraceCheckUtils]: 22: Hoare triple {307#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {293#false} is VALID [2020-07-10 15:01:11,660 INFO L280 TraceCheckUtils]: 23: Hoare triple {293#false} assume !false; {293#false} is VALID [2020-07-10 15:01:11,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:01:11,663 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36508447] [2020-07-10 15:01:11,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:01:11,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 15:01:11,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431790630] [2020-07-10 15:01:11,666 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-07-10 15:01:11,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:01:11,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:01:11,695 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:01:11,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:01:11,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:01:11,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:01:11,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:01:11,697 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2020-07-10 15:01:13,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:13,020 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2020-07-10 15:01:13,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:01:13,020 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-07-10 15:01:13,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:01:13,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:01:13,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2020-07-10 15:01:13,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:01:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2020-07-10 15:01:13,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 75 transitions. [2020-07-10 15:01:13,184 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:01:13,192 INFO L225 Difference]: With dead ends: 64 [2020-07-10 15:01:13,192 INFO L226 Difference]: Without dead ends: 62 [2020-07-10 15:01:13,194 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-07-10 15:01:13,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-10 15:01:13,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2020-07-10 15:01:13,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:01:13,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 55 states. [2020-07-10 15:01:13,275 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 55 states. [2020-07-10 15:01:13,275 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 55 states. [2020-07-10 15:01:13,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:13,287 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2020-07-10 15:01:13,287 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2020-07-10 15:01:13,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:01:13,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:01:13,290 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 62 states. [2020-07-10 15:01:13,291 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 62 states. [2020-07-10 15:01:13,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:13,305 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2020-07-10 15:01:13,305 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2020-07-10 15:01:13,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:01:13,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:01:13,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:01:13,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:01:13,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-10 15:01:13,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2020-07-10 15:01:13,320 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 24 [2020-07-10 15:01:13,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:01:13,321 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2020-07-10 15:01:13,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:01:13,321 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2020-07-10 15:01:13,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-10 15:01:13,323 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:01:13,324 INFO L422 BasicCegarLoop]: trace histogram [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 15:01:13,324 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:01:13,324 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:01:13,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:01:13,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1086413545, now seen corresponding path program 1 times [2020-07-10 15:01:13,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:01:13,326 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598615111] [2020-07-10 15:01:13,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:01:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:13,589 INFO L280 TraceCheckUtils]: 0: Hoare triple {636#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {614#true} is VALID [2020-07-10 15:01:13,589 INFO L280 TraceCheckUtils]: 1: Hoare triple {614#true} assume true; {614#true} is VALID [2020-07-10 15:01:13,590 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {614#true} {614#true} #68#return; {614#true} is VALID [2020-07-10 15:01:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:13,594 INFO L280 TraceCheckUtils]: 0: Hoare triple {614#true} ~cond := #in~cond; {614#true} is VALID [2020-07-10 15:01:13,595 INFO L280 TraceCheckUtils]: 1: Hoare triple {614#true} assume !(0 == ~cond); {614#true} is VALID [2020-07-10 15:01:13,595 INFO L280 TraceCheckUtils]: 2: Hoare triple {614#true} assume true; {614#true} is VALID [2020-07-10 15:01:13,595 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {614#true} {614#true} #54#return; {614#true} is VALID [2020-07-10 15:01:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:13,613 INFO L280 TraceCheckUtils]: 0: Hoare triple {637#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {614#true} is VALID [2020-07-10 15:01:13,613 INFO L280 TraceCheckUtils]: 1: Hoare triple {614#true} assume true; {614#true} is VALID [2020-07-10 15:01:13,614 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {614#true} {614#true} #56#return; {614#true} is VALID [2020-07-10 15:01:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:13,621 INFO L280 TraceCheckUtils]: 0: Hoare triple {614#true} ~cond := #in~cond; {614#true} is VALID [2020-07-10 15:01:13,621 INFO L280 TraceCheckUtils]: 1: Hoare triple {614#true} assume !(0 == ~cond); {614#true} is VALID [2020-07-10 15:01:13,621 INFO L280 TraceCheckUtils]: 2: Hoare triple {614#true} assume true; {614#true} is VALID [2020-07-10 15:01:13,623 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {614#true} {627#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #60#return; {627#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 15:01:13,624 INFO L263 TraceCheckUtils]: 0: Hoare triple {614#true} call ULTIMATE.init(); {636#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:01:13,624 INFO L280 TraceCheckUtils]: 1: Hoare triple {636#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {614#true} is VALID [2020-07-10 15:01:13,624 INFO L280 TraceCheckUtils]: 2: Hoare triple {614#true} assume true; {614#true} is VALID [2020-07-10 15:01:13,625 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {614#true} {614#true} #68#return; {614#true} is VALID [2020-07-10 15:01:13,625 INFO L263 TraceCheckUtils]: 4: Hoare triple {614#true} call #t~ret12 := main(); {614#true} is VALID [2020-07-10 15:01:13,625 INFO L280 TraceCheckUtils]: 5: Hoare triple {614#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~n~0 := #t~nondet9;havoc #t~nondet9; {614#true} is VALID [2020-07-10 15:01:13,626 INFO L263 TraceCheckUtils]: 6: Hoare triple {614#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {614#true} is VALID [2020-07-10 15:01:13,626 INFO L280 TraceCheckUtils]: 7: Hoare triple {614#true} ~cond := #in~cond; {614#true} is VALID [2020-07-10 15:01:13,626 INFO L280 TraceCheckUtils]: 8: Hoare triple {614#true} assume !(0 == ~cond); {614#true} is VALID [2020-07-10 15:01:13,626 INFO L280 TraceCheckUtils]: 9: Hoare triple {614#true} assume true; {614#true} is VALID [2020-07-10 15:01:13,627 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {614#true} {614#true} #54#return; {614#true} is VALID [2020-07-10 15:01:13,627 INFO L280 TraceCheckUtils]: 11: Hoare triple {614#true} call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); {614#true} is VALID [2020-07-10 15:01:13,630 INFO L263 TraceCheckUtils]: 12: Hoare triple {614#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {637#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:01:13,630 INFO L280 TraceCheckUtils]: 13: Hoare triple {637#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {614#true} is VALID [2020-07-10 15:01:13,631 INFO L280 TraceCheckUtils]: 14: Hoare triple {614#true} assume true; {614#true} is VALID [2020-07-10 15:01:13,631 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {614#true} {614#true} #56#return; {614#true} is VALID [2020-07-10 15:01:13,631 INFO L280 TraceCheckUtils]: 16: Hoare triple {614#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {614#true} is VALID [2020-07-10 15:01:13,632 INFO L263 TraceCheckUtils]: 17: Hoare triple {614#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~n~0); {626#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-10 15:01:13,633 INFO L280 TraceCheckUtils]: 18: Hoare triple {626#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; {627#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 15:01:13,644 INFO L280 TraceCheckUtils]: 19: Hoare triple {627#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {627#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 15:01:13,645 INFO L263 TraceCheckUtils]: 20: Hoare triple {627#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {614#true} is VALID [2020-07-10 15:01:13,645 INFO L280 TraceCheckUtils]: 21: Hoare triple {614#true} ~cond := #in~cond; {614#true} is VALID [2020-07-10 15:01:13,645 INFO L280 TraceCheckUtils]: 22: Hoare triple {614#true} assume !(0 == ~cond); {614#true} is VALID [2020-07-10 15:01:13,646 INFO L280 TraceCheckUtils]: 23: Hoare triple {614#true} assume true; {614#true} is VALID [2020-07-10 15:01:13,647 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {614#true} {627#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #60#return; {627#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 15:01:13,650 INFO L280 TraceCheckUtils]: 25: Hoare triple {627#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~x0~0 := ~x;~y0~0 := ~y;call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4);call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); {627#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 15:01:13,650 INFO L280 TraceCheckUtils]: 26: Hoare triple {627#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume #t~mem1 <= #t~mem2;havoc #t~mem1;havoc #t~mem2;#t~post3 := ~x;~x := 1 + #t~post3;havoc #t~post3; {632#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 15:01:13,652 INFO L263 TraceCheckUtils]: 27: Hoare triple {632#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~n); {633#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-10 15:01:13,652 INFO L280 TraceCheckUtils]: 28: Hoare triple {633#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; {632#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 15:01:13,653 INFO L280 TraceCheckUtils]: 29: Hoare triple {632#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume !(~x >= ~y); {632#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 15:01:13,654 INFO L263 TraceCheckUtils]: 30: Hoare triple {632#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {634#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:01:13,655 INFO L280 TraceCheckUtils]: 31: Hoare triple {634#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {635#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:01:13,655 INFO L280 TraceCheckUtils]: 32: Hoare triple {635#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {615#false} is VALID [2020-07-10 15:01:13,656 INFO L280 TraceCheckUtils]: 33: Hoare triple {615#false} assume !false; {615#false} is VALID [2020-07-10 15:01:13,659 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:01:13,659 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598615111] [2020-07-10 15:01:13,659 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148768612] [2020-07-10 15:01:13,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:01:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:13,727 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-10 15:01:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:13,752 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:01:14,008 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:01:14,014 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:01:14,036 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:01:14,092 INFO L263 TraceCheckUtils]: 0: Hoare triple {614#true} call ULTIMATE.init(); {614#true} is VALID [2020-07-10 15:01:14,093 INFO L280 TraceCheckUtils]: 1: Hoare triple {614#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {614#true} is VALID [2020-07-10 15:01:14,094 INFO L280 TraceCheckUtils]: 2: Hoare triple {614#true} assume true; {614#true} is VALID [2020-07-10 15:01:14,094 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {614#true} {614#true} #68#return; {614#true} is VALID [2020-07-10 15:01:14,094 INFO L263 TraceCheckUtils]: 4: Hoare triple {614#true} call #t~ret12 := main(); {614#true} is VALID [2020-07-10 15:01:14,095 INFO L280 TraceCheckUtils]: 5: Hoare triple {614#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~n~0 := #t~nondet9;havoc #t~nondet9; {614#true} is VALID [2020-07-10 15:01:14,095 INFO L263 TraceCheckUtils]: 6: Hoare triple {614#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {614#true} is VALID [2020-07-10 15:01:14,095 INFO L280 TraceCheckUtils]: 7: Hoare triple {614#true} ~cond := #in~cond; {614#true} is VALID [2020-07-10 15:01:14,096 INFO L280 TraceCheckUtils]: 8: Hoare triple {614#true} assume !(0 == ~cond); {614#true} is VALID [2020-07-10 15:01:14,096 INFO L280 TraceCheckUtils]: 9: Hoare triple {614#true} assume true; {614#true} is VALID [2020-07-10 15:01:14,101 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {614#true} {614#true} #54#return; {614#true} is VALID [2020-07-10 15:01:14,102 INFO L280 TraceCheckUtils]: 11: Hoare triple {614#true} call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); {614#true} is VALID [2020-07-10 15:01:14,102 INFO L263 TraceCheckUtils]: 12: Hoare triple {614#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {614#true} is VALID [2020-07-10 15:01:14,102 INFO L280 TraceCheckUtils]: 13: Hoare triple {614#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {614#true} is VALID [2020-07-10 15:01:14,103 INFO L280 TraceCheckUtils]: 14: Hoare triple {614#true} assume true; {614#true} is VALID [2020-07-10 15:01:14,103 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {614#true} {614#true} #56#return; {614#true} is VALID [2020-07-10 15:01:14,103 INFO L280 TraceCheckUtils]: 16: Hoare triple {614#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {614#true} is VALID [2020-07-10 15:01:14,112 INFO L263 TraceCheckUtils]: 17: Hoare triple {614#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~n~0); {692#(and (<= 0 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-10 15:01:14,114 INFO L280 TraceCheckUtils]: 18: Hoare triple {692#(and (<= 0 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; {696#(and (<= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 15:01:14,115 INFO L280 TraceCheckUtils]: 19: Hoare triple {696#(and (<= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {696#(and (<= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 15:01:14,116 INFO L263 TraceCheckUtils]: 20: Hoare triple {696#(and (<= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {614#true} is VALID [2020-07-10 15:01:14,116 INFO L280 TraceCheckUtils]: 21: Hoare triple {614#true} ~cond := #in~cond; {614#true} is VALID [2020-07-10 15:01:14,116 INFO L280 TraceCheckUtils]: 22: Hoare triple {614#true} assume !(0 == ~cond); {614#true} is VALID [2020-07-10 15:01:14,116 INFO L280 TraceCheckUtils]: 23: Hoare triple {614#true} assume true; {614#true} is VALID [2020-07-10 15:01:14,118 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {614#true} {696#(and (<= 0 check_~x) (<= (+ check_~y 1) check_~n))} #60#return; {696#(and (<= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 15:01:14,119 INFO L280 TraceCheckUtils]: 25: Hoare triple {696#(and (<= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~x0~0 := ~x;~y0~0 := ~y;call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4);call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); {696#(and (<= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 15:01:14,120 INFO L280 TraceCheckUtils]: 26: Hoare triple {696#(and (<= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume #t~mem1 <= #t~mem2;havoc #t~mem1;havoc #t~mem2;#t~post3 := ~x;~x := 1 + #t~post3;havoc #t~post3; {632#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 15:01:14,121 INFO L263 TraceCheckUtils]: 27: Hoare triple {632#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~n); {633#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-10 15:01:14,122 INFO L280 TraceCheckUtils]: 28: Hoare triple {633#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; {632#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 15:01:14,123 INFO L280 TraceCheckUtils]: 29: Hoare triple {632#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume !(~x >= ~y); {632#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 15:01:14,124 INFO L263 TraceCheckUtils]: 30: Hoare triple {632#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {733#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:01:14,126 INFO L280 TraceCheckUtils]: 31: Hoare triple {733#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {737#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:01:14,126 INFO L280 TraceCheckUtils]: 32: Hoare triple {737#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {615#false} is VALID [2020-07-10 15:01:14,126 INFO L280 TraceCheckUtils]: 33: Hoare triple {615#false} assume !false; {615#false} is VALID [2020-07-10 15:01:14,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:01:14,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:01:14,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 14 [2020-07-10 15:01:14,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781047487] [2020-07-10 15:01:14,132 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2020-07-10 15:01:14,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:01:14,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:01:14,173 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:01:14,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:01:14,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:01:14,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:01:14,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-07-10 15:01:14,174 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 8 states. [2020-07-10 15:01:14,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:14,982 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2020-07-10 15:01:14,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:01:14,982 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2020-07-10 15:01:14,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:01:14,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:01:14,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2020-07-10 15:01:14,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:01:14,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2020-07-10 15:01:14,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 75 transitions. [2020-07-10 15:01:15,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:01:15,108 INFO L225 Difference]: With dead ends: 68 [2020-07-10 15:01:15,108 INFO L226 Difference]: Without dead ends: 66 [2020-07-10 15:01:15,109 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2020-07-10 15:01:15,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-10 15:01:15,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 41. [2020-07-10 15:01:15,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:01:15,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 41 states. [2020-07-10 15:01:15,153 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 41 states. [2020-07-10 15:01:15,153 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 41 states. [2020-07-10 15:01:15,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:15,158 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2020-07-10 15:01:15,158 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2020-07-10 15:01:15,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:01:15,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:01:15,160 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 66 states. [2020-07-10 15:01:15,160 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 66 states. [2020-07-10 15:01:15,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:15,164 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2020-07-10 15:01:15,165 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2020-07-10 15:01:15,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:01:15,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:01:15,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:01:15,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:01:15,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-10 15:01:15,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2020-07-10 15:01:15,169 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 34 [2020-07-10 15:01:15,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:01:15,169 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2020-07-10 15:01:15,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:01:15,169 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2020-07-10 15:01:15,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-10 15:01:15,171 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:01:15,171 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-10 15:01:15,382 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 15:01:15,382 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:01:15,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:01:15,383 INFO L82 PathProgramCache]: Analyzing trace with hash 601964552, now seen corresponding path program 1 times [2020-07-10 15:01:15,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:01:15,384 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616583448] [2020-07-10 15:01:15,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:01:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:15,604 INFO L280 TraceCheckUtils]: 0: Hoare triple {1064#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1033#true} is VALID [2020-07-10 15:01:15,604 INFO L280 TraceCheckUtils]: 1: Hoare triple {1033#true} assume true; {1033#true} is VALID [2020-07-10 15:01:15,604 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1033#true} {1033#true} #68#return; {1033#true} is VALID [2020-07-10 15:01:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:15,611 INFO L280 TraceCheckUtils]: 0: Hoare triple {1033#true} ~cond := #in~cond; {1033#true} is VALID [2020-07-10 15:01:15,612 INFO L280 TraceCheckUtils]: 1: Hoare triple {1033#true} assume !(0 == ~cond); {1033#true} is VALID [2020-07-10 15:01:15,612 INFO L280 TraceCheckUtils]: 2: Hoare triple {1033#true} assume true; {1033#true} is VALID [2020-07-10 15:01:15,612 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1033#true} {1033#true} #54#return; {1033#true} is VALID [2020-07-10 15:01:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:15,649 INFO L280 TraceCheckUtils]: 0: Hoare triple {1065#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1066#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 15:01:15,650 INFO L280 TraceCheckUtils]: 1: Hoare triple {1066#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {1066#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 15:01:15,652 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1066#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {1033#true} #56#return; {1045#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-10 15:01:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:15,670 INFO L280 TraceCheckUtils]: 0: Hoare triple {1033#true} ~cond := #in~cond; {1033#true} is VALID [2020-07-10 15:01:15,670 INFO L280 TraceCheckUtils]: 1: Hoare triple {1033#true} assume !(0 == ~cond); {1033#true} is VALID [2020-07-10 15:01:15,671 INFO L280 TraceCheckUtils]: 2: Hoare triple {1033#true} assume true; {1033#true} is VALID [2020-07-10 15:01:15,672 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1033#true} {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #60#return; {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:15,680 INFO L280 TraceCheckUtils]: 0: Hoare triple {1033#true} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; {1033#true} is VALID [2020-07-10 15:01:15,681 INFO L280 TraceCheckUtils]: 1: Hoare triple {1033#true} assume ~x >= ~y;#res := ~x; {1033#true} is VALID [2020-07-10 15:01:15,681 INFO L280 TraceCheckUtils]: 2: Hoare triple {1033#true} assume true; {1033#true} is VALID [2020-07-10 15:01:15,682 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1033#true} {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #62#return; {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:15,695 INFO L280 TraceCheckUtils]: 0: Hoare triple {1033#true} ~cond := #in~cond; {1033#true} is VALID [2020-07-10 15:01:15,696 INFO L280 TraceCheckUtils]: 1: Hoare triple {1033#true} assume !(0 == ~cond); {1033#true} is VALID [2020-07-10 15:01:15,696 INFO L280 TraceCheckUtils]: 2: Hoare triple {1033#true} assume true; {1033#true} is VALID [2020-07-10 15:01:15,697 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1033#true} {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #64#return; {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:15,698 INFO L263 TraceCheckUtils]: 0: Hoare triple {1033#true} call ULTIMATE.init(); {1064#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:01:15,698 INFO L280 TraceCheckUtils]: 1: Hoare triple {1064#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1033#true} is VALID [2020-07-10 15:01:15,698 INFO L280 TraceCheckUtils]: 2: Hoare triple {1033#true} assume true; {1033#true} is VALID [2020-07-10 15:01:15,699 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1033#true} {1033#true} #68#return; {1033#true} is VALID [2020-07-10 15:01:15,699 INFO L263 TraceCheckUtils]: 4: Hoare triple {1033#true} call #t~ret12 := main(); {1033#true} is VALID [2020-07-10 15:01:15,699 INFO L280 TraceCheckUtils]: 5: Hoare triple {1033#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~n~0 := #t~nondet9;havoc #t~nondet9; {1033#true} is VALID [2020-07-10 15:01:15,699 INFO L263 TraceCheckUtils]: 6: Hoare triple {1033#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {1033#true} is VALID [2020-07-10 15:01:15,699 INFO L280 TraceCheckUtils]: 7: Hoare triple {1033#true} ~cond := #in~cond; {1033#true} is VALID [2020-07-10 15:01:15,700 INFO L280 TraceCheckUtils]: 8: Hoare triple {1033#true} assume !(0 == ~cond); {1033#true} is VALID [2020-07-10 15:01:15,700 INFO L280 TraceCheckUtils]: 9: Hoare triple {1033#true} assume true; {1033#true} is VALID [2020-07-10 15:01:15,700 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1033#true} {1033#true} #54#return; {1033#true} is VALID [2020-07-10 15:01:15,700 INFO L280 TraceCheckUtils]: 11: Hoare triple {1033#true} call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); {1033#true} is VALID [2020-07-10 15:01:15,703 INFO L263 TraceCheckUtils]: 12: Hoare triple {1033#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {1065#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:01:15,704 INFO L280 TraceCheckUtils]: 13: Hoare triple {1065#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1066#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 15:01:15,704 INFO L280 TraceCheckUtils]: 14: Hoare triple {1066#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {1066#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 15:01:15,706 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1066#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {1033#true} #56#return; {1045#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-10 15:01:15,707 INFO L280 TraceCheckUtils]: 16: Hoare triple {1045#(= ((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; {1046#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-10 15:01:15,708 INFO L263 TraceCheckUtils]: 17: Hoare triple {1046#(= ((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, ~n~0); {1047#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-10 15:01:15,708 INFO L280 TraceCheckUtils]: 18: Hoare triple {1047#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:15,709 INFO L280 TraceCheckUtils]: 19: Hoare triple {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume !(~x >= ~y); {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:15,709 INFO L263 TraceCheckUtils]: 20: Hoare triple {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {1033#true} is VALID [2020-07-10 15:01:15,709 INFO L280 TraceCheckUtils]: 21: Hoare triple {1033#true} ~cond := #in~cond; {1033#true} is VALID [2020-07-10 15:01:15,709 INFO L280 TraceCheckUtils]: 22: Hoare triple {1033#true} assume !(0 == ~cond); {1033#true} is VALID [2020-07-10 15:01:15,710 INFO L280 TraceCheckUtils]: 23: Hoare triple {1033#true} assume true; {1033#true} is VALID [2020-07-10 15:01:15,711 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1033#true} {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #60#return; {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:15,712 INFO L280 TraceCheckUtils]: 25: Hoare triple {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~x0~0 := ~x;~y0~0 := ~y;call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4);call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:15,713 INFO L280 TraceCheckUtils]: 26: Hoare triple {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume #t~mem1 <= #t~mem2;havoc #t~mem1;havoc #t~mem2;#t~post3 := ~x;~x := 1 + #t~post3;havoc #t~post3; {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:15,713 INFO L263 TraceCheckUtils]: 27: Hoare triple {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~n); {1033#true} is VALID [2020-07-10 15:01:15,713 INFO L280 TraceCheckUtils]: 28: Hoare triple {1033#true} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; {1033#true} is VALID [2020-07-10 15:01:15,714 INFO L280 TraceCheckUtils]: 29: Hoare triple {1033#true} assume ~x >= ~y;#res := ~x; {1033#true} is VALID [2020-07-10 15:01:15,714 INFO L280 TraceCheckUtils]: 30: Hoare triple {1033#true} assume true; {1033#true} is VALID [2020-07-10 15:01:15,717 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1033#true} {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #62#return; {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:15,717 INFO L280 TraceCheckUtils]: 32: Hoare triple {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~x1~0 := #t~ret5;havoc #t~ret5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~i~0 := #t~nondet6;havoc #t~nondet6; {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:15,717 INFO L263 TraceCheckUtils]: 33: Hoare triple {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call assume_abort_if_not((if ~x0~0 <= ~i~0 && ~i~0 <= ~y0~0 then 1 else 0)); {1033#true} is VALID [2020-07-10 15:01:15,718 INFO L280 TraceCheckUtils]: 34: Hoare triple {1033#true} ~cond := #in~cond; {1033#true} is VALID [2020-07-10 15:01:15,718 INFO L280 TraceCheckUtils]: 35: Hoare triple {1033#true} assume !(0 == ~cond); {1033#true} is VALID [2020-07-10 15:01:15,718 INFO L280 TraceCheckUtils]: 36: Hoare triple {1033#true} assume true; {1033#true} is VALID [2020-07-10 15:01:15,719 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1033#true} {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #64#return; {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:15,719 INFO L280 TraceCheckUtils]: 38: Hoare triple {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4);~ai~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~x1~0, 4);~ax~0 := #t~mem8;havoc #t~mem8; {1061#(and (= 0 check_~ax~0) (= 0 check_~ai~0))} is VALID [2020-07-10 15:01:15,720 INFO L263 TraceCheckUtils]: 39: Hoare triple {1061#(and (= 0 check_~ax~0) (= 0 check_~ai~0))} call __VERIFIER_assert((if ~ai~0 <= ~ax~0 then 1 else 0)); {1062#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:01:15,721 INFO L280 TraceCheckUtils]: 40: Hoare triple {1062#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1063#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:01:15,721 INFO L280 TraceCheckUtils]: 41: Hoare triple {1063#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1034#false} is VALID [2020-07-10 15:01:15,721 INFO L280 TraceCheckUtils]: 42: Hoare triple {1034#false} assume !false; {1034#false} is VALID [2020-07-10 15:01:15,724 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 15:01:15,725 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616583448] [2020-07-10 15:01:15,725 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868994916] [2020-07-10 15:01:15,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:01:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:15,772 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-10 15:01:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:15,792 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:01:15,847 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2020-07-10 15:01:15,848 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:01:15,854 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:01:15,854 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:01:15,855 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:6 [2020-07-10 15:01:15,868 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:01:15,869 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_9|]. (= |#memory_int| (store |v_#memory_int_9| |#Ultimate.meminit_#ptr.base| ((as const (Array Int Int)) 0))) [2020-07-10 15:01:15,869 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2020-07-10 15:01:17,897 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_1 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_1))) is different from true [2020-07-10 15:01:19,972 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_2 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_2))) is different from true [2020-07-10 15:01:22,045 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_3 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_3))) is different from true [2020-07-10 15:01:22,097 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2020-07-10 15:01:22,104 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:01:22,108 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:01:22,110 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-10 15:01:22,110 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:21 [2020-07-10 15:01:22,114 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:01:22,115 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, check_~a.base, check_~x1~0, check_~a.offset, check_~i~0]. (let ((.cse0 (select |#memory_int| check_~a.base))) (and (<= (select .cse0 (+ (* check_~x1~0 4) check_~a.offset)) check_~ax~0) (= ((as const (Array Int Int)) 0) .cse0) (<= check_~ai~0 (select .cse0 (+ (* check_~i~0 4) check_~a.offset))))) [2020-07-10 15:01:22,115 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [check_~x1~0, check_~a.offset, check_~i~0]. (let ((.cse0 ((as const (Array Int Int)) 0))) (and (<= (select .cse0 (+ (* check_~x1~0 4) check_~a.offset)) check_~ax~0) (<= check_~ai~0 (select .cse0 (+ (* check_~i~0 4) check_~a.offset))))) [2020-07-10 15:01:22,154 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:01:22,248 INFO L263 TraceCheckUtils]: 0: Hoare triple {1033#true} call ULTIMATE.init(); {1033#true} is VALID [2020-07-10 15:01:22,248 INFO L280 TraceCheckUtils]: 1: Hoare triple {1033#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1033#true} is VALID [2020-07-10 15:01:22,249 INFO L280 TraceCheckUtils]: 2: Hoare triple {1033#true} assume true; {1033#true} is VALID [2020-07-10 15:01:22,249 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1033#true} {1033#true} #68#return; {1033#true} is VALID [2020-07-10 15:01:22,249 INFO L263 TraceCheckUtils]: 4: Hoare triple {1033#true} call #t~ret12 := main(); {1033#true} is VALID [2020-07-10 15:01:22,250 INFO L280 TraceCheckUtils]: 5: Hoare triple {1033#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~n~0 := #t~nondet9;havoc #t~nondet9; {1033#true} is VALID [2020-07-10 15:01:22,250 INFO L263 TraceCheckUtils]: 6: Hoare triple {1033#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {1033#true} is VALID [2020-07-10 15:01:22,251 INFO L280 TraceCheckUtils]: 7: Hoare triple {1033#true} ~cond := #in~cond; {1033#true} is VALID [2020-07-10 15:01:22,251 INFO L280 TraceCheckUtils]: 8: Hoare triple {1033#true} assume !(0 == ~cond); {1033#true} is VALID [2020-07-10 15:01:22,251 INFO L280 TraceCheckUtils]: 9: Hoare triple {1033#true} assume true; {1033#true} is VALID [2020-07-10 15:01:22,251 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1033#true} {1033#true} #54#return; {1033#true} is VALID [2020-07-10 15:01:22,252 INFO L280 TraceCheckUtils]: 11: Hoare triple {1033#true} call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); {1033#true} is VALID [2020-07-10 15:01:22,252 INFO L263 TraceCheckUtils]: 12: Hoare triple {1033#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {1033#true} is VALID [2020-07-10 15:01:22,253 INFO L280 TraceCheckUtils]: 13: Hoare triple {1033#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1066#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 15:01:22,254 INFO L280 TraceCheckUtils]: 14: Hoare triple {1066#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {1066#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 15:01:22,255 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1066#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {1033#true} #56#return; {1045#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-10 15:01:22,256 INFO L280 TraceCheckUtils]: 16: Hoare triple {1045#(= ((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; {1046#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-10 15:01:22,256 INFO L263 TraceCheckUtils]: 17: Hoare triple {1046#(= ((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, ~n~0); {1047#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-10 15:01:22,257 INFO L280 TraceCheckUtils]: 18: Hoare triple {1047#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:22,257 INFO L280 TraceCheckUtils]: 19: Hoare triple {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume !(~x >= ~y); {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:22,260 INFO L263 TraceCheckUtils]: 20: Hoare triple {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {1130#(exists ((v_check_~a.base_BEFORE_CALL_1 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)))} is VALID [2020-07-10 15:01:22,261 INFO L280 TraceCheckUtils]: 21: Hoare triple {1130#(exists ((v_check_~a.base_BEFORE_CALL_1 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)))} ~cond := #in~cond; {1130#(exists ((v_check_~a.base_BEFORE_CALL_1 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)))} is VALID [2020-07-10 15:01:22,261 INFO L280 TraceCheckUtils]: 22: Hoare triple {1130#(exists ((v_check_~a.base_BEFORE_CALL_1 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)))} assume !(0 == ~cond); {1130#(exists ((v_check_~a.base_BEFORE_CALL_1 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)))} is VALID [2020-07-10 15:01:22,261 INFO L280 TraceCheckUtils]: 23: Hoare triple {1130#(exists ((v_check_~a.base_BEFORE_CALL_1 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)))} assume true; {1130#(exists ((v_check_~a.base_BEFORE_CALL_1 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)))} is VALID [2020-07-10 15:01:22,262 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1130#(exists ((v_check_~a.base_BEFORE_CALL_1 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)))} {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #60#return; {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:22,263 INFO L280 TraceCheckUtils]: 25: Hoare triple {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~x0~0 := ~x;~y0~0 := ~y;call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4);call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:22,263 INFO L280 TraceCheckUtils]: 26: Hoare triple {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume #t~mem1 <= #t~mem2;havoc #t~mem1;havoc #t~mem2;#t~post3 := ~x;~x := 1 + #t~post3;havoc #t~post3; {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:22,265 INFO L263 TraceCheckUtils]: 27: Hoare triple {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~n); {1152#(exists ((v_check_~a.base_BEFORE_CALL_2 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_2)))} is VALID [2020-07-10 15:01:22,265 INFO L280 TraceCheckUtils]: 28: Hoare triple {1152#(exists ((v_check_~a.base_BEFORE_CALL_2 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_2)))} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; {1152#(exists ((v_check_~a.base_BEFORE_CALL_2 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_2)))} is VALID [2020-07-10 15:01:22,266 INFO L280 TraceCheckUtils]: 29: Hoare triple {1152#(exists ((v_check_~a.base_BEFORE_CALL_2 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_2)))} assume ~x >= ~y;#res := ~x; {1152#(exists ((v_check_~a.base_BEFORE_CALL_2 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_2)))} is VALID [2020-07-10 15:01:22,267 INFO L280 TraceCheckUtils]: 30: Hoare triple {1152#(exists ((v_check_~a.base_BEFORE_CALL_2 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_2)))} assume true; {1152#(exists ((v_check_~a.base_BEFORE_CALL_2 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_2)))} is VALID [2020-07-10 15:01:22,268 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1152#(exists ((v_check_~a.base_BEFORE_CALL_2 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_2)))} {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #62#return; {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:22,269 INFO L280 TraceCheckUtils]: 32: Hoare triple {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~x1~0 := #t~ret5;havoc #t~ret5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~i~0 := #t~nondet6;havoc #t~nondet6; {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:22,271 INFO L263 TraceCheckUtils]: 33: Hoare triple {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call assume_abort_if_not((if ~x0~0 <= ~i~0 && ~i~0 <= ~y0~0 then 1 else 0)); {1171#(exists ((v_check_~a.base_BEFORE_CALL_3 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_3)))} is VALID [2020-07-10 15:01:22,272 INFO L280 TraceCheckUtils]: 34: Hoare triple {1171#(exists ((v_check_~a.base_BEFORE_CALL_3 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_3)))} ~cond := #in~cond; {1171#(exists ((v_check_~a.base_BEFORE_CALL_3 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_3)))} is VALID [2020-07-10 15:01:22,277 INFO L280 TraceCheckUtils]: 35: Hoare triple {1171#(exists ((v_check_~a.base_BEFORE_CALL_3 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_3)))} assume !(0 == ~cond); {1171#(exists ((v_check_~a.base_BEFORE_CALL_3 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_3)))} is VALID [2020-07-10 15:01:22,285 INFO L280 TraceCheckUtils]: 36: Hoare triple {1171#(exists ((v_check_~a.base_BEFORE_CALL_3 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_3)))} assume true; {1171#(exists ((v_check_~a.base_BEFORE_CALL_3 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_3)))} is VALID [2020-07-10 15:01:22,287 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1171#(exists ((v_check_~a.base_BEFORE_CALL_3 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_3)))} {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #64#return; {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:22,291 INFO L280 TraceCheckUtils]: 38: Hoare triple {1048#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4);~ai~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~x1~0, 4);~ax~0 := #t~mem8;havoc #t~mem8; {1187#(exists ((check_~x1~0 Int) (check_~i~0 Int) (check_~a.offset Int)) (and (<= (select ((as const (Array Int Int)) 0) (+ (* check_~x1~0 4) check_~a.offset)) check_~ax~0) (<= check_~ai~0 (select ((as const (Array Int Int)) 0) (+ (* check_~i~0 4) check_~a.offset)))))} is VALID [2020-07-10 15:01:22,293 INFO L263 TraceCheckUtils]: 39: Hoare triple {1187#(exists ((check_~x1~0 Int) (check_~i~0 Int) (check_~a.offset Int)) (and (<= (select ((as const (Array Int Int)) 0) (+ (* check_~x1~0 4) check_~a.offset)) check_~ax~0) (<= check_~ai~0 (select ((as const (Array Int Int)) 0) (+ (* check_~i~0 4) check_~a.offset)))))} call __VERIFIER_assert((if ~ai~0 <= ~ax~0 then 1 else 0)); {1191#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:01:22,293 INFO L280 TraceCheckUtils]: 40: Hoare triple {1191#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1195#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:01:22,294 INFO L280 TraceCheckUtils]: 41: Hoare triple {1195#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1034#false} is VALID [2020-07-10 15:01:22,294 INFO L280 TraceCheckUtils]: 42: Hoare triple {1034#false} assume !false; {1034#false} is VALID [2020-07-10 15:01:22,298 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2020-07-10 15:01:22,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:01:22,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 18 [2020-07-10 15:01:22,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673940407] [2020-07-10 15:01:22,300 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2020-07-10 15:01:22,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:01:22,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2020-07-10 15:01:22,395 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:01:22,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-10 15:01:22,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:01:22,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-10 15:01:22,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=183, Unknown=3, NotChecked=84, Total=306 [2020-07-10 15:01:22,396 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 18 states. [2020-07-10 15:02:45,452 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 19 [2020-07-10 15:02:47,533 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 22 [2020-07-10 15:03:14,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:14,424 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2020-07-10 15:03:14,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-10 15:03:14,425 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2020-07-10 15:03:14,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:14,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 15:03:14,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 49 transitions. [2020-07-10 15:03:14,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 15:03:14,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 49 transitions. [2020-07-10 15:03:14,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 49 transitions. [2020-07-10 15:03:14,523 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 15:03:14,524 INFO L225 Difference]: With dead ends: 47 [2020-07-10 15:03:14,524 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:03:14,526 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=105, Invalid=500, Unknown=7, NotChecked=144, Total=756 [2020-07-10 15:03:14,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:03:14,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:03:14,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:14,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:03:14,527 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:03:14,527 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:03:14,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:14,528 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:03:14,528 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:03:14,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:14,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:14,528 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:03:14,528 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:03:14,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:14,529 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:03:14,529 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:03:14,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:14,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:14,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:14,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:14,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:03:14,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:03:14,530 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2020-07-10 15:03:14,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:14,530 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:03:14,530 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-10 15:03:14,531 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:03:14,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:14,739 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:03:14,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:03:15,120 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2020-07-10 15:03:15,258 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2020-07-10 15:03:15,522 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:03:15,522 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 15:03:15,522 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:03:15,522 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:03:15,522 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:03:15,523 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:03:15,523 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:03:15,523 INFO L271 CegarLoopResult]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2020-07-10 15:03:15,523 INFO L268 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2020-07-10 15:03:15,523 INFO L268 CegarLoopResult]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2020-07-10 15:03:15,523 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2020-07-10 15:03:15,523 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 39 48) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-10 15:03:15,523 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 39 48) no Hoare annotation was computed. [2020-07-10 15:03:15,523 INFO L264 CegarLoopResult]: At program point L44(line 44) 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 15:03:15,523 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-10 15:03:15,524 INFO L268 CegarLoopResult]: For program point L44-1(line 44) no Hoare annotation was computed. [2020-07-10 15:03:15,524 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-10 15:03:15,524 INFO L268 CegarLoopResult]: For program point L43-1(line 43) no Hoare annotation was computed. [2020-07-10 15:03:15,524 INFO L268 CegarLoopResult]: For program point L42-1(line 42) no Hoare annotation was computed. [2020-07-10 15:03:15,524 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 39 48) no Hoare annotation was computed. [2020-07-10 15:03:15,524 INFO L268 CegarLoopResult]: For program point L34-1(line 34) no Hoare annotation was computed. [2020-07-10 15:03:15,524 INFO L271 CegarLoopResult]: At program point checkENTRY(lines 14 37) the Hoare annotation is: true [2020-07-10 15:03:15,524 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (let ((.cse1 (= 0 |check_#in~x|)) (.cse2 ((as const (Array Int Int)) 0))) (or (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|)))) (and (or (not (<= 1 |check_#in~x|)) .cse0) (or .cse0 (not .cse1)))) (not (= .cse2 (select |#memory_int| |check_#in~a.base|))) (and (let ((.cse3 (<= (+ check_~y 1) check_~n))) (or (and .cse3 (<= 1 check_~x)) (and (<= 0 check_~x) .cse3 .cse1))) (= .cse2 (select |#memory_int| check_~a.base))))) [2020-07-10 15:03:15,524 INFO L268 CegarLoopResult]: For program point L31-1(line 31) no Hoare annotation was computed. [2020-07-10 15:03:15,525 INFO L268 CegarLoopResult]: For program point L26(line 26) no Hoare annotation was computed. [2020-07-10 15:03:15,525 INFO L268 CegarLoopResult]: For program point L23(lines 23 24) no Hoare annotation was computed. [2020-07-10 15:03:15,525 INFO L264 CegarLoopResult]: At program point L23-2(lines 23 24) the Hoare annotation is: (let ((.cse1 (= 0 |check_#in~x|)) (.cse2 ((as const (Array Int Int)) 0))) (or (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|)))) (and (or (not (<= 1 |check_#in~x|)) .cse0) (or .cse0 (not .cse1)))) (not (= .cse2 (select |#memory_int| |check_#in~a.base|))) (and (let ((.cse3 (<= (+ check_~y 1) check_~n))) (or (and .cse3 (<= 1 check_~x)) (and (<= 0 check_~x) .cse3 .cse1))) (= .cse2 (select |#memory_int| check_~a.base))))) [2020-07-10 15:03:15,525 INFO L268 CegarLoopResult]: For program point checkEXIT(lines 14 37) no Hoare annotation was computed. [2020-07-10 15:03:15,525 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (let ((.cse0 (<= 1 |check_#in~x|)) (.cse2 (= 0 |check_#in~x|)) (.cse3 ((as const (Array Int Int)) 0))) (or (let ((.cse1 (not (<= (+ |check_#in~y| 1) |check_#in~n|)))) (and (or (not .cse0) .cse1) (or .cse1 (not .cse2)))) (not (= .cse3 (select |#memory_int| |check_#in~a.base|))) (and (let ((.cse4 (<= (+ check_~y 1) check_~n))) (or (and .cse0 .cse4 (<= 1 check_~x)) (and (= 0 check_~x) .cse4 .cse2))) (= .cse3 (select |#memory_int| check_~a.base))))) [2020-07-10 15:03:15,526 INFO L268 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-07-10 15:03:15,526 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-10 15:03:15,526 INFO L268 CegarLoopResult]: For program point checkFINAL(lines 14 37) no Hoare annotation was computed. [2020-07-10 15:03:15,526 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (let ((.cse1 (= 0 |check_#in~x|)) (.cse3 ((as const (Array Int Int)) 0))) (or (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|)))) (and (or (not (<= 1 |check_#in~x|)) .cse0) (or .cse0 (not .cse1)))) (and (= 0 check_~ax~0) (let ((.cse2 (<= (+ check_~y 1) check_~n))) (or (and .cse2 (<= 1 check_~x)) (and (<= 0 check_~x) .cse2 .cse1))) (= 0 check_~ai~0) (= .cse3 (select |#memory_int| check_~a.base))) (not (= .cse3 (select |#memory_int| |check_#in~a.base|))))) [2020-07-10 15:03:15,526 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 8 10) the Hoare annotation is: true [2020-07-10 15:03:15,526 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 8 10) no Hoare annotation was computed. [2020-07-10 15:03:15,526 INFO L268 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2020-07-10 15:03:15,527 INFO L268 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-07-10 15:03:15,527 INFO L268 CegarLoopResult]: For program point L9-3(lines 8 10) no Hoare annotation was computed. [2020-07-10 15:03:15,527 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-07-10 15:03:15,527 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-10 15:03:15,527 INFO L268 CegarLoopResult]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:03:15,527 INFO L268 CegarLoopResult]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:03:15,531 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:03:15,532 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-10 15:03:15,533 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-10 15:03:15,533 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-10 15:03:15,533 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2020-07-10 15:03:15,533 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:03:15,533 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:03:15,534 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-10 15:03:15,534 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-10 15:03:15,534 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2020-07-10 15:03:15,534 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-10 15:03:15,534 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-10 15:03:15,534 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-10 15:03:15,534 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-10 15:03:15,534 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2020-07-10 15:03:15,534 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:03:15,534 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:03:15,534 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2020-07-10 15:03:15,534 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2020-07-10 15:03:15,535 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2020-07-10 15:03:15,535 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2020-07-10 15:03:15,535 WARN L170 areAnnotationChecker]: L9-3 has no Hoare annotation [2020-07-10 15:03:15,535 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2020-07-10 15:03:15,535 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-10 15:03:15,535 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2020-07-10 15:03:15,535 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:03:15,535 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:03:15,535 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2020-07-10 15:03:15,536 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:03:15,536 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:03:15,536 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2020-07-10 15:03:15,536 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2020-07-10 15:03:15,536 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-10 15:03:15,536 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2020-07-10 15:03:15,537 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2020-07-10 15:03:15,537 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-10 15:03:15,537 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-10 15:03:15,537 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-10 15:03:15,537 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:03:15,537 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:03:15,537 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-10 15:03:15,537 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-10 15:03:15,537 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:03:15,537 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2020-07-10 15:03:15,537 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-10 15:03:15,537 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:03:15,538 INFO L163 areAnnotationChecker]: CFG has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:03:15,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:03:15 BoogieIcfgContainer [2020-07-10 15:03:15,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:03:15,542 INFO L168 Benchmark]: Toolchain (without parser) took 126294.05 ms. Allocated memory was 137.9 MB in the beginning and 309.9 MB in the end (delta: 172.0 MB). Free memory was 102.5 MB in the beginning and 146.9 MB in the end (delta: -44.3 MB). Peak memory consumption was 127.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:03:15,543 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 15:03:15,544 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.22 ms. Allocated memory was 137.9 MB in the beginning and 203.9 MB in the end (delta: 66.1 MB). Free memory was 102.1 MB in the beginning and 182.7 MB in the end (delta: -80.6 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:03:15,544 INFO L168 Benchmark]: Boogie Preprocessor took 62.97 ms. Allocated memory is still 203.9 MB. Free memory was 182.7 MB in the beginning and 180.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:03:15,545 INFO L168 Benchmark]: RCFGBuilder took 503.90 ms. Allocated memory is still 203.9 MB. Free memory was 180.4 MB in the beginning and 151.2 MB in the end (delta: 29.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:03:15,546 INFO L168 Benchmark]: TraceAbstraction took 125327.30 ms. Allocated memory was 203.9 MB in the beginning and 309.9 MB in the end (delta: 105.9 MB). Free memory was 151.2 MB in the beginning and 146.9 MB in the end (delta: 4.3 MB). Peak memory consumption was 110.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:03:15,549 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.23 ms. Allocated memory is still 137.9 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 394.22 ms. Allocated memory was 137.9 MB in the beginning and 203.9 MB in the end (delta: 66.1 MB). Free memory was 102.1 MB in the beginning and 182.7 MB in the end (delta: -80.6 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.97 ms. Allocated memory is still 203.9 MB. Free memory was 182.7 MB in the beginning and 180.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 503.90 ms. Allocated memory is still 203.9 MB. Free memory was 180.4 MB in the beginning and 151.2 MB in the end (delta: 29.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 125327.30 ms. Allocated memory was 203.9 MB in the beginning and 309.9 MB in the end (delta: 105.9 MB). Free memory was 151.2 MB in the beginning and 146.9 MB in the end (delta: 4.3 MB). Peak memory consumption was 110.2 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 124.4s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 115.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 139 SDtfs, 235 SDslu, 234 SDs, 0 SdLazy, 620 SolverSat, 184 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 99 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 21.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 32 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 36 PreInvPairs, 44 NumberOfFragments, 297 HoareAnnotationTreeSize, 36 FomulaSimplifications, 442 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 15 FomulaSimplificationsInter, 518 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 196 ConstructedInterpolants, 13 QuantifiedInterpolants, 23905 SizeOfPredicates, 17 NumberOfNonLiveVariables, 312 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 17/26 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...