/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_onepoint.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:01:12,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:01:12,650 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:01:12,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:01:12,663 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:01:12,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:01:12,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:01:12,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:01:12,669 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:01:12,670 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:01:12,671 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:01:12,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:01:12,673 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:01:12,674 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:01:12,675 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:01:12,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:01:12,677 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:01:12,678 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:01:12,680 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:01:12,682 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:01:12,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:01:12,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:01:12,686 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:01:12,686 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:01:12,689 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:01:12,689 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:01:12,690 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:01:12,691 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:01:12,691 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:01:12,692 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:01:12,692 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:01:12,693 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:01:12,694 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:01:12,695 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:01:12,696 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:01:12,696 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:01:12,697 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:01:12,697 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:01:12,697 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:01:12,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:01:12,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:01:12,700 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:12,716 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:01:12,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:01:12,717 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:01:12,717 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:01:12,718 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:01:12,718 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:01:12,718 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:01:12,718 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:01:12,718 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:01:12,719 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:01:12,719 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:01:12,719 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:01:12,719 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:01:12,719 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:01:12,720 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:01:12,720 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:01:12,720 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:01:12,720 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:01:12,720 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:01:12,721 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:01:12,721 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:01:12,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:01:12,721 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:01:12,721 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:01:12,722 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:01:12,722 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:01:12,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:01:12,722 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:01:12,722 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:01:12,723 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:01:13,011 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:01:13,026 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:01:13,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:01:13,030 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:01:13,031 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:01:13,032 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2020-07-10 15:01:13,108 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df90422ff/fedd0516ab264b568be6a934dfe41758/FLAG10dc169ac [2020-07-10 15:01:13,672 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:01:13,673 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2020-07-10 15:01:13,682 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df90422ff/fedd0516ab264b568be6a934dfe41758/FLAG10dc169ac [2020-07-10 15:01:14,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df90422ff/fedd0516ab264b568be6a934dfe41758 [2020-07-10 15:01:14,070 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:01:14,072 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:01:14,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:01:14,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:01:14,078 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:01:14,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:01:14" (1/1) ... [2020-07-10 15:01:14,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c0efb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:01:14, skipping insertion in model container [2020-07-10 15:01:14,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:01:14" (1/1) ... [2020-07-10 15:01:14,091 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:01:14,109 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:01:14,294 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:01:14,317 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:01:14,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:01:14,459 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:01:14,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:01:14 WrapperNode [2020-07-10 15:01:14,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:01:14,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:01:14,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:01:14,460 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:01:14,473 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:14" (1/1) ... [2020-07-10 15:01:14,473 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:14" (1/1) ... [2020-07-10 15:01:14,482 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:14" (1/1) ... [2020-07-10 15:01:14,484 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:14" (1/1) ... [2020-07-10 15:01:14,498 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:14" (1/1) ... [2020-07-10 15:01:14,505 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:14" (1/1) ... [2020-07-10 15:01:14,507 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:14" (1/1) ... [2020-07-10 15:01:14,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:01:14,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:01:14,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:01:14,511 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:01:14,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:01:14" (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:14,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:01:14,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:01:14,571 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:01:14,571 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:01:14,571 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-10 15:01:14,571 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:01:14,571 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-10 15:01:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 15:01:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 15:01:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:01:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:01:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:01:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:01:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:01:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-10 15:01:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:01:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:01:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:01:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-10 15:01:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:01:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:01:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:01:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:01:15,115 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:01:15,115 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 15:01:15,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:01:15 BoogieIcfgContainer [2020-07-10 15:01:15,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:01:15,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:01:15,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:01:15,126 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:01:15,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:01:14" (1/3) ... [2020-07-10 15:01:15,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a38584c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:01:15, skipping insertion in model container [2020-07-10 15:01:15,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:01:14" (2/3) ... [2020-07-10 15:01:15,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a38584c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:01:15, skipping insertion in model container [2020-07-10 15:01:15,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:01:15" (3/3) ... [2020-07-10 15:01:15,131 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2020-07-10 15:01:15,144 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:01:15,153 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:01:15,170 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:01:15,201 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:01:15,201 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:01:15,201 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:01:15,202 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:01:15,202 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:01:15,202 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:01:15,203 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:01:15,203 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:01:15,227 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-07-10 15:01:15,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:01:15,236 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:01:15,237 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:01:15,238 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:01:15,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:01:15,246 INFO L82 PathProgramCache]: Analyzing trace with hash -640327596, now seen corresponding path program 1 times [2020-07-10 15:01:15,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:01:15,260 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581737401] [2020-07-10 15:01:15,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:01:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:15,481 INFO L280 TraceCheckUtils]: 0: Hoare triple {64#(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; {48#true} is VALID [2020-07-10 15:01:15,481 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-10 15:01:15,482 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {48#true} {48#true} #75#return; {48#true} is VALID [2020-07-10 15:01:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:15,494 INFO L280 TraceCheckUtils]: 0: Hoare triple {48#true} ~cond := #in~cond; {48#true} is VALID [2020-07-10 15:01:15,495 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#true} assume 0 == ~cond;assume false; {49#false} is VALID [2020-07-10 15:01:15,495 INFO L280 TraceCheckUtils]: 2: Hoare triple {49#false} assume true; {49#false} is VALID [2020-07-10 15:01:15,496 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {49#false} {48#true} #57#return; {49#false} is VALID [2020-07-10 15:01:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:15,504 INFO L280 TraceCheckUtils]: 0: Hoare triple {48#true} ~cond := #in~cond; {48#true} is VALID [2020-07-10 15:01:15,505 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#true} assume 0 == ~cond;assume false; {49#false} is VALID [2020-07-10 15:01:15,505 INFO L280 TraceCheckUtils]: 2: Hoare triple {49#false} assume true; {49#false} is VALID [2020-07-10 15:01:15,506 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {49#false} {49#false} #59#return; {49#false} is VALID [2020-07-10 15:01:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:15,527 INFO L280 TraceCheckUtils]: 0: Hoare triple {65#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {48#true} is VALID [2020-07-10 15:01:15,527 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-10 15:01:15,528 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {48#true} {49#false} #61#return; {49#false} is VALID [2020-07-10 15:01:15,530 INFO L263 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {64#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:01:15,530 INFO L280 TraceCheckUtils]: 1: Hoare triple {64#(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; {48#true} is VALID [2020-07-10 15:01:15,531 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-10 15:01:15,531 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {48#true} {48#true} #75#return; {48#true} is VALID [2020-07-10 15:01:15,531 INFO L263 TraceCheckUtils]: 4: Hoare triple {48#true} call #t~ret14 := main(); {48#true} is VALID [2020-07-10 15:01:15,532 INFO L280 TraceCheckUtils]: 5: Hoare triple {48#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~n~0 := #t~nondet8;havoc #t~nondet8; {48#true} is VALID [2020-07-10 15:01:15,532 INFO L263 TraceCheckUtils]: 6: Hoare triple {48#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {48#true} is VALID [2020-07-10 15:01:15,533 INFO L280 TraceCheckUtils]: 7: Hoare triple {48#true} ~cond := #in~cond; {48#true} is VALID [2020-07-10 15:01:15,534 INFO L280 TraceCheckUtils]: 8: Hoare triple {48#true} assume 0 == ~cond;assume false; {49#false} is VALID [2020-07-10 15:01:15,534 INFO L280 TraceCheckUtils]: 9: Hoare triple {49#false} assume true; {49#false} is VALID [2020-07-10 15:01:15,534 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {49#false} {48#true} #57#return; {49#false} is VALID [2020-07-10 15:01:15,535 INFO L280 TraceCheckUtils]: 11: Hoare triple {49#false} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~i~0 := #t~nondet9;havoc #t~nondet9; {49#false} is VALID [2020-07-10 15:01:15,535 INFO L263 TraceCheckUtils]: 12: Hoare triple {49#false} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {48#true} is VALID [2020-07-10 15:01:15,536 INFO L280 TraceCheckUtils]: 13: Hoare triple {48#true} ~cond := #in~cond; {48#true} is VALID [2020-07-10 15:01:15,537 INFO L280 TraceCheckUtils]: 14: Hoare triple {48#true} assume 0 == ~cond;assume false; {49#false} is VALID [2020-07-10 15:01:15,537 INFO L280 TraceCheckUtils]: 15: Hoare triple {49#false} assume true; {49#false} is VALID [2020-07-10 15:01:15,537 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {49#false} {49#false} #59#return; {49#false} is VALID [2020-07-10 15:01:15,538 INFO L280 TraceCheckUtils]: 17: Hoare triple {49#false} call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); {49#false} is VALID [2020-07-10 15:01:15,538 INFO L263 TraceCheckUtils]: 18: Hoare triple {49#false} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {65#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:01:15,539 INFO L280 TraceCheckUtils]: 19: Hoare triple {65#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {48#true} is VALID [2020-07-10 15:01:15,539 INFO L280 TraceCheckUtils]: 20: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-10 15:01:15,539 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {48#true} {49#false} #61#return; {49#false} is VALID [2020-07-10 15:01:15,540 INFO L280 TraceCheckUtils]: 22: Hoare triple {49#false} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {49#false} is VALID [2020-07-10 15:01:15,540 INFO L263 TraceCheckUtils]: 23: Hoare triple {49#false} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {49#false} is VALID [2020-07-10 15:01:15,540 INFO L280 TraceCheckUtils]: 24: Hoare triple {49#false} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i;~n := #in~n; {49#false} is VALID [2020-07-10 15:01:15,541 INFO L280 TraceCheckUtils]: 25: Hoare triple {49#false} assume !(~x >= ~y); {49#false} is VALID [2020-07-10 15:01:15,541 INFO L263 TraceCheckUtils]: 26: Hoare triple {49#false} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {49#false} is VALID [2020-07-10 15:01:15,542 INFO L280 TraceCheckUtils]: 27: Hoare triple {49#false} ~cond := #in~cond; {49#false} is VALID [2020-07-10 15:01:15,542 INFO L280 TraceCheckUtils]: 28: Hoare triple {49#false} assume 0 == ~cond; {49#false} is VALID [2020-07-10 15:01:15,542 INFO L280 TraceCheckUtils]: 29: Hoare triple {49#false} assume !false; {49#false} is VALID [2020-07-10 15:01:15,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 15:01:15,548 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581737401] [2020-07-10 15:01:15,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:01:15,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:01:15,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347078169] [2020-07-10 15:01:15,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-07-10 15:01:15,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:01:15,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:01:15,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:01:15,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:01:15,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:01:15,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:01:15,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:01:15,653 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 4 states. [2020-07-10 15:01:16,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:16,139 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2020-07-10 15:01:16,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:01:16,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-07-10 15:01:16,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:01:16,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:01:16,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2020-07-10 15:01:16,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:01:16,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2020-07-10 15:01:16,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 106 transitions. [2020-07-10 15:01:16,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:01:16,374 INFO L225 Difference]: With dead ends: 83 [2020-07-10 15:01:16,374 INFO L226 Difference]: Without dead ends: 40 [2020-07-10 15:01:16,378 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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:16,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-10 15:01:16,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-10 15:01:16,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:01:16,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2020-07-10 15:01:16,455 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-10 15:01:16,455 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-10 15:01:16,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:16,462 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2020-07-10 15:01:16,462 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2020-07-10 15:01:16,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:01:16,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:01:16,464 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-10 15:01:16,464 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-10 15:01:16,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:16,471 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2020-07-10 15:01:16,471 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2020-07-10 15:01:16,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:01:16,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:01:16,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:01:16,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:01:16,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-10 15:01:16,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2020-07-10 15:01:16,480 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 30 [2020-07-10 15:01:16,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:01:16,481 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2020-07-10 15:01:16,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:01:16,481 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2020-07-10 15:01:16,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:01:16,484 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:01:16,484 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:01:16,485 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:01:16,486 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:01:16,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:01:16,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1442541232, now seen corresponding path program 1 times [2020-07-10 15:01:16,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:01:16,489 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812624047] [2020-07-10 15:01:16,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:01:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:16,718 INFO L280 TraceCheckUtils]: 0: Hoare triple {340#(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; {320#true} is VALID [2020-07-10 15:01:16,718 INFO L280 TraceCheckUtils]: 1: Hoare triple {320#true} assume true; {320#true} is VALID [2020-07-10 15:01:16,719 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {320#true} {320#true} #75#return; {320#true} is VALID [2020-07-10 15:01:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:16,742 INFO L280 TraceCheckUtils]: 0: Hoare triple {320#true} ~cond := #in~cond; {320#true} is VALID [2020-07-10 15:01:16,743 INFO L280 TraceCheckUtils]: 1: Hoare triple {320#true} assume !(0 == ~cond); {320#true} is VALID [2020-07-10 15:01:16,743 INFO L280 TraceCheckUtils]: 2: Hoare triple {320#true} assume true; {320#true} is VALID [2020-07-10 15:01:16,744 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {320#true} {320#true} #57#return; {320#true} is VALID [2020-07-10 15:01:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:16,756 INFO L280 TraceCheckUtils]: 0: Hoare triple {320#true} ~cond := #in~cond; {320#true} is VALID [2020-07-10 15:01:16,756 INFO L280 TraceCheckUtils]: 1: Hoare triple {320#true} assume !(0 == ~cond); {320#true} is VALID [2020-07-10 15:01:16,757 INFO L280 TraceCheckUtils]: 2: Hoare triple {320#true} assume true; {320#true} is VALID [2020-07-10 15:01:16,757 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {320#true} {320#true} #59#return; {320#true} is VALID [2020-07-10 15:01:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:16,782 INFO L280 TraceCheckUtils]: 0: Hoare triple {341#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {320#true} is VALID [2020-07-10 15:01:16,783 INFO L280 TraceCheckUtils]: 1: Hoare triple {320#true} assume true; {320#true} is VALID [2020-07-10 15:01:16,783 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {320#true} {320#true} #61#return; {320#true} is VALID [2020-07-10 15:01:16,784 INFO L263 TraceCheckUtils]: 0: Hoare triple {320#true} call ULTIMATE.init(); {340#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:01:16,785 INFO L280 TraceCheckUtils]: 1: Hoare triple {340#(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; {320#true} is VALID [2020-07-10 15:01:16,785 INFO L280 TraceCheckUtils]: 2: Hoare triple {320#true} assume true; {320#true} is VALID [2020-07-10 15:01:16,786 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {320#true} {320#true} #75#return; {320#true} is VALID [2020-07-10 15:01:16,786 INFO L263 TraceCheckUtils]: 4: Hoare triple {320#true} call #t~ret14 := main(); {320#true} is VALID [2020-07-10 15:01:16,789 INFO L280 TraceCheckUtils]: 5: Hoare triple {320#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~n~0 := #t~nondet8;havoc #t~nondet8; {320#true} is VALID [2020-07-10 15:01:16,789 INFO L263 TraceCheckUtils]: 6: Hoare triple {320#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {320#true} is VALID [2020-07-10 15:01:16,789 INFO L280 TraceCheckUtils]: 7: Hoare triple {320#true} ~cond := #in~cond; {320#true} is VALID [2020-07-10 15:01:16,790 INFO L280 TraceCheckUtils]: 8: Hoare triple {320#true} assume !(0 == ~cond); {320#true} is VALID [2020-07-10 15:01:16,790 INFO L280 TraceCheckUtils]: 9: Hoare triple {320#true} assume true; {320#true} is VALID [2020-07-10 15:01:16,791 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {320#true} {320#true} #57#return; {320#true} is VALID [2020-07-10 15:01:16,791 INFO L280 TraceCheckUtils]: 11: Hoare triple {320#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~i~0 := #t~nondet9;havoc #t~nondet9; {320#true} is VALID [2020-07-10 15:01:16,792 INFO L263 TraceCheckUtils]: 12: Hoare triple {320#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {320#true} is VALID [2020-07-10 15:01:16,792 INFO L280 TraceCheckUtils]: 13: Hoare triple {320#true} ~cond := #in~cond; {320#true} is VALID [2020-07-10 15:01:16,793 INFO L280 TraceCheckUtils]: 14: Hoare triple {320#true} assume !(0 == ~cond); {320#true} is VALID [2020-07-10 15:01:16,793 INFO L280 TraceCheckUtils]: 15: Hoare triple {320#true} assume true; {320#true} is VALID [2020-07-10 15:01:16,793 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {320#true} {320#true} #59#return; {320#true} is VALID [2020-07-10 15:01:16,793 INFO L280 TraceCheckUtils]: 17: Hoare triple {320#true} call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); {320#true} is VALID [2020-07-10 15:01:16,796 INFO L263 TraceCheckUtils]: 18: Hoare triple {320#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {341#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:01:16,797 INFO L280 TraceCheckUtils]: 19: Hoare triple {341#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {320#true} is VALID [2020-07-10 15:01:16,799 INFO L280 TraceCheckUtils]: 20: Hoare triple {320#true} assume true; {320#true} is VALID [2020-07-10 15:01:16,799 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {320#true} {320#true} #61#return; {320#true} is VALID [2020-07-10 15:01:16,799 INFO L280 TraceCheckUtils]: 22: Hoare triple {320#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {320#true} is VALID [2020-07-10 15:01:16,802 INFO L263 TraceCheckUtils]: 23: Hoare triple {320#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {336#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-10 15:01:16,803 INFO L280 TraceCheckUtils]: 24: Hoare triple {336#(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;~i := #in~i;~n := #in~n; {337#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 15:01:16,804 INFO L280 TraceCheckUtils]: 25: Hoare triple {337#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {337#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 15:01:16,806 INFO L263 TraceCheckUtils]: 26: Hoare triple {337#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {338#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:01:16,807 INFO L280 TraceCheckUtils]: 27: Hoare triple {338#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {339#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:01:16,807 INFO L280 TraceCheckUtils]: 28: Hoare triple {339#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {321#false} is VALID [2020-07-10 15:01:16,808 INFO L280 TraceCheckUtils]: 29: Hoare triple {321#false} assume !false; {321#false} is VALID [2020-07-10 15:01:16,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 15:01:16,812 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812624047] [2020-07-10 15:01:16,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:01:16,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 15:01:16,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467934114] [2020-07-10 15:01:16,817 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2020-07-10 15:01:16,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:01:16,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:01:16,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:01:16,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:01:16,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:01:16,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:01:16,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:01:16,865 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 8 states. [2020-07-10 15:01:18,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:18,583 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2020-07-10 15:01:18,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:01:18,583 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2020-07-10 15:01:18,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:01:18,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:01:18,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 77 transitions. [2020-07-10 15:01:18,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:01:18,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 77 transitions. [2020-07-10 15:01:18,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 77 transitions. [2020-07-10 15:01:18,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:01:18,742 INFO L225 Difference]: With dead ends: 64 [2020-07-10 15:01:18,742 INFO L226 Difference]: Without dead ends: 62 [2020-07-10 15:01:18,750 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-07-10 15:01:18,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-10 15:01:18,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2020-07-10 15:01:18,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:01:18,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 57 states. [2020-07-10 15:01:18,816 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 57 states. [2020-07-10 15:01:18,817 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 57 states. [2020-07-10 15:01:18,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:18,824 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2020-07-10 15:01:18,824 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2020-07-10 15:01:18,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:01:18,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:01:18,826 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 62 states. [2020-07-10 15:01:18,826 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 62 states. [2020-07-10 15:01:18,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:18,832 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2020-07-10 15:01:18,832 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2020-07-10 15:01:18,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:01:18,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:01:18,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:01:18,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:01:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-10 15:01:18,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2020-07-10 15:01:18,839 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 30 [2020-07-10 15:01:18,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:01:18,840 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2020-07-10 15:01:18,840 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:01:18,840 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2020-07-10 15:01:18,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 15:01:18,841 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:01:18,842 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:01:18,842 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:01:18,842 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:01:18,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:01:18,843 INFO L82 PathProgramCache]: Analyzing trace with hash 389656800, now seen corresponding path program 1 times [2020-07-10 15:01:18,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:01:18,843 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573543858] [2020-07-10 15:01:18,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:01:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:18,983 INFO L280 TraceCheckUtils]: 0: Hoare triple {676#(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; {651#true} is VALID [2020-07-10 15:01:18,984 INFO L280 TraceCheckUtils]: 1: Hoare triple {651#true} assume true; {651#true} is VALID [2020-07-10 15:01:18,984 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {651#true} {651#true} #75#return; {651#true} is VALID [2020-07-10 15:01:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:18,998 INFO L280 TraceCheckUtils]: 0: Hoare triple {651#true} ~cond := #in~cond; {651#true} is VALID [2020-07-10 15:01:18,998 INFO L280 TraceCheckUtils]: 1: Hoare triple {651#true} assume !(0 == ~cond); {651#true} is VALID [2020-07-10 15:01:18,998 INFO L280 TraceCheckUtils]: 2: Hoare triple {651#true} assume true; {651#true} is VALID [2020-07-10 15:01:18,999 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {651#true} {651#true} #57#return; {651#true} is VALID [2020-07-10 15:01:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:19,004 INFO L280 TraceCheckUtils]: 0: Hoare triple {651#true} ~cond := #in~cond; {651#true} is VALID [2020-07-10 15:01:19,005 INFO L280 TraceCheckUtils]: 1: Hoare triple {651#true} assume !(0 == ~cond); {651#true} is VALID [2020-07-10 15:01:19,005 INFO L280 TraceCheckUtils]: 2: Hoare triple {651#true} assume true; {651#true} is VALID [2020-07-10 15:01:19,005 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {651#true} {651#true} #59#return; {651#true} is VALID [2020-07-10 15:01:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:19,047 INFO L280 TraceCheckUtils]: 0: Hoare triple {677#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {678#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 15:01:19,048 INFO L280 TraceCheckUtils]: 1: Hoare triple {678#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {678#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 15:01:19,052 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {678#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {651#true} #61#return; {667#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-10 15:01:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:19,063 INFO L280 TraceCheckUtils]: 0: Hoare triple {651#true} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i;~n := #in~n; {651#true} is VALID [2020-07-10 15:01:19,063 INFO L280 TraceCheckUtils]: 1: Hoare triple {651#true} assume ~x >= ~y;#res := ~x; {651#true} is VALID [2020-07-10 15:01:19,064 INFO L280 TraceCheckUtils]: 2: Hoare triple {651#true} assume true; {651#true} is VALID [2020-07-10 15:01:19,065 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {651#true} {668#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} #63#return; {668#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-10 15:01:19,067 INFO L263 TraceCheckUtils]: 0: Hoare triple {651#true} call ULTIMATE.init(); {676#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:01:19,067 INFO L280 TraceCheckUtils]: 1: Hoare triple {676#(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; {651#true} is VALID [2020-07-10 15:01:19,068 INFO L280 TraceCheckUtils]: 2: Hoare triple {651#true} assume true; {651#true} is VALID [2020-07-10 15:01:19,068 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {651#true} {651#true} #75#return; {651#true} is VALID [2020-07-10 15:01:19,068 INFO L263 TraceCheckUtils]: 4: Hoare triple {651#true} call #t~ret14 := main(); {651#true} is VALID [2020-07-10 15:01:19,068 INFO L280 TraceCheckUtils]: 5: Hoare triple {651#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~n~0 := #t~nondet8;havoc #t~nondet8; {651#true} is VALID [2020-07-10 15:01:19,069 INFO L263 TraceCheckUtils]: 6: Hoare triple {651#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {651#true} is VALID [2020-07-10 15:01:19,069 INFO L280 TraceCheckUtils]: 7: Hoare triple {651#true} ~cond := #in~cond; {651#true} is VALID [2020-07-10 15:01:19,069 INFO L280 TraceCheckUtils]: 8: Hoare triple {651#true} assume !(0 == ~cond); {651#true} is VALID [2020-07-10 15:01:19,069 INFO L280 TraceCheckUtils]: 9: Hoare triple {651#true} assume true; {651#true} is VALID [2020-07-10 15:01:19,070 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {651#true} {651#true} #57#return; {651#true} is VALID [2020-07-10 15:01:19,070 INFO L280 TraceCheckUtils]: 11: Hoare triple {651#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~i~0 := #t~nondet9;havoc #t~nondet9; {651#true} is VALID [2020-07-10 15:01:19,070 INFO L263 TraceCheckUtils]: 12: Hoare triple {651#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {651#true} is VALID [2020-07-10 15:01:19,071 INFO L280 TraceCheckUtils]: 13: Hoare triple {651#true} ~cond := #in~cond; {651#true} is VALID [2020-07-10 15:01:19,071 INFO L280 TraceCheckUtils]: 14: Hoare triple {651#true} assume !(0 == ~cond); {651#true} is VALID [2020-07-10 15:01:19,071 INFO L280 TraceCheckUtils]: 15: Hoare triple {651#true} assume true; {651#true} is VALID [2020-07-10 15:01:19,071 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {651#true} {651#true} #59#return; {651#true} is VALID [2020-07-10 15:01:19,072 INFO L280 TraceCheckUtils]: 17: Hoare triple {651#true} call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); {651#true} is VALID [2020-07-10 15:01:19,092 INFO L263 TraceCheckUtils]: 18: Hoare triple {651#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {677#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:01:19,094 INFO L280 TraceCheckUtils]: 19: Hoare triple {677#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {678#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 15:01:19,100 INFO L280 TraceCheckUtils]: 20: Hoare triple {678#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {678#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 15:01:19,104 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {678#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {651#true} #61#return; {667#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-10 15:01:19,106 INFO L280 TraceCheckUtils]: 22: Hoare triple {667#(= ((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; {668#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-10 15:01:19,106 INFO L263 TraceCheckUtils]: 23: Hoare triple {668#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {651#true} is VALID [2020-07-10 15:01:19,106 INFO L280 TraceCheckUtils]: 24: Hoare triple {651#true} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i;~n := #in~n; {651#true} is VALID [2020-07-10 15:01:19,107 INFO L280 TraceCheckUtils]: 25: Hoare triple {651#true} assume ~x >= ~y;#res := ~x; {651#true} is VALID [2020-07-10 15:01:19,107 INFO L280 TraceCheckUtils]: 26: Hoare triple {651#true} assume true; {651#true} is VALID [2020-07-10 15:01:19,109 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {651#true} {668#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} #63#return; {668#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-10 15:01:19,110 INFO L280 TraceCheckUtils]: 28: Hoare triple {668#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~x~0 := #t~ret11;havoc #t~ret11;call #t~mem12 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);~ai~1 := #t~mem12;havoc #t~mem12;call #t~mem13 := read~int(~a~0.base, ~a~0.offset + 4 * ~x~0, 4);~ax~1 := #t~mem13;havoc #t~mem13; {673#(and (= 0 main_~ai~1) (= 0 main_~ax~1))} is VALID [2020-07-10 15:01:19,111 INFO L263 TraceCheckUtils]: 29: Hoare triple {673#(and (= 0 main_~ai~1) (= 0 main_~ax~1))} call __VERIFIER_assert((if ~ai~1 <= ~ax~1 then 1 else 0)); {674#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:01:19,112 INFO L280 TraceCheckUtils]: 30: Hoare triple {674#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {675#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:01:19,112 INFO L280 TraceCheckUtils]: 31: Hoare triple {675#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {652#false} is VALID [2020-07-10 15:01:19,113 INFO L280 TraceCheckUtils]: 32: Hoare triple {652#false} assume !false; {652#false} is VALID [2020-07-10 15:01:19,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 15:01:19,116 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573543858] [2020-07-10 15:01:19,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:01:19,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-10 15:01:19,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822442958] [2020-07-10 15:01:19,117 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2020-07-10 15:01:19,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:01:19,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 15:01:19,171 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:01:19,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 15:01:19,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:01:19,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 15:01:19,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:01:19,172 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 10 states. [2020-07-10 15:01:20,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:20,461 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2020-07-10 15:01:20,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 15:01:20,462 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2020-07-10 15:01:20,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:01:20,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:01:20,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2020-07-10 15:01:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:01:20,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2020-07-10 15:01:20,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 51 transitions. [2020-07-10 15:01:20,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:01:20,567 INFO L225 Difference]: With dead ends: 63 [2020-07-10 15:01:20,567 INFO L226 Difference]: Without dead ends: 55 [2020-07-10 15:01:20,568 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2020-07-10 15:01:20,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-10 15:01:20,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-07-10 15:01:20,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:01:20,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2020-07-10 15:01:20,627 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-10 15:01:20,627 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-10 15:01:20,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:20,631 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2020-07-10 15:01:20,632 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2020-07-10 15:01:20,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:01:20,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:01:20,633 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-10 15:01:20,633 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-10 15:01:20,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:20,638 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2020-07-10 15:01:20,638 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2020-07-10 15:01:20,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:01:20,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:01:20,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:01:20,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:01:20,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-10 15:01:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2020-07-10 15:01:20,644 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 33 [2020-07-10 15:01:20,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:01:20,645 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2020-07-10 15:01:20,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 15:01:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2020-07-10 15:01:20,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-10 15:01:20,646 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:01:20,647 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2020-07-10 15:01:20,647 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:01:20,647 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:01:20,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:01:20,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1379492317, now seen corresponding path program 1 times [2020-07-10 15:01:20,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:01:20,648 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124090702] [2020-07-10 15:01:20,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:01:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:20,826 INFO L280 TraceCheckUtils]: 0: Hoare triple {1002#(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; {972#true} is VALID [2020-07-10 15:01:20,826 INFO L280 TraceCheckUtils]: 1: Hoare triple {972#true} assume true; {972#true} is VALID [2020-07-10 15:01:20,827 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {972#true} {972#true} #75#return; {972#true} is VALID [2020-07-10 15:01:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:20,832 INFO L280 TraceCheckUtils]: 0: Hoare triple {972#true} ~cond := #in~cond; {972#true} is VALID [2020-07-10 15:01:20,832 INFO L280 TraceCheckUtils]: 1: Hoare triple {972#true} assume !(0 == ~cond); {972#true} is VALID [2020-07-10 15:01:20,832 INFO L280 TraceCheckUtils]: 2: Hoare triple {972#true} assume true; {972#true} is VALID [2020-07-10 15:01:20,832 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {972#true} {972#true} #57#return; {972#true} is VALID [2020-07-10 15:01:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:20,839 INFO L280 TraceCheckUtils]: 0: Hoare triple {972#true} ~cond := #in~cond; {972#true} is VALID [2020-07-10 15:01:20,839 INFO L280 TraceCheckUtils]: 1: Hoare triple {972#true} assume !(0 == ~cond); {972#true} is VALID [2020-07-10 15:01:20,840 INFO L280 TraceCheckUtils]: 2: Hoare triple {972#true} assume true; {972#true} is VALID [2020-07-10 15:01:20,840 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {972#true} {972#true} #59#return; {972#true} is VALID [2020-07-10 15:01:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:20,863 INFO L280 TraceCheckUtils]: 0: Hoare triple {1003#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {972#true} is VALID [2020-07-10 15:01:20,863 INFO L280 TraceCheckUtils]: 1: Hoare triple {972#true} assume true; {972#true} is VALID [2020-07-10 15:01:20,864 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {972#true} {972#true} #61#return; {972#true} is VALID [2020-07-10 15:01:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:20,876 INFO L280 TraceCheckUtils]: 0: Hoare triple {972#true} ~cond := #in~cond; {972#true} is VALID [2020-07-10 15:01:20,877 INFO L280 TraceCheckUtils]: 1: Hoare triple {972#true} assume !(0 == ~cond); {972#true} is VALID [2020-07-10 15:01:20,877 INFO L280 TraceCheckUtils]: 2: Hoare triple {972#true} assume true; {972#true} is VALID [2020-07-10 15:01:20,879 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {972#true} {989#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #67#return; {989#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 15:01:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:20,894 INFO L280 TraceCheckUtils]: 0: Hoare triple {972#true} ~cond := #in~cond; {972#true} is VALID [2020-07-10 15:01:20,894 INFO L280 TraceCheckUtils]: 1: Hoare triple {972#true} assume !(0 == ~cond); {972#true} is VALID [2020-07-10 15:01:20,895 INFO L280 TraceCheckUtils]: 2: Hoare triple {972#true} assume true; {972#true} is VALID [2020-07-10 15:01:20,895 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {972#true} {989#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #69#return; {989#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 15:01:20,896 INFO L263 TraceCheckUtils]: 0: Hoare triple {972#true} call ULTIMATE.init(); {1002#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:01:20,897 INFO L280 TraceCheckUtils]: 1: Hoare triple {1002#(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; {972#true} is VALID [2020-07-10 15:01:20,897 INFO L280 TraceCheckUtils]: 2: Hoare triple {972#true} assume true; {972#true} is VALID [2020-07-10 15:01:20,898 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {972#true} {972#true} #75#return; {972#true} is VALID [2020-07-10 15:01:20,898 INFO L263 TraceCheckUtils]: 4: Hoare triple {972#true} call #t~ret14 := main(); {972#true} is VALID [2020-07-10 15:01:20,899 INFO L280 TraceCheckUtils]: 5: Hoare triple {972#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~n~0 := #t~nondet8;havoc #t~nondet8; {972#true} is VALID [2020-07-10 15:01:20,899 INFO L263 TraceCheckUtils]: 6: Hoare triple {972#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {972#true} is VALID [2020-07-10 15:01:20,899 INFO L280 TraceCheckUtils]: 7: Hoare triple {972#true} ~cond := #in~cond; {972#true} is VALID [2020-07-10 15:01:20,899 INFO L280 TraceCheckUtils]: 8: Hoare triple {972#true} assume !(0 == ~cond); {972#true} is VALID [2020-07-10 15:01:20,900 INFO L280 TraceCheckUtils]: 9: Hoare triple {972#true} assume true; {972#true} is VALID [2020-07-10 15:01:20,900 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {972#true} {972#true} #57#return; {972#true} is VALID [2020-07-10 15:01:20,900 INFO L280 TraceCheckUtils]: 11: Hoare triple {972#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~i~0 := #t~nondet9;havoc #t~nondet9; {972#true} is VALID [2020-07-10 15:01:20,901 INFO L263 TraceCheckUtils]: 12: Hoare triple {972#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {972#true} is VALID [2020-07-10 15:01:20,901 INFO L280 TraceCheckUtils]: 13: Hoare triple {972#true} ~cond := #in~cond; {972#true} is VALID [2020-07-10 15:01:20,901 INFO L280 TraceCheckUtils]: 14: Hoare triple {972#true} assume !(0 == ~cond); {972#true} is VALID [2020-07-10 15:01:20,901 INFO L280 TraceCheckUtils]: 15: Hoare triple {972#true} assume true; {972#true} is VALID [2020-07-10 15:01:20,902 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {972#true} {972#true} #59#return; {972#true} is VALID [2020-07-10 15:01:20,902 INFO L280 TraceCheckUtils]: 17: Hoare triple {972#true} call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); {972#true} is VALID [2020-07-10 15:01:20,903 INFO L263 TraceCheckUtils]: 18: Hoare triple {972#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {1003#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:01:20,903 INFO L280 TraceCheckUtils]: 19: Hoare triple {1003#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {972#true} is VALID [2020-07-10 15:01:20,904 INFO L280 TraceCheckUtils]: 20: Hoare triple {972#true} assume true; {972#true} is VALID [2020-07-10 15:01:20,904 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {972#true} {972#true} #61#return; {972#true} is VALID [2020-07-10 15:01:20,904 INFO L280 TraceCheckUtils]: 22: Hoare triple {972#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {972#true} is VALID [2020-07-10 15:01:20,905 INFO L263 TraceCheckUtils]: 23: Hoare triple {972#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {988#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-10 15:01:20,906 INFO L280 TraceCheckUtils]: 24: Hoare triple {988#(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;~i := #in~i;~n := #in~n; {989#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 15:01:20,906 INFO L280 TraceCheckUtils]: 25: Hoare triple {989#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {989#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 15:01:20,907 INFO L263 TraceCheckUtils]: 26: Hoare triple {989#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {972#true} is VALID [2020-07-10 15:01:20,907 INFO L280 TraceCheckUtils]: 27: Hoare triple {972#true} ~cond := #in~cond; {972#true} is VALID [2020-07-10 15:01:20,907 INFO L280 TraceCheckUtils]: 28: Hoare triple {972#true} assume !(0 == ~cond); {972#true} is VALID [2020-07-10 15:01:20,907 INFO L280 TraceCheckUtils]: 29: Hoare triple {972#true} assume true; {972#true} is VALID [2020-07-10 15:01:20,908 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {972#true} {989#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #67#return; {989#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 15:01:20,908 INFO L263 TraceCheckUtils]: 31: Hoare triple {989#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {972#true} is VALID [2020-07-10 15:01:20,909 INFO L280 TraceCheckUtils]: 32: Hoare triple {972#true} ~cond := #in~cond; {972#true} is VALID [2020-07-10 15:01:20,909 INFO L280 TraceCheckUtils]: 33: Hoare triple {972#true} assume !(0 == ~cond); {972#true} is VALID [2020-07-10 15:01:20,910 INFO L280 TraceCheckUtils]: 34: Hoare triple {972#true} assume true; {972#true} is VALID [2020-07-10 15:01:20,913 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {972#true} {989#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #69#return; {989#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 15:01:20,914 INFO L280 TraceCheckUtils]: 36: Hoare triple {989#(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); {989#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 15:01:20,915 INFO L280 TraceCheckUtils]: 37: Hoare triple {989#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume #t~mem1 <= #t~mem2;havoc #t~mem2;havoc #t~mem1;#t~post3 := ~x;~x := 1 + #t~post3;havoc #t~post3; {998#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 15:01:20,916 INFO L263 TraceCheckUtils]: 38: Hoare triple {998#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {999#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-10 15:01:20,917 INFO L280 TraceCheckUtils]: 39: Hoare triple {999#(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;~i := #in~i;~n := #in~n; {998#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 15:01:20,918 INFO L280 TraceCheckUtils]: 40: Hoare triple {998#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume !(~x >= ~y); {998#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 15:01:20,919 INFO L263 TraceCheckUtils]: 41: Hoare triple {998#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {1000#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:01:20,920 INFO L280 TraceCheckUtils]: 42: Hoare triple {1000#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1001#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:01:20,920 INFO L280 TraceCheckUtils]: 43: Hoare triple {1001#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {973#false} is VALID [2020-07-10 15:01:20,920 INFO L280 TraceCheckUtils]: 44: Hoare triple {973#false} assume !false; {973#false} is VALID [2020-07-10 15:01:20,925 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-10 15:01:20,926 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124090702] [2020-07-10 15:01:20,926 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088180039] [2020-07-10 15:01:20,927 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:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:20,997 INFO L264 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-10 15:01:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:21,024 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:01:21,300 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:01:21,303 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:01:21,333 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:01:21,398 INFO L263 TraceCheckUtils]: 0: Hoare triple {972#true} call ULTIMATE.init(); {972#true} is VALID [2020-07-10 15:01:21,398 INFO L280 TraceCheckUtils]: 1: Hoare triple {972#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {972#true} is VALID [2020-07-10 15:01:21,398 INFO L280 TraceCheckUtils]: 2: Hoare triple {972#true} assume true; {972#true} is VALID [2020-07-10 15:01:21,399 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {972#true} {972#true} #75#return; {972#true} is VALID [2020-07-10 15:01:21,399 INFO L263 TraceCheckUtils]: 4: Hoare triple {972#true} call #t~ret14 := main(); {972#true} is VALID [2020-07-10 15:01:21,399 INFO L280 TraceCheckUtils]: 5: Hoare triple {972#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~n~0 := #t~nondet8;havoc #t~nondet8; {972#true} is VALID [2020-07-10 15:01:21,399 INFO L263 TraceCheckUtils]: 6: Hoare triple {972#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {972#true} is VALID [2020-07-10 15:01:21,400 INFO L280 TraceCheckUtils]: 7: Hoare triple {972#true} ~cond := #in~cond; {972#true} is VALID [2020-07-10 15:01:21,400 INFO L280 TraceCheckUtils]: 8: Hoare triple {972#true} assume !(0 == ~cond); {972#true} is VALID [2020-07-10 15:01:21,400 INFO L280 TraceCheckUtils]: 9: Hoare triple {972#true} assume true; {972#true} is VALID [2020-07-10 15:01:21,400 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {972#true} {972#true} #57#return; {972#true} is VALID [2020-07-10 15:01:21,401 INFO L280 TraceCheckUtils]: 11: Hoare triple {972#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~i~0 := #t~nondet9;havoc #t~nondet9; {972#true} is VALID [2020-07-10 15:01:21,401 INFO L263 TraceCheckUtils]: 12: Hoare triple {972#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {972#true} is VALID [2020-07-10 15:01:21,401 INFO L280 TraceCheckUtils]: 13: Hoare triple {972#true} ~cond := #in~cond; {972#true} is VALID [2020-07-10 15:01:21,401 INFO L280 TraceCheckUtils]: 14: Hoare triple {972#true} assume !(0 == ~cond); {972#true} is VALID [2020-07-10 15:01:21,402 INFO L280 TraceCheckUtils]: 15: Hoare triple {972#true} assume true; {972#true} is VALID [2020-07-10 15:01:21,402 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {972#true} {972#true} #59#return; {972#true} is VALID [2020-07-10 15:01:21,402 INFO L280 TraceCheckUtils]: 17: Hoare triple {972#true} call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); {972#true} is VALID [2020-07-10 15:01:21,402 INFO L263 TraceCheckUtils]: 18: Hoare triple {972#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {972#true} is VALID [2020-07-10 15:01:21,403 INFO L280 TraceCheckUtils]: 19: Hoare triple {972#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {972#true} is VALID [2020-07-10 15:01:21,403 INFO L280 TraceCheckUtils]: 20: Hoare triple {972#true} assume true; {972#true} is VALID [2020-07-10 15:01:21,403 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {972#true} {972#true} #61#return; {972#true} is VALID [2020-07-10 15:01:21,404 INFO L280 TraceCheckUtils]: 22: Hoare triple {972#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {972#true} is VALID [2020-07-10 15:01:21,405 INFO L263 TraceCheckUtils]: 23: Hoare triple {972#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {1076#(and (<= 0 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-10 15:01:21,407 INFO L280 TraceCheckUtils]: 24: Hoare triple {1076#(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;~i := #in~i;~n := #in~n; {1080#(and (<= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 15:01:21,408 INFO L280 TraceCheckUtils]: 25: Hoare triple {1080#(and (<= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {1080#(and (<= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 15:01:21,408 INFO L263 TraceCheckUtils]: 26: Hoare triple {1080#(and (<= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {972#true} is VALID [2020-07-10 15:01:21,408 INFO L280 TraceCheckUtils]: 27: Hoare triple {972#true} ~cond := #in~cond; {972#true} is VALID [2020-07-10 15:01:21,409 INFO L280 TraceCheckUtils]: 28: Hoare triple {972#true} assume !(0 == ~cond); {972#true} is VALID [2020-07-10 15:01:21,409 INFO L280 TraceCheckUtils]: 29: Hoare triple {972#true} assume true; {972#true} is VALID [2020-07-10 15:01:21,410 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {972#true} {1080#(and (<= 0 check_~x) (<= (+ check_~y 1) check_~n))} #67#return; {1080#(and (<= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 15:01:21,410 INFO L263 TraceCheckUtils]: 31: Hoare triple {1080#(and (<= 0 check_~x) (<= (+ check_~y 1) check_~n))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {972#true} is VALID [2020-07-10 15:01:21,411 INFO L280 TraceCheckUtils]: 32: Hoare triple {972#true} ~cond := #in~cond; {972#true} is VALID [2020-07-10 15:01:21,411 INFO L280 TraceCheckUtils]: 33: Hoare triple {972#true} assume !(0 == ~cond); {972#true} is VALID [2020-07-10 15:01:21,411 INFO L280 TraceCheckUtils]: 34: Hoare triple {972#true} assume true; {972#true} is VALID [2020-07-10 15:01:21,412 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {972#true} {1080#(and (<= 0 check_~x) (<= (+ check_~y 1) check_~n))} #69#return; {1080#(and (<= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 15:01:21,414 INFO L280 TraceCheckUtils]: 36: Hoare triple {1080#(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); {1080#(and (<= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-10 15:01:21,416 INFO L280 TraceCheckUtils]: 37: Hoare triple {1080#(and (<= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume #t~mem1 <= #t~mem2;havoc #t~mem2;havoc #t~mem1;#t~post3 := ~x;~x := 1 + #t~post3;havoc #t~post3; {998#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 15:01:21,418 INFO L263 TraceCheckUtils]: 38: Hoare triple {998#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {999#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-10 15:01:21,419 INFO L280 TraceCheckUtils]: 39: Hoare triple {999#(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;~i := #in~i;~n := #in~n; {998#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 15:01:21,420 INFO L280 TraceCheckUtils]: 40: Hoare triple {998#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume !(~x >= ~y); {998#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-10 15:01:21,421 INFO L263 TraceCheckUtils]: 41: Hoare triple {998#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {1132#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:01:21,422 INFO L280 TraceCheckUtils]: 42: Hoare triple {1132#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1136#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:01:21,423 INFO L280 TraceCheckUtils]: 43: Hoare triple {1136#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {973#false} is VALID [2020-07-10 15:01:21,440 INFO L280 TraceCheckUtils]: 44: Hoare triple {973#false} assume !false; {973#false} is VALID [2020-07-10 15:01:21,444 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-10 15:01:21,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:01:21,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 14 [2020-07-10 15:01:21,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690743068] [2020-07-10 15:01:21,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-07-10 15:01:21,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:01:21,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:01:21,496 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:01:21,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:01:21,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:01:21,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:01:21,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-07-10 15:01:21,497 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 8 states. [2020-07-10 15:01:22,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:22,461 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2020-07-10 15:01:22,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:01:22,461 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-07-10 15:01:22,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:01:22,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:01:22,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2020-07-10 15:01:22,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:01:22,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2020-07-10 15:01:22,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 73 transitions. [2020-07-10 15:01:22,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:01:22,588 INFO L225 Difference]: With dead ends: 66 [2020-07-10 15:01:22,589 INFO L226 Difference]: Without dead ends: 64 [2020-07-10 15:01:22,589 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 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:22,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-10 15:01:22,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 42. [2020-07-10 15:01:22,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:01:22,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 42 states. [2020-07-10 15:01:22,637 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 42 states. [2020-07-10 15:01:22,637 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 42 states. [2020-07-10 15:01:22,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:22,642 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2020-07-10 15:01:22,643 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2020-07-10 15:01:22,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:01:22,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:01:22,644 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 64 states. [2020-07-10 15:01:22,644 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 64 states. [2020-07-10 15:01:22,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:22,648 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2020-07-10 15:01:22,649 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2020-07-10 15:01:22,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:01:22,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:01:22,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:01:22,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:01:22,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-10 15:01:22,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2020-07-10 15:01:22,653 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 45 [2020-07-10 15:01:22,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:01:22,653 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2020-07-10 15:01:22,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:01:22,654 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-07-10 15:01:22,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-10 15:01:22,655 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:01:22,655 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:01:22,867 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:01:22,868 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:01:22,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:01:22,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1445821128, now seen corresponding path program 1 times [2020-07-10 15:01:22,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:01:22,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318936066] [2020-07-10 15:01:22,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:01:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:23,090 INFO L280 TraceCheckUtils]: 0: Hoare triple {1461#(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; {1428#true} is VALID [2020-07-10 15:01:23,090 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume true; {1428#true} is VALID [2020-07-10 15:01:23,091 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1428#true} {1428#true} #75#return; {1428#true} is VALID [2020-07-10 15:01:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:23,101 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} ~cond := #in~cond; {1428#true} is VALID [2020-07-10 15:01:23,101 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume !(0 == ~cond); {1428#true} is VALID [2020-07-10 15:01:23,101 INFO L280 TraceCheckUtils]: 2: Hoare triple {1428#true} assume true; {1428#true} is VALID [2020-07-10 15:01:23,102 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1428#true} {1428#true} #57#return; {1428#true} is VALID [2020-07-10 15:01:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:23,114 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} ~cond := #in~cond; {1428#true} is VALID [2020-07-10 15:01:23,114 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume !(0 == ~cond); {1428#true} is VALID [2020-07-10 15:01:23,115 INFO L280 TraceCheckUtils]: 2: Hoare triple {1428#true} assume true; {1428#true} is VALID [2020-07-10 15:01:23,115 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1428#true} {1428#true} #59#return; {1428#true} is VALID [2020-07-10 15:01:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:23,179 INFO L280 TraceCheckUtils]: 0: Hoare triple {1462#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1463#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 15:01:23,180 INFO L280 TraceCheckUtils]: 1: Hoare triple {1463#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {1463#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 15:01:23,181 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1463#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {1428#true} #61#return; {1444#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-10 15:01:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:23,187 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} ~cond := #in~cond; {1428#true} is VALID [2020-07-10 15:01:23,187 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume !(0 == ~cond); {1428#true} is VALID [2020-07-10 15:01:23,188 INFO L280 TraceCheckUtils]: 2: Hoare triple {1428#true} assume true; {1428#true} is VALID [2020-07-10 15:01:23,189 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1428#true} {1447#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #67#return; {1447#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:23,197 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} ~cond := #in~cond; {1428#true} is VALID [2020-07-10 15:01:23,197 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume !(0 == ~cond); {1428#true} is VALID [2020-07-10 15:01:23,198 INFO L280 TraceCheckUtils]: 2: Hoare triple {1428#true} assume true; {1428#true} is VALID [2020-07-10 15:01:23,199 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1428#true} {1447#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #69#return; {1447#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:23,206 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i;~n := #in~n; {1428#true} is VALID [2020-07-10 15:01:23,206 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume ~x >= ~y;#res := ~x; {1428#true} is VALID [2020-07-10 15:01:23,207 INFO L280 TraceCheckUtils]: 2: Hoare triple {1428#true} assume true; {1428#true} is VALID [2020-07-10 15:01:23,207 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1428#true} {1429#false} #71#return; {1429#false} is VALID [2020-07-10 15:01:23,208 INFO L263 TraceCheckUtils]: 0: Hoare triple {1428#true} call ULTIMATE.init(); {1461#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:01:23,208 INFO L280 TraceCheckUtils]: 1: Hoare triple {1461#(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; {1428#true} is VALID [2020-07-10 15:01:23,209 INFO L280 TraceCheckUtils]: 2: Hoare triple {1428#true} assume true; {1428#true} is VALID [2020-07-10 15:01:23,209 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1428#true} {1428#true} #75#return; {1428#true} is VALID [2020-07-10 15:01:23,209 INFO L263 TraceCheckUtils]: 4: Hoare triple {1428#true} call #t~ret14 := main(); {1428#true} is VALID [2020-07-10 15:01:23,210 INFO L280 TraceCheckUtils]: 5: Hoare triple {1428#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~n~0 := #t~nondet8;havoc #t~nondet8; {1428#true} is VALID [2020-07-10 15:01:23,210 INFO L263 TraceCheckUtils]: 6: Hoare triple {1428#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {1428#true} is VALID [2020-07-10 15:01:23,210 INFO L280 TraceCheckUtils]: 7: Hoare triple {1428#true} ~cond := #in~cond; {1428#true} is VALID [2020-07-10 15:01:23,210 INFO L280 TraceCheckUtils]: 8: Hoare triple {1428#true} assume !(0 == ~cond); {1428#true} is VALID [2020-07-10 15:01:23,211 INFO L280 TraceCheckUtils]: 9: Hoare triple {1428#true} assume true; {1428#true} is VALID [2020-07-10 15:01:23,211 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1428#true} {1428#true} #57#return; {1428#true} is VALID [2020-07-10 15:01:23,211 INFO L280 TraceCheckUtils]: 11: Hoare triple {1428#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~i~0 := #t~nondet9;havoc #t~nondet9; {1428#true} is VALID [2020-07-10 15:01:23,212 INFO L263 TraceCheckUtils]: 12: Hoare triple {1428#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {1428#true} is VALID [2020-07-10 15:01:23,212 INFO L280 TraceCheckUtils]: 13: Hoare triple {1428#true} ~cond := #in~cond; {1428#true} is VALID [2020-07-10 15:01:23,212 INFO L280 TraceCheckUtils]: 14: Hoare triple {1428#true} assume !(0 == ~cond); {1428#true} is VALID [2020-07-10 15:01:23,212 INFO L280 TraceCheckUtils]: 15: Hoare triple {1428#true} assume true; {1428#true} is VALID [2020-07-10 15:01:23,213 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1428#true} {1428#true} #59#return; {1428#true} is VALID [2020-07-10 15:01:23,213 INFO L280 TraceCheckUtils]: 17: Hoare triple {1428#true} call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); {1428#true} is VALID [2020-07-10 15:01:23,215 INFO L263 TraceCheckUtils]: 18: Hoare triple {1428#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {1462#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:01:23,216 INFO L280 TraceCheckUtils]: 19: Hoare triple {1462#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1463#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 15:01:23,218 INFO L280 TraceCheckUtils]: 20: Hoare triple {1463#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {1463#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 15:01:23,220 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1463#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {1428#true} #61#return; {1444#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-10 15:01:23,221 INFO L280 TraceCheckUtils]: 22: Hoare triple {1444#(= ((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; {1445#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-10 15:01:23,223 INFO L263 TraceCheckUtils]: 23: Hoare triple {1445#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {1446#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-10 15:01:23,224 INFO L280 TraceCheckUtils]: 24: Hoare triple {1446#(= ((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;~i := #in~i;~n := #in~n; {1447#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:23,224 INFO L280 TraceCheckUtils]: 25: Hoare triple {1447#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume !(~x >= ~y); {1447#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:23,225 INFO L263 TraceCheckUtils]: 26: Hoare triple {1447#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {1428#true} is VALID [2020-07-10 15:01:23,225 INFO L280 TraceCheckUtils]: 27: Hoare triple {1428#true} ~cond := #in~cond; {1428#true} is VALID [2020-07-10 15:01:23,225 INFO L280 TraceCheckUtils]: 28: Hoare triple {1428#true} assume !(0 == ~cond); {1428#true} is VALID [2020-07-10 15:01:23,225 INFO L280 TraceCheckUtils]: 29: Hoare triple {1428#true} assume true; {1428#true} is VALID [2020-07-10 15:01:23,226 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1428#true} {1447#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #67#return; {1447#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:23,227 INFO L263 TraceCheckUtils]: 31: Hoare triple {1447#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {1428#true} is VALID [2020-07-10 15:01:23,227 INFO L280 TraceCheckUtils]: 32: Hoare triple {1428#true} ~cond := #in~cond; {1428#true} is VALID [2020-07-10 15:01:23,227 INFO L280 TraceCheckUtils]: 33: Hoare triple {1428#true} assume !(0 == ~cond); {1428#true} is VALID [2020-07-10 15:01:23,227 INFO L280 TraceCheckUtils]: 34: Hoare triple {1428#true} assume true; {1428#true} is VALID [2020-07-10 15:01:23,228 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1428#true} {1447#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #69#return; {1447#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:23,229 INFO L280 TraceCheckUtils]: 36: Hoare triple {1447#(= ((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); {1456#(and (= 0 |check_#t~mem1|) (= 0 |check_#t~mem2|))} is VALID [2020-07-10 15:01:23,230 INFO L280 TraceCheckUtils]: 37: Hoare triple {1456#(and (= 0 |check_#t~mem1|) (= 0 |check_#t~mem2|))} assume !(#t~mem1 <= #t~mem2);havoc #t~mem2;havoc #t~mem1;#t~post4 := ~y;~y := #t~post4 - 1;havoc #t~post4; {1429#false} is VALID [2020-07-10 15:01:23,230 INFO L263 TraceCheckUtils]: 38: Hoare triple {1429#false} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {1428#true} is VALID [2020-07-10 15:01:23,231 INFO L280 TraceCheckUtils]: 39: Hoare triple {1428#true} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i;~n := #in~n; {1428#true} is VALID [2020-07-10 15:01:23,231 INFO L280 TraceCheckUtils]: 40: Hoare triple {1428#true} assume ~x >= ~y;#res := ~x; {1428#true} is VALID [2020-07-10 15:01:23,231 INFO L280 TraceCheckUtils]: 41: Hoare triple {1428#true} assume true; {1428#true} is VALID [2020-07-10 15:01:23,231 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1428#true} {1429#false} #71#return; {1429#false} is VALID [2020-07-10 15:01:23,232 INFO L280 TraceCheckUtils]: 43: Hoare triple {1429#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~x1~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~i, 4);~ai~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~x1~0, 4);~ax~0 := #t~mem7;havoc #t~mem7; {1429#false} is VALID [2020-07-10 15:01:23,232 INFO L263 TraceCheckUtils]: 44: Hoare triple {1429#false} call __VERIFIER_assert((if ~ai~0 <= ~ax~0 then 1 else 0)); {1429#false} is VALID [2020-07-10 15:01:23,232 INFO L280 TraceCheckUtils]: 45: Hoare triple {1429#false} ~cond := #in~cond; {1429#false} is VALID [2020-07-10 15:01:23,233 INFO L280 TraceCheckUtils]: 46: Hoare triple {1429#false} assume 0 == ~cond; {1429#false} is VALID [2020-07-10 15:01:23,233 INFO L280 TraceCheckUtils]: 47: Hoare triple {1429#false} assume !false; {1429#false} is VALID [2020-07-10 15:01:23,235 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-10 15:01:23,236 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318936066] [2020-07-10 15:01:23,236 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292361910] [2020-07-10 15:01:23,236 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:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:23,303 INFO L264 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-10 15:01:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:23,319 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:01:23,382 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:23,383 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:01:23,390 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:01:23,390 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:01:23,390 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:6 [2020-07-10 15:01:23,393 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:01:23,394 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_10|]. (= (store |v_#memory_int_10| |#Ultimate.meminit_#ptr.base| ((as const (Array Int Int)) 0)) |#memory_int|) [2020-07-10 15:01:23,394 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2020-07-10 15:01:25,440 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:27,489 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:27,569 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:27,572 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:01:27,578 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:01:27,579 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:27,580 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:21 [2020-07-10 15:01:27,584 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:01:27,585 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, check_~a.base, check_~x, check_~a.offset, check_~y]. (let ((.cse0 (select |#memory_int| check_~a.base))) (and (= ((as const (Array Int Int)) 0) .cse0) (<= |check_#t~mem1| (select .cse0 (+ (* check_~x 4) check_~a.offset))) (<= (select .cse0 (+ (* check_~y 4) check_~a.offset)) |check_#t~mem2|))) [2020-07-10 15:01:27,585 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [check_~x, check_~a.offset, check_~y]. (let ((.cse0 ((as const (Array Int Int)) 0))) (and (<= |check_#t~mem1| (select .cse0 (+ (* check_~x 4) check_~a.offset))) (<= (select .cse0 (+ (* check_~y 4) check_~a.offset)) |check_#t~mem2|))) [2020-07-10 15:01:27,643 INFO L263 TraceCheckUtils]: 0: Hoare triple {1428#true} call ULTIMATE.init(); {1428#true} is VALID [2020-07-10 15:01:27,643 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1428#true} is VALID [2020-07-10 15:01:27,643 INFO L280 TraceCheckUtils]: 2: Hoare triple {1428#true} assume true; {1428#true} is VALID [2020-07-10 15:01:27,644 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1428#true} {1428#true} #75#return; {1428#true} is VALID [2020-07-10 15:01:27,644 INFO L263 TraceCheckUtils]: 4: Hoare triple {1428#true} call #t~ret14 := main(); {1428#true} is VALID [2020-07-10 15:01:27,644 INFO L280 TraceCheckUtils]: 5: Hoare triple {1428#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~n~0 := #t~nondet8;havoc #t~nondet8; {1428#true} is VALID [2020-07-10 15:01:27,644 INFO L263 TraceCheckUtils]: 6: Hoare triple {1428#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {1428#true} is VALID [2020-07-10 15:01:27,645 INFO L280 TraceCheckUtils]: 7: Hoare triple {1428#true} ~cond := #in~cond; {1428#true} is VALID [2020-07-10 15:01:27,645 INFO L280 TraceCheckUtils]: 8: Hoare triple {1428#true} assume !(0 == ~cond); {1428#true} is VALID [2020-07-10 15:01:27,645 INFO L280 TraceCheckUtils]: 9: Hoare triple {1428#true} assume true; {1428#true} is VALID [2020-07-10 15:01:27,645 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1428#true} {1428#true} #57#return; {1428#true} is VALID [2020-07-10 15:01:27,645 INFO L280 TraceCheckUtils]: 11: Hoare triple {1428#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~i~0 := #t~nondet9;havoc #t~nondet9; {1428#true} is VALID [2020-07-10 15:01:27,646 INFO L263 TraceCheckUtils]: 12: Hoare triple {1428#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {1428#true} is VALID [2020-07-10 15:01:27,646 INFO L280 TraceCheckUtils]: 13: Hoare triple {1428#true} ~cond := #in~cond; {1428#true} is VALID [2020-07-10 15:01:27,646 INFO L280 TraceCheckUtils]: 14: Hoare triple {1428#true} assume !(0 == ~cond); {1428#true} is VALID [2020-07-10 15:01:27,646 INFO L280 TraceCheckUtils]: 15: Hoare triple {1428#true} assume true; {1428#true} is VALID [2020-07-10 15:01:27,647 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1428#true} {1428#true} #59#return; {1428#true} is VALID [2020-07-10 15:01:27,647 INFO L280 TraceCheckUtils]: 17: Hoare triple {1428#true} call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); {1428#true} is VALID [2020-07-10 15:01:27,647 INFO L263 TraceCheckUtils]: 18: Hoare triple {1428#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {1428#true} is VALID [2020-07-10 15:01:27,648 INFO L280 TraceCheckUtils]: 19: Hoare triple {1428#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1463#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 15:01:27,649 INFO L280 TraceCheckUtils]: 20: Hoare triple {1463#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {1463#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 15:01:27,650 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1463#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {1428#true} #61#return; {1444#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-10 15:01:27,651 INFO L280 TraceCheckUtils]: 22: Hoare triple {1444#(= ((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; {1445#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-10 15:01:27,652 INFO L263 TraceCheckUtils]: 23: Hoare triple {1445#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {1446#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-10 15:01:27,652 INFO L280 TraceCheckUtils]: 24: Hoare triple {1446#(= ((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;~i := #in~i;~n := #in~n; {1447#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:27,653 INFO L280 TraceCheckUtils]: 25: Hoare triple {1447#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume !(~x >= ~y); {1447#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:27,654 INFO L263 TraceCheckUtils]: 26: Hoare triple {1447#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {1545#(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:27,655 INFO L280 TraceCheckUtils]: 27: Hoare triple {1545#(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; {1545#(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:27,656 INFO L280 TraceCheckUtils]: 28: Hoare triple {1545#(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); {1545#(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:27,657 INFO L280 TraceCheckUtils]: 29: Hoare triple {1545#(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; {1545#(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:27,657 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1545#(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)))} {1447#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #67#return; {1447#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:27,659 INFO L263 TraceCheckUtils]: 31: Hoare triple {1447#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {1561#(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:27,659 INFO L280 TraceCheckUtils]: 32: Hoare triple {1561#(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)))} ~cond := #in~cond; {1561#(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:27,660 INFO L280 TraceCheckUtils]: 33: Hoare triple {1561#(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 !(0 == ~cond); {1561#(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:27,661 INFO L280 TraceCheckUtils]: 34: Hoare triple {1561#(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; {1561#(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:27,662 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1561#(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)))} {1447#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #69#return; {1447#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:01:27,667 INFO L280 TraceCheckUtils]: 36: Hoare triple {1447#(= ((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); {1577#(exists ((check_~x Int) (check_~y Int) (check_~a.offset Int)) (and (<= |check_#t~mem1| (select ((as const (Array Int Int)) 0) (+ (* check_~x 4) check_~a.offset))) (<= (select ((as const (Array Int Int)) 0) (+ (* check_~y 4) check_~a.offset)) |check_#t~mem2|)))} is VALID [2020-07-10 15:01:27,669 INFO L280 TraceCheckUtils]: 37: Hoare triple {1577#(exists ((check_~x Int) (check_~y Int) (check_~a.offset Int)) (and (<= |check_#t~mem1| (select ((as const (Array Int Int)) 0) (+ (* check_~x 4) check_~a.offset))) (<= (select ((as const (Array Int Int)) 0) (+ (* check_~y 4) check_~a.offset)) |check_#t~mem2|)))} assume !(#t~mem1 <= #t~mem2);havoc #t~mem2;havoc #t~mem1;#t~post4 := ~y;~y := #t~post4 - 1;havoc #t~post4; {1429#false} is VALID [2020-07-10 15:01:27,669 INFO L263 TraceCheckUtils]: 38: Hoare triple {1429#false} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {1429#false} is VALID [2020-07-10 15:01:27,669 INFO L280 TraceCheckUtils]: 39: Hoare triple {1429#false} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i;~n := #in~n; {1429#false} is VALID [2020-07-10 15:01:27,670 INFO L280 TraceCheckUtils]: 40: Hoare triple {1429#false} assume ~x >= ~y;#res := ~x; {1429#false} is VALID [2020-07-10 15:01:27,670 INFO L280 TraceCheckUtils]: 41: Hoare triple {1429#false} assume true; {1429#false} is VALID [2020-07-10 15:01:27,670 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1429#false} {1429#false} #71#return; {1429#false} is VALID [2020-07-10 15:01:27,670 INFO L280 TraceCheckUtils]: 43: Hoare triple {1429#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~x1~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~i, 4);~ai~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~x1~0, 4);~ax~0 := #t~mem7;havoc #t~mem7; {1429#false} is VALID [2020-07-10 15:01:27,670 INFO L263 TraceCheckUtils]: 44: Hoare triple {1429#false} call __VERIFIER_assert((if ~ai~0 <= ~ax~0 then 1 else 0)); {1429#false} is VALID [2020-07-10 15:01:27,671 INFO L280 TraceCheckUtils]: 45: Hoare triple {1429#false} ~cond := #in~cond; {1429#false} is VALID [2020-07-10 15:01:27,671 INFO L280 TraceCheckUtils]: 46: Hoare triple {1429#false} assume 0 == ~cond; {1429#false} is VALID [2020-07-10 15:01:27,671 INFO L280 TraceCheckUtils]: 47: Hoare triple {1429#false} assume !false; {1429#false} is VALID [2020-07-10 15:01:27,676 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 15:01:27,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:01:27,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 13 [2020-07-10 15:01:27,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699371968] [2020-07-10 15:01:27,678 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2020-07-10 15:01:27,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:01:27,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 15:01:27,731 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:01:27,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 15:01:27,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:01:27,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 15:01:27,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=92, Unknown=2, NotChecked=38, Total=156 [2020-07-10 15:01:27,732 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 10 states. [2020-07-10 15:02:52,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:02:52,649 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2020-07-10 15:02:52,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 15:02:52,650 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2020-07-10 15:02:52,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:02:52,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:02:52,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 77 transitions. [2020-07-10 15:02:52,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:02:52,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 77 transitions. [2020-07-10 15:02:52,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 77 transitions. [2020-07-10 15:02:52,786 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:02:52,789 INFO L225 Difference]: With dead ends: 74 [2020-07-10 15:02:52,789 INFO L226 Difference]: Without dead ends: 48 [2020-07-10 15:02:52,791 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=36, Invalid=152, Unknown=2, NotChecked=50, Total=240 [2020-07-10 15:02:52,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-10 15:02:52,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2020-07-10 15:02:52,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:02:52,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 46 states. [2020-07-10 15:02:52,841 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 46 states. [2020-07-10 15:02:52,842 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 46 states. [2020-07-10 15:02:52,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:02:52,845 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2020-07-10 15:02:52,845 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2020-07-10 15:02:52,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:02:52,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:02:52,846 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 48 states. [2020-07-10 15:02:52,846 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 48 states. [2020-07-10 15:02:52,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:02:52,848 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2020-07-10 15:02:52,849 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2020-07-10 15:02:52,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:02:52,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:02:52,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:02:52,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:02:52,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-10 15:02:52,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2020-07-10 15:02:52,852 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 48 [2020-07-10 15:02:52,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:02:52,852 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2020-07-10 15:02:52,852 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 15:02:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2020-07-10 15:02:52,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-10 15:02:52,853 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:02:52,853 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:02:53,054 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:02:53,055 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:02:53,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:02:53,055 INFO L82 PathProgramCache]: Analyzing trace with hash -2146885706, now seen corresponding path program 1 times [2020-07-10 15:02:53,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:02:53,056 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263102823] [2020-07-10 15:02:53,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:02:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:02:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:02:53,263 INFO L280 TraceCheckUtils]: 0: Hoare triple {1911#(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; {1876#true} is VALID [2020-07-10 15:02:53,263 INFO L280 TraceCheckUtils]: 1: Hoare triple {1876#true} assume true; {1876#true} is VALID [2020-07-10 15:02:53,264 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1876#true} {1876#true} #75#return; {1876#true} is VALID [2020-07-10 15:02:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:02:53,267 INFO L280 TraceCheckUtils]: 0: Hoare triple {1876#true} ~cond := #in~cond; {1876#true} is VALID [2020-07-10 15:02:53,268 INFO L280 TraceCheckUtils]: 1: Hoare triple {1876#true} assume !(0 == ~cond); {1876#true} is VALID [2020-07-10 15:02:53,268 INFO L280 TraceCheckUtils]: 2: Hoare triple {1876#true} assume true; {1876#true} is VALID [2020-07-10 15:02:53,268 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1876#true} {1876#true} #57#return; {1876#true} is VALID [2020-07-10 15:02:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:02:53,272 INFO L280 TraceCheckUtils]: 0: Hoare triple {1876#true} ~cond := #in~cond; {1876#true} is VALID [2020-07-10 15:02:53,273 INFO L280 TraceCheckUtils]: 1: Hoare triple {1876#true} assume !(0 == ~cond); {1876#true} is VALID [2020-07-10 15:02:53,273 INFO L280 TraceCheckUtils]: 2: Hoare triple {1876#true} assume true; {1876#true} is VALID [2020-07-10 15:02:53,273 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1876#true} {1876#true} #59#return; {1876#true} is VALID [2020-07-10 15:02:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:02:53,321 INFO L280 TraceCheckUtils]: 0: Hoare triple {1912#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1913#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 15:02:53,322 INFO L280 TraceCheckUtils]: 1: Hoare triple {1913#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {1913#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 15:02:53,323 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1913#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {1876#true} #61#return; {1892#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-10 15:02:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:02:53,329 INFO L280 TraceCheckUtils]: 0: Hoare triple {1876#true} ~cond := #in~cond; {1876#true} is VALID [2020-07-10 15:02:53,330 INFO L280 TraceCheckUtils]: 1: Hoare triple {1876#true} assume !(0 == ~cond); {1876#true} is VALID [2020-07-10 15:02:53,330 INFO L280 TraceCheckUtils]: 2: Hoare triple {1876#true} assume true; {1876#true} is VALID [2020-07-10 15:02:53,331 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1876#true} {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #67#return; {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:02:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:02:53,337 INFO L280 TraceCheckUtils]: 0: Hoare triple {1876#true} ~cond := #in~cond; {1876#true} is VALID [2020-07-10 15:02:53,337 INFO L280 TraceCheckUtils]: 1: Hoare triple {1876#true} assume !(0 == ~cond); {1876#true} is VALID [2020-07-10 15:02:53,337 INFO L280 TraceCheckUtils]: 2: Hoare triple {1876#true} assume true; {1876#true} is VALID [2020-07-10 15:02:53,338 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1876#true} {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #69#return; {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:02:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:02:53,345 INFO L280 TraceCheckUtils]: 0: Hoare triple {1876#true} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i;~n := #in~n; {1876#true} is VALID [2020-07-10 15:02:53,346 INFO L280 TraceCheckUtils]: 1: Hoare triple {1876#true} assume ~x >= ~y;#res := ~x; {1876#true} is VALID [2020-07-10 15:02:53,346 INFO L280 TraceCheckUtils]: 2: Hoare triple {1876#true} assume true; {1876#true} is VALID [2020-07-10 15:02:53,347 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1876#true} {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #71#return; {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:02:53,348 INFO L263 TraceCheckUtils]: 0: Hoare triple {1876#true} call ULTIMATE.init(); {1911#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:02:53,348 INFO L280 TraceCheckUtils]: 1: Hoare triple {1911#(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; {1876#true} is VALID [2020-07-10 15:02:53,349 INFO L280 TraceCheckUtils]: 2: Hoare triple {1876#true} assume true; {1876#true} is VALID [2020-07-10 15:02:53,349 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1876#true} {1876#true} #75#return; {1876#true} is VALID [2020-07-10 15:02:53,349 INFO L263 TraceCheckUtils]: 4: Hoare triple {1876#true} call #t~ret14 := main(); {1876#true} is VALID [2020-07-10 15:02:53,349 INFO L280 TraceCheckUtils]: 5: Hoare triple {1876#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~n~0 := #t~nondet8;havoc #t~nondet8; {1876#true} is VALID [2020-07-10 15:02:53,350 INFO L263 TraceCheckUtils]: 6: Hoare triple {1876#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {1876#true} is VALID [2020-07-10 15:02:53,350 INFO L280 TraceCheckUtils]: 7: Hoare triple {1876#true} ~cond := #in~cond; {1876#true} is VALID [2020-07-10 15:02:53,350 INFO L280 TraceCheckUtils]: 8: Hoare triple {1876#true} assume !(0 == ~cond); {1876#true} is VALID [2020-07-10 15:02:53,350 INFO L280 TraceCheckUtils]: 9: Hoare triple {1876#true} assume true; {1876#true} is VALID [2020-07-10 15:02:53,350 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1876#true} {1876#true} #57#return; {1876#true} is VALID [2020-07-10 15:02:53,350 INFO L280 TraceCheckUtils]: 11: Hoare triple {1876#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~i~0 := #t~nondet9;havoc #t~nondet9; {1876#true} is VALID [2020-07-10 15:02:53,351 INFO L263 TraceCheckUtils]: 12: Hoare triple {1876#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {1876#true} is VALID [2020-07-10 15:02:53,351 INFO L280 TraceCheckUtils]: 13: Hoare triple {1876#true} ~cond := #in~cond; {1876#true} is VALID [2020-07-10 15:02:53,351 INFO L280 TraceCheckUtils]: 14: Hoare triple {1876#true} assume !(0 == ~cond); {1876#true} is VALID [2020-07-10 15:02:53,351 INFO L280 TraceCheckUtils]: 15: Hoare triple {1876#true} assume true; {1876#true} is VALID [2020-07-10 15:02:53,351 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1876#true} {1876#true} #59#return; {1876#true} is VALID [2020-07-10 15:02:53,351 INFO L280 TraceCheckUtils]: 17: Hoare triple {1876#true} call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); {1876#true} is VALID [2020-07-10 15:02:53,352 INFO L263 TraceCheckUtils]: 18: Hoare triple {1876#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {1912#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:02:53,353 INFO L280 TraceCheckUtils]: 19: Hoare triple {1912#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1913#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 15:02:53,354 INFO L280 TraceCheckUtils]: 20: Hoare triple {1913#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {1913#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 15:02:53,354 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1913#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {1876#true} #61#return; {1892#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-10 15:02:53,355 INFO L280 TraceCheckUtils]: 22: Hoare triple {1892#(= ((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; {1893#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-10 15:02:53,356 INFO L263 TraceCheckUtils]: 23: Hoare triple {1893#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {1894#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-10 15:02:53,357 INFO L280 TraceCheckUtils]: 24: Hoare triple {1894#(= ((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;~i := #in~i;~n := #in~n; {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:02:53,357 INFO L280 TraceCheckUtils]: 25: Hoare triple {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume !(~x >= ~y); {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:02:53,357 INFO L263 TraceCheckUtils]: 26: Hoare triple {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {1876#true} is VALID [2020-07-10 15:02:53,357 INFO L280 TraceCheckUtils]: 27: Hoare triple {1876#true} ~cond := #in~cond; {1876#true} is VALID [2020-07-10 15:02:53,358 INFO L280 TraceCheckUtils]: 28: Hoare triple {1876#true} assume !(0 == ~cond); {1876#true} is VALID [2020-07-10 15:02:53,358 INFO L280 TraceCheckUtils]: 29: Hoare triple {1876#true} assume true; {1876#true} is VALID [2020-07-10 15:02:53,359 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1876#true} {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #67#return; {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:02:53,359 INFO L263 TraceCheckUtils]: 31: Hoare triple {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {1876#true} is VALID [2020-07-10 15:02:53,359 INFO L280 TraceCheckUtils]: 32: Hoare triple {1876#true} ~cond := #in~cond; {1876#true} is VALID [2020-07-10 15:02:53,359 INFO L280 TraceCheckUtils]: 33: Hoare triple {1876#true} assume !(0 == ~cond); {1876#true} is VALID [2020-07-10 15:02:53,359 INFO L280 TraceCheckUtils]: 34: Hoare triple {1876#true} assume true; {1876#true} is VALID [2020-07-10 15:02:53,360 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1876#true} {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #69#return; {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:02:53,361 INFO L280 TraceCheckUtils]: 36: Hoare triple {1895#(= ((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); {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:02:53,361 INFO L280 TraceCheckUtils]: 37: Hoare triple {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume #t~mem1 <= #t~mem2;havoc #t~mem2;havoc #t~mem1;#t~post3 := ~x;~x := 1 + #t~post3;havoc #t~post3; {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:02:53,361 INFO L263 TraceCheckUtils]: 38: Hoare triple {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {1876#true} is VALID [2020-07-10 15:02:53,361 INFO L280 TraceCheckUtils]: 39: Hoare triple {1876#true} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i;~n := #in~n; {1876#true} is VALID [2020-07-10 15:02:53,362 INFO L280 TraceCheckUtils]: 40: Hoare triple {1876#true} assume ~x >= ~y;#res := ~x; {1876#true} is VALID [2020-07-10 15:02:53,362 INFO L280 TraceCheckUtils]: 41: Hoare triple {1876#true} assume true; {1876#true} is VALID [2020-07-10 15:02:53,363 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1876#true} {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #71#return; {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:02:53,364 INFO L280 TraceCheckUtils]: 43: Hoare triple {1895#(= ((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;call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~i, 4);~ai~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~x1~0, 4);~ax~0 := #t~mem7;havoc #t~mem7; {1908#(and (= 0 check_~ax~0) (= 0 check_~ai~0))} is VALID [2020-07-10 15:02:53,365 INFO L263 TraceCheckUtils]: 44: Hoare triple {1908#(and (= 0 check_~ax~0) (= 0 check_~ai~0))} call __VERIFIER_assert((if ~ai~0 <= ~ax~0 then 1 else 0)); {1909#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:02:53,365 INFO L280 TraceCheckUtils]: 45: Hoare triple {1909#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1910#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:02:53,366 INFO L280 TraceCheckUtils]: 46: Hoare triple {1910#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1877#false} is VALID [2020-07-10 15:02:53,366 INFO L280 TraceCheckUtils]: 47: Hoare triple {1877#false} assume !false; {1877#false} is VALID [2020-07-10 15:02:53,370 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-10 15:02:53,370 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263102823] [2020-07-10 15:02:53,371 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679976045] [2020-07-10 15:02:53,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:02:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:02:53,435 INFO L264 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-10 15:02:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:02:53,456 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:02:53,481 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:02:53,481 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:02:53,484 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:02:53,485 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:02:53,485 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:6 [2020-07-10 15:02:53,490 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:02:53,490 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_11|]. (= |#memory_int| (store |v_#memory_int_11| |#Ultimate.meminit_#ptr.base| ((as const (Array Int Int)) 0))) [2020-07-10 15:02:53,490 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2020-07-10 15:02:55,508 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:02:57,551 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_4 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_4))) is different from true [2020-07-10 15:02:59,600 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_5 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_5))) is different from true [2020-07-10 15:02:59,649 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:02:59,652 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:02:59,656 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:02:59,658 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:02:59,659 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:21 [2020-07-10 15:02:59,664 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:02:59,664 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, check_~a.base, check_~x1~0, check_~a.offset, check_~i]. (let ((.cse0 (select |#memory_int| check_~a.base))) (and (<= (select .cse0 (+ (* check_~x1~0 4) check_~a.offset)) check_~ax~0) (<= check_~ai~0 (select .cse0 (+ (* check_~i 4) check_~a.offset))) (= ((as const (Array Int Int)) 0) .cse0))) [2020-07-10 15:02:59,664 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [check_~x1~0, check_~a.offset, check_~i]. (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 4) check_~a.offset))))) [2020-07-10 15:02:59,696 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:02:59,791 INFO L263 TraceCheckUtils]: 0: Hoare triple {1876#true} call ULTIMATE.init(); {1876#true} is VALID [2020-07-10 15:02:59,791 INFO L280 TraceCheckUtils]: 1: Hoare triple {1876#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1876#true} is VALID [2020-07-10 15:02:59,792 INFO L280 TraceCheckUtils]: 2: Hoare triple {1876#true} assume true; {1876#true} is VALID [2020-07-10 15:02:59,792 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1876#true} {1876#true} #75#return; {1876#true} is VALID [2020-07-10 15:02:59,792 INFO L263 TraceCheckUtils]: 4: Hoare triple {1876#true} call #t~ret14 := main(); {1876#true} is VALID [2020-07-10 15:02:59,792 INFO L280 TraceCheckUtils]: 5: Hoare triple {1876#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~n~0 := #t~nondet8;havoc #t~nondet8; {1876#true} is VALID [2020-07-10 15:02:59,793 INFO L263 TraceCheckUtils]: 6: Hoare triple {1876#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {1876#true} is VALID [2020-07-10 15:02:59,793 INFO L280 TraceCheckUtils]: 7: Hoare triple {1876#true} ~cond := #in~cond; {1876#true} is VALID [2020-07-10 15:02:59,793 INFO L280 TraceCheckUtils]: 8: Hoare triple {1876#true} assume !(0 == ~cond); {1876#true} is VALID [2020-07-10 15:02:59,793 INFO L280 TraceCheckUtils]: 9: Hoare triple {1876#true} assume true; {1876#true} is VALID [2020-07-10 15:02:59,794 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1876#true} {1876#true} #57#return; {1876#true} is VALID [2020-07-10 15:02:59,794 INFO L280 TraceCheckUtils]: 11: Hoare triple {1876#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~i~0 := #t~nondet9;havoc #t~nondet9; {1876#true} is VALID [2020-07-10 15:02:59,794 INFO L263 TraceCheckUtils]: 12: Hoare triple {1876#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {1876#true} is VALID [2020-07-10 15:02:59,794 INFO L280 TraceCheckUtils]: 13: Hoare triple {1876#true} ~cond := #in~cond; {1876#true} is VALID [2020-07-10 15:02:59,794 INFO L280 TraceCheckUtils]: 14: Hoare triple {1876#true} assume !(0 == ~cond); {1876#true} is VALID [2020-07-10 15:02:59,794 INFO L280 TraceCheckUtils]: 15: Hoare triple {1876#true} assume true; {1876#true} is VALID [2020-07-10 15:02:59,795 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1876#true} {1876#true} #59#return; {1876#true} is VALID [2020-07-10 15:02:59,795 INFO L280 TraceCheckUtils]: 17: Hoare triple {1876#true} call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); {1876#true} is VALID [2020-07-10 15:02:59,795 INFO L263 TraceCheckUtils]: 18: Hoare triple {1876#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {1876#true} is VALID [2020-07-10 15:02:59,796 INFO L280 TraceCheckUtils]: 19: Hoare triple {1876#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1913#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 15:02:59,796 INFO L280 TraceCheckUtils]: 20: Hoare triple {1913#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {1913#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-10 15:02:59,797 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1913#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {1876#true} #61#return; {1892#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-10 15:02:59,798 INFO L280 TraceCheckUtils]: 22: Hoare triple {1892#(= ((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; {1893#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-10 15:02:59,799 INFO L263 TraceCheckUtils]: 23: Hoare triple {1893#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {1894#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-10 15:02:59,799 INFO L280 TraceCheckUtils]: 24: Hoare triple {1894#(= ((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;~i := #in~i;~n := #in~n; {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:02:59,800 INFO L280 TraceCheckUtils]: 25: Hoare triple {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume !(~x >= ~y); {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:02:59,802 INFO L263 TraceCheckUtils]: 26: Hoare triple {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {1995#(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:02:59,802 INFO L280 TraceCheckUtils]: 27: Hoare triple {1995#(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; {1995#(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:02:59,803 INFO L280 TraceCheckUtils]: 28: Hoare triple {1995#(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); {1995#(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:02:59,804 INFO L280 TraceCheckUtils]: 29: Hoare triple {1995#(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; {1995#(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:02:59,805 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1995#(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)))} {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #67#return; {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:02:59,806 INFO L263 TraceCheckUtils]: 31: Hoare triple {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {2011#(exists ((v_check_~a.base_BEFORE_CALL_4 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_4)))} is VALID [2020-07-10 15:02:59,807 INFO L280 TraceCheckUtils]: 32: Hoare triple {2011#(exists ((v_check_~a.base_BEFORE_CALL_4 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_4)))} ~cond := #in~cond; {2011#(exists ((v_check_~a.base_BEFORE_CALL_4 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_4)))} is VALID [2020-07-10 15:02:59,807 INFO L280 TraceCheckUtils]: 33: Hoare triple {2011#(exists ((v_check_~a.base_BEFORE_CALL_4 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_4)))} assume !(0 == ~cond); {2011#(exists ((v_check_~a.base_BEFORE_CALL_4 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_4)))} is VALID [2020-07-10 15:02:59,807 INFO L280 TraceCheckUtils]: 34: Hoare triple {2011#(exists ((v_check_~a.base_BEFORE_CALL_4 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_4)))} assume true; {2011#(exists ((v_check_~a.base_BEFORE_CALL_4 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_4)))} is VALID [2020-07-10 15:02:59,808 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {2011#(exists ((v_check_~a.base_BEFORE_CALL_4 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_4)))} {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #69#return; {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:02:59,809 INFO L280 TraceCheckUtils]: 36: Hoare triple {1895#(= ((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); {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:02:59,809 INFO L280 TraceCheckUtils]: 37: Hoare triple {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume #t~mem1 <= #t~mem2;havoc #t~mem2;havoc #t~mem1;#t~post3 := ~x;~x := 1 + #t~post3;havoc #t~post3; {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:02:59,810 INFO L263 TraceCheckUtils]: 38: Hoare triple {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {2033#(exists ((v_check_~a.base_BEFORE_CALL_5 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_5)))} is VALID [2020-07-10 15:02:59,811 INFO L280 TraceCheckUtils]: 39: Hoare triple {2033#(exists ((v_check_~a.base_BEFORE_CALL_5 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_5)))} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i;~n := #in~n; {2033#(exists ((v_check_~a.base_BEFORE_CALL_5 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_5)))} is VALID [2020-07-10 15:02:59,812 INFO L280 TraceCheckUtils]: 40: Hoare triple {2033#(exists ((v_check_~a.base_BEFORE_CALL_5 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_5)))} assume ~x >= ~y;#res := ~x; {2033#(exists ((v_check_~a.base_BEFORE_CALL_5 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_5)))} is VALID [2020-07-10 15:02:59,821 INFO L280 TraceCheckUtils]: 41: Hoare triple {2033#(exists ((v_check_~a.base_BEFORE_CALL_5 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_5)))} assume true; {2033#(exists ((v_check_~a.base_BEFORE_CALL_5 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_5)))} is VALID [2020-07-10 15:02:59,822 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2033#(exists ((v_check_~a.base_BEFORE_CALL_5 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_5)))} {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #71#return; {1895#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-10 15:02:59,823 INFO L280 TraceCheckUtils]: 43: Hoare triple {1895#(= ((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;call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~i, 4);~ai~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~x1~0, 4);~ax~0 := #t~mem7;havoc #t~mem7; {2049#(exists ((check_~x1~0 Int) (check_~i 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 4) check_~a.offset)))))} is VALID [2020-07-10 15:02:59,825 INFO L263 TraceCheckUtils]: 44: Hoare triple {2049#(exists ((check_~x1~0 Int) (check_~i 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 4) check_~a.offset)))))} call __VERIFIER_assert((if ~ai~0 <= ~ax~0 then 1 else 0)); {2053#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:02:59,825 INFO L280 TraceCheckUtils]: 45: Hoare triple {2053#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2057#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:02:59,826 INFO L280 TraceCheckUtils]: 46: Hoare triple {2057#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1877#false} is VALID [2020-07-10 15:02:59,826 INFO L280 TraceCheckUtils]: 47: Hoare triple {1877#false} assume !false; {1877#false} is VALID [2020-07-10 15:02:59,830 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2020-07-10 15:02:59,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:02:59,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 18 [2020-07-10 15:02:59,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771106535] [2020-07-10 15:02:59,831 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2020-07-10 15:02:59,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:02:59,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2020-07-10 15:02:59,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:02:59,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-10 15:02:59,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:02:59,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-10 15:02:59,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=183, Unknown=3, NotChecked=84, Total=306 [2020-07-10 15:02:59,915 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 18 states. [2020-07-10 15:04:41,105 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 19 [2020-07-10 15:04:43,198 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 22 [2020-07-10 15:05:10,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:10,182 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2020-07-10 15:05:10,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-10 15:05:10,183 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2020-07-10 15:05:10,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:05:10,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 15:05:10,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 50 transitions. [2020-07-10 15:05:10,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 15:05:10,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 50 transitions. [2020-07-10 15:05:10,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 50 transitions. [2020-07-10 15:05:10,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:10,274 INFO L225 Difference]: With dead ends: 48 [2020-07-10 15:05:10,274 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:05:10,276 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 53 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:05:10,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:05:10,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:05:10,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:05:10,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:05:10,277 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:05:10,277 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:05:10,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:10,277 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:05:10,277 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:05:10,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:10,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:10,278 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:05:10,278 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:05:10,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:10,278 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:05:10,278 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:05:10,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:10,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:10,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:05:10,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:05:10,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:05:10,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:05:10,279 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2020-07-10 15:05:10,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:05:10,279 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:05:10,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-10 15:05:10,279 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:05:10,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:10,480 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:05:10,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:05:10,828 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2020-07-10 15:05:10,955 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:05:11,256 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:05:11,256 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:05:11,256 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:05:11,256 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:05:11,257 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:05:11,257 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:05:11,257 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:05:11,257 INFO L271 CegarLoopResult]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2020-07-10 15:05:11,257 INFO L268 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2020-07-10 15:05:11,257 INFO L268 CegarLoopResult]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2020-07-10 15:05:11,257 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2020-07-10 15:05:11,257 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 38 52) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-10 15:05:11,258 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 38 52) no Hoare annotation was computed. [2020-07-10 15:05:11,258 INFO L264 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= 0 main_~ai~1) (= 0 main_~ax~1) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-10 15:05:11,258 INFO L268 CegarLoopResult]: For program point L48-1(line 48) no Hoare annotation was computed. [2020-07-10 15:05:11,258 INFO L264 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-10 15:05:11,258 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 38 52) no Hoare annotation was computed. [2020-07-10 15:05:11,258 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-10 15:05:11,258 INFO L268 CegarLoopResult]: For program point L45-1(line 45) no Hoare annotation was computed. [2020-07-10 15:05:11,259 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-10 15:05:11,259 INFO L268 CegarLoopResult]: For program point L44-1(line 44) no Hoare annotation was computed. [2020-07-10 15:05:11,259 INFO L268 CegarLoopResult]: For program point L43-1(line 43) no Hoare annotation was computed. [2020-07-10 15:05:11,259 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-10 15:05:11,259 INFO L268 CegarLoopResult]: For program point L40-1(line 40) no Hoare annotation was computed. [2020-07-10 15:05:11,259 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (let ((.cse1 (= 0 |check_#in~x|)) (.cse2 ((as const (Array Int Int)) 0))) (or (and (= 0 check_~ax~0) (let ((.cse0 (<= (+ check_~y 1) check_~n))) (or (and .cse0 (<= 1 check_~x)) (and (<= 0 check_~x) .cse0 .cse1))) (= 0 check_~ai~0) (= .cse2 (select |#memory_int| check_~a.base))) (let ((.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|)))) (and (or (not (<= 1 |check_#in~x|)) .cse3) (or .cse3 (not .cse1)))) (not (= .cse2 (select |#memory_int| |check_#in~a.base|))))) [2020-07-10 15:05:11,259 INFO L268 CegarLoopResult]: For program point L33-1(line 33) no Hoare annotation was computed. [2020-07-10 15:05:11,260 INFO L271 CegarLoopResult]: At program point checkENTRY(lines 14 36) the Hoare annotation is: true [2020-07-10 15:05:11,260 INFO L268 CegarLoopResult]: For program point L27(line 27) no Hoare annotation was computed. [2020-07-10 15:05:11,260 INFO L268 CegarLoopResult]: For program point L24(lines 24 25) no Hoare annotation was computed. [2020-07-10 15:05:11,260 INFO L264 CegarLoopResult]: At program point L24-2(lines 24 25) 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:05:11,260 INFO L268 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2020-07-10 15:05:11,260 INFO L268 CegarLoopResult]: For program point checkEXIT(lines 14 36) no Hoare annotation was computed. [2020-07-10 15:05:11,260 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:05:11,261 INFO L264 CegarLoopResult]: At program point L18-1(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:05:11,261 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-10 15:05:11,261 INFO L268 CegarLoopResult]: For program point checkFINAL(lines 14 36) no Hoare annotation was computed. [2020-07-10 15:05:11,261 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 8 10) the Hoare annotation is: true [2020-07-10 15:05:11,261 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 8 10) no Hoare annotation was computed. [2020-07-10 15:05:11,261 INFO L268 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2020-07-10 15:05:11,261 INFO L268 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-07-10 15:05:11,261 INFO L268 CegarLoopResult]: For program point L9-3(lines 8 10) no Hoare annotation was computed. [2020-07-10 15:05:11,262 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-07-10 15:05:11,262 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-10 15:05:11,262 INFO L268 CegarLoopResult]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:05:11,262 INFO L268 CegarLoopResult]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:05:11,266 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:05:11,267 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-10 15:05:11,267 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-10 15:05:11,267 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-10 15:05:11,267 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2020-07-10 15:05:11,267 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:05:11,268 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:05:11,268 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-10 15:05:11,268 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-10 15:05:11,268 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-10 15:05:11,268 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-10 15:05:11,268 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-10 15:05:11,269 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-10 15:05:11,269 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-10 15:05:11,269 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2020-07-10 15:05:11,269 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:05:11,269 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:05:11,269 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2020-07-10 15:05:11,269 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-10 15:05:11,269 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2020-07-10 15:05:11,270 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2020-07-10 15:05:11,270 WARN L170 areAnnotationChecker]: L9-3 has no Hoare annotation [2020-07-10 15:05:11,270 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2020-07-10 15:05:11,270 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2020-07-10 15:05:11,270 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:05:11,270 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:05:11,270 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:05:11,271 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2020-07-10 15:05:11,271 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:05:11,271 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:05:11,271 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:05:11,271 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2020-07-10 15:05:11,271 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2020-07-10 15:05:11,271 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 15:05:11,271 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-10 15:05:11,271 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2020-07-10 15:05:11,272 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 15:05:11,272 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2020-07-10 15:05:11,272 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2020-07-10 15:05:11,272 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2020-07-10 15:05:11,272 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-10 15:05:11,272 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2020-07-10 15:05:11,272 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-10 15:05:11,273 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 15:05:11,273 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 15:05:11,273 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:05:11,273 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2020-07-10 15:05:11,273 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2020-07-10 15:05:11,273 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-10 15:05:11,273 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:05:11,273 INFO L163 areAnnotationChecker]: CFG has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:05:11,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:05:11 BoogieIcfgContainer [2020-07-10 15:05:11,276 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:05:11,278 INFO L168 Benchmark]: Toolchain (without parser) took 237206.10 ms. Allocated memory was 136.3 MB in the beginning and 325.6 MB in the end (delta: 189.3 MB). Free memory was 99.0 MB in the beginning and 123.9 MB in the end (delta: -24.8 MB). Peak memory consumption was 164.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:11,278 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 136.3 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 15:05:11,279 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.21 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 98.8 MB in the beginning and 179.2 MB in the end (delta: -80.4 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:11,280 INFO L168 Benchmark]: Boogie Preprocessor took 49.87 ms. Allocated memory is still 200.8 MB. Free memory was 179.2 MB in the beginning and 176.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:11,280 INFO L168 Benchmark]: RCFGBuilder took 610.88 ms. Allocated memory is still 200.8 MB. Free memory was 176.7 MB in the beginning and 145.8 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:11,281 INFO L168 Benchmark]: TraceAbstraction took 236153.29 ms. Allocated memory was 200.8 MB in the beginning and 325.6 MB in the end (delta: 124.8 MB). Free memory was 145.1 MB in the beginning and 123.9 MB in the end (delta: 21.2 MB). Peak memory consumption was 146.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:11,283 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.24 ms. Allocated memory is still 136.3 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 386.21 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 98.8 MB in the beginning and 179.2 MB in the end (delta: -80.4 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.87 ms. Allocated memory is still 200.8 MB. Free memory was 179.2 MB in the beginning and 176.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 610.88 ms. Allocated memory is still 200.8 MB. Free memory was 176.7 MB in the beginning and 145.8 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 236153.29 ms. Allocated memory was 200.8 MB in the beginning and 325.6 MB in the end (delta: 124.8 MB). Free memory was 145.1 MB in the beginning and 123.9 MB in the end (delta: 21.2 MB). Peak memory consumption was 146.0 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, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 235.2s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 220.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 212 SDtfs, 271 SDslu, 490 SDs, 0 SdLazy, 1056 SolverSat, 228 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 191 SyntacticMatches, 7 SemanticMatches, 86 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 25.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred 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.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 29 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 50 PreInvPairs, 60 NumberOfFragments, 326 HoareAnnotationTreeSize, 50 FomulaSimplifications, 382 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 525 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 12.7s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 366 ConstructedInterpolants, 22 QuantifiedInterpolants, 45974 SizeOfPredicates, 24 NumberOfNonLiveVariables, 545 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 99/110 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...