/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/nested6.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:24:16,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:24:16,694 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:24:16,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:24:16,711 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:24:16,713 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:24:16,714 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:24:16,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:24:16,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:24:16,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:24:16,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:24:16,733 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:24:16,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:24:16,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:24:16,740 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:24:16,741 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:24:16,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:24:16,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:24:16,748 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:24:16,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:24:16,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:24:16,756 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:24:16,757 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:24:16,758 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:24:16,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:24:16,761 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:24:16,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:24:16,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:24:16,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:24:16,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:24:16,767 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:24:16,768 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:24:16,770 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:24:16,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:24:16,774 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:24:16,774 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:24:16,774 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:24:16,775 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:24:16,775 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:24:16,776 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:24:16,777 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:24:16,778 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:24:16,791 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:24:16,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:24:16,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:24:16,793 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:24:16,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:24:16,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:24:16,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:24:16,793 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:24:16,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:24:16,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:24:16,795 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:24:16,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:24:16,795 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:24:16,795 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:24:16,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:24:16,796 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:24:16,796 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:24:16,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:24:16,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:24:16,797 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:24:16,797 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:24:16,797 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:24:16,797 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:24:17,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:24:17,074 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:24:17,077 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:24:17,079 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:24:17,079 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:24:17,080 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested6.i [2020-07-10 20:24:17,139 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c110dad91/68d7f4d896ca4aafb5733ddbe96659c5/FLAG9119344da [2020-07-10 20:24:17,539 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:24:17,540 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i [2020-07-10 20:24:17,547 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c110dad91/68d7f4d896ca4aafb5733ddbe96659c5/FLAG9119344da [2020-07-10 20:24:17,908 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c110dad91/68d7f4d896ca4aafb5733ddbe96659c5 [2020-07-10 20:24:17,916 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:24:17,918 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:24:17,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:24:17,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:24:17,924 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:24:17,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:24:17" (1/1) ... [2020-07-10 20:24:17,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e929f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:17, skipping insertion in model container [2020-07-10 20:24:17,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:24:17" (1/1) ... [2020-07-10 20:24:17,939 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:24:17,955 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:24:18,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:24:18,163 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:24:18,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:24:18,194 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:24:18,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:18 WrapperNode [2020-07-10 20:24:18,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:24:18,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:24:18,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:24:18,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:24:18,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:18" (1/1) ... [2020-07-10 20:24:18,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:18" (1/1) ... [2020-07-10 20:24:18,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:18" (1/1) ... [2020-07-10 20:24:18,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:18" (1/1) ... [2020-07-10 20:24:18,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:18" (1/1) ... [2020-07-10 20:24:18,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:18" (1/1) ... [2020-07-10 20:24:18,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:18" (1/1) ... [2020-07-10 20:24:18,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:24:18,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:24:18,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:24:18,312 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:24:18,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:18" (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 20:24:18,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:24:18,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:24:18,373 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:24:18,373 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:24:18,373 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:24:18,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:24:18,373 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:24:18,373 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:24:18,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:24:18,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:24:18,374 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:24:18,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:24:18,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:24:18,795 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:24:18,796 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 20:24:18,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:24:18 BoogieIcfgContainer [2020-07-10 20:24:18,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:24:18,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:24:18,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:24:18,804 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:24:18,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:24:17" (1/3) ... [2020-07-10 20:24:18,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4678fd93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:24:18, skipping insertion in model container [2020-07-10 20:24:18,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:18" (2/3) ... [2020-07-10 20:24:18,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4678fd93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:24:18, skipping insertion in model container [2020-07-10 20:24:18,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:24:18" (3/3) ... [2020-07-10 20:24:18,808 INFO L109 eAbstractionObserver]: Analyzing ICFG nested6.i [2020-07-10 20:24:18,817 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:24:18,823 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:24:18,833 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:24:18,849 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:24:18,849 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:24:18,850 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:24:18,850 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:24:18,850 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:24:18,850 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:24:18,850 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:24:18,850 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:24:18,862 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2020-07-10 20:24:18,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 20:24:18,872 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:18,873 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:24:18,874 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:18,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:18,879 INFO L82 PathProgramCache]: Analyzing trace with hash 2127483765, now seen corresponding path program 1 times [2020-07-10 20:24:18,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:18,885 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [651302860] [2020-07-10 20:24:18,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:19,141 INFO L280 TraceCheckUtils]: 0: Hoare triple {53#true} assume true; {53#true} is VALID [2020-07-10 20:24:19,142 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {53#true} {53#true} #106#return; {53#true} is VALID [2020-07-10 20:24:19,144 INFO L263 TraceCheckUtils]: 0: Hoare triple {53#true} call ULTIMATE.init(); {53#true} is VALID [2020-07-10 20:24:19,144 INFO L280 TraceCheckUtils]: 1: Hoare triple {53#true} assume true; {53#true} is VALID [2020-07-10 20:24:19,145 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {53#true} {53#true} #106#return; {53#true} is VALID [2020-07-10 20:24:19,145 INFO L263 TraceCheckUtils]: 3: Hoare triple {53#true} call #t~ret6 := main(); {53#true} is VALID [2020-07-10 20:24:19,146 INFO L280 TraceCheckUtils]: 4: Hoare triple {53#true} havoc ~i~0; {53#true} is VALID [2020-07-10 20:24:19,146 INFO L280 TraceCheckUtils]: 5: Hoare triple {53#true} havoc ~j~0; {53#true} is VALID [2020-07-10 20:24:19,146 INFO L280 TraceCheckUtils]: 6: Hoare triple {53#true} havoc ~k~0; {53#true} is VALID [2020-07-10 20:24:19,147 INFO L280 TraceCheckUtils]: 7: Hoare triple {53#true} havoc ~n~0; {53#true} is VALID [2020-07-10 20:24:19,147 INFO L280 TraceCheckUtils]: 8: Hoare triple {53#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {53#true} is VALID [2020-07-10 20:24:19,148 INFO L280 TraceCheckUtils]: 9: Hoare triple {53#true} ~k~0 := #t~nondet0; {53#true} is VALID [2020-07-10 20:24:19,148 INFO L280 TraceCheckUtils]: 10: Hoare triple {53#true} havoc #t~nondet0; {53#true} is VALID [2020-07-10 20:24:19,149 INFO L280 TraceCheckUtils]: 11: Hoare triple {53#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {53#true} is VALID [2020-07-10 20:24:19,149 INFO L280 TraceCheckUtils]: 12: Hoare triple {53#true} ~n~0 := #t~nondet1; {53#true} is VALID [2020-07-10 20:24:19,149 INFO L280 TraceCheckUtils]: 13: Hoare triple {53#true} havoc #t~nondet1; {53#true} is VALID [2020-07-10 20:24:19,150 INFO L280 TraceCheckUtils]: 14: Hoare triple {53#true} assume !!(~n~0 < 1000000); {53#true} is VALID [2020-07-10 20:24:19,151 INFO L280 TraceCheckUtils]: 15: Hoare triple {53#true} assume ~k~0 == ~n~0; {57#(<= main_~n~0 main_~k~0)} is VALID [2020-07-10 20:24:19,153 INFO L280 TraceCheckUtils]: 16: Hoare triple {57#(<= main_~n~0 main_~k~0)} ~i~0 := 0; {57#(<= main_~n~0 main_~k~0)} is VALID [2020-07-10 20:24:19,155 INFO L280 TraceCheckUtils]: 17: Hoare triple {57#(<= main_~n~0 main_~k~0)} assume !!(~i~0 < ~n~0); {57#(<= main_~n~0 main_~k~0)} is VALID [2020-07-10 20:24:19,156 INFO L280 TraceCheckUtils]: 18: Hoare triple {57#(<= main_~n~0 main_~k~0)} ~j~0 := 2 * ~i~0; {57#(<= main_~n~0 main_~k~0)} is VALID [2020-07-10 20:24:19,157 INFO L280 TraceCheckUtils]: 19: Hoare triple {57#(<= main_~n~0 main_~k~0)} assume !!(~j~0 < ~n~0); {57#(<= main_~n~0 main_~k~0)} is VALID [2020-07-10 20:24:19,158 INFO L280 TraceCheckUtils]: 20: Hoare triple {57#(<= main_~n~0 main_~k~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {57#(<= main_~n~0 main_~k~0)} is VALID [2020-07-10 20:24:19,160 INFO L280 TraceCheckUtils]: 21: Hoare triple {57#(<= main_~n~0 main_~k~0)} assume !(0 != #t~nondet4); {57#(<= main_~n~0 main_~k~0)} is VALID [2020-07-10 20:24:19,182 INFO L280 TraceCheckUtils]: 22: Hoare triple {57#(<= main_~n~0 main_~k~0)} havoc #t~nondet4; {57#(<= main_~n~0 main_~k~0)} is VALID [2020-07-10 20:24:19,203 INFO L263 TraceCheckUtils]: 23: Hoare triple {57#(<= main_~n~0 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {58#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:24:19,217 INFO L280 TraceCheckUtils]: 24: Hoare triple {58#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {59#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:24:19,218 INFO L280 TraceCheckUtils]: 25: Hoare triple {59#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {54#false} is VALID [2020-07-10 20:24:19,219 INFO L280 TraceCheckUtils]: 26: Hoare triple {54#false} assume !false; {54#false} is VALID [2020-07-10 20:24:19,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:19,225 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:19,227 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [651302860] [2020-07-10 20:24:19,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:19,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:24:19,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765966283] [2020-07-10 20:24:19,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-10 20:24:19,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:19,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:24:19,306 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 20:24:19,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:24:19,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:19,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:24:19,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:24:19,320 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 5 states. [2020-07-10 20:24:19,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:19,739 INFO L93 Difference]: Finished difference Result 89 states and 112 transitions. [2020-07-10 20:24:19,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:24:19,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-10 20:24:19,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:19,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:24:19,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2020-07-10 20:24:19,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:24:19,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2020-07-10 20:24:19,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 112 transitions. [2020-07-10 20:24:19,903 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:19,917 INFO L225 Difference]: With dead ends: 89 [2020-07-10 20:24:19,917 INFO L226 Difference]: Without dead ends: 48 [2020-07-10 20:24:19,922 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:24:19,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-10 20:24:20,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-07-10 20:24:20,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:20,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2020-07-10 20:24:20,010 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2020-07-10 20:24:20,011 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2020-07-10 20:24:20,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:20,021 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-07-10 20:24:20,022 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-10 20:24:20,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:20,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:20,024 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2020-07-10 20:24:20,024 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2020-07-10 20:24:20,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:20,032 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-07-10 20:24:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-10 20:24:20,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:20,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:20,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:20,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:20,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-10 20:24:20,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2020-07-10 20:24:20,046 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 27 [2020-07-10 20:24:20,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:20,046 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2020-07-10 20:24:20,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:24:20,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 52 transitions. [2020-07-10 20:24:20,114 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:20,115 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-10 20:24:20,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-10 20:24:20,116 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:20,116 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:24:20,117 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:24:20,117 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:20,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:20,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1763359327, now seen corresponding path program 1 times [2020-07-10 20:24:20,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:20,118 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1775583275] [2020-07-10 20:24:20,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:20,218 INFO L280 TraceCheckUtils]: 0: Hoare triple {434#true} assume true; {434#true} is VALID [2020-07-10 20:24:20,219 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {434#true} {434#true} #106#return; {434#true} is VALID [2020-07-10 20:24:20,219 INFO L263 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2020-07-10 20:24:20,219 INFO L280 TraceCheckUtils]: 1: Hoare triple {434#true} assume true; {434#true} is VALID [2020-07-10 20:24:20,220 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {434#true} {434#true} #106#return; {434#true} is VALID [2020-07-10 20:24:20,220 INFO L263 TraceCheckUtils]: 3: Hoare triple {434#true} call #t~ret6 := main(); {434#true} is VALID [2020-07-10 20:24:20,220 INFO L280 TraceCheckUtils]: 4: Hoare triple {434#true} havoc ~i~0; {434#true} is VALID [2020-07-10 20:24:20,221 INFO L280 TraceCheckUtils]: 5: Hoare triple {434#true} havoc ~j~0; {434#true} is VALID [2020-07-10 20:24:20,221 INFO L280 TraceCheckUtils]: 6: Hoare triple {434#true} havoc ~k~0; {434#true} is VALID [2020-07-10 20:24:20,221 INFO L280 TraceCheckUtils]: 7: Hoare triple {434#true} havoc ~n~0; {434#true} is VALID [2020-07-10 20:24:20,222 INFO L280 TraceCheckUtils]: 8: Hoare triple {434#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {434#true} is VALID [2020-07-10 20:24:20,222 INFO L280 TraceCheckUtils]: 9: Hoare triple {434#true} ~k~0 := #t~nondet0; {434#true} is VALID [2020-07-10 20:24:20,222 INFO L280 TraceCheckUtils]: 10: Hoare triple {434#true} havoc #t~nondet0; {434#true} is VALID [2020-07-10 20:24:20,222 INFO L280 TraceCheckUtils]: 11: Hoare triple {434#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {434#true} is VALID [2020-07-10 20:24:20,223 INFO L280 TraceCheckUtils]: 12: Hoare triple {434#true} ~n~0 := #t~nondet1; {434#true} is VALID [2020-07-10 20:24:20,223 INFO L280 TraceCheckUtils]: 13: Hoare triple {434#true} havoc #t~nondet1; {434#true} is VALID [2020-07-10 20:24:20,223 INFO L280 TraceCheckUtils]: 14: Hoare triple {434#true} assume !!(~n~0 < 1000000); {434#true} is VALID [2020-07-10 20:24:20,224 INFO L280 TraceCheckUtils]: 15: Hoare triple {434#true} assume ~k~0 == ~n~0; {434#true} is VALID [2020-07-10 20:24:20,224 INFO L280 TraceCheckUtils]: 16: Hoare triple {434#true} ~i~0 := 0; {434#true} is VALID [2020-07-10 20:24:20,224 INFO L280 TraceCheckUtils]: 17: Hoare triple {434#true} assume !!(~i~0 < ~n~0); {434#true} is VALID [2020-07-10 20:24:20,225 INFO L280 TraceCheckUtils]: 18: Hoare triple {434#true} ~j~0 := 2 * ~i~0; {438#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 20:24:20,226 INFO L280 TraceCheckUtils]: 19: Hoare triple {438#(<= (* 2 main_~i~0) main_~j~0)} assume !!(~j~0 < ~n~0); {438#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 20:24:20,227 INFO L280 TraceCheckUtils]: 20: Hoare triple {438#(<= (* 2 main_~i~0) main_~j~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {438#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 20:24:20,227 INFO L280 TraceCheckUtils]: 21: Hoare triple {438#(<= (* 2 main_~i~0) main_~j~0)} assume 0 != #t~nondet4; {438#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 20:24:20,228 INFO L280 TraceCheckUtils]: 22: Hoare triple {438#(<= (* 2 main_~i~0) main_~j~0)} havoc #t~nondet4; {438#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 20:24:20,229 INFO L280 TraceCheckUtils]: 23: Hoare triple {438#(<= (* 2 main_~i~0) main_~j~0)} ~k~0 := ~j~0; {439#(<= (* 2 main_~i~0) main_~k~0)} is VALID [2020-07-10 20:24:20,230 INFO L280 TraceCheckUtils]: 24: Hoare triple {439#(<= (* 2 main_~i~0) main_~k~0)} assume !!(~k~0 < ~n~0); {439#(<= (* 2 main_~i~0) main_~k~0)} is VALID [2020-07-10 20:24:20,231 INFO L263 TraceCheckUtils]: 25: Hoare triple {439#(<= (* 2 main_~i~0) main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {440#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:24:20,231 INFO L280 TraceCheckUtils]: 26: Hoare triple {440#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {441#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:24:20,232 INFO L280 TraceCheckUtils]: 27: Hoare triple {441#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {435#false} is VALID [2020-07-10 20:24:20,232 INFO L280 TraceCheckUtils]: 28: Hoare triple {435#false} assume !false; {435#false} is VALID [2020-07-10 20:24:20,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:20,235 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:20,236 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1775583275] [2020-07-10 20:24:20,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:20,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 20:24:20,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132174821] [2020-07-10 20:24:20,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-07-10 20:24:20,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:20,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 20:24:20,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:20,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 20:24:20,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:20,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 20:24:20,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:24:20,270 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 6 states. [2020-07-10 20:24:20,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:20,804 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2020-07-10 20:24:20,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 20:24:20,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-07-10 20:24:20,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:20,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:24:20,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2020-07-10 20:24:20,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:24:20,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2020-07-10 20:24:20,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 102 transitions. [2020-07-10 20:24:20,929 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:20,934 INFO L225 Difference]: With dead ends: 90 [2020-07-10 20:24:20,934 INFO L226 Difference]: Without dead ends: 88 [2020-07-10 20:24:20,935 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-10 20:24:20,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-10 20:24:21,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 59. [2020-07-10 20:24:21,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:21,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 59 states. [2020-07-10 20:24:21,020 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 59 states. [2020-07-10 20:24:21,021 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 59 states. [2020-07-10 20:24:21,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:21,027 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2020-07-10 20:24:21,027 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2020-07-10 20:24:21,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:21,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:21,029 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 88 states. [2020-07-10 20:24:21,029 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 88 states. [2020-07-10 20:24:21,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:21,035 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2020-07-10 20:24:21,035 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2020-07-10 20:24:21,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:21,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:21,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:21,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:21,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-10 20:24:21,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2020-07-10 20:24:21,040 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 29 [2020-07-10 20:24:21,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:21,041 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2020-07-10 20:24:21,041 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 20:24:21,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states and 66 transitions. [2020-07-10 20:24:21,129 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:21,129 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2020-07-10 20:24:21,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-10 20:24:21,132 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:21,132 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-10 20:24:21,132 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:24:21,133 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:21,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:21,133 INFO L82 PathProgramCache]: Analyzing trace with hash 2139784298, now seen corresponding path program 1 times [2020-07-10 20:24:21,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:21,134 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1219814872] [2020-07-10 20:24:21,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:21,230 INFO L280 TraceCheckUtils]: 0: Hoare triple {922#true} assume true; {922#true} is VALID [2020-07-10 20:24:21,231 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {922#true} {922#true} #106#return; {922#true} is VALID [2020-07-10 20:24:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:21,238 INFO L280 TraceCheckUtils]: 0: Hoare triple {922#true} ~cond := #in~cond; {922#true} is VALID [2020-07-10 20:24:21,239 INFO L280 TraceCheckUtils]: 1: Hoare triple {922#true} assume !(0 == ~cond); {922#true} is VALID [2020-07-10 20:24:21,239 INFO L280 TraceCheckUtils]: 2: Hoare triple {922#true} assume true; {922#true} is VALID [2020-07-10 20:24:21,241 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {922#true} {926#(<= main_~k~0 main_~n~0)} #112#return; {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 20:24:21,241 INFO L263 TraceCheckUtils]: 0: Hoare triple {922#true} call ULTIMATE.init(); {922#true} is VALID [2020-07-10 20:24:21,242 INFO L280 TraceCheckUtils]: 1: Hoare triple {922#true} assume true; {922#true} is VALID [2020-07-10 20:24:21,242 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {922#true} {922#true} #106#return; {922#true} is VALID [2020-07-10 20:24:21,242 INFO L263 TraceCheckUtils]: 3: Hoare triple {922#true} call #t~ret6 := main(); {922#true} is VALID [2020-07-10 20:24:21,242 INFO L280 TraceCheckUtils]: 4: Hoare triple {922#true} havoc ~i~0; {922#true} is VALID [2020-07-10 20:24:21,243 INFO L280 TraceCheckUtils]: 5: Hoare triple {922#true} havoc ~j~0; {922#true} is VALID [2020-07-10 20:24:21,243 INFO L280 TraceCheckUtils]: 6: Hoare triple {922#true} havoc ~k~0; {922#true} is VALID [2020-07-10 20:24:21,243 INFO L280 TraceCheckUtils]: 7: Hoare triple {922#true} havoc ~n~0; {922#true} is VALID [2020-07-10 20:24:21,243 INFO L280 TraceCheckUtils]: 8: Hoare triple {922#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {922#true} is VALID [2020-07-10 20:24:21,244 INFO L280 TraceCheckUtils]: 9: Hoare triple {922#true} ~k~0 := #t~nondet0; {922#true} is VALID [2020-07-10 20:24:21,244 INFO L280 TraceCheckUtils]: 10: Hoare triple {922#true} havoc #t~nondet0; {922#true} is VALID [2020-07-10 20:24:21,244 INFO L280 TraceCheckUtils]: 11: Hoare triple {922#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {922#true} is VALID [2020-07-10 20:24:21,245 INFO L280 TraceCheckUtils]: 12: Hoare triple {922#true} ~n~0 := #t~nondet1; {922#true} is VALID [2020-07-10 20:24:21,245 INFO L280 TraceCheckUtils]: 13: Hoare triple {922#true} havoc #t~nondet1; {922#true} is VALID [2020-07-10 20:24:21,245 INFO L280 TraceCheckUtils]: 14: Hoare triple {922#true} assume !!(~n~0 < 1000000); {922#true} is VALID [2020-07-10 20:24:21,246 INFO L280 TraceCheckUtils]: 15: Hoare triple {922#true} assume ~k~0 == ~n~0; {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 20:24:21,247 INFO L280 TraceCheckUtils]: 16: Hoare triple {926#(<= main_~k~0 main_~n~0)} ~i~0 := 0; {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 20:24:21,247 INFO L280 TraceCheckUtils]: 17: Hoare triple {926#(<= main_~k~0 main_~n~0)} assume !!(~i~0 < ~n~0); {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 20:24:21,248 INFO L280 TraceCheckUtils]: 18: Hoare triple {926#(<= main_~k~0 main_~n~0)} ~j~0 := 2 * ~i~0; {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 20:24:21,249 INFO L280 TraceCheckUtils]: 19: Hoare triple {926#(<= main_~k~0 main_~n~0)} assume !!(~j~0 < ~n~0); {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 20:24:21,249 INFO L280 TraceCheckUtils]: 20: Hoare triple {926#(<= main_~k~0 main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 20:24:21,250 INFO L280 TraceCheckUtils]: 21: Hoare triple {926#(<= main_~k~0 main_~n~0)} assume !(0 != #t~nondet4); {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 20:24:21,251 INFO L280 TraceCheckUtils]: 22: Hoare triple {926#(<= main_~k~0 main_~n~0)} havoc #t~nondet4; {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 20:24:21,251 INFO L263 TraceCheckUtils]: 23: Hoare triple {926#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {922#true} is VALID [2020-07-10 20:24:21,251 INFO L280 TraceCheckUtils]: 24: Hoare triple {922#true} ~cond := #in~cond; {922#true} is VALID [2020-07-10 20:24:21,251 INFO L280 TraceCheckUtils]: 25: Hoare triple {922#true} assume !(0 == ~cond); {922#true} is VALID [2020-07-10 20:24:21,252 INFO L280 TraceCheckUtils]: 26: Hoare triple {922#true} assume true; {922#true} is VALID [2020-07-10 20:24:21,253 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {922#true} {926#(<= main_~k~0 main_~n~0)} #112#return; {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 20:24:21,254 INFO L263 TraceCheckUtils]: 28: Hoare triple {926#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {931#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:24:21,255 INFO L280 TraceCheckUtils]: 29: Hoare triple {931#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {932#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:24:21,255 INFO L280 TraceCheckUtils]: 30: Hoare triple {932#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {923#false} is VALID [2020-07-10 20:24:21,255 INFO L280 TraceCheckUtils]: 31: Hoare triple {923#false} assume !false; {923#false} is VALID [2020-07-10 20:24:21,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:21,257 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:21,257 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1219814872] [2020-07-10 20:24:21,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:21,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:24:21,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112713763] [2020-07-10 20:24:21,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2020-07-10 20:24:21,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:21,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:24:21,290 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:21,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:24:21,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:21,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:24:21,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:24:21,291 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 5 states. [2020-07-10 20:24:21,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:21,638 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2020-07-10 20:24:21,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:24:21,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2020-07-10 20:24:21,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:21,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:24:21,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2020-07-10 20:24:21,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:24:21,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2020-07-10 20:24:21,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2020-07-10 20:24:21,726 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:21,730 INFO L225 Difference]: With dead ends: 86 [2020-07-10 20:24:21,730 INFO L226 Difference]: Without dead ends: 84 [2020-07-10 20:24:21,731 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:24:21,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-07-10 20:24:21,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2020-07-10 20:24:21,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:21,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 80 states. [2020-07-10 20:24:21,853 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 80 states. [2020-07-10 20:24:21,854 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 80 states. [2020-07-10 20:24:21,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:21,859 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2020-07-10 20:24:21,859 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2020-07-10 20:24:21,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:21,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:21,860 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 84 states. [2020-07-10 20:24:21,860 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 84 states. [2020-07-10 20:24:21,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:21,865 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2020-07-10 20:24:21,865 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2020-07-10 20:24:21,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:21,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:21,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:21,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:21,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-10 20:24:21,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2020-07-10 20:24:21,870 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 32 [2020-07-10 20:24:21,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:21,871 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2020-07-10 20:24:21,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:24:21,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 80 states and 92 transitions. [2020-07-10 20:24:21,993 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:21,993 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2020-07-10 20:24:21,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-10 20:24:21,994 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:21,994 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:24:21,995 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:24:21,995 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:21,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:21,995 INFO L82 PathProgramCache]: Analyzing trace with hash -268568898, now seen corresponding path program 1 times [2020-07-10 20:24:21,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:21,995 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1780897224] [2020-07-10 20:24:21,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:22,119 INFO L280 TraceCheckUtils]: 0: Hoare triple {1437#true} assume true; {1437#true} is VALID [2020-07-10 20:24:22,119 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1437#true} {1437#true} #106#return; {1437#true} is VALID [2020-07-10 20:24:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:22,131 INFO L280 TraceCheckUtils]: 0: Hoare triple {1437#true} ~cond := #in~cond; {1437#true} is VALID [2020-07-10 20:24:22,131 INFO L280 TraceCheckUtils]: 1: Hoare triple {1437#true} assume !(0 == ~cond); {1437#true} is VALID [2020-07-10 20:24:22,131 INFO L280 TraceCheckUtils]: 2: Hoare triple {1437#true} assume true; {1437#true} is VALID [2020-07-10 20:24:22,132 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1437#true} {1442#(<= (* 2 main_~i~0) main_~k~0)} #110#return; {1442#(<= (* 2 main_~i~0) main_~k~0)} is VALID [2020-07-10 20:24:22,132 INFO L263 TraceCheckUtils]: 0: Hoare triple {1437#true} call ULTIMATE.init(); {1437#true} is VALID [2020-07-10 20:24:22,133 INFO L280 TraceCheckUtils]: 1: Hoare triple {1437#true} assume true; {1437#true} is VALID [2020-07-10 20:24:22,133 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1437#true} {1437#true} #106#return; {1437#true} is VALID [2020-07-10 20:24:22,133 INFO L263 TraceCheckUtils]: 3: Hoare triple {1437#true} call #t~ret6 := main(); {1437#true} is VALID [2020-07-10 20:24:22,134 INFO L280 TraceCheckUtils]: 4: Hoare triple {1437#true} havoc ~i~0; {1437#true} is VALID [2020-07-10 20:24:22,134 INFO L280 TraceCheckUtils]: 5: Hoare triple {1437#true} havoc ~j~0; {1437#true} is VALID [2020-07-10 20:24:22,134 INFO L280 TraceCheckUtils]: 6: Hoare triple {1437#true} havoc ~k~0; {1437#true} is VALID [2020-07-10 20:24:22,134 INFO L280 TraceCheckUtils]: 7: Hoare triple {1437#true} havoc ~n~0; {1437#true} is VALID [2020-07-10 20:24:22,135 INFO L280 TraceCheckUtils]: 8: Hoare triple {1437#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1437#true} is VALID [2020-07-10 20:24:22,135 INFO L280 TraceCheckUtils]: 9: Hoare triple {1437#true} ~k~0 := #t~nondet0; {1437#true} is VALID [2020-07-10 20:24:22,135 INFO L280 TraceCheckUtils]: 10: Hoare triple {1437#true} havoc #t~nondet0; {1437#true} is VALID [2020-07-10 20:24:22,135 INFO L280 TraceCheckUtils]: 11: Hoare triple {1437#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1437#true} is VALID [2020-07-10 20:24:22,136 INFO L280 TraceCheckUtils]: 12: Hoare triple {1437#true} ~n~0 := #t~nondet1; {1437#true} is VALID [2020-07-10 20:24:22,136 INFO L280 TraceCheckUtils]: 13: Hoare triple {1437#true} havoc #t~nondet1; {1437#true} is VALID [2020-07-10 20:24:22,136 INFO L280 TraceCheckUtils]: 14: Hoare triple {1437#true} assume !!(~n~0 < 1000000); {1437#true} is VALID [2020-07-10 20:24:22,136 INFO L280 TraceCheckUtils]: 15: Hoare triple {1437#true} assume ~k~0 == ~n~0; {1437#true} is VALID [2020-07-10 20:24:22,137 INFO L280 TraceCheckUtils]: 16: Hoare triple {1437#true} ~i~0 := 0; {1437#true} is VALID [2020-07-10 20:24:22,137 INFO L280 TraceCheckUtils]: 17: Hoare triple {1437#true} assume !!(~i~0 < ~n~0); {1437#true} is VALID [2020-07-10 20:24:22,139 INFO L280 TraceCheckUtils]: 18: Hoare triple {1437#true} ~j~0 := 2 * ~i~0; {1441#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 20:24:22,140 INFO L280 TraceCheckUtils]: 19: Hoare triple {1441#(<= (* 2 main_~i~0) main_~j~0)} assume !!(~j~0 < ~n~0); {1441#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 20:24:22,142 INFO L280 TraceCheckUtils]: 20: Hoare triple {1441#(<= (* 2 main_~i~0) main_~j~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1441#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 20:24:22,143 INFO L280 TraceCheckUtils]: 21: Hoare triple {1441#(<= (* 2 main_~i~0) main_~j~0)} assume 0 != #t~nondet4; {1441#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 20:24:22,144 INFO L280 TraceCheckUtils]: 22: Hoare triple {1441#(<= (* 2 main_~i~0) main_~j~0)} havoc #t~nondet4; {1441#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 20:24:22,146 INFO L280 TraceCheckUtils]: 23: Hoare triple {1441#(<= (* 2 main_~i~0) main_~j~0)} ~k~0 := ~j~0; {1442#(<= (* 2 main_~i~0) main_~k~0)} is VALID [2020-07-10 20:24:22,147 INFO L280 TraceCheckUtils]: 24: Hoare triple {1442#(<= (* 2 main_~i~0) main_~k~0)} assume !!(~k~0 < ~n~0); {1442#(<= (* 2 main_~i~0) main_~k~0)} is VALID [2020-07-10 20:24:22,147 INFO L263 TraceCheckUtils]: 25: Hoare triple {1442#(<= (* 2 main_~i~0) main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {1437#true} is VALID [2020-07-10 20:24:22,147 INFO L280 TraceCheckUtils]: 26: Hoare triple {1437#true} ~cond := #in~cond; {1437#true} is VALID [2020-07-10 20:24:22,148 INFO L280 TraceCheckUtils]: 27: Hoare triple {1437#true} assume !(0 == ~cond); {1437#true} is VALID [2020-07-10 20:24:22,148 INFO L280 TraceCheckUtils]: 28: Hoare triple {1437#true} assume true; {1437#true} is VALID [2020-07-10 20:24:22,149 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1437#true} {1442#(<= (* 2 main_~i~0) main_~k~0)} #110#return; {1442#(<= (* 2 main_~i~0) main_~k~0)} is VALID [2020-07-10 20:24:22,150 INFO L280 TraceCheckUtils]: 30: Hoare triple {1442#(<= (* 2 main_~i~0) main_~k~0)} #t~post5 := ~k~0; {1447#(<= (* 2 main_~i~0) |main_#t~post5|)} is VALID [2020-07-10 20:24:22,153 INFO L280 TraceCheckUtils]: 31: Hoare triple {1447#(<= (* 2 main_~i~0) |main_#t~post5|)} ~k~0 := 1 + #t~post5; {1448#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} is VALID [2020-07-10 20:24:22,154 INFO L280 TraceCheckUtils]: 32: Hoare triple {1448#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} havoc #t~post5; {1448#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} is VALID [2020-07-10 20:24:22,156 INFO L280 TraceCheckUtils]: 33: Hoare triple {1448#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} assume !!(~k~0 < ~n~0); {1448#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} is VALID [2020-07-10 20:24:22,157 INFO L263 TraceCheckUtils]: 34: Hoare triple {1448#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {1449#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:24:22,157 INFO L280 TraceCheckUtils]: 35: Hoare triple {1449#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1450#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:24:22,158 INFO L280 TraceCheckUtils]: 36: Hoare triple {1450#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1438#false} is VALID [2020-07-10 20:24:22,160 INFO L280 TraceCheckUtils]: 37: Hoare triple {1438#false} assume !false; {1438#false} is VALID [2020-07-10 20:24:22,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:22,163 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:22,163 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1780897224] [2020-07-10 20:24:22,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:22,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 20:24:22,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337005566] [2020-07-10 20:24:22,164 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2020-07-10 20:24:22,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:22,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 20:24:22,216 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:22,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 20:24:22,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:22,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 20:24:22,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-10 20:24:22,217 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand 8 states. [2020-07-10 20:24:23,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:23,122 INFO L93 Difference]: Finished difference Result 137 states and 162 transitions. [2020-07-10 20:24:23,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 20:24:23,122 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2020-07-10 20:24:23,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:23,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:24:23,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 121 transitions. [2020-07-10 20:24:23,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:24:23,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 121 transitions. [2020-07-10 20:24:23,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 121 transitions. [2020-07-10 20:24:23,265 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:23,271 INFO L225 Difference]: With dead ends: 137 [2020-07-10 20:24:23,271 INFO L226 Difference]: Without dead ends: 135 [2020-07-10 20:24:23,272 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-07-10 20:24:23,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-07-10 20:24:23,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 83. [2020-07-10 20:24:23,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:23,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand 83 states. [2020-07-10 20:24:23,392 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 83 states. [2020-07-10 20:24:23,392 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 83 states. [2020-07-10 20:24:23,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:23,403 INFO L93 Difference]: Finished difference Result 135 states and 160 transitions. [2020-07-10 20:24:23,403 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 160 transitions. [2020-07-10 20:24:23,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:23,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:23,404 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 135 states. [2020-07-10 20:24:23,405 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 135 states. [2020-07-10 20:24:23,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:23,415 INFO L93 Difference]: Finished difference Result 135 states and 160 transitions. [2020-07-10 20:24:23,415 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 160 transitions. [2020-07-10 20:24:23,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:23,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:23,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:23,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:23,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-07-10 20:24:23,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2020-07-10 20:24:23,421 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 38 [2020-07-10 20:24:23,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:23,421 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2020-07-10 20:24:23,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 20:24:23,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 83 states and 95 transitions. [2020-07-10 20:24:23,536 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:23,536 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2020-07-10 20:24:23,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-10 20:24:23,538 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:23,538 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:24:23,538 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 20:24:23,539 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:23,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:23,539 INFO L82 PathProgramCache]: Analyzing trace with hash -360550748, now seen corresponding path program 1 times [2020-07-10 20:24:23,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:23,540 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1815737923] [2020-07-10 20:24:23,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:23,629 INFO L280 TraceCheckUtils]: 0: Hoare triple {2173#true} assume true; {2173#true} is VALID [2020-07-10 20:24:23,629 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2173#true} {2173#true} #106#return; {2173#true} is VALID [2020-07-10 20:24:23,629 INFO L263 TraceCheckUtils]: 0: Hoare triple {2173#true} call ULTIMATE.init(); {2173#true} is VALID [2020-07-10 20:24:23,630 INFO L280 TraceCheckUtils]: 1: Hoare triple {2173#true} assume true; {2173#true} is VALID [2020-07-10 20:24:23,630 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2173#true} {2173#true} #106#return; {2173#true} is VALID [2020-07-10 20:24:23,630 INFO L263 TraceCheckUtils]: 3: Hoare triple {2173#true} call #t~ret6 := main(); {2173#true} is VALID [2020-07-10 20:24:23,631 INFO L280 TraceCheckUtils]: 4: Hoare triple {2173#true} havoc ~i~0; {2173#true} is VALID [2020-07-10 20:24:23,631 INFO L280 TraceCheckUtils]: 5: Hoare triple {2173#true} havoc ~j~0; {2173#true} is VALID [2020-07-10 20:24:23,631 INFO L280 TraceCheckUtils]: 6: Hoare triple {2173#true} havoc ~k~0; {2173#true} is VALID [2020-07-10 20:24:23,631 INFO L280 TraceCheckUtils]: 7: Hoare triple {2173#true} havoc ~n~0; {2173#true} is VALID [2020-07-10 20:24:23,632 INFO L280 TraceCheckUtils]: 8: Hoare triple {2173#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2173#true} is VALID [2020-07-10 20:24:23,632 INFO L280 TraceCheckUtils]: 9: Hoare triple {2173#true} ~k~0 := #t~nondet0; {2173#true} is VALID [2020-07-10 20:24:23,632 INFO L280 TraceCheckUtils]: 10: Hoare triple {2173#true} havoc #t~nondet0; {2173#true} is VALID [2020-07-10 20:24:23,632 INFO L280 TraceCheckUtils]: 11: Hoare triple {2173#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2173#true} is VALID [2020-07-10 20:24:23,633 INFO L280 TraceCheckUtils]: 12: Hoare triple {2173#true} ~n~0 := #t~nondet1; {2173#true} is VALID [2020-07-10 20:24:23,633 INFO L280 TraceCheckUtils]: 13: Hoare triple {2173#true} havoc #t~nondet1; {2173#true} is VALID [2020-07-10 20:24:23,633 INFO L280 TraceCheckUtils]: 14: Hoare triple {2173#true} assume !!(~n~0 < 1000000); {2173#true} is VALID [2020-07-10 20:24:23,633 INFO L280 TraceCheckUtils]: 15: Hoare triple {2173#true} assume ~k~0 == ~n~0; {2173#true} is VALID [2020-07-10 20:24:23,634 INFO L280 TraceCheckUtils]: 16: Hoare triple {2173#true} ~i~0 := 0; {2177#(<= main_~i~0 0)} is VALID [2020-07-10 20:24:23,636 INFO L280 TraceCheckUtils]: 17: Hoare triple {2177#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0); {2178#(<= (+ (* 2 main_~i~0) 1) main_~n~0)} is VALID [2020-07-10 20:24:23,639 INFO L280 TraceCheckUtils]: 18: Hoare triple {2178#(<= (+ (* 2 main_~i~0) 1) main_~n~0)} ~j~0 := 2 * ~i~0; {2179#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-10 20:24:23,640 INFO L280 TraceCheckUtils]: 19: Hoare triple {2179#(<= (+ main_~j~0 1) main_~n~0)} assume !!(~j~0 < ~n~0); {2179#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-10 20:24:23,641 INFO L280 TraceCheckUtils]: 20: Hoare triple {2179#(<= (+ main_~j~0 1) main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2179#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-10 20:24:23,641 INFO L280 TraceCheckUtils]: 21: Hoare triple {2179#(<= (+ main_~j~0 1) main_~n~0)} assume 0 != #t~nondet4; {2179#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-10 20:24:23,642 INFO L280 TraceCheckUtils]: 22: Hoare triple {2179#(<= (+ main_~j~0 1) main_~n~0)} havoc #t~nondet4; {2179#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-10 20:24:23,643 INFO L280 TraceCheckUtils]: 23: Hoare triple {2179#(<= (+ main_~j~0 1) main_~n~0)} ~k~0 := ~j~0; {2180#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2020-07-10 20:24:23,643 INFO L280 TraceCheckUtils]: 24: Hoare triple {2180#(<= (+ main_~k~0 1) main_~n~0)} assume !(~k~0 < ~n~0); {2174#false} is VALID [2020-07-10 20:24:23,644 INFO L280 TraceCheckUtils]: 25: Hoare triple {2174#false} #t~post3 := ~j~0; {2174#false} is VALID [2020-07-10 20:24:23,644 INFO L280 TraceCheckUtils]: 26: Hoare triple {2174#false} ~j~0 := 1 + #t~post3; {2174#false} is VALID [2020-07-10 20:24:23,644 INFO L280 TraceCheckUtils]: 27: Hoare triple {2174#false} havoc #t~post3; {2174#false} is VALID [2020-07-10 20:24:23,644 INFO L280 TraceCheckUtils]: 28: Hoare triple {2174#false} assume !!(~j~0 < ~n~0); {2174#false} is VALID [2020-07-10 20:24:23,645 INFO L280 TraceCheckUtils]: 29: Hoare triple {2174#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2174#false} is VALID [2020-07-10 20:24:23,645 INFO L280 TraceCheckUtils]: 30: Hoare triple {2174#false} assume 0 != #t~nondet4; {2174#false} is VALID [2020-07-10 20:24:23,645 INFO L280 TraceCheckUtils]: 31: Hoare triple {2174#false} havoc #t~nondet4; {2174#false} is VALID [2020-07-10 20:24:23,645 INFO L280 TraceCheckUtils]: 32: Hoare triple {2174#false} ~k~0 := ~j~0; {2174#false} is VALID [2020-07-10 20:24:23,646 INFO L280 TraceCheckUtils]: 33: Hoare triple {2174#false} assume !!(~k~0 < ~n~0); {2174#false} is VALID [2020-07-10 20:24:23,646 INFO L263 TraceCheckUtils]: 34: Hoare triple {2174#false} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {2174#false} is VALID [2020-07-10 20:24:23,646 INFO L280 TraceCheckUtils]: 35: Hoare triple {2174#false} ~cond := #in~cond; {2174#false} is VALID [2020-07-10 20:24:23,646 INFO L280 TraceCheckUtils]: 36: Hoare triple {2174#false} assume 0 == ~cond; {2174#false} is VALID [2020-07-10 20:24:23,647 INFO L280 TraceCheckUtils]: 37: Hoare triple {2174#false} assume !false; {2174#false} is VALID [2020-07-10 20:24:23,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:23,648 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:23,649 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1815737923] [2020-07-10 20:24:23,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:23,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 20:24:23,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596589346] [2020-07-10 20:24:23,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-10 20:24:23,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:23,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 20:24:23,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:23,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 20:24:23,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:23,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 20:24:23,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:24:23,685 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand 6 states. [2020-07-10 20:24:24,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:24,312 INFO L93 Difference]: Finished difference Result 194 states and 236 transitions. [2020-07-10 20:24:24,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 20:24:24,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-10 20:24:24,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:24,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:24:24,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2020-07-10 20:24:24,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:24:24,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2020-07-10 20:24:24,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 113 transitions. [2020-07-10 20:24:24,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:24,452 INFO L225 Difference]: With dead ends: 194 [2020-07-10 20:24:24,452 INFO L226 Difference]: Without dead ends: 128 [2020-07-10 20:24:24,453 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-10 20:24:24,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-07-10 20:24:24,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 88. [2020-07-10 20:24:24,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:24,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 88 states. [2020-07-10 20:24:24,641 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 88 states. [2020-07-10 20:24:24,641 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 88 states. [2020-07-10 20:24:24,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:24,647 INFO L93 Difference]: Finished difference Result 128 states and 153 transitions. [2020-07-10 20:24:24,647 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 153 transitions. [2020-07-10 20:24:24,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:24,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:24,648 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 128 states. [2020-07-10 20:24:24,648 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 128 states. [2020-07-10 20:24:24,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:24,653 INFO L93 Difference]: Finished difference Result 128 states and 153 transitions. [2020-07-10 20:24:24,654 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 153 transitions. [2020-07-10 20:24:24,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:24,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:24,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:24,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:24,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-07-10 20:24:24,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2020-07-10 20:24:24,658 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 38 [2020-07-10 20:24:24,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:24,658 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2020-07-10 20:24:24,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 20:24:24,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 88 states and 100 transitions. [2020-07-10 20:24:24,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:24,821 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2020-07-10 20:24:24,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-10 20:24:24,822 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:24,822 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:24:24,823 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 20:24:24,823 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:24,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:24,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1447898534, now seen corresponding path program 1 times [2020-07-10 20:24:24,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:24,824 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1307501091] [2020-07-10 20:24:24,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:24,961 INFO L280 TraceCheckUtils]: 0: Hoare triple {3011#true} assume true; {3011#true} is VALID [2020-07-10 20:24:24,961 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3011#true} {3011#true} #106#return; {3011#true} is VALID [2020-07-10 20:24:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:24,968 INFO L280 TraceCheckUtils]: 0: Hoare triple {3011#true} ~cond := #in~cond; {3011#true} is VALID [2020-07-10 20:24:24,969 INFO L280 TraceCheckUtils]: 1: Hoare triple {3011#true} assume !(0 == ~cond); {3011#true} is VALID [2020-07-10 20:24:24,969 INFO L280 TraceCheckUtils]: 2: Hoare triple {3011#true} assume true; {3011#true} is VALID [2020-07-10 20:24:24,970 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3011#true} {3015#(<= (* 2 main_~i~0) main_~j~0)} #112#return; {3015#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 20:24:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:24,976 INFO L280 TraceCheckUtils]: 0: Hoare triple {3011#true} ~cond := #in~cond; {3011#true} is VALID [2020-07-10 20:24:24,976 INFO L280 TraceCheckUtils]: 1: Hoare triple {3011#true} assume !(0 == ~cond); {3011#true} is VALID [2020-07-10 20:24:24,977 INFO L280 TraceCheckUtils]: 2: Hoare triple {3011#true} assume true; {3011#true} is VALID [2020-07-10 20:24:24,978 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3011#true} {3015#(<= (* 2 main_~i~0) main_~j~0)} #114#return; {3015#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 20:24:24,978 INFO L263 TraceCheckUtils]: 0: Hoare triple {3011#true} call ULTIMATE.init(); {3011#true} is VALID [2020-07-10 20:24:24,978 INFO L280 TraceCheckUtils]: 1: Hoare triple {3011#true} assume true; {3011#true} is VALID [2020-07-10 20:24:24,978 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3011#true} {3011#true} #106#return; {3011#true} is VALID [2020-07-10 20:24:24,979 INFO L263 TraceCheckUtils]: 3: Hoare triple {3011#true} call #t~ret6 := main(); {3011#true} is VALID [2020-07-10 20:24:24,979 INFO L280 TraceCheckUtils]: 4: Hoare triple {3011#true} havoc ~i~0; {3011#true} is VALID [2020-07-10 20:24:24,979 INFO L280 TraceCheckUtils]: 5: Hoare triple {3011#true} havoc ~j~0; {3011#true} is VALID [2020-07-10 20:24:24,979 INFO L280 TraceCheckUtils]: 6: Hoare triple {3011#true} havoc ~k~0; {3011#true} is VALID [2020-07-10 20:24:24,980 INFO L280 TraceCheckUtils]: 7: Hoare triple {3011#true} havoc ~n~0; {3011#true} is VALID [2020-07-10 20:24:24,980 INFO L280 TraceCheckUtils]: 8: Hoare triple {3011#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3011#true} is VALID [2020-07-10 20:24:24,980 INFO L280 TraceCheckUtils]: 9: Hoare triple {3011#true} ~k~0 := #t~nondet0; {3011#true} is VALID [2020-07-10 20:24:24,980 INFO L280 TraceCheckUtils]: 10: Hoare triple {3011#true} havoc #t~nondet0; {3011#true} is VALID [2020-07-10 20:24:24,981 INFO L280 TraceCheckUtils]: 11: Hoare triple {3011#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3011#true} is VALID [2020-07-10 20:24:24,981 INFO L280 TraceCheckUtils]: 12: Hoare triple {3011#true} ~n~0 := #t~nondet1; {3011#true} is VALID [2020-07-10 20:24:24,981 INFO L280 TraceCheckUtils]: 13: Hoare triple {3011#true} havoc #t~nondet1; {3011#true} is VALID [2020-07-10 20:24:24,981 INFO L280 TraceCheckUtils]: 14: Hoare triple {3011#true} assume !!(~n~0 < 1000000); {3011#true} is VALID [2020-07-10 20:24:24,982 INFO L280 TraceCheckUtils]: 15: Hoare triple {3011#true} assume ~k~0 == ~n~0; {3011#true} is VALID [2020-07-10 20:24:24,982 INFO L280 TraceCheckUtils]: 16: Hoare triple {3011#true} ~i~0 := 0; {3011#true} is VALID [2020-07-10 20:24:24,982 INFO L280 TraceCheckUtils]: 17: Hoare triple {3011#true} assume !!(~i~0 < ~n~0); {3011#true} is VALID [2020-07-10 20:24:24,983 INFO L280 TraceCheckUtils]: 18: Hoare triple {3011#true} ~j~0 := 2 * ~i~0; {3015#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 20:24:24,984 INFO L280 TraceCheckUtils]: 19: Hoare triple {3015#(<= (* 2 main_~i~0) main_~j~0)} assume !!(~j~0 < ~n~0); {3015#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 20:24:24,984 INFO L280 TraceCheckUtils]: 20: Hoare triple {3015#(<= (* 2 main_~i~0) main_~j~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3015#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 20:24:24,985 INFO L280 TraceCheckUtils]: 21: Hoare triple {3015#(<= (* 2 main_~i~0) main_~j~0)} assume !(0 != #t~nondet4); {3015#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 20:24:24,985 INFO L280 TraceCheckUtils]: 22: Hoare triple {3015#(<= (* 2 main_~i~0) main_~j~0)} havoc #t~nondet4; {3015#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 20:24:24,986 INFO L263 TraceCheckUtils]: 23: Hoare triple {3015#(<= (* 2 main_~i~0) main_~j~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {3011#true} is VALID [2020-07-10 20:24:24,986 INFO L280 TraceCheckUtils]: 24: Hoare triple {3011#true} ~cond := #in~cond; {3011#true} is VALID [2020-07-10 20:24:24,986 INFO L280 TraceCheckUtils]: 25: Hoare triple {3011#true} assume !(0 == ~cond); {3011#true} is VALID [2020-07-10 20:24:24,986 INFO L280 TraceCheckUtils]: 26: Hoare triple {3011#true} assume true; {3011#true} is VALID [2020-07-10 20:24:24,987 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {3011#true} {3015#(<= (* 2 main_~i~0) main_~j~0)} #112#return; {3015#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 20:24:24,987 INFO L263 TraceCheckUtils]: 28: Hoare triple {3015#(<= (* 2 main_~i~0) main_~j~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {3011#true} is VALID [2020-07-10 20:24:24,988 INFO L280 TraceCheckUtils]: 29: Hoare triple {3011#true} ~cond := #in~cond; {3011#true} is VALID [2020-07-10 20:24:24,988 INFO L280 TraceCheckUtils]: 30: Hoare triple {3011#true} assume !(0 == ~cond); {3011#true} is VALID [2020-07-10 20:24:24,988 INFO L280 TraceCheckUtils]: 31: Hoare triple {3011#true} assume true; {3011#true} is VALID [2020-07-10 20:24:24,989 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {3011#true} {3015#(<= (* 2 main_~i~0) main_~j~0)} #114#return; {3015#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 20:24:24,990 INFO L280 TraceCheckUtils]: 33: Hoare triple {3015#(<= (* 2 main_~i~0) main_~j~0)} #t~post3 := ~j~0; {3024#(<= (* 2 main_~i~0) |main_#t~post3|)} is VALID [2020-07-10 20:24:24,991 INFO L280 TraceCheckUtils]: 34: Hoare triple {3024#(<= (* 2 main_~i~0) |main_#t~post3|)} ~j~0 := 1 + #t~post3; {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-10 20:24:24,991 INFO L280 TraceCheckUtils]: 35: Hoare triple {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} havoc #t~post3; {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-10 20:24:24,992 INFO L280 TraceCheckUtils]: 36: Hoare triple {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} assume !!(~j~0 < ~n~0); {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-10 20:24:24,992 INFO L280 TraceCheckUtils]: 37: Hoare triple {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-10 20:24:24,993 INFO L280 TraceCheckUtils]: 38: Hoare triple {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} assume 0 != #t~nondet4; {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-10 20:24:24,994 INFO L280 TraceCheckUtils]: 39: Hoare triple {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} havoc #t~nondet4; {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-10 20:24:24,994 INFO L280 TraceCheckUtils]: 40: Hoare triple {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} ~k~0 := ~j~0; {3026#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} is VALID [2020-07-10 20:24:24,995 INFO L280 TraceCheckUtils]: 41: Hoare triple {3026#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} assume !!(~k~0 < ~n~0); {3026#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} is VALID [2020-07-10 20:24:24,996 INFO L263 TraceCheckUtils]: 42: Hoare triple {3026#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {3027#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:24:24,997 INFO L280 TraceCheckUtils]: 43: Hoare triple {3027#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3028#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:24:24,997 INFO L280 TraceCheckUtils]: 44: Hoare triple {3028#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3012#false} is VALID [2020-07-10 20:24:24,998 INFO L280 TraceCheckUtils]: 45: Hoare triple {3012#false} assume !false; {3012#false} is VALID [2020-07-10 20:24:25,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:25,001 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:25,001 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1307501091] [2020-07-10 20:24:25,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:25,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 20:24:25,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536499196] [2020-07-10 20:24:25,002 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2020-07-10 20:24:25,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:25,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 20:24:25,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:25,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 20:24:25,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:25,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 20:24:25,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-10 20:24:25,044 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand 8 states. [2020-07-10 20:24:25,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:25,837 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2020-07-10 20:24:25,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 20:24:25,837 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2020-07-10 20:24:25,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:25,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:24:25,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2020-07-10 20:24:25,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:24:25,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2020-07-10 20:24:25,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 82 transitions. [2020-07-10 20:24:25,937 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:25,940 INFO L225 Difference]: With dead ends: 111 [2020-07-10 20:24:25,940 INFO L226 Difference]: Without dead ends: 109 [2020-07-10 20:24:25,940 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-10 20:24:25,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-07-10 20:24:26,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93. [2020-07-10 20:24:26,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:26,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 93 states. [2020-07-10 20:24:26,132 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 93 states. [2020-07-10 20:24:26,132 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 93 states. [2020-07-10 20:24:26,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:26,137 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2020-07-10 20:24:26,137 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2020-07-10 20:24:26,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:26,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:26,138 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 109 states. [2020-07-10 20:24:26,138 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 109 states. [2020-07-10 20:24:26,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:26,143 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2020-07-10 20:24:26,143 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2020-07-10 20:24:26,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:26,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:26,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:26,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:26,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-07-10 20:24:26,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2020-07-10 20:24:26,148 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 46 [2020-07-10 20:24:26,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:26,148 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2020-07-10 20:24:26,148 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 20:24:26,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 93 states and 105 transitions. [2020-07-10 20:24:26,301 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:26,302 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2020-07-10 20:24:26,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-10 20:24:26,303 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:26,303 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:24:26,303 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 20:24:26,304 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:26,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:26,304 INFO L82 PathProgramCache]: Analyzing trace with hash 87970788, now seen corresponding path program 1 times [2020-07-10 20:24:26,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:26,305 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [758002888] [2020-07-10 20:24:26,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:26,475 INFO L280 TraceCheckUtils]: 0: Hoare triple {3665#true} assume true; {3665#true} is VALID [2020-07-10 20:24:26,475 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3665#true} {3665#true} #106#return; {3665#true} is VALID [2020-07-10 20:24:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:26,486 INFO L280 TraceCheckUtils]: 0: Hoare triple {3665#true} ~cond := #in~cond; {3665#true} is VALID [2020-07-10 20:24:26,486 INFO L280 TraceCheckUtils]: 1: Hoare triple {3665#true} assume !(0 == ~cond); {3665#true} is VALID [2020-07-10 20:24:26,486 INFO L280 TraceCheckUtils]: 2: Hoare triple {3665#true} assume true; {3665#true} is VALID [2020-07-10 20:24:26,487 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3665#true} {3672#(<= (+ main_~k~0 1) main_~n~0)} #110#return; {3672#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2020-07-10 20:24:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:26,494 INFO L280 TraceCheckUtils]: 0: Hoare triple {3665#true} ~cond := #in~cond; {3665#true} is VALID [2020-07-10 20:24:26,495 INFO L280 TraceCheckUtils]: 1: Hoare triple {3665#true} assume !(0 == ~cond); {3665#true} is VALID [2020-07-10 20:24:26,495 INFO L280 TraceCheckUtils]: 2: Hoare triple {3665#true} assume true; {3665#true} is VALID [2020-07-10 20:24:26,499 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3665#true} {3678#(<= main_~k~0 main_~n~0)} #112#return; {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 20:24:26,500 INFO L263 TraceCheckUtils]: 0: Hoare triple {3665#true} call ULTIMATE.init(); {3665#true} is VALID [2020-07-10 20:24:26,500 INFO L280 TraceCheckUtils]: 1: Hoare triple {3665#true} assume true; {3665#true} is VALID [2020-07-10 20:24:26,500 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3665#true} {3665#true} #106#return; {3665#true} is VALID [2020-07-10 20:24:26,500 INFO L263 TraceCheckUtils]: 3: Hoare triple {3665#true} call #t~ret6 := main(); {3665#true} is VALID [2020-07-10 20:24:26,501 INFO L280 TraceCheckUtils]: 4: Hoare triple {3665#true} havoc ~i~0; {3665#true} is VALID [2020-07-10 20:24:26,501 INFO L280 TraceCheckUtils]: 5: Hoare triple {3665#true} havoc ~j~0; {3665#true} is VALID [2020-07-10 20:24:26,501 INFO L280 TraceCheckUtils]: 6: Hoare triple {3665#true} havoc ~k~0; {3665#true} is VALID [2020-07-10 20:24:26,501 INFO L280 TraceCheckUtils]: 7: Hoare triple {3665#true} havoc ~n~0; {3665#true} is VALID [2020-07-10 20:24:26,501 INFO L280 TraceCheckUtils]: 8: Hoare triple {3665#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3665#true} is VALID [2020-07-10 20:24:26,502 INFO L280 TraceCheckUtils]: 9: Hoare triple {3665#true} ~k~0 := #t~nondet0; {3665#true} is VALID [2020-07-10 20:24:26,502 INFO L280 TraceCheckUtils]: 10: Hoare triple {3665#true} havoc #t~nondet0; {3665#true} is VALID [2020-07-10 20:24:26,502 INFO L280 TraceCheckUtils]: 11: Hoare triple {3665#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3665#true} is VALID [2020-07-10 20:24:26,502 INFO L280 TraceCheckUtils]: 12: Hoare triple {3665#true} ~n~0 := #t~nondet1; {3665#true} is VALID [2020-07-10 20:24:26,502 INFO L280 TraceCheckUtils]: 13: Hoare triple {3665#true} havoc #t~nondet1; {3665#true} is VALID [2020-07-10 20:24:26,503 INFO L280 TraceCheckUtils]: 14: Hoare triple {3665#true} assume !!(~n~0 < 1000000); {3665#true} is VALID [2020-07-10 20:24:26,503 INFO L280 TraceCheckUtils]: 15: Hoare triple {3665#true} assume ~k~0 == ~n~0; {3665#true} is VALID [2020-07-10 20:24:26,504 INFO L280 TraceCheckUtils]: 16: Hoare triple {3665#true} ~i~0 := 0; {3669#(<= main_~i~0 0)} is VALID [2020-07-10 20:24:26,505 INFO L280 TraceCheckUtils]: 17: Hoare triple {3669#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0); {3670#(<= (+ (* 2 main_~i~0) 1) main_~n~0)} is VALID [2020-07-10 20:24:26,507 INFO L280 TraceCheckUtils]: 18: Hoare triple {3670#(<= (+ (* 2 main_~i~0) 1) main_~n~0)} ~j~0 := 2 * ~i~0; {3671#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-10 20:24:26,508 INFO L280 TraceCheckUtils]: 19: Hoare triple {3671#(<= (+ main_~j~0 1) main_~n~0)} assume !!(~j~0 < ~n~0); {3671#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-10 20:24:26,510 INFO L280 TraceCheckUtils]: 20: Hoare triple {3671#(<= (+ main_~j~0 1) main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3671#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-10 20:24:26,512 INFO L280 TraceCheckUtils]: 21: Hoare triple {3671#(<= (+ main_~j~0 1) main_~n~0)} assume 0 != #t~nondet4; {3671#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-10 20:24:26,513 INFO L280 TraceCheckUtils]: 22: Hoare triple {3671#(<= (+ main_~j~0 1) main_~n~0)} havoc #t~nondet4; {3671#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-10 20:24:26,514 INFO L280 TraceCheckUtils]: 23: Hoare triple {3671#(<= (+ main_~j~0 1) main_~n~0)} ~k~0 := ~j~0; {3672#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2020-07-10 20:24:26,514 INFO L280 TraceCheckUtils]: 24: Hoare triple {3672#(<= (+ main_~k~0 1) main_~n~0)} assume !!(~k~0 < ~n~0); {3672#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2020-07-10 20:24:26,515 INFO L263 TraceCheckUtils]: 25: Hoare triple {3672#(<= (+ main_~k~0 1) main_~n~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {3665#true} is VALID [2020-07-10 20:24:26,515 INFO L280 TraceCheckUtils]: 26: Hoare triple {3665#true} ~cond := #in~cond; {3665#true} is VALID [2020-07-10 20:24:26,515 INFO L280 TraceCheckUtils]: 27: Hoare triple {3665#true} assume !(0 == ~cond); {3665#true} is VALID [2020-07-10 20:24:26,515 INFO L280 TraceCheckUtils]: 28: Hoare triple {3665#true} assume true; {3665#true} is VALID [2020-07-10 20:24:26,516 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {3665#true} {3672#(<= (+ main_~k~0 1) main_~n~0)} #110#return; {3672#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2020-07-10 20:24:26,517 INFO L280 TraceCheckUtils]: 30: Hoare triple {3672#(<= (+ main_~k~0 1) main_~n~0)} #t~post5 := ~k~0; {3677#(<= (+ |main_#t~post5| 1) main_~n~0)} is VALID [2020-07-10 20:24:26,518 INFO L280 TraceCheckUtils]: 31: Hoare triple {3677#(<= (+ |main_#t~post5| 1) main_~n~0)} ~k~0 := 1 + #t~post5; {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 20:24:26,518 INFO L280 TraceCheckUtils]: 32: Hoare triple {3678#(<= main_~k~0 main_~n~0)} havoc #t~post5; {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 20:24:26,519 INFO L280 TraceCheckUtils]: 33: Hoare triple {3678#(<= main_~k~0 main_~n~0)} assume !(~k~0 < ~n~0); {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 20:24:26,519 INFO L280 TraceCheckUtils]: 34: Hoare triple {3678#(<= main_~k~0 main_~n~0)} #t~post3 := ~j~0; {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 20:24:26,520 INFO L280 TraceCheckUtils]: 35: Hoare triple {3678#(<= main_~k~0 main_~n~0)} ~j~0 := 1 + #t~post3; {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 20:24:26,521 INFO L280 TraceCheckUtils]: 36: Hoare triple {3678#(<= main_~k~0 main_~n~0)} havoc #t~post3; {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 20:24:26,521 INFO L280 TraceCheckUtils]: 37: Hoare triple {3678#(<= main_~k~0 main_~n~0)} assume !!(~j~0 < ~n~0); {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 20:24:26,522 INFO L280 TraceCheckUtils]: 38: Hoare triple {3678#(<= main_~k~0 main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 20:24:26,522 INFO L280 TraceCheckUtils]: 39: Hoare triple {3678#(<= main_~k~0 main_~n~0)} assume !(0 != #t~nondet4); {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 20:24:26,523 INFO L280 TraceCheckUtils]: 40: Hoare triple {3678#(<= main_~k~0 main_~n~0)} havoc #t~nondet4; {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 20:24:26,523 INFO L263 TraceCheckUtils]: 41: Hoare triple {3678#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {3665#true} is VALID [2020-07-10 20:24:26,523 INFO L280 TraceCheckUtils]: 42: Hoare triple {3665#true} ~cond := #in~cond; {3665#true} is VALID [2020-07-10 20:24:26,524 INFO L280 TraceCheckUtils]: 43: Hoare triple {3665#true} assume !(0 == ~cond); {3665#true} is VALID [2020-07-10 20:24:26,524 INFO L280 TraceCheckUtils]: 44: Hoare triple {3665#true} assume true; {3665#true} is VALID [2020-07-10 20:24:26,525 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {3665#true} {3678#(<= main_~k~0 main_~n~0)} #112#return; {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 20:24:26,525 INFO L263 TraceCheckUtils]: 46: Hoare triple {3678#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {3683#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:24:26,526 INFO L280 TraceCheckUtils]: 47: Hoare triple {3683#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3684#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:24:26,527 INFO L280 TraceCheckUtils]: 48: Hoare triple {3684#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3666#false} is VALID [2020-07-10 20:24:26,527 INFO L280 TraceCheckUtils]: 49: Hoare triple {3666#false} assume !false; {3666#false} is VALID [2020-07-10 20:24:26,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:26,530 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:26,530 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [758002888] [2020-07-10 20:24:26,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:26,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-10 20:24:26,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798853109] [2020-07-10 20:24:26,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2020-07-10 20:24:26,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:26,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 20:24:26,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:26,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 20:24:26,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:26,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 20:24:26,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-10 20:24:26,577 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 10 states. [2020-07-10 20:24:27,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:27,693 INFO L93 Difference]: Finished difference Result 140 states and 165 transitions. [2020-07-10 20:24:27,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-10 20:24:27,693 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2020-07-10 20:24:27,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:27,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 20:24:27,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 83 transitions. [2020-07-10 20:24:27,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 20:24:27,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 83 transitions. [2020-07-10 20:24:27,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 83 transitions. [2020-07-10 20:24:27,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:27,808 INFO L225 Difference]: With dead ends: 140 [2020-07-10 20:24:27,808 INFO L226 Difference]: Without dead ends: 138 [2020-07-10 20:24:27,809 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2020-07-10 20:24:27,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-07-10 20:24:27,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 76. [2020-07-10 20:24:27,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:27,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 76 states. [2020-07-10 20:24:27,999 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 76 states. [2020-07-10 20:24:27,999 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 76 states. [2020-07-10 20:24:28,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:28,007 INFO L93 Difference]: Finished difference Result 138 states and 163 transitions. [2020-07-10 20:24:28,007 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 163 transitions. [2020-07-10 20:24:28,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:28,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:28,016 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 138 states. [2020-07-10 20:24:28,016 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 138 states. [2020-07-10 20:24:28,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:28,042 INFO L93 Difference]: Finished difference Result 138 states and 163 transitions. [2020-07-10 20:24:28,042 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 163 transitions. [2020-07-10 20:24:28,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:28,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:28,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:28,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:28,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-10 20:24:28,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2020-07-10 20:24:28,046 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 50 [2020-07-10 20:24:28,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:28,046 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2020-07-10 20:24:28,047 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 20:24:28,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 82 transitions. [2020-07-10 20:24:28,200 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:28,201 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2020-07-10 20:24:28,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-10 20:24:28,201 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:28,202 INFO L422 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:24:28,202 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 20:24:28,203 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:28,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:28,203 INFO L82 PathProgramCache]: Analyzing trace with hash 2033926999, now seen corresponding path program 1 times [2020-07-10 20:24:28,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:28,204 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [304258003] [2020-07-10 20:24:28,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:28,409 INFO L280 TraceCheckUtils]: 0: Hoare triple {4417#true} assume true; {4417#true} is VALID [2020-07-10 20:24:28,409 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4417#true} {4417#true} #106#return; {4417#true} is VALID [2020-07-10 20:24:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:28,420 INFO L280 TraceCheckUtils]: 0: Hoare triple {4417#true} ~cond := #in~cond; {4417#true} is VALID [2020-07-10 20:24:28,421 INFO L280 TraceCheckUtils]: 1: Hoare triple {4417#true} assume !(0 == ~cond); {4417#true} is VALID [2020-07-10 20:24:28,421 INFO L280 TraceCheckUtils]: 2: Hoare triple {4417#true} assume true; {4417#true} is VALID [2020-07-10 20:24:28,422 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4417#true} {4421#(<= (* 2 main_~i~0) main_~j~0)} #112#return; {4421#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 20:24:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:28,432 INFO L280 TraceCheckUtils]: 0: Hoare triple {4417#true} ~cond := #in~cond; {4417#true} is VALID [2020-07-10 20:24:28,432 INFO L280 TraceCheckUtils]: 1: Hoare triple {4417#true} assume !(0 == ~cond); {4417#true} is VALID [2020-07-10 20:24:28,433 INFO L280 TraceCheckUtils]: 2: Hoare triple {4417#true} assume true; {4417#true} is VALID [2020-07-10 20:24:28,434 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4417#true} {4421#(<= (* 2 main_~i~0) main_~j~0)} #114#return; {4421#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 20:24:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:28,443 INFO L280 TraceCheckUtils]: 0: Hoare triple {4417#true} ~cond := #in~cond; {4417#true} is VALID [2020-07-10 20:24:28,444 INFO L280 TraceCheckUtils]: 1: Hoare triple {4417#true} assume !(0 == ~cond); {4417#true} is VALID [2020-07-10 20:24:28,444 INFO L280 TraceCheckUtils]: 2: Hoare triple {4417#true} assume true; {4417#true} is VALID [2020-07-10 20:24:28,445 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4417#true} {4432#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} #110#return; {4432#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} is VALID [2020-07-10 20:24:28,445 INFO L263 TraceCheckUtils]: 0: Hoare triple {4417#true} call ULTIMATE.init(); {4417#true} is VALID [2020-07-10 20:24:28,445 INFO L280 TraceCheckUtils]: 1: Hoare triple {4417#true} assume true; {4417#true} is VALID [2020-07-10 20:24:28,446 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4417#true} {4417#true} #106#return; {4417#true} is VALID [2020-07-10 20:24:28,446 INFO L263 TraceCheckUtils]: 3: Hoare triple {4417#true} call #t~ret6 := main(); {4417#true} is VALID [2020-07-10 20:24:28,446 INFO L280 TraceCheckUtils]: 4: Hoare triple {4417#true} havoc ~i~0; {4417#true} is VALID [2020-07-10 20:24:28,449 INFO L280 TraceCheckUtils]: 5: Hoare triple {4417#true} havoc ~j~0; {4417#true} is VALID [2020-07-10 20:24:28,449 INFO L280 TraceCheckUtils]: 6: Hoare triple {4417#true} havoc ~k~0; {4417#true} is VALID [2020-07-10 20:24:28,449 INFO L280 TraceCheckUtils]: 7: Hoare triple {4417#true} havoc ~n~0; {4417#true} is VALID [2020-07-10 20:24:28,449 INFO L280 TraceCheckUtils]: 8: Hoare triple {4417#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4417#true} is VALID [2020-07-10 20:24:28,449 INFO L280 TraceCheckUtils]: 9: Hoare triple {4417#true} ~k~0 := #t~nondet0; {4417#true} is VALID [2020-07-10 20:24:28,450 INFO L280 TraceCheckUtils]: 10: Hoare triple {4417#true} havoc #t~nondet0; {4417#true} is VALID [2020-07-10 20:24:28,450 INFO L280 TraceCheckUtils]: 11: Hoare triple {4417#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4417#true} is VALID [2020-07-10 20:24:28,450 INFO L280 TraceCheckUtils]: 12: Hoare triple {4417#true} ~n~0 := #t~nondet1; {4417#true} is VALID [2020-07-10 20:24:28,450 INFO L280 TraceCheckUtils]: 13: Hoare triple {4417#true} havoc #t~nondet1; {4417#true} is VALID [2020-07-10 20:24:28,451 INFO L280 TraceCheckUtils]: 14: Hoare triple {4417#true} assume !!(~n~0 < 1000000); {4417#true} is VALID [2020-07-10 20:24:28,451 INFO L280 TraceCheckUtils]: 15: Hoare triple {4417#true} assume ~k~0 == ~n~0; {4417#true} is VALID [2020-07-10 20:24:28,451 INFO L280 TraceCheckUtils]: 16: Hoare triple {4417#true} ~i~0 := 0; {4417#true} is VALID [2020-07-10 20:24:28,451 INFO L280 TraceCheckUtils]: 17: Hoare triple {4417#true} assume !!(~i~0 < ~n~0); {4417#true} is VALID [2020-07-10 20:24:28,452 INFO L280 TraceCheckUtils]: 18: Hoare triple {4417#true} ~j~0 := 2 * ~i~0; {4421#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 20:24:28,453 INFO L280 TraceCheckUtils]: 19: Hoare triple {4421#(<= (* 2 main_~i~0) main_~j~0)} assume !!(~j~0 < ~n~0); {4421#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 20:24:28,453 INFO L280 TraceCheckUtils]: 20: Hoare triple {4421#(<= (* 2 main_~i~0) main_~j~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {4421#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 20:24:28,454 INFO L280 TraceCheckUtils]: 21: Hoare triple {4421#(<= (* 2 main_~i~0) main_~j~0)} assume !(0 != #t~nondet4); {4421#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 20:24:28,454 INFO L280 TraceCheckUtils]: 22: Hoare triple {4421#(<= (* 2 main_~i~0) main_~j~0)} havoc #t~nondet4; {4421#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 20:24:28,454 INFO L263 TraceCheckUtils]: 23: Hoare triple {4421#(<= (* 2 main_~i~0) main_~j~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {4417#true} is VALID [2020-07-10 20:24:28,455 INFO L280 TraceCheckUtils]: 24: Hoare triple {4417#true} ~cond := #in~cond; {4417#true} is VALID [2020-07-10 20:24:28,455 INFO L280 TraceCheckUtils]: 25: Hoare triple {4417#true} assume !(0 == ~cond); {4417#true} is VALID [2020-07-10 20:24:28,455 INFO L280 TraceCheckUtils]: 26: Hoare triple {4417#true} assume true; {4417#true} is VALID [2020-07-10 20:24:28,456 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {4417#true} {4421#(<= (* 2 main_~i~0) main_~j~0)} #112#return; {4421#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 20:24:28,456 INFO L263 TraceCheckUtils]: 28: Hoare triple {4421#(<= (* 2 main_~i~0) main_~j~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {4417#true} is VALID [2020-07-10 20:24:28,456 INFO L280 TraceCheckUtils]: 29: Hoare triple {4417#true} ~cond := #in~cond; {4417#true} is VALID [2020-07-10 20:24:28,457 INFO L280 TraceCheckUtils]: 30: Hoare triple {4417#true} assume !(0 == ~cond); {4417#true} is VALID [2020-07-10 20:24:28,457 INFO L280 TraceCheckUtils]: 31: Hoare triple {4417#true} assume true; {4417#true} is VALID [2020-07-10 20:24:28,458 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {4417#true} {4421#(<= (* 2 main_~i~0) main_~j~0)} #114#return; {4421#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 20:24:28,458 INFO L280 TraceCheckUtils]: 33: Hoare triple {4421#(<= (* 2 main_~i~0) main_~j~0)} #t~post3 := ~j~0; {4430#(<= (* 2 main_~i~0) |main_#t~post3|)} is VALID [2020-07-10 20:24:28,459 INFO L280 TraceCheckUtils]: 34: Hoare triple {4430#(<= (* 2 main_~i~0) |main_#t~post3|)} ~j~0 := 1 + #t~post3; {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-10 20:24:28,460 INFO L280 TraceCheckUtils]: 35: Hoare triple {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} havoc #t~post3; {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-10 20:24:28,460 INFO L280 TraceCheckUtils]: 36: Hoare triple {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} assume !!(~j~0 < ~n~0); {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-10 20:24:28,461 INFO L280 TraceCheckUtils]: 37: Hoare triple {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-10 20:24:28,461 INFO L280 TraceCheckUtils]: 38: Hoare triple {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} assume 0 != #t~nondet4; {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-10 20:24:28,462 INFO L280 TraceCheckUtils]: 39: Hoare triple {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} havoc #t~nondet4; {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-10 20:24:28,463 INFO L280 TraceCheckUtils]: 40: Hoare triple {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} ~k~0 := ~j~0; {4432#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} is VALID [2020-07-10 20:24:28,463 INFO L280 TraceCheckUtils]: 41: Hoare triple {4432#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} assume !!(~k~0 < ~n~0); {4432#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} is VALID [2020-07-10 20:24:28,463 INFO L263 TraceCheckUtils]: 42: Hoare triple {4432#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {4417#true} is VALID [2020-07-10 20:24:28,464 INFO L280 TraceCheckUtils]: 43: Hoare triple {4417#true} ~cond := #in~cond; {4417#true} is VALID [2020-07-10 20:24:28,464 INFO L280 TraceCheckUtils]: 44: Hoare triple {4417#true} assume !(0 == ~cond); {4417#true} is VALID [2020-07-10 20:24:28,464 INFO L280 TraceCheckUtils]: 45: Hoare triple {4417#true} assume true; {4417#true} is VALID [2020-07-10 20:24:28,465 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {4417#true} {4432#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} #110#return; {4432#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} is VALID [2020-07-10 20:24:28,465 INFO L280 TraceCheckUtils]: 47: Hoare triple {4432#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} #t~post5 := ~k~0; {4437#(<= (+ (* 2 main_~i~0) 1) |main_#t~post5|)} is VALID [2020-07-10 20:24:28,466 INFO L280 TraceCheckUtils]: 48: Hoare triple {4437#(<= (+ (* 2 main_~i~0) 1) |main_#t~post5|)} ~k~0 := 1 + #t~post5; {4438#(<= (+ (* 2 main_~i~0) 2) main_~k~0)} is VALID [2020-07-10 20:24:28,467 INFO L280 TraceCheckUtils]: 49: Hoare triple {4438#(<= (+ (* 2 main_~i~0) 2) main_~k~0)} havoc #t~post5; {4438#(<= (+ (* 2 main_~i~0) 2) main_~k~0)} is VALID [2020-07-10 20:24:28,467 INFO L280 TraceCheckUtils]: 50: Hoare triple {4438#(<= (+ (* 2 main_~i~0) 2) main_~k~0)} assume !!(~k~0 < ~n~0); {4438#(<= (+ (* 2 main_~i~0) 2) main_~k~0)} is VALID [2020-07-10 20:24:28,468 INFO L263 TraceCheckUtils]: 51: Hoare triple {4438#(<= (+ (* 2 main_~i~0) 2) main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {4439#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:24:28,469 INFO L280 TraceCheckUtils]: 52: Hoare triple {4439#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {4440#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:24:28,470 INFO L280 TraceCheckUtils]: 53: Hoare triple {4440#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4418#false} is VALID [2020-07-10 20:24:28,470 INFO L280 TraceCheckUtils]: 54: Hoare triple {4418#false} assume !false; {4418#false} is VALID [2020-07-10 20:24:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:28,476 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:28,476 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [304258003] [2020-07-10 20:24:28,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:28,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-10 20:24:28,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525092299] [2020-07-10 20:24:28,477 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2020-07-10 20:24:28,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:28,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 20:24:28,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:28,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 20:24:28,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:28,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 20:24:28,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-10 20:24:28,529 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 10 states. [2020-07-10 20:24:29,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:29,681 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2020-07-10 20:24:29,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-10 20:24:29,681 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2020-07-10 20:24:29,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:29,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 20:24:29,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 97 transitions. [2020-07-10 20:24:29,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 20:24:29,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 97 transitions. [2020-07-10 20:24:29,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 97 transitions. [2020-07-10 20:24:29,808 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:29,809 INFO L225 Difference]: With dead ends: 98 [2020-07-10 20:24:29,809 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 20:24:29,811 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2020-07-10 20:24:29,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 20:24:29,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 20:24:29,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:29,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:29,812 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:29,812 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:29,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:29,813 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:24:29,813 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:24:29,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:29,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:29,813 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:29,813 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:29,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:29,814 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:24:29,814 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:24:29,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:29,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:29,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:29,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:29,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 20:24:29,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 20:24:29,815 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2020-07-10 20:24:29,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:29,815 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 20:24:29,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 20:24:29,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 20:24:29,816 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:29,816 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:24:29,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:29,816 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 20:24:29,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 20:24:31,241 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:24:31,241 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:24:31,241 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:24:31,242 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 20:24:31,242 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 20:24:31,242 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:24:31,242 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:24:31,242 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:24:31,242 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-10 20:24:31,242 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-10 20:24:31,242 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:24:31,243 INFO L264 CegarLoopResult]: At program point L31(lines 23 33) the Hoare annotation is: (and (<= (+ main_~j~0 1) main_~n~0) (<= main_~k~0 main_~n~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~n~0 main_~k~0)) [2020-07-10 20:24:31,243 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 37) the Hoare annotation is: true [2020-07-10 20:24:31,243 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2020-07-10 20:24:31,243 INFO L264 CegarLoopResult]: At program point L23-3(line 23) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= (+ main_~j~0 1) main_~n~0) (<= main_~k~0 main_~n~0) (<= .cse0 |main_#t~post3|) (<= .cse0 main_~j~0) (<= main_~n~0 main_~k~0))) [2020-07-10 20:24:31,243 INFO L264 CegarLoopResult]: At program point L23-4(line 23) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= (+ .cse0 1) main_~j~0) (<= main_~k~0 main_~n~0) (<= .cse0 |main_#t~post3|) (<= main_~n~0 main_~k~0))) [2020-07-10 20:24:31,243 INFO L264 CegarLoopResult]: At program point L23-5(lines 23 33) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0) (<= (* 2 main_~i~0) main_~j~0)) [2020-07-10 20:24:31,243 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-10 20:24:31,244 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-10 20:24:31,244 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-10 20:24:31,244 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (and (<= (+ main_~j~0 1) main_~n~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0) (<= (* 2 main_~i~0) main_~j~0)) [2020-07-10 20:24:31,244 INFO L264 CegarLoopResult]: At program point L24-1(lines 24 32) the Hoare annotation is: (and (<= (+ main_~j~0 1) main_~n~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0) (<= (* 2 main_~i~0) main_~j~0)) [2020-07-10 20:24:31,244 INFO L264 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: (and (<= (+ main_~j~0 1) main_~n~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0) (<= (* 2 main_~i~0) main_~j~0)) [2020-07-10 20:24:31,244 INFO L264 CegarLoopResult]: At program point L24-3(line 24) the Hoare annotation is: (and (<= (+ main_~j~0 1) main_~n~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0) (<= (* 2 main_~i~0) main_~j~0)) [2020-07-10 20:24:31,244 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-10 20:24:31,245 INFO L271 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: true [2020-07-10 20:24:31,245 INFO L271 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: true [2020-07-10 20:24:31,245 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (<= (+ main_~j~0 1) main_~n~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0) (<= (* 2 main_~i~0) main_~j~0)) [2020-07-10 20:24:31,245 INFO L264 CegarLoopResult]: At program point L25-3(line 25) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= (+ main_~j~0 1) main_~n~0) (<= (+ main_~k~0 1) main_~n~0) (<= .cse0 main_~k~0) (<= (+ |main_#t~post5| 1) main_~n~0) (<= .cse0 |main_#t~post5|) (<= .cse0 main_~j~0))) [2020-07-10 20:24:31,245 INFO L264 CegarLoopResult]: At program point L25-4(line 25) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= (+ .cse0 1) main_~k~0) (<= (+ main_~j~0 1) main_~n~0) (<= (+ |main_#t~post5| 1) main_~n~0) (<= main_~k~0 main_~n~0) (<= .cse0 |main_#t~post5|) (<= .cse0 main_~j~0))) [2020-07-10 20:24:31,245 INFO L264 CegarLoopResult]: At program point L25-5(lines 25 27) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= (+ main_~j~0 1) main_~n~0) (<= .cse0 main_~k~0) (<= main_~k~0 main_~n~0) (<= .cse0 main_~j~0))) [2020-07-10 20:24:31,245 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-07-10 20:24:31,246 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-07-10 20:24:31,246 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 37) the Hoare annotation is: true [2020-07-10 20:24:31,246 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (and (<= (+ main_~j~0 1) main_~n~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0) (<= (* 2 main_~i~0) main_~j~0)) [2020-07-10 20:24:31,246 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 37) the Hoare annotation is: true [2020-07-10 20:24:31,246 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (and (<= (+ main_~j~0 1) main_~n~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0) (<= (* 2 main_~i~0) main_~j~0)) [2020-07-10 20:24:31,246 INFO L264 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= (+ main_~j~0 1) main_~n~0) (<= (+ main_~k~0 1) main_~n~0) (<= .cse0 main_~k~0) (<= .cse0 main_~j~0))) [2020-07-10 20:24:31,247 INFO L264 CegarLoopResult]: At program point L26-1(lines 25 27) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= (+ main_~j~0 1) main_~n~0) (<= (+ main_~k~0 1) main_~n~0) (<= .cse0 main_~k~0) (<= .cse0 main_~j~0))) [2020-07-10 20:24:31,247 INFO L264 CegarLoopResult]: At program point L22-2(lines 22 34) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0) (<= (* 2 main_~i~0) main_~j~0)) [2020-07-10 20:24:31,247 INFO L264 CegarLoopResult]: At program point L22-3(line 22) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0) (<= (* 2 main_~i~0) main_~j~0)) [2020-07-10 20:24:31,247 INFO L271 CegarLoopResult]: At program point L18(lines 18 21) the Hoare annotation is: true [2020-07-10 20:24:31,247 INFO L264 CegarLoopResult]: At program point L22-4(line 22) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2020-07-10 20:24:31,247 INFO L264 CegarLoopResult]: At program point L18-1(lines 18 21) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2020-07-10 20:24:31,247 INFO L264 CegarLoopResult]: At program point L22-5(lines 22 34) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2020-07-10 20:24:31,248 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-10 20:24:31,248 INFO L271 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-07-10 20:24:31,248 INFO L271 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-07-10 20:24:31,248 INFO L271 CegarLoopResult]: At program point L35(lines 13 37) the Hoare annotation is: true [2020-07-10 20:24:31,248 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-10 20:24:31,248 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:24:31,248 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:24:31,249 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:24:31,249 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:24:31,249 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:24:31,253 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 20:24:31,256 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 20:24:31,257 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 20:24:31,263 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-10 20:24:31,263 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-10 20:24:31,284 INFO L163 areAnnotationChecker]: CFG has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 20:24:31,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 08:24:31 BoogieIcfgContainer [2020-07-10 20:24:31,298 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 20:24:31,301 INFO L168 Benchmark]: Toolchain (without parser) took 13383.23 ms. Allocated memory was 138.9 MB in the beginning and 359.7 MB in the end (delta: 220.7 MB). Free memory was 103.3 MB in the beginning and 215.6 MB in the end (delta: -112.3 MB). Peak memory consumption was 108.4 MB. Max. memory is 7.1 GB. [2020-07-10 20:24:31,302 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 138.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 20:24:31,303 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.99 ms. Allocated memory is still 138.9 MB. Free memory was 102.8 MB in the beginning and 93.0 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:24:31,304 INFO L168 Benchmark]: Boogie Preprocessor took 115.70 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 93.0 MB in the beginning and 183.5 MB in the end (delta: -90.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:24:31,304 INFO L168 Benchmark]: RCFGBuilder took 488.92 ms. Allocated memory is still 203.4 MB. Free memory was 183.5 MB in the beginning and 158.0 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:24:31,305 INFO L168 Benchmark]: TraceAbstraction took 12497.27 ms. Allocated memory was 203.4 MB in the beginning and 359.7 MB in the end (delta: 156.2 MB). Free memory was 157.3 MB in the beginning and 215.6 MB in the end (delta: -58.3 MB). Peak memory consumption was 98.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:24:31,308 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.27 ms. Allocated memory is still 138.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 275.99 ms. Allocated memory is still 138.9 MB. Free memory was 102.8 MB in the beginning and 93.0 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.70 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 93.0 MB in the beginning and 183.5 MB in the end (delta: -90.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 488.92 ms. Allocated memory is still 203.4 MB. Free memory was 183.5 MB in the beginning and 158.0 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12497.27 ms. Allocated memory was 203.4 MB in the beginning and 359.7 MB in the end (delta: 156.2 MB). Free memory was 157.3 MB in the beginning and 215.6 MB in the end (delta: -58.3 MB). Peak memory consumption was 98.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: 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 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: k <= n && n <= k - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (k <= n && n <= k) && 2 * i <= j - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((j + 1 <= n && 2 * i <= k) && k <= n) && 2 * i <= j - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 10.9s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 437 SDtfs, 342 SDslu, 1605 SDs, 0 SdLazy, 854 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 203 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 50 LocationsWithAnnotation, 152 PreInvPairs, 237 NumberOfFragments, 417 HoareAnnotationTreeSize, 152 FomulaSimplifications, 48886 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 50 FomulaSimplificationsInter, 2689 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...