java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/nested6_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:10:20,988 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:10:20,991 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:10:21,010 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:10:21,010 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:10:21,012 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:10:21,014 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:10:21,016 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:10:21,020 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:10:21,027 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:10:21,028 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:10:21,028 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:10:21,031 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:10:21,034 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:10:21,036 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:10:21,036 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:10:21,037 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:10:21,041 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:10:21,044 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:10:21,047 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:10:21,048 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:10:21,049 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:10:21,052 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:10:21,052 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:10:21,052 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:10:21,053 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:10:21,054 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:10:21,054 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:10:21,055 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:10:21,056 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:10:21,056 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:10:21,057 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:10:21,057 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:10:21,057 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:10:21,058 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:10:21,059 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:10:21,059 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:10:21,074 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:10:21,074 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:10:21,075 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:10:21,075 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:10:21,075 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:10:21,076 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:10:21,076 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:10:21,076 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:10:21,076 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:10:21,076 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:10:21,077 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:10:21,077 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:10:21,077 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:10:21,077 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:10:21,077 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:10:21,077 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:10:21,078 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:10:21,078 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:10:21,078 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:10:21,078 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:10:21,078 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:10:21,079 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:10:21,079 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:10:21,079 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:10:21,079 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:10:21,079 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:10:21,080 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:10:21,080 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:10:21,080 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:10:21,080 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:10:21,080 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:10:21,126 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:10:21,140 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:10:21,145 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:10:21,146 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:10:21,147 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:10:21,147 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested6_true-unreach-call_true-termination.i [2018-11-23 13:10:21,222 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb4e04e0c/38f89e9753624e0a9db13886bebccdc9/FLAGb7eae587e [2018-11-23 13:10:21,667 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:10:21,668 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6_true-unreach-call_true-termination.i [2018-11-23 13:10:21,674 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb4e04e0c/38f89e9753624e0a9db13886bebccdc9/FLAGb7eae587e [2018-11-23 13:10:22,043 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb4e04e0c/38f89e9753624e0a9db13886bebccdc9 [2018-11-23 13:10:22,051 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:10:22,053 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:10:22,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:10:22,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:10:22,058 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:10:22,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:10:22" (1/1) ... [2018-11-23 13:10:22,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@99eefed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:22, skipping insertion in model container [2018-11-23 13:10:22,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:10:22" (1/1) ... [2018-11-23 13:10:22,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:10:22,101 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:10:22,360 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:10:22,366 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:10:22,395 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:10:22,414 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:10:22,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:22 WrapperNode [2018-11-23 13:10:22,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:10:22,416 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:10:22,416 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:10:22,416 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:10:22,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:22" (1/1) ... [2018-11-23 13:10:22,435 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:22" (1/1) ... [2018-11-23 13:10:22,444 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:10:22,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:10:22,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:10:22,445 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:10:22,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:22" (1/1) ... [2018-11-23 13:10:22,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:22" (1/1) ... [2018-11-23 13:10:22,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:22" (1/1) ... [2018-11-23 13:10:22,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:22" (1/1) ... [2018-11-23 13:10:22,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:22" (1/1) ... [2018-11-23 13:10:22,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:22" (1/1) ... [2018-11-23 13:10:22,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:22" (1/1) ... [2018-11-23 13:10:22,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:10:22,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:10:22,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:10:22,484 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:10:22,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:22" (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 [2018-11-23 13:10:22,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:10:22,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:10:22,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:10:22,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:10:22,634 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:10:22,634 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:10:22,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:10:22,634 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:10:23,200 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:10:23,200 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 13:10:23,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:10:23 BoogieIcfgContainer [2018-11-23 13:10:23,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:10:23,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:10:23,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:10:23,205 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:10:23,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:10:22" (1/3) ... [2018-11-23 13:10:23,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21427ab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:10:23, skipping insertion in model container [2018-11-23 13:10:23,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:22" (2/3) ... [2018-11-23 13:10:23,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21427ab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:10:23, skipping insertion in model container [2018-11-23 13:10:23,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:10:23" (3/3) ... [2018-11-23 13:10:23,209 INFO L112 eAbstractionObserver]: Analyzing ICFG nested6_true-unreach-call_true-termination.i [2018-11-23 13:10:23,219 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:10:23,228 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:10:23,248 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:10:23,282 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:10:23,283 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:10:23,283 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:10:23,284 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:10:23,285 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:10:23,285 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:10:23,285 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:10:23,285 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:10:23,286 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:10:23,306 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 13:10:23,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:10:23,314 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:23,315 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:23,318 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:23,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:23,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1213508388, now seen corresponding path program 1 times [2018-11-23 13:10:23,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:23,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:23,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:23,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:23,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:23,763 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-23 13:10:23,768 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-23 13:10:23,769 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #76#return; {32#true} is VALID [2018-11-23 13:10:23,769 INFO L256 TraceCheckUtils]: 3: Hoare triple {32#true} call #t~ret7 := main(); {32#true} is VALID [2018-11-23 13:10:23,770 INFO L273 TraceCheckUtils]: 4: Hoare triple {32#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {32#true} is VALID [2018-11-23 13:10:23,770 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} assume !!(~n~0 < 1000000); {32#true} is VALID [2018-11-23 13:10:23,782 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume ~k~0 == ~n~0; {34#(<= main_~n~0 main_~k~0)} is VALID [2018-11-23 13:10:23,785 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#(<= main_~n~0 main_~k~0)} ~i~0 := 0; {34#(<= main_~n~0 main_~k~0)} is VALID [2018-11-23 13:10:23,786 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#(<= main_~n~0 main_~k~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {34#(<= main_~n~0 main_~k~0)} is VALID [2018-11-23 13:10:23,787 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#(<= main_~n~0 main_~k~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {34#(<= main_~n~0 main_~k~0)} is VALID [2018-11-23 13:10:23,787 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#(<= main_~n~0 main_~k~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {34#(<= main_~n~0 main_~k~0)} is VALID [2018-11-23 13:10:23,790 INFO L256 TraceCheckUtils]: 11: Hoare triple {34#(<= main_~n~0 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {35#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:10:23,792 INFO L273 TraceCheckUtils]: 12: Hoare triple {35#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {36#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:10:23,794 INFO L273 TraceCheckUtils]: 13: Hoare triple {36#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {33#false} is VALID [2018-11-23 13:10:23,794 INFO L273 TraceCheckUtils]: 14: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-23 13:10:23,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:23,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:10:23,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:10:23,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 13:10:23,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:23,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:10:23,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:23,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:10:23,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:10:23,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:10:23,924 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 5 states. [2018-11-23 13:10:24,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:24,421 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-11-23 13:10:24,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:10:24,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 13:10:24,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:24,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:10:24,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2018-11-23 13:10:24,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:10:24,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2018-11-23 13:10:24,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 80 transitions. [2018-11-23 13:10:25,046 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:25,059 INFO L225 Difference]: With dead ends: 57 [2018-11-23 13:10:25,059 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:10:25,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:10:25,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:10:25,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 13:10:25,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:25,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 13:10:25,130 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 13:10:25,131 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 13:10:25,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:25,136 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 13:10:25,136 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 13:10:25,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:25,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:25,137 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 13:10:25,138 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 13:10:25,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:25,142 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 13:10:25,142 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 13:10:25,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:25,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:25,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:25,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:10:25,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-23 13:10:25,149 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2018-11-23 13:10:25,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:25,150 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-23 13:10:25,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:10:25,150 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 13:10:25,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:10:25,151 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:25,151 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:25,152 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:25,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:25,152 INFO L82 PathProgramCache]: Analyzing trace with hash 542305890, now seen corresponding path program 1 times [2018-11-23 13:10:25,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:25,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:25,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:25,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:25,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:25,298 INFO L256 TraceCheckUtils]: 0: Hoare triple {216#true} call ULTIMATE.init(); {216#true} is VALID [2018-11-23 13:10:25,299 INFO L273 TraceCheckUtils]: 1: Hoare triple {216#true} assume true; {216#true} is VALID [2018-11-23 13:10:25,299 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {216#true} {216#true} #76#return; {216#true} is VALID [2018-11-23 13:10:25,299 INFO L256 TraceCheckUtils]: 3: Hoare triple {216#true} call #t~ret7 := main(); {216#true} is VALID [2018-11-23 13:10:25,300 INFO L273 TraceCheckUtils]: 4: Hoare triple {216#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {216#true} is VALID [2018-11-23 13:10:25,300 INFO L273 TraceCheckUtils]: 5: Hoare triple {216#true} assume !!(~n~0 < 1000000); {216#true} is VALID [2018-11-23 13:10:25,300 INFO L273 TraceCheckUtils]: 6: Hoare triple {216#true} assume ~k~0 == ~n~0; {216#true} is VALID [2018-11-23 13:10:25,300 INFO L273 TraceCheckUtils]: 7: Hoare triple {216#true} ~i~0 := 0; {216#true} is VALID [2018-11-23 13:10:25,301 INFO L273 TraceCheckUtils]: 8: Hoare triple {216#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {218#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2018-11-23 13:10:25,302 INFO L273 TraceCheckUtils]: 9: Hoare triple {218#(<= (* 2 main_~i~0) main_~j~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {218#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2018-11-23 13:10:25,306 INFO L273 TraceCheckUtils]: 10: Hoare triple {218#(<= (* 2 main_~i~0) main_~j~0)} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {219#(<= (* 2 main_~i~0) main_~k~0)} is VALID [2018-11-23 13:10:25,306 INFO L273 TraceCheckUtils]: 11: Hoare triple {219#(<= (* 2 main_~i~0) main_~k~0)} assume !!(~k~0 < ~n~0); {219#(<= (* 2 main_~i~0) main_~k~0)} is VALID [2018-11-23 13:10:25,310 INFO L256 TraceCheckUtils]: 12: Hoare triple {219#(<= (* 2 main_~i~0) main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {220#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:10:25,311 INFO L273 TraceCheckUtils]: 13: Hoare triple {220#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {221#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:10:25,312 INFO L273 TraceCheckUtils]: 14: Hoare triple {221#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {217#false} is VALID [2018-11-23 13:10:25,312 INFO L273 TraceCheckUtils]: 15: Hoare triple {217#false} assume !false; {217#false} is VALID [2018-11-23 13:10:25,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:25,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:10:25,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:10:25,317 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 13:10:25,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:25,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:10:25,345 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:25,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:10:25,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:10:25,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:10:25,346 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2018-11-23 13:10:26,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:26,022 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-11-23 13:10:26,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:10:26,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 13:10:26,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:26,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:10:26,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2018-11-23 13:10:26,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:10:26,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2018-11-23 13:10:26,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2018-11-23 13:10:26,170 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:26,174 INFO L225 Difference]: With dead ends: 40 [2018-11-23 13:10:26,174 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 13:10:26,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:10:26,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 13:10:26,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2018-11-23 13:10:26,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:26,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 32 states. [2018-11-23 13:10:26,241 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 32 states. [2018-11-23 13:10:26,241 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 32 states. [2018-11-23 13:10:26,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:26,247 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-11-23 13:10:26,247 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-23 13:10:26,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:26,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:26,248 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 38 states. [2018-11-23 13:10:26,249 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 38 states. [2018-11-23 13:10:26,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:26,253 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-11-23 13:10:26,253 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-23 13:10:26,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:26,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:26,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:26,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:26,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:10:26,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-23 13:10:26,257 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 16 [2018-11-23 13:10:26,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:26,258 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-23 13:10:26,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:10:26,258 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-23 13:10:26,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:10:26,259 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:26,259 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:26,259 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:26,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:26,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1063580357, now seen corresponding path program 1 times [2018-11-23 13:10:26,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:26,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:26,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:26,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:26,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:26,400 INFO L256 TraceCheckUtils]: 0: Hoare triple {405#true} call ULTIMATE.init(); {405#true} is VALID [2018-11-23 13:10:26,400 INFO L273 TraceCheckUtils]: 1: Hoare triple {405#true} assume true; {405#true} is VALID [2018-11-23 13:10:26,401 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {405#true} {405#true} #76#return; {405#true} is VALID [2018-11-23 13:10:26,401 INFO L256 TraceCheckUtils]: 3: Hoare triple {405#true} call #t~ret7 := main(); {405#true} is VALID [2018-11-23 13:10:26,402 INFO L273 TraceCheckUtils]: 4: Hoare triple {405#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {405#true} is VALID [2018-11-23 13:10:26,402 INFO L273 TraceCheckUtils]: 5: Hoare triple {405#true} assume !!(~n~0 < 1000000); {405#true} is VALID [2018-11-23 13:10:26,421 INFO L273 TraceCheckUtils]: 6: Hoare triple {405#true} assume ~k~0 == ~n~0; {407#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} is VALID [2018-11-23 13:10:26,436 INFO L273 TraceCheckUtils]: 7: Hoare triple {407#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} ~i~0 := 0; {407#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} is VALID [2018-11-23 13:10:26,439 INFO L273 TraceCheckUtils]: 8: Hoare triple {407#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {407#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} is VALID [2018-11-23 13:10:26,440 INFO L273 TraceCheckUtils]: 9: Hoare triple {407#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {407#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} is VALID [2018-11-23 13:10:26,441 INFO L273 TraceCheckUtils]: 10: Hoare triple {407#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} assume !(0 != #t~nondet5);havoc #t~nondet5; {407#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} is VALID [2018-11-23 13:10:26,441 INFO L256 TraceCheckUtils]: 11: Hoare triple {407#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {405#true} is VALID [2018-11-23 13:10:26,445 INFO L273 TraceCheckUtils]: 12: Hoare triple {405#true} ~cond := #in~cond; {408#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:10:26,445 INFO L273 TraceCheckUtils]: 13: Hoare triple {408#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {409#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:10:26,446 INFO L273 TraceCheckUtils]: 14: Hoare triple {409#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {409#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:10:26,448 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {409#(not (= |__VERIFIER_assert_#in~cond| 0))} {407#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} #82#return; {410#(<= main_~k~0 main_~n~0)} is VALID [2018-11-23 13:10:26,451 INFO L256 TraceCheckUtils]: 16: Hoare triple {410#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {409#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:10:26,453 INFO L273 TraceCheckUtils]: 17: Hoare triple {409#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {411#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:10:26,454 INFO L273 TraceCheckUtils]: 18: Hoare triple {411#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {406#false} is VALID [2018-11-23 13:10:26,454 INFO L273 TraceCheckUtils]: 19: Hoare triple {406#false} assume !false; {406#false} is VALID [2018-11-23 13:10:26,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:26,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:26,457 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:10:26,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:26,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:26,918 INFO L256 TraceCheckUtils]: 0: Hoare triple {405#true} call ULTIMATE.init(); {405#true} is VALID [2018-11-23 13:10:26,919 INFO L273 TraceCheckUtils]: 1: Hoare triple {405#true} assume true; {405#true} is VALID [2018-11-23 13:10:26,919 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {405#true} {405#true} #76#return; {405#true} is VALID [2018-11-23 13:10:26,920 INFO L256 TraceCheckUtils]: 3: Hoare triple {405#true} call #t~ret7 := main(); {405#true} is VALID [2018-11-23 13:10:26,920 INFO L273 TraceCheckUtils]: 4: Hoare triple {405#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {405#true} is VALID [2018-11-23 13:10:26,920 INFO L273 TraceCheckUtils]: 5: Hoare triple {405#true} assume !!(~n~0 < 1000000); {405#true} is VALID [2018-11-23 13:10:26,921 INFO L273 TraceCheckUtils]: 6: Hoare triple {405#true} assume ~k~0 == ~n~0; {410#(<= main_~k~0 main_~n~0)} is VALID [2018-11-23 13:10:26,922 INFO L273 TraceCheckUtils]: 7: Hoare triple {410#(<= main_~k~0 main_~n~0)} ~i~0 := 0; {410#(<= main_~k~0 main_~n~0)} is VALID [2018-11-23 13:10:26,922 INFO L273 TraceCheckUtils]: 8: Hoare triple {410#(<= main_~k~0 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {410#(<= main_~k~0 main_~n~0)} is VALID [2018-11-23 13:10:26,923 INFO L273 TraceCheckUtils]: 9: Hoare triple {410#(<= main_~k~0 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {410#(<= main_~k~0 main_~n~0)} is VALID [2018-11-23 13:10:26,923 INFO L273 TraceCheckUtils]: 10: Hoare triple {410#(<= main_~k~0 main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {410#(<= main_~k~0 main_~n~0)} is VALID [2018-11-23 13:10:26,923 INFO L256 TraceCheckUtils]: 11: Hoare triple {410#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {405#true} is VALID [2018-11-23 13:10:26,924 INFO L273 TraceCheckUtils]: 12: Hoare triple {405#true} ~cond := #in~cond; {405#true} is VALID [2018-11-23 13:10:26,924 INFO L273 TraceCheckUtils]: 13: Hoare triple {405#true} assume !(0 == ~cond); {405#true} is VALID [2018-11-23 13:10:26,924 INFO L273 TraceCheckUtils]: 14: Hoare triple {405#true} assume true; {405#true} is VALID [2018-11-23 13:10:26,934 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {405#true} {410#(<= main_~k~0 main_~n~0)} #82#return; {410#(<= main_~k~0 main_~n~0)} is VALID [2018-11-23 13:10:26,943 INFO L256 TraceCheckUtils]: 16: Hoare triple {410#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {463#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:10:26,944 INFO L273 TraceCheckUtils]: 17: Hoare triple {463#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {467#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:10:26,944 INFO L273 TraceCheckUtils]: 18: Hoare triple {467#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {406#false} is VALID [2018-11-23 13:10:26,945 INFO L273 TraceCheckUtils]: 19: Hoare triple {406#false} assume !false; {406#false} is VALID [2018-11-23 13:10:26,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:26,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:10:26,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2018-11-23 13:10:26,966 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-11-23 13:10:26,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:26,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:10:27,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:27,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:10:27,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:10:27,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:10:27,093 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 9 states. [2018-11-23 13:10:27,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:27,940 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-23 13:10:27,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:10:27,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-11-23 13:10:27,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:27,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:10:27,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2018-11-23 13:10:27,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:10:27,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2018-11-23 13:10:27,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 54 transitions. [2018-11-23 13:10:28,037 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:28,040 INFO L225 Difference]: With dead ends: 55 [2018-11-23 13:10:28,040 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 13:10:28,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:10:28,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 13:10:28,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-23 13:10:28,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:28,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2018-11-23 13:10:28,160 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-23 13:10:28,160 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-23 13:10:28,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:28,165 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-11-23 13:10:28,165 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-11-23 13:10:28,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:28,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:28,166 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-23 13:10:28,166 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-23 13:10:28,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:28,170 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-11-23 13:10:28,171 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-11-23 13:10:28,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:28,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:28,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:28,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:28,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 13:10:28,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-11-23 13:10:28,176 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 20 [2018-11-23 13:10:28,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:28,176 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-11-23 13:10:28,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:10:28,177 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-11-23 13:10:28,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:10:28,178 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:28,178 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:28,178 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:28,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:28,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1462671860, now seen corresponding path program 1 times [2018-11-23 13:10:28,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:28,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:28,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:28,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:28,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:28,406 INFO L256 TraceCheckUtils]: 0: Hoare triple {735#true} call ULTIMATE.init(); {735#true} is VALID [2018-11-23 13:10:28,406 INFO L273 TraceCheckUtils]: 1: Hoare triple {735#true} assume true; {735#true} is VALID [2018-11-23 13:10:28,407 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {735#true} {735#true} #76#return; {735#true} is VALID [2018-11-23 13:10:28,407 INFO L256 TraceCheckUtils]: 3: Hoare triple {735#true} call #t~ret7 := main(); {735#true} is VALID [2018-11-23 13:10:28,407 INFO L273 TraceCheckUtils]: 4: Hoare triple {735#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {735#true} is VALID [2018-11-23 13:10:28,407 INFO L273 TraceCheckUtils]: 5: Hoare triple {735#true} assume !!(~n~0 < 1000000); {735#true} is VALID [2018-11-23 13:10:28,408 INFO L273 TraceCheckUtils]: 6: Hoare triple {735#true} assume ~k~0 == ~n~0; {735#true} is VALID [2018-11-23 13:10:28,408 INFO L273 TraceCheckUtils]: 7: Hoare triple {735#true} ~i~0 := 0; {737#(<= main_~i~0 0)} is VALID [2018-11-23 13:10:28,411 INFO L273 TraceCheckUtils]: 8: Hoare triple {737#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {738#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-23 13:10:28,412 INFO L273 TraceCheckUtils]: 9: Hoare triple {738#(<= (+ main_~j~0 1) main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {738#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-23 13:10:28,419 INFO L273 TraceCheckUtils]: 10: Hoare triple {738#(<= (+ main_~j~0 1) main_~n~0)} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {739#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2018-11-23 13:10:28,421 INFO L273 TraceCheckUtils]: 11: Hoare triple {739#(<= (+ main_~k~0 1) main_~n~0)} assume !(~k~0 < ~n~0); {736#false} is VALID [2018-11-23 13:10:28,421 INFO L273 TraceCheckUtils]: 12: Hoare triple {736#false} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {736#false} is VALID [2018-11-23 13:10:28,421 INFO L273 TraceCheckUtils]: 13: Hoare triple {736#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {736#false} is VALID [2018-11-23 13:10:28,422 INFO L273 TraceCheckUtils]: 14: Hoare triple {736#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {736#false} is VALID [2018-11-23 13:10:28,422 INFO L256 TraceCheckUtils]: 15: Hoare triple {736#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {735#true} is VALID [2018-11-23 13:10:28,423 INFO L273 TraceCheckUtils]: 16: Hoare triple {735#true} ~cond := #in~cond; {740#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:10:28,424 INFO L273 TraceCheckUtils]: 17: Hoare triple {740#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {741#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:10:28,425 INFO L273 TraceCheckUtils]: 18: Hoare triple {741#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {741#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:10:28,425 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {741#(not (= |__VERIFIER_assert_#in~cond| 0))} {736#false} #82#return; {739#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2018-11-23 13:10:28,426 INFO L256 TraceCheckUtils]: 20: Hoare triple {739#(<= (+ main_~k~0 1) main_~n~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {741#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:10:28,429 INFO L273 TraceCheckUtils]: 21: Hoare triple {741#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {742#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:10:28,429 INFO L273 TraceCheckUtils]: 22: Hoare triple {742#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {736#false} is VALID [2018-11-23 13:10:28,429 INFO L273 TraceCheckUtils]: 23: Hoare triple {736#false} assume !false; {736#false} is VALID [2018-11-23 13:10:28,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:28,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:28,431 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:10:28,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:28,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:28,616 INFO L256 TraceCheckUtils]: 0: Hoare triple {735#true} call ULTIMATE.init(); {735#true} is VALID [2018-11-23 13:10:28,617 INFO L273 TraceCheckUtils]: 1: Hoare triple {735#true} assume true; {735#true} is VALID [2018-11-23 13:10:28,617 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {735#true} {735#true} #76#return; {735#true} is VALID [2018-11-23 13:10:28,618 INFO L256 TraceCheckUtils]: 3: Hoare triple {735#true} call #t~ret7 := main(); {735#true} is VALID [2018-11-23 13:10:28,618 INFO L273 TraceCheckUtils]: 4: Hoare triple {735#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {735#true} is VALID [2018-11-23 13:10:28,618 INFO L273 TraceCheckUtils]: 5: Hoare triple {735#true} assume !!(~n~0 < 1000000); {735#true} is VALID [2018-11-23 13:10:28,619 INFO L273 TraceCheckUtils]: 6: Hoare triple {735#true} assume ~k~0 == ~n~0; {735#true} is VALID [2018-11-23 13:10:28,620 INFO L273 TraceCheckUtils]: 7: Hoare triple {735#true} ~i~0 := 0; {737#(<= main_~i~0 0)} is VALID [2018-11-23 13:10:28,621 INFO L273 TraceCheckUtils]: 8: Hoare triple {737#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {770#(exists ((main_~i~0 Int)) (and (< main_~i~0 main_~n~0) (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 0)))} is VALID [2018-11-23 13:10:28,621 INFO L273 TraceCheckUtils]: 9: Hoare triple {770#(exists ((main_~i~0 Int)) (and (< main_~i~0 main_~n~0) (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 0)))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {770#(exists ((main_~i~0 Int)) (and (< main_~i~0 main_~n~0) (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 0)))} is VALID [2018-11-23 13:10:28,627 INFO L273 TraceCheckUtils]: 10: Hoare triple {770#(exists ((main_~i~0 Int)) (and (< main_~i~0 main_~n~0) (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 0)))} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {777#(exists ((main_~i~0 Int)) (and (< main_~i~0 main_~n~0) (<= main_~k~0 (* 2 main_~i~0)) (<= main_~i~0 0)))} is VALID [2018-11-23 13:10:28,628 INFO L273 TraceCheckUtils]: 11: Hoare triple {777#(exists ((main_~i~0 Int)) (and (< main_~i~0 main_~n~0) (<= main_~k~0 (* 2 main_~i~0)) (<= main_~i~0 0)))} assume !(~k~0 < ~n~0); {736#false} is VALID [2018-11-23 13:10:28,628 INFO L273 TraceCheckUtils]: 12: Hoare triple {736#false} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {736#false} is VALID [2018-11-23 13:10:28,628 INFO L273 TraceCheckUtils]: 13: Hoare triple {736#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {736#false} is VALID [2018-11-23 13:10:28,628 INFO L273 TraceCheckUtils]: 14: Hoare triple {736#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {736#false} is VALID [2018-11-23 13:10:28,629 INFO L256 TraceCheckUtils]: 15: Hoare triple {736#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {736#false} is VALID [2018-11-23 13:10:28,629 INFO L273 TraceCheckUtils]: 16: Hoare triple {736#false} ~cond := #in~cond; {736#false} is VALID [2018-11-23 13:10:28,629 INFO L273 TraceCheckUtils]: 17: Hoare triple {736#false} assume !(0 == ~cond); {736#false} is VALID [2018-11-23 13:10:28,629 INFO L273 TraceCheckUtils]: 18: Hoare triple {736#false} assume true; {736#false} is VALID [2018-11-23 13:10:28,630 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {736#false} {736#false} #82#return; {736#false} is VALID [2018-11-23 13:10:28,630 INFO L256 TraceCheckUtils]: 20: Hoare triple {736#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {736#false} is VALID [2018-11-23 13:10:28,630 INFO L273 TraceCheckUtils]: 21: Hoare triple {736#false} ~cond := #in~cond; {736#false} is VALID [2018-11-23 13:10:28,630 INFO L273 TraceCheckUtils]: 22: Hoare triple {736#false} assume 0 == ~cond; {736#false} is VALID [2018-11-23 13:10:28,631 INFO L273 TraceCheckUtils]: 23: Hoare triple {736#false} assume !false; {736#false} is VALID [2018-11-23 13:10:28,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:10:28,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:10:28,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2018-11-23 13:10:28,657 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-23 13:10:28,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:28,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:10:28,716 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:28,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:10:28,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:10:28,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:10:28,717 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 10 states. [2018-11-23 13:10:30,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:30,164 INFO L93 Difference]: Finished difference Result 133 states and 172 transitions. [2018-11-23 13:10:30,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:10:30,164 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-23 13:10:30,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:30,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:10:30,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 89 transitions. [2018-11-23 13:10:30,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:10:30,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 89 transitions. [2018-11-23 13:10:30,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 89 transitions. [2018-11-23 13:10:30,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:30,409 INFO L225 Difference]: With dead ends: 133 [2018-11-23 13:10:30,410 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 13:10:30,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:10:30,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 13:10:30,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 56. [2018-11-23 13:10:30,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:30,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 56 states. [2018-11-23 13:10:30,518 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 56 states. [2018-11-23 13:10:30,518 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 56 states. [2018-11-23 13:10:30,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:30,525 INFO L93 Difference]: Finished difference Result 88 states and 115 transitions. [2018-11-23 13:10:30,525 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 115 transitions. [2018-11-23 13:10:30,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:30,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:30,528 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 88 states. [2018-11-23 13:10:30,528 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 88 states. [2018-11-23 13:10:30,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:30,534 INFO L93 Difference]: Finished difference Result 88 states and 115 transitions. [2018-11-23 13:10:30,535 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 115 transitions. [2018-11-23 13:10:30,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:30,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:30,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:30,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:30,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 13:10:30,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-11-23 13:10:30,540 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 24 [2018-11-23 13:10:30,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:30,541 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-11-23 13:10:30,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:10:30,541 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-11-23 13:10:30,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 13:10:30,542 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:30,543 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-11-23 13:10:30,543 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:30,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:30,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1830678608, now seen corresponding path program 1 times [2018-11-23 13:10:30,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:30,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:30,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:30,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:30,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:30,707 INFO L256 TraceCheckUtils]: 0: Hoare triple {1280#true} call ULTIMATE.init(); {1280#true} is VALID [2018-11-23 13:10:30,707 INFO L273 TraceCheckUtils]: 1: Hoare triple {1280#true} assume true; {1280#true} is VALID [2018-11-23 13:10:30,708 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1280#true} {1280#true} #76#return; {1280#true} is VALID [2018-11-23 13:10:30,708 INFO L256 TraceCheckUtils]: 3: Hoare triple {1280#true} call #t~ret7 := main(); {1280#true} is VALID [2018-11-23 13:10:30,709 INFO L273 TraceCheckUtils]: 4: Hoare triple {1280#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {1280#true} is VALID [2018-11-23 13:10:30,709 INFO L273 TraceCheckUtils]: 5: Hoare triple {1280#true} assume !!(~n~0 < 1000000); {1280#true} is VALID [2018-11-23 13:10:30,710 INFO L273 TraceCheckUtils]: 6: Hoare triple {1280#true} assume ~k~0 == ~n~0; {1280#true} is VALID [2018-11-23 13:10:30,710 INFO L273 TraceCheckUtils]: 7: Hoare triple {1280#true} ~i~0 := 0; {1280#true} is VALID [2018-11-23 13:10:30,710 INFO L273 TraceCheckUtils]: 8: Hoare triple {1280#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1280#true} is VALID [2018-11-23 13:10:30,711 INFO L273 TraceCheckUtils]: 9: Hoare triple {1280#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1280#true} is VALID [2018-11-23 13:10:30,711 INFO L273 TraceCheckUtils]: 10: Hoare triple {1280#true} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {1280#true} is VALID [2018-11-23 13:10:30,725 INFO L273 TraceCheckUtils]: 11: Hoare triple {1280#true} assume !!(~k~0 < ~n~0); {1282#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2018-11-23 13:10:30,726 INFO L256 TraceCheckUtils]: 12: Hoare triple {1282#(<= (+ main_~k~0 1) main_~n~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {1280#true} is VALID [2018-11-23 13:10:30,727 INFO L273 TraceCheckUtils]: 13: Hoare triple {1280#true} ~cond := #in~cond; {1283#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:10:30,727 INFO L273 TraceCheckUtils]: 14: Hoare triple {1283#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {1284#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:10:30,729 INFO L273 TraceCheckUtils]: 15: Hoare triple {1284#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1284#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:10:30,730 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1284#(not (= |__VERIFIER_assert_#in~cond| 0))} {1282#(<= (+ main_~k~0 1) main_~n~0)} #80#return; {1282#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2018-11-23 13:10:30,732 INFO L273 TraceCheckUtils]: 17: Hoare triple {1282#(<= (+ main_~k~0 1) main_~n~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1285#(<= main_~k~0 main_~n~0)} is VALID [2018-11-23 13:10:30,733 INFO L273 TraceCheckUtils]: 18: Hoare triple {1285#(<= main_~k~0 main_~n~0)} assume !(~k~0 < ~n~0); {1285#(<= main_~k~0 main_~n~0)} is VALID [2018-11-23 13:10:30,734 INFO L273 TraceCheckUtils]: 19: Hoare triple {1285#(<= main_~k~0 main_~n~0)} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1285#(<= main_~k~0 main_~n~0)} is VALID [2018-11-23 13:10:30,734 INFO L273 TraceCheckUtils]: 20: Hoare triple {1285#(<= main_~k~0 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1285#(<= main_~k~0 main_~n~0)} is VALID [2018-11-23 13:10:30,735 INFO L273 TraceCheckUtils]: 21: Hoare triple {1285#(<= main_~k~0 main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {1285#(<= main_~k~0 main_~n~0)} is VALID [2018-11-23 13:10:30,736 INFO L256 TraceCheckUtils]: 22: Hoare triple {1285#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {1280#true} is VALID [2018-11-23 13:10:30,736 INFO L273 TraceCheckUtils]: 23: Hoare triple {1280#true} ~cond := #in~cond; {1280#true} is VALID [2018-11-23 13:10:30,736 INFO L273 TraceCheckUtils]: 24: Hoare triple {1280#true} assume !(0 == ~cond); {1280#true} is VALID [2018-11-23 13:10:30,737 INFO L273 TraceCheckUtils]: 25: Hoare triple {1280#true} assume true; {1280#true} is VALID [2018-11-23 13:10:30,738 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1280#true} {1285#(<= main_~k~0 main_~n~0)} #82#return; {1285#(<= main_~k~0 main_~n~0)} is VALID [2018-11-23 13:10:30,739 INFO L256 TraceCheckUtils]: 27: Hoare triple {1285#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {1284#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:10:30,739 INFO L273 TraceCheckUtils]: 28: Hoare triple {1284#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1286#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:10:30,740 INFO L273 TraceCheckUtils]: 29: Hoare triple {1286#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1281#false} is VALID [2018-11-23 13:10:30,740 INFO L273 TraceCheckUtils]: 30: Hoare triple {1281#false} assume !false; {1281#false} is VALID [2018-11-23 13:10:30,743 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:10:30,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:30,743 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:10:30,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:30,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:30,955 INFO L256 TraceCheckUtils]: 0: Hoare triple {1280#true} call ULTIMATE.init(); {1280#true} is VALID [2018-11-23 13:10:30,955 INFO L273 TraceCheckUtils]: 1: Hoare triple {1280#true} assume true; {1280#true} is VALID [2018-11-23 13:10:30,956 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1280#true} {1280#true} #76#return; {1280#true} is VALID [2018-11-23 13:10:30,956 INFO L256 TraceCheckUtils]: 3: Hoare triple {1280#true} call #t~ret7 := main(); {1280#true} is VALID [2018-11-23 13:10:30,956 INFO L273 TraceCheckUtils]: 4: Hoare triple {1280#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {1280#true} is VALID [2018-11-23 13:10:30,957 INFO L273 TraceCheckUtils]: 5: Hoare triple {1280#true} assume !!(~n~0 < 1000000); {1280#true} is VALID [2018-11-23 13:10:30,957 INFO L273 TraceCheckUtils]: 6: Hoare triple {1280#true} assume ~k~0 == ~n~0; {1280#true} is VALID [2018-11-23 13:10:30,957 INFO L273 TraceCheckUtils]: 7: Hoare triple {1280#true} ~i~0 := 0; {1280#true} is VALID [2018-11-23 13:10:30,958 INFO L273 TraceCheckUtils]: 8: Hoare triple {1280#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1280#true} is VALID [2018-11-23 13:10:30,958 INFO L273 TraceCheckUtils]: 9: Hoare triple {1280#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1280#true} is VALID [2018-11-23 13:10:30,958 INFO L273 TraceCheckUtils]: 10: Hoare triple {1280#true} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {1320#(<= main_~k~0 main_~j~0)} is VALID [2018-11-23 13:10:30,959 INFO L273 TraceCheckUtils]: 11: Hoare triple {1320#(<= main_~k~0 main_~j~0)} assume !!(~k~0 < ~n~0); {1320#(<= main_~k~0 main_~j~0)} is VALID [2018-11-23 13:10:30,959 INFO L256 TraceCheckUtils]: 12: Hoare triple {1320#(<= main_~k~0 main_~j~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {1280#true} is VALID [2018-11-23 13:10:30,959 INFO L273 TraceCheckUtils]: 13: Hoare triple {1280#true} ~cond := #in~cond; {1280#true} is VALID [2018-11-23 13:10:30,959 INFO L273 TraceCheckUtils]: 14: Hoare triple {1280#true} assume !(0 == ~cond); {1280#true} is VALID [2018-11-23 13:10:30,960 INFO L273 TraceCheckUtils]: 15: Hoare triple {1280#true} assume true; {1280#true} is VALID [2018-11-23 13:10:30,961 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1280#true} {1320#(<= main_~k~0 main_~j~0)} #80#return; {1320#(<= main_~k~0 main_~j~0)} is VALID [2018-11-23 13:10:30,963 INFO L273 TraceCheckUtils]: 17: Hoare triple {1320#(<= main_~k~0 main_~j~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1342#(<= main_~k~0 (+ main_~j~0 1))} is VALID [2018-11-23 13:10:30,970 INFO L273 TraceCheckUtils]: 18: Hoare triple {1342#(<= main_~k~0 (+ main_~j~0 1))} assume !(~k~0 < ~n~0); {1346#(<= main_~n~0 (+ main_~j~0 1))} is VALID [2018-11-23 13:10:30,971 INFO L273 TraceCheckUtils]: 19: Hoare triple {1346#(<= main_~n~0 (+ main_~j~0 1))} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1350#(<= main_~n~0 main_~j~0)} is VALID [2018-11-23 13:10:30,977 INFO L273 TraceCheckUtils]: 20: Hoare triple {1350#(<= main_~n~0 main_~j~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1281#false} is VALID [2018-11-23 13:10:30,977 INFO L273 TraceCheckUtils]: 21: Hoare triple {1281#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {1281#false} is VALID [2018-11-23 13:10:30,977 INFO L256 TraceCheckUtils]: 22: Hoare triple {1281#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {1281#false} is VALID [2018-11-23 13:10:30,978 INFO L273 TraceCheckUtils]: 23: Hoare triple {1281#false} ~cond := #in~cond; {1281#false} is VALID [2018-11-23 13:10:30,978 INFO L273 TraceCheckUtils]: 24: Hoare triple {1281#false} assume !(0 == ~cond); {1281#false} is VALID [2018-11-23 13:10:30,978 INFO L273 TraceCheckUtils]: 25: Hoare triple {1281#false} assume true; {1281#false} is VALID [2018-11-23 13:10:30,978 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1281#false} {1281#false} #82#return; {1281#false} is VALID [2018-11-23 13:10:30,979 INFO L256 TraceCheckUtils]: 27: Hoare triple {1281#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {1281#false} is VALID [2018-11-23 13:10:30,979 INFO L273 TraceCheckUtils]: 28: Hoare triple {1281#false} ~cond := #in~cond; {1281#false} is VALID [2018-11-23 13:10:30,979 INFO L273 TraceCheckUtils]: 29: Hoare triple {1281#false} assume 0 == ~cond; {1281#false} is VALID [2018-11-23 13:10:30,980 INFO L273 TraceCheckUtils]: 30: Hoare triple {1281#false} assume !false; {1281#false} is VALID [2018-11-23 13:10:30,981 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:10:31,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:10:31,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-11-23 13:10:31,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-11-23 13:10:31,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:31,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:10:31,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:31,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:10:31,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:10:31,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:10:31,057 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 11 states. [2018-11-23 13:10:32,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:32,200 INFO L93 Difference]: Finished difference Result 107 states and 128 transitions. [2018-11-23 13:10:32,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:10:32,200 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-11-23 13:10:32,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:32,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:10:32,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2018-11-23 13:10:32,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:10:32,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2018-11-23 13:10:32,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 64 transitions. [2018-11-23 13:10:32,425 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:32,426 INFO L225 Difference]: With dead ends: 107 [2018-11-23 13:10:32,426 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:10:32,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:10:32,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:10:32,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:10:32,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:32,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:10:32,429 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:10:32,429 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:10:32,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:32,429 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:10:32,429 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:10:32,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:32,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:32,429 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:10:32,429 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:10:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:32,430 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:10:32,430 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:10:32,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:32,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:32,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:32,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:32,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:10:32,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:10:32,431 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-11-23 13:10:32,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:32,431 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:10:32,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:10:32,432 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:10:32,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:32,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:10:32,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 13:10:32,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 13:10:32,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 13:10:32,862 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:10:32,862 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:10:32,862 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:10:32,862 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:10:32,863 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:10:32,863 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:10:32,863 INFO L444 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (and (<= (* 2 main_~i~0) main_~j~0) (<= (+ main_~j~0 1) main_~n~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2018-11-23 13:10:32,863 INFO L444 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (and (<= (* 2 main_~i~0) main_~j~0) (<= (+ main_~j~0 1) main_~n~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2018-11-23 13:10:32,863 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 34) no Hoare annotation was computed. [2018-11-23 13:10:32,863 INFO L444 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= .cse0 main_~j~0) (<= (+ main_~j~0 1) main_~n~0) (<= .cse0 main_~k~0) (<= (+ main_~k~0 1) main_~n~0))) [2018-11-23 13:10:32,863 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 22 24) no Hoare annotation was computed. [2018-11-23 13:10:32,863 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 31) no Hoare annotation was computed. [2018-11-23 13:10:32,864 INFO L444 ceAbstractionStarter]: At program point L19-3(lines 19 31) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 main_~n~0)) (.cse1 (<= main_~n~0 main_~k~0))) (or (and .cse0 (<= main_~i~0 0) .cse1) (and .cse0 .cse1 (<= main_~n~0 main_~j~0)))) [2018-11-23 13:10:32,864 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 18) no Hoare annotation was computed. [2018-11-23 13:10:32,864 INFO L448 ceAbstractionStarter]: For program point L15-1(lines 15 18) no Hoare annotation was computed. [2018-11-23 13:10:32,864 INFO L451 ceAbstractionStarter]: At program point L32(lines 10 34) the Hoare annotation is: true [2018-11-23 13:10:32,864 INFO L448 ceAbstractionStarter]: For program point L28(lines 20 30) no Hoare annotation was computed. [2018-11-23 13:10:32,864 INFO L444 ceAbstractionStarter]: At program point L20-2(lines 20 30) the Hoare annotation is: (and (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2018-11-23 13:10:32,864 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 29) no Hoare annotation was computed. [2018-11-23 13:10:32,864 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 34) no Hoare annotation was computed. [2018-11-23 13:10:32,865 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 34) the Hoare annotation is: true [2018-11-23 13:10:32,865 INFO L444 ceAbstractionStarter]: At program point L22-2(lines 22 24) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= .cse0 main_~j~0) (<= (+ main_~j~0 1) main_~n~0) (<= .cse0 main_~k~0) (<= main_~k~0 main_~n~0))) [2018-11-23 13:10:32,865 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-23 13:10:32,865 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 13:10:32,865 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 13:10:32,865 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:10:32,865 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 13:10:32,865 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 13:10:32,865 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:10:32,867 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:10:32,867 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:10:32,867 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:10:32,867 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:10:32,867 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:10:32,867 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:10:32,867 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:10:32,867 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:10:32,868 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:10:32,868 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:10:32,868 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:10:32,868 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 13:10:32,868 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 13:10:32,868 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:10:32,868 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:10:32,868 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:10:32,868 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:10:32,868 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2018-11-23 13:10:32,868 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:10:32,869 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:10:32,869 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:10:32,869 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:10:32,886 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2018-11-23 13:10:32,886 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2018-11-23 13:10:32,886 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2018-11-23 13:10:32,886 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2018-11-23 13:10:32,886 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2018-11-23 13:10:32,887 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 13:10:32,887 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2018-11-23 13:10:32,887 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2018-11-23 13:10:32,901 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2018-11-23 13:10:32,901 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 13:10:32,901 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 13:10:32,901 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2018-11-23 13:10:32,901 INFO L163 areAnnotationChecker]: CFG has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:10:32,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:10:32 BoogieIcfgContainer [2018-11-23 13:10:32,913 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:10:32,914 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:10:32,914 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:10:32,914 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:10:32,915 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:10:23" (3/4) ... [2018-11-23 13:10:32,919 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:10:32,926 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:10:32,926 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:10:32,926 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:10:32,932 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-11-23 13:10:32,932 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-23 13:10:32,932 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:10:32,932 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:10:32,988 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-invgen/nested6_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 13:10:32,988 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:10:32,990 INFO L168 Benchmark]: Toolchain (without parser) took 10937.83 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 852.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -767.9 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:10:32,991 INFO L168 Benchmark]: CDTParser took 2.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:10:32,992 INFO L168 Benchmark]: CACSL2BoogieTranslator took 362.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:10:32,992 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.40 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:10:32,993 INFO L168 Benchmark]: Boogie Preprocessor took 38.41 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:10:32,993 INFO L168 Benchmark]: RCFGBuilder took 717.88 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 705.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -743.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2018-11-23 13:10:32,994 INFO L168 Benchmark]: TraceAbstraction took 9711.59 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 147.3 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -37.3 MB). Peak memory consumption was 110.0 MB. Max. memory is 7.1 GB. [2018-11-23 13:10:32,995 INFO L168 Benchmark]: Witness Printer took 74.38 ms. Allocated memory is still 2.4 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:10:32,998 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 362.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 28.40 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.41 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 717.88 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 705.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -743.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9711.59 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 147.3 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -37.3 MB). Peak memory consumption was 110.0 MB. Max. memory is 7.1 GB. * Witness Printer took 74.38 ms. Allocated memory is still 2.4 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 20]: Loop Invariant Derived loop invariant: (2 * i <= j && k <= n) && n <= k - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((2 * i <= j && j + 1 <= n) && 2 * i <= k) && k <= n - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((k <= n && i <= 0) && n <= k) || ((k <= n && n <= k) && n <= j) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 29 locations, 1 error locations. SAFE Result, 9.5s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 5.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 110 SDtfs, 100 SDslu, 427 SDs, 0 SdLazy, 490 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 5 MinimizatonAttempts, 38 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 34 PreInvPairs, 54 NumberOfFragments, 117 HoareAnnotationTreeSize, 34 FomulaSimplifications, 899 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 413 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 173 ConstructedInterpolants, 3 QuantifiedInterpolants, 8785 SizeOfPredicates, 9 NumberOfNonLiveVariables, 177 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 27/34 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...