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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/heapsort_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-19 00:04:37,663 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-19 00:04:37,666 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-19 00:04:37,678 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-19 00:04:37,679 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-19 00:04:37,680 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-19 00:04:37,681 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-19 00:04:37,683 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-19 00:04:37,685 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-19 00:04:37,685 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-19 00:04:37,686 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-19 00:04:37,687 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-19 00:04:37,687 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-19 00:04:37,688 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-19 00:04:37,690 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-19 00:04:37,690 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-19 00:04:37,692 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-19 00:04:37,698 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-19 00:04:37,700 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-19 00:04:37,704 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-19 00:04:37,708 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-19 00:04:37,710 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-19 00:04:37,715 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-19 00:04:37,718 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-19 00:04:37,718 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-19 00:04:37,719 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-19 00:04:37,720 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-19 00:04:37,721 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-19 00:04:37,722 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-19 00:04:37,723 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-19 00:04:37,723 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-19 00:04:37,728 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-19 00:04:37,728 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-19 00:04:37,728 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-19 00:04:37,729 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-19 00:04:37,730 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-19 00:04:37,730 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-19 00:04:37,760 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-19 00:04:37,761 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-19 00:04:37,762 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-19 00:04:37,764 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-19 00:04:37,765 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-19 00:04:37,765 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-19 00:04:37,766 INFO L133 SettingsManager]: * Use SBE=true [2018-11-19 00:04:37,767 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-19 00:04:37,767 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-19 00:04:37,767 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-19 00:04:37,767 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-19 00:04:37,768 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-19 00:04:37,768 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-19 00:04:37,768 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-19 00:04:37,768 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-19 00:04:37,768 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-19 00:04:37,769 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-19 00:04:37,769 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-19 00:04:37,769 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-19 00:04:37,770 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-19 00:04:37,770 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-19 00:04:37,770 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-19 00:04:37,770 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-19 00:04:37,770 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-19 00:04:37,771 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-19 00:04:37,771 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-19 00:04:37,771 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-19 00:04:37,772 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-19 00:04:37,772 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-19 00:04:37,772 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-19 00:04:37,772 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-19 00:04:37,840 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-19 00:04:37,856 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-19 00:04:37,861 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-19 00:04:37,863 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-19 00:04:37,863 INFO L276 PluginConnector]: CDTParser initialized [2018-11-19 00:04:37,864 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-11-19 00:04:37,930 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa96efd3/45cacded02974ad296f6ef054b387317/FLAGe90111a65 [2018-11-19 00:04:38,337 INFO L307 CDTParser]: Found 1 translation units. [2018-11-19 00:04:38,338 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-11-19 00:04:38,345 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa96efd3/45cacded02974ad296f6ef054b387317/FLAGe90111a65 [2018-11-19 00:04:38,710 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa96efd3/45cacded02974ad296f6ef054b387317 [2018-11-19 00:04:38,720 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-19 00:04:38,722 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-19 00:04:38,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-19 00:04:38,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-19 00:04:38,727 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-19 00:04:38,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:04:38" (1/1) ... [2018-11-19 00:04:38,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad56655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:38, skipping insertion in model container [2018-11-19 00:04:38,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:04:38" (1/1) ... [2018-11-19 00:04:38,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-19 00:04:38,772 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-19 00:04:39,031 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-19 00:04:39,036 INFO L191 MainTranslator]: Completed pre-run [2018-11-19 00:04:39,065 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-19 00:04:39,080 INFO L195 MainTranslator]: Completed translation [2018-11-19 00:04:39,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:39 WrapperNode [2018-11-19 00:04:39,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-19 00:04:39,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-19 00:04:39,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-19 00:04:39,082 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-19 00:04:39,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:39" (1/1) ... [2018-11-19 00:04:39,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:39" (1/1) ... [2018-11-19 00:04:39,102 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:39" (1/1) ... [2018-11-19 00:04:39,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:39" (1/1) ... [2018-11-19 00:04:39,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:39" (1/1) ... [2018-11-19 00:04:39,117 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:39" (1/1) ... [2018-11-19 00:04:39,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:39" (1/1) ... [2018-11-19 00:04:39,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-19 00:04:39,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-19 00:04:39,122 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-19 00:04:39,122 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-19 00:04:39,123 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:39" (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-19 00:04:39,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-19 00:04:39,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-19 00:04:39,252 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-19 00:04:39,252 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-19 00:04:39,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-19 00:04:39,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-19 00:04:39,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-19 00:04:39,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-19 00:04:39,253 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-19 00:04:39,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-19 00:04:39,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-19 00:04:40,055 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-19 00:04:40,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:04:40 BoogieIcfgContainer [2018-11-19 00:04:40,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-19 00:04:40,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-19 00:04:40,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-19 00:04:40,061 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-19 00:04:40,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:04:38" (1/3) ... [2018-11-19 00:04:40,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc639c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:04:40, skipping insertion in model container [2018-11-19 00:04:40,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:04:39" (2/3) ... [2018-11-19 00:04:40,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc639c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:04:40, skipping insertion in model container [2018-11-19 00:04:40,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:04:40" (3/3) ... [2018-11-19 00:04:40,065 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort_true-unreach-call_true-termination.i [2018-11-19 00:04:40,075 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-19 00:04:40,084 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-19 00:04:40,101 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-19 00:04:40,132 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-19 00:04:40,132 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-19 00:04:40,133 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-19 00:04:40,133 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-19 00:04:40,133 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-19 00:04:40,133 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-19 00:04:40,134 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-19 00:04:40,134 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-19 00:04:40,134 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-19 00:04:40,155 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-11-19 00:04:40,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-19 00:04:40,162 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:04:40,163 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:04:40,166 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:04:40,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:04:40,172 INFO L82 PathProgramCache]: Analyzing trace with hash 64061581, now seen corresponding path program 1 times [2018-11-19 00:04:40,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:04:40,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:04:40,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:04:40,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:04:40,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:04:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:04:40,351 INFO L256 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {48#true} is VALID [2018-11-19 00:04:40,354 INFO L273 TraceCheckUtils]: 1: Hoare triple {48#true} assume true; {48#true} is VALID [2018-11-19 00:04:40,355 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {48#true} {48#true} #96#return; {48#true} is VALID [2018-11-19 00:04:40,355 INFO L256 TraceCheckUtils]: 3: Hoare triple {48#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {48#true} is VALID [2018-11-19 00:04:40,356 INFO L273 TraceCheckUtils]: 4: Hoare triple {48#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {48#true} is VALID [2018-11-19 00:04:40,356 INFO L273 TraceCheckUtils]: 5: Hoare triple {48#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {48#true} is VALID [2018-11-19 00:04:40,356 INFO L273 TraceCheckUtils]: 6: Hoare triple {48#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {48#true} is VALID [2018-11-19 00:04:40,357 INFO L273 TraceCheckUtils]: 7: Hoare triple {48#true} assume true; {48#true} is VALID [2018-11-19 00:04:40,357 INFO L273 TraceCheckUtils]: 8: Hoare triple {48#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {48#true} is VALID [2018-11-19 00:04:40,358 INFO L273 TraceCheckUtils]: 9: Hoare triple {48#true} assume !true; {49#false} is VALID [2018-11-19 00:04:40,358 INFO L273 TraceCheckUtils]: 10: Hoare triple {49#false} assume ~l~0 > 1; {49#false} is VALID [2018-11-19 00:04:40,358 INFO L256 TraceCheckUtils]: 11: Hoare triple {49#false} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {49#false} is VALID [2018-11-19 00:04:40,359 INFO L273 TraceCheckUtils]: 12: Hoare triple {49#false} ~cond := #in~cond; {49#false} is VALID [2018-11-19 00:04:40,359 INFO L273 TraceCheckUtils]: 13: Hoare triple {49#false} assume 0 == ~cond; {49#false} is VALID [2018-11-19 00:04:40,359 INFO L273 TraceCheckUtils]: 14: Hoare triple {49#false} assume !false; {49#false} is VALID [2018-11-19 00:04:40,362 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-19 00:04:40,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:04:40,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-19 00:04:40,369 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-19 00:04:40,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:04:40,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-19 00:04:40,522 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-19 00:04:40,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-19 00:04:40,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-19 00:04:40,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-19 00:04:40,537 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-11-19 00:04:40,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:04:40,964 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-11-19 00:04:40,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-19 00:04:40,965 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-19 00:04:40,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:04:40,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-19 00:04:40,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 141 transitions. [2018-11-19 00:04:40,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-19 00:04:40,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 141 transitions. [2018-11-19 00:04:40,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 141 transitions. [2018-11-19 00:04:41,611 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:04:41,628 INFO L225 Difference]: With dead ends: 83 [2018-11-19 00:04:41,628 INFO L226 Difference]: Without dead ends: 40 [2018-11-19 00:04:41,633 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-19 00:04:41,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-19 00:04:41,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-19 00:04:41,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:04:41,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-19 00:04:41,921 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-19 00:04:41,922 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-19 00:04:41,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:04:41,930 INFO L93 Difference]: Finished difference Result 40 states and 59 transitions. [2018-11-19 00:04:41,930 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2018-11-19 00:04:41,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:04:41,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:04:41,932 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-19 00:04:41,933 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-19 00:04:41,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:04:41,945 INFO L93 Difference]: Finished difference Result 40 states and 59 transitions. [2018-11-19 00:04:41,945 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2018-11-19 00:04:41,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:04:41,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:04:41,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:04:41,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:04:41,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-19 00:04:41,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2018-11-19 00:04:41,963 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 15 [2018-11-19 00:04:41,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:04:41,966 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2018-11-19 00:04:41,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-19 00:04:41,967 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2018-11-19 00:04:41,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-19 00:04:41,968 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:04:41,968 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:04:41,968 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:04:41,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:04:41,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1525893932, now seen corresponding path program 1 times [2018-11-19 00:04:41,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:04:41,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:04:41,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:04:41,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:04:41,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:04:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:04:42,241 INFO L256 TraceCheckUtils]: 0: Hoare triple {311#true} call ULTIMATE.init(); {311#true} is VALID [2018-11-19 00:04:42,242 INFO L273 TraceCheckUtils]: 1: Hoare triple {311#true} assume true; {311#true} is VALID [2018-11-19 00:04:42,242 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {311#true} {311#true} #96#return; {311#true} is VALID [2018-11-19 00:04:42,242 INFO L256 TraceCheckUtils]: 3: Hoare triple {311#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {311#true} is VALID [2018-11-19 00:04:42,243 INFO L273 TraceCheckUtils]: 4: Hoare triple {311#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {311#true} is VALID [2018-11-19 00:04:42,243 INFO L273 TraceCheckUtils]: 5: Hoare triple {311#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {311#true} is VALID [2018-11-19 00:04:42,243 INFO L273 TraceCheckUtils]: 6: Hoare triple {311#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {311#true} is VALID [2018-11-19 00:04:42,244 INFO L273 TraceCheckUtils]: 7: Hoare triple {311#true} assume true; {311#true} is VALID [2018-11-19 00:04:42,253 INFO L273 TraceCheckUtils]: 8: Hoare triple {311#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {313#(<= 2 main_~r~0)} is VALID [2018-11-19 00:04:42,266 INFO L273 TraceCheckUtils]: 9: Hoare triple {313#(<= 2 main_~r~0)} assume true; {313#(<= 2 main_~r~0)} is VALID [2018-11-19 00:04:42,276 INFO L273 TraceCheckUtils]: 10: Hoare triple {313#(<= 2 main_~r~0)} assume !!(~j~0 <= ~r~0); {313#(<= 2 main_~r~0)} is VALID [2018-11-19 00:04:42,289 INFO L273 TraceCheckUtils]: 11: Hoare triple {313#(<= 2 main_~r~0)} assume !(~j~0 < ~r~0); {314#(<= 2 main_~j~0)} is VALID [2018-11-19 00:04:42,302 INFO L256 TraceCheckUtils]: 12: Hoare triple {314#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {315#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-19 00:04:42,308 INFO L273 TraceCheckUtils]: 13: Hoare triple {315#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {316#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-19 00:04:42,310 INFO L273 TraceCheckUtils]: 14: Hoare triple {316#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {312#false} is VALID [2018-11-19 00:04:42,310 INFO L273 TraceCheckUtils]: 15: Hoare triple {312#false} assume !false; {312#false} is VALID [2018-11-19 00:04:42,312 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-19 00:04:42,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:04:42,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-19 00:04:42,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-19 00:04:42,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:04:42,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-19 00:04:42,341 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-19 00:04:42,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-19 00:04:42,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-19 00:04:42,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-19 00:04:42,342 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 6 states. [2018-11-19 00:04:43,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:04:43,621 INFO L93 Difference]: Finished difference Result 77 states and 114 transitions. [2018-11-19 00:04:43,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-19 00:04:43,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-19 00:04:43,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:04:43,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 00:04:43,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2018-11-19 00:04:43,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 00:04:43,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2018-11-19 00:04:43,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 114 transitions. [2018-11-19 00:04:43,816 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:04:43,822 INFO L225 Difference]: With dead ends: 77 [2018-11-19 00:04:43,822 INFO L226 Difference]: Without dead ends: 75 [2018-11-19 00:04:43,824 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-19 00:04:43,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-19 00:04:43,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 62. [2018-11-19 00:04:43,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:04:43,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 62 states. [2018-11-19 00:04:43,923 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 62 states. [2018-11-19 00:04:43,923 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 62 states. [2018-11-19 00:04:43,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:04:43,933 INFO L93 Difference]: Finished difference Result 75 states and 112 transitions. [2018-11-19 00:04:43,933 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 112 transitions. [2018-11-19 00:04:43,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:04:43,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:04:43,936 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 75 states. [2018-11-19 00:04:43,937 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 75 states. [2018-11-19 00:04:43,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:04:43,944 INFO L93 Difference]: Finished difference Result 75 states and 112 transitions. [2018-11-19 00:04:43,945 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 112 transitions. [2018-11-19 00:04:43,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:04:43,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:04:43,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:04:43,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:04:43,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-19 00:04:43,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 94 transitions. [2018-11-19 00:04:43,954 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 94 transitions. Word has length 16 [2018-11-19 00:04:43,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:04:43,954 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 94 transitions. [2018-11-19 00:04:43,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-19 00:04:43,955 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 94 transitions. [2018-11-19 00:04:43,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-19 00:04:43,956 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:04:43,956 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:04:43,956 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:04:43,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:04:43,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1513649831, now seen corresponding path program 1 times [2018-11-19 00:04:43,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:04:43,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:04:43,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:04:43,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:04:43,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:04:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:04:44,137 INFO L256 TraceCheckUtils]: 0: Hoare triple {681#true} call ULTIMATE.init(); {681#true} is VALID [2018-11-19 00:04:44,138 INFO L273 TraceCheckUtils]: 1: Hoare triple {681#true} assume true; {681#true} is VALID [2018-11-19 00:04:44,138 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {681#true} {681#true} #96#return; {681#true} is VALID [2018-11-19 00:04:44,138 INFO L256 TraceCheckUtils]: 3: Hoare triple {681#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {681#true} is VALID [2018-11-19 00:04:44,139 INFO L273 TraceCheckUtils]: 4: Hoare triple {681#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {681#true} is VALID [2018-11-19 00:04:44,139 INFO L273 TraceCheckUtils]: 5: Hoare triple {681#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {681#true} is VALID [2018-11-19 00:04:44,141 INFO L273 TraceCheckUtils]: 6: Hoare triple {681#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {683#(<= 1 main_~l~0)} is VALID [2018-11-19 00:04:44,146 INFO L273 TraceCheckUtils]: 7: Hoare triple {683#(<= 1 main_~l~0)} assume true; {683#(<= 1 main_~l~0)} is VALID [2018-11-19 00:04:44,147 INFO L273 TraceCheckUtils]: 8: Hoare triple {683#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {684#(<= 2 main_~j~0)} is VALID [2018-11-19 00:04:44,147 INFO L273 TraceCheckUtils]: 9: Hoare triple {684#(<= 2 main_~j~0)} assume true; {684#(<= 2 main_~j~0)} is VALID [2018-11-19 00:04:44,148 INFO L273 TraceCheckUtils]: 10: Hoare triple {684#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {684#(<= 2 main_~j~0)} is VALID [2018-11-19 00:04:44,148 INFO L273 TraceCheckUtils]: 11: Hoare triple {684#(<= 2 main_~j~0)} assume ~j~0 < ~r~0; {684#(<= 2 main_~j~0)} is VALID [2018-11-19 00:04:44,149 INFO L256 TraceCheckUtils]: 12: Hoare triple {684#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {685#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-19 00:04:44,150 INFO L273 TraceCheckUtils]: 13: Hoare triple {685#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {686#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-19 00:04:44,151 INFO L273 TraceCheckUtils]: 14: Hoare triple {686#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {682#false} is VALID [2018-11-19 00:04:44,151 INFO L273 TraceCheckUtils]: 15: Hoare triple {682#false} assume !false; {682#false} is VALID [2018-11-19 00:04:44,153 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-19 00:04:44,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:04:44,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-19 00:04:44,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-19 00:04:44,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:04:44,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-19 00:04:44,181 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-19 00:04:44,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-19 00:04:44,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-19 00:04:44,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-19 00:04:44,183 INFO L87 Difference]: Start difference. First operand 62 states and 94 transitions. Second operand 6 states. [2018-11-19 00:04:45,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:04:45,240 INFO L93 Difference]: Finished difference Result 121 states and 184 transitions. [2018-11-19 00:04:45,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-19 00:04:45,240 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-19 00:04:45,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:04:45,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 00:04:45,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2018-11-19 00:04:45,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 00:04:45,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2018-11-19 00:04:45,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 114 transitions. [2018-11-19 00:04:45,425 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:04:45,435 INFO L225 Difference]: With dead ends: 121 [2018-11-19 00:04:45,435 INFO L226 Difference]: Without dead ends: 119 [2018-11-19 00:04:45,436 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-19 00:04:45,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-19 00:04:45,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2018-11-19 00:04:45,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:04:45,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 112 states. [2018-11-19 00:04:45,638 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 112 states. [2018-11-19 00:04:45,638 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 112 states. [2018-11-19 00:04:45,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:04:45,649 INFO L93 Difference]: Finished difference Result 119 states and 182 transitions. [2018-11-19 00:04:45,650 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 182 transitions. [2018-11-19 00:04:45,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:04:45,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:04:45,652 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 119 states. [2018-11-19 00:04:45,652 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 119 states. [2018-11-19 00:04:45,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:04:45,663 INFO L93 Difference]: Finished difference Result 119 states and 182 transitions. [2018-11-19 00:04:45,663 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 182 transitions. [2018-11-19 00:04:45,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:04:45,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:04:45,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:04:45,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:04:45,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-19 00:04:45,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 173 transitions. [2018-11-19 00:04:45,675 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 173 transitions. Word has length 16 [2018-11-19 00:04:45,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:04:45,675 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 173 transitions. [2018-11-19 00:04:45,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-19 00:04:45,675 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 173 transitions. [2018-11-19 00:04:45,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-19 00:04:45,676 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:04:45,677 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:04:45,677 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:04:45,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:04:45,677 INFO L82 PathProgramCache]: Analyzing trace with hash -492506935, now seen corresponding path program 1 times [2018-11-19 00:04:45,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:04:45,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:04:45,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:04:45,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:04:45,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:04:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:04:45,861 INFO L256 TraceCheckUtils]: 0: Hoare triple {1282#true} call ULTIMATE.init(); {1282#true} is VALID [2018-11-19 00:04:45,861 INFO L273 TraceCheckUtils]: 1: Hoare triple {1282#true} assume true; {1282#true} is VALID [2018-11-19 00:04:45,862 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1282#true} {1282#true} #96#return; {1282#true} is VALID [2018-11-19 00:04:45,862 INFO L256 TraceCheckUtils]: 3: Hoare triple {1282#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {1282#true} is VALID [2018-11-19 00:04:45,862 INFO L273 TraceCheckUtils]: 4: Hoare triple {1282#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1282#true} is VALID [2018-11-19 00:04:45,865 INFO L273 TraceCheckUtils]: 5: Hoare triple {1282#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {1284#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:04:45,866 INFO L273 TraceCheckUtils]: 6: Hoare triple {1284#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {1284#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:04:45,868 INFO L273 TraceCheckUtils]: 7: Hoare triple {1284#(<= main_~r~0 main_~n~0)} assume true; {1284#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:04:45,868 INFO L273 TraceCheckUtils]: 8: Hoare triple {1284#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {1284#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:04:45,870 INFO L273 TraceCheckUtils]: 9: Hoare triple {1284#(<= main_~r~0 main_~n~0)} assume true; {1284#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:04:45,872 INFO L273 TraceCheckUtils]: 10: Hoare triple {1284#(<= main_~r~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {1285#(<= main_~j~0 main_~n~0)} is VALID [2018-11-19 00:04:45,872 INFO L273 TraceCheckUtils]: 11: Hoare triple {1285#(<= main_~j~0 main_~n~0)} assume !(~j~0 < ~r~0); {1285#(<= main_~j~0 main_~n~0)} is VALID [2018-11-19 00:04:45,872 INFO L256 TraceCheckUtils]: 12: Hoare triple {1285#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {1282#true} is VALID [2018-11-19 00:04:45,874 INFO L273 TraceCheckUtils]: 13: Hoare triple {1282#true} ~cond := #in~cond; {1286#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-19 00:04:45,875 INFO L273 TraceCheckUtils]: 14: Hoare triple {1286#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {1287#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:04:45,880 INFO L273 TraceCheckUtils]: 15: Hoare triple {1287#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1287#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:04:45,881 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1287#(not (= |__VERIFIER_assert_#in~cond| 0))} {1285#(<= main_~j~0 main_~n~0)} #108#return; {1285#(<= main_~j~0 main_~n~0)} is VALID [2018-11-19 00:04:45,882 INFO L256 TraceCheckUtils]: 17: Hoare triple {1285#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {1287#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:04:45,886 INFO L273 TraceCheckUtils]: 18: Hoare triple {1287#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1288#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-19 00:04:45,886 INFO L273 TraceCheckUtils]: 19: Hoare triple {1288#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1283#false} is VALID [2018-11-19 00:04:45,887 INFO L273 TraceCheckUtils]: 20: Hoare triple {1283#false} assume !false; {1283#false} is VALID [2018-11-19 00:04:45,888 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-19 00:04:45,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:04:45,889 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-19 00:04:45,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:04:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:04:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:04:45,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:04:46,891 INFO L256 TraceCheckUtils]: 0: Hoare triple {1282#true} call ULTIMATE.init(); {1282#true} is VALID [2018-11-19 00:04:46,892 INFO L273 TraceCheckUtils]: 1: Hoare triple {1282#true} assume true; {1282#true} is VALID [2018-11-19 00:04:46,892 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1282#true} {1282#true} #96#return; {1282#true} is VALID [2018-11-19 00:04:46,892 INFO L256 TraceCheckUtils]: 3: Hoare triple {1282#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {1282#true} is VALID [2018-11-19 00:04:46,892 INFO L273 TraceCheckUtils]: 4: Hoare triple {1282#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1282#true} is VALID [2018-11-19 00:04:46,894 INFO L273 TraceCheckUtils]: 5: Hoare triple {1282#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {1307#(and (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= 1 main_~n~0))} is VALID [2018-11-19 00:04:46,894 INFO L273 TraceCheckUtils]: 6: Hoare triple {1307#(and (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= 1 main_~n~0))} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {1311#(and (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2)))} is VALID [2018-11-19 00:04:46,895 INFO L273 TraceCheckUtils]: 7: Hoare triple {1311#(and (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2)))} assume true; {1311#(and (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2)))} is VALID [2018-11-19 00:04:46,896 INFO L273 TraceCheckUtils]: 8: Hoare triple {1311#(and (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2)))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {1318#(exists ((main_~l~0 Int)) (and (= main_~j~0 (* 2 main_~l~0)) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2))))} is VALID [2018-11-19 00:04:46,897 INFO L273 TraceCheckUtils]: 9: Hoare triple {1318#(exists ((main_~l~0 Int)) (and (= main_~j~0 (* 2 main_~l~0)) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2))))} assume true; {1318#(exists ((main_~l~0 Int)) (and (= main_~j~0 (* 2 main_~l~0)) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2))))} is VALID [2018-11-19 00:04:46,898 INFO L273 TraceCheckUtils]: 10: Hoare triple {1318#(exists ((main_~l~0 Int)) (and (= main_~j~0 (* 2 main_~l~0)) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2))))} assume !!(~j~0 <= ~r~0); {1318#(exists ((main_~l~0 Int)) (and (= main_~j~0 (* 2 main_~l~0)) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2))))} is VALID [2018-11-19 00:04:46,899 INFO L273 TraceCheckUtils]: 11: Hoare triple {1318#(exists ((main_~l~0 Int)) (and (= main_~j~0 (* 2 main_~l~0)) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2))))} assume !(~j~0 < ~r~0); {1318#(exists ((main_~l~0 Int)) (and (= main_~j~0 (* 2 main_~l~0)) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2))))} is VALID [2018-11-19 00:04:46,899 INFO L256 TraceCheckUtils]: 12: Hoare triple {1318#(exists ((main_~l~0 Int)) (and (= main_~j~0 (* 2 main_~l~0)) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2))))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {1282#true} is VALID [2018-11-19 00:04:46,900 INFO L273 TraceCheckUtils]: 13: Hoare triple {1282#true} ~cond := #in~cond; {1286#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-19 00:04:46,901 INFO L273 TraceCheckUtils]: 14: Hoare triple {1286#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {1287#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:04:46,901 INFO L273 TraceCheckUtils]: 15: Hoare triple {1287#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1287#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:04:46,903 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1287#(not (= |__VERIFIER_assert_#in~cond| 0))} {1318#(exists ((main_~l~0 Int)) (and (= main_~j~0 (* 2 main_~l~0)) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2))))} #108#return; {1318#(exists ((main_~l~0 Int)) (and (= main_~j~0 (* 2 main_~l~0)) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2))))} is VALID [2018-11-19 00:04:46,905 INFO L256 TraceCheckUtils]: 17: Hoare triple {1318#(exists ((main_~l~0 Int)) (and (= main_~j~0 (* 2 main_~l~0)) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2))))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {1346#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-19 00:04:46,906 INFO L273 TraceCheckUtils]: 18: Hoare triple {1346#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1350#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-19 00:04:46,907 INFO L273 TraceCheckUtils]: 19: Hoare triple {1350#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1283#false} is VALID [2018-11-19 00:04:46,907 INFO L273 TraceCheckUtils]: 20: Hoare triple {1283#false} assume !false; {1283#false} is VALID [2018-11-19 00:04:46,910 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-19 00:04:46,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:04:46,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2018-11-19 00:04:46,937 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-19 00:04:46,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:04:46,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-19 00:04:47,031 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-19 00:04:47,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-19 00:04:47,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-19 00:04:47,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-11-19 00:04:47,033 INFO L87 Difference]: Start difference. First operand 112 states and 173 transitions. Second operand 12 states. [2018-11-19 00:04:53,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:04:53,366 INFO L93 Difference]: Finished difference Result 245 states and 387 transitions. [2018-11-19 00:04:53,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-19 00:04:53,367 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-19 00:04:53,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:04:53,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-19 00:04:53,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 194 transitions. [2018-11-19 00:04:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-19 00:04:53,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 194 transitions. [2018-11-19 00:04:53,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 194 transitions. [2018-11-19 00:04:53,767 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:04:53,779 INFO L225 Difference]: With dead ends: 245 [2018-11-19 00:04:53,779 INFO L226 Difference]: Without dead ends: 243 [2018-11-19 00:04:53,780 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2018-11-19 00:04:53,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-11-19 00:04:54,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 202. [2018-11-19 00:04:54,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:04:54,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 243 states. Second operand 202 states. [2018-11-19 00:04:54,481 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand 202 states. [2018-11-19 00:04:54,481 INFO L87 Difference]: Start difference. First operand 243 states. Second operand 202 states. [2018-11-19 00:04:54,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:04:54,504 INFO L93 Difference]: Finished difference Result 243 states and 385 transitions. [2018-11-19 00:04:54,504 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 385 transitions. [2018-11-19 00:04:54,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:04:54,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:04:54,507 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 243 states. [2018-11-19 00:04:54,507 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 243 states. [2018-11-19 00:04:54,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:04:54,528 INFO L93 Difference]: Finished difference Result 243 states and 385 transitions. [2018-11-19 00:04:54,528 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 385 transitions. [2018-11-19 00:04:54,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:04:54,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:04:54,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:04:54,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:04:54,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-11-19 00:04:54,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 323 transitions. [2018-11-19 00:04:54,548 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 323 transitions. Word has length 21 [2018-11-19 00:04:54,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:04:54,548 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 323 transitions. [2018-11-19 00:04:54,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-19 00:04:54,548 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 323 transitions. [2018-11-19 00:04:54,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-19 00:04:54,550 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:04:54,550 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:04:54,550 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:04:54,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:04:54,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1278784497, now seen corresponding path program 1 times [2018-11-19 00:04:54,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:04:54,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:04:54,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:04:54,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:04:54,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:04:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:04:54,705 INFO L256 TraceCheckUtils]: 0: Hoare triple {2548#true} call ULTIMATE.init(); {2548#true} is VALID [2018-11-19 00:04:54,706 INFO L273 TraceCheckUtils]: 1: Hoare triple {2548#true} assume true; {2548#true} is VALID [2018-11-19 00:04:54,706 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2548#true} {2548#true} #96#return; {2548#true} is VALID [2018-11-19 00:04:54,707 INFO L256 TraceCheckUtils]: 3: Hoare triple {2548#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {2548#true} is VALID [2018-11-19 00:04:54,708 INFO L273 TraceCheckUtils]: 4: Hoare triple {2548#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2548#true} is VALID [2018-11-19 00:04:54,708 INFO L273 TraceCheckUtils]: 5: Hoare triple {2548#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {2548#true} is VALID [2018-11-19 00:04:54,715 INFO L273 TraceCheckUtils]: 6: Hoare triple {2548#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {2550#(<= 1 main_~l~0)} is VALID [2018-11-19 00:04:54,716 INFO L273 TraceCheckUtils]: 7: Hoare triple {2550#(<= 1 main_~l~0)} assume true; {2550#(<= 1 main_~l~0)} is VALID [2018-11-19 00:04:54,717 INFO L273 TraceCheckUtils]: 8: Hoare triple {2550#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {2551#(<= 1 main_~i~0)} is VALID [2018-11-19 00:04:54,717 INFO L273 TraceCheckUtils]: 9: Hoare triple {2551#(<= 1 main_~i~0)} assume true; {2551#(<= 1 main_~i~0)} is VALID [2018-11-19 00:04:54,719 INFO L273 TraceCheckUtils]: 10: Hoare triple {2551#(<= 1 main_~i~0)} assume !!(~j~0 <= ~r~0); {2551#(<= 1 main_~i~0)} is VALID [2018-11-19 00:04:54,719 INFO L273 TraceCheckUtils]: 11: Hoare triple {2551#(<= 1 main_~i~0)} assume !(~j~0 < ~r~0); {2551#(<= 1 main_~i~0)} is VALID [2018-11-19 00:04:54,719 INFO L256 TraceCheckUtils]: 12: Hoare triple {2551#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {2548#true} is VALID [2018-11-19 00:04:54,720 INFO L273 TraceCheckUtils]: 13: Hoare triple {2548#true} ~cond := #in~cond; {2552#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-19 00:04:54,720 INFO L273 TraceCheckUtils]: 14: Hoare triple {2552#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {2553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:04:54,721 INFO L273 TraceCheckUtils]: 15: Hoare triple {2553#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:04:54,727 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {2553#(not (= |__VERIFIER_assert_#in~cond| 0))} {2551#(<= 1 main_~i~0)} #108#return; {2551#(<= 1 main_~i~0)} is VALID [2018-11-19 00:04:54,727 INFO L256 TraceCheckUtils]: 17: Hoare triple {2551#(<= 1 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {2548#true} is VALID [2018-11-19 00:04:54,727 INFO L273 TraceCheckUtils]: 18: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2018-11-19 00:04:54,728 INFO L273 TraceCheckUtils]: 19: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2018-11-19 00:04:54,728 INFO L273 TraceCheckUtils]: 20: Hoare triple {2548#true} assume true; {2548#true} is VALID [2018-11-19 00:04:54,729 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2548#true} {2551#(<= 1 main_~i~0)} #110#return; {2551#(<= 1 main_~i~0)} is VALID [2018-11-19 00:04:54,734 INFO L273 TraceCheckUtils]: 22: Hoare triple {2551#(<= 1 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2551#(<= 1 main_~i~0)} is VALID [2018-11-19 00:04:54,734 INFO L273 TraceCheckUtils]: 23: Hoare triple {2551#(<= 1 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {2551#(<= 1 main_~i~0)} is VALID [2018-11-19 00:04:54,741 INFO L256 TraceCheckUtils]: 24: Hoare triple {2551#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {2553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:04:54,742 INFO L273 TraceCheckUtils]: 25: Hoare triple {2553#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2554#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-19 00:04:54,742 INFO L273 TraceCheckUtils]: 26: Hoare triple {2554#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2549#false} is VALID [2018-11-19 00:04:54,742 INFO L273 TraceCheckUtils]: 27: Hoare triple {2549#false} assume !false; {2549#false} is VALID [2018-11-19 00:04:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-19 00:04:54,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:04:54,745 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-19 00:04:54,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:04:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:04:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:04:54,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:04:54,877 INFO L256 TraceCheckUtils]: 0: Hoare triple {2548#true} call ULTIMATE.init(); {2548#true} is VALID [2018-11-19 00:04:54,878 INFO L273 TraceCheckUtils]: 1: Hoare triple {2548#true} assume true; {2548#true} is VALID [2018-11-19 00:04:54,878 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2548#true} {2548#true} #96#return; {2548#true} is VALID [2018-11-19 00:04:54,878 INFO L256 TraceCheckUtils]: 3: Hoare triple {2548#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {2548#true} is VALID [2018-11-19 00:04:54,879 INFO L273 TraceCheckUtils]: 4: Hoare triple {2548#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2548#true} is VALID [2018-11-19 00:04:54,879 INFO L273 TraceCheckUtils]: 5: Hoare triple {2548#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {2548#true} is VALID [2018-11-19 00:04:54,894 INFO L273 TraceCheckUtils]: 6: Hoare triple {2548#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {2550#(<= 1 main_~l~0)} is VALID [2018-11-19 00:04:54,896 INFO L273 TraceCheckUtils]: 7: Hoare triple {2550#(<= 1 main_~l~0)} assume true; {2550#(<= 1 main_~l~0)} is VALID [2018-11-19 00:04:54,896 INFO L273 TraceCheckUtils]: 8: Hoare triple {2550#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {2551#(<= 1 main_~i~0)} is VALID [2018-11-19 00:04:54,897 INFO L273 TraceCheckUtils]: 9: Hoare triple {2551#(<= 1 main_~i~0)} assume true; {2551#(<= 1 main_~i~0)} is VALID [2018-11-19 00:04:54,898 INFO L273 TraceCheckUtils]: 10: Hoare triple {2551#(<= 1 main_~i~0)} assume !!(~j~0 <= ~r~0); {2551#(<= 1 main_~i~0)} is VALID [2018-11-19 00:04:54,902 INFO L273 TraceCheckUtils]: 11: Hoare triple {2551#(<= 1 main_~i~0)} assume !(~j~0 < ~r~0); {2551#(<= 1 main_~i~0)} is VALID [2018-11-19 00:04:54,902 INFO L256 TraceCheckUtils]: 12: Hoare triple {2551#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {2548#true} is VALID [2018-11-19 00:04:54,902 INFO L273 TraceCheckUtils]: 13: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2018-11-19 00:04:54,903 INFO L273 TraceCheckUtils]: 14: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2018-11-19 00:04:54,903 INFO L273 TraceCheckUtils]: 15: Hoare triple {2548#true} assume true; {2548#true} is VALID [2018-11-19 00:04:54,904 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {2548#true} {2551#(<= 1 main_~i~0)} #108#return; {2551#(<= 1 main_~i~0)} is VALID [2018-11-19 00:04:54,904 INFO L256 TraceCheckUtils]: 17: Hoare triple {2551#(<= 1 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {2548#true} is VALID [2018-11-19 00:04:54,904 INFO L273 TraceCheckUtils]: 18: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2018-11-19 00:04:54,904 INFO L273 TraceCheckUtils]: 19: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2018-11-19 00:04:54,905 INFO L273 TraceCheckUtils]: 20: Hoare triple {2548#true} assume true; {2548#true} is VALID [2018-11-19 00:04:54,905 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2548#true} {2551#(<= 1 main_~i~0)} #110#return; {2551#(<= 1 main_~i~0)} is VALID [2018-11-19 00:04:54,906 INFO L273 TraceCheckUtils]: 22: Hoare triple {2551#(<= 1 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2551#(<= 1 main_~i~0)} is VALID [2018-11-19 00:04:54,906 INFO L273 TraceCheckUtils]: 23: Hoare triple {2551#(<= 1 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {2551#(<= 1 main_~i~0)} is VALID [2018-11-19 00:04:54,907 INFO L256 TraceCheckUtils]: 24: Hoare triple {2551#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {2630#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-19 00:04:54,907 INFO L273 TraceCheckUtils]: 25: Hoare triple {2630#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2634#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-19 00:04:54,908 INFO L273 TraceCheckUtils]: 26: Hoare triple {2634#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2549#false} is VALID [2018-11-19 00:04:54,908 INFO L273 TraceCheckUtils]: 27: Hoare triple {2549#false} assume !false; {2549#false} is VALID [2018-11-19 00:04:54,910 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-19 00:04:54,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:04:54,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-19 00:04:54,933 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-19 00:04:54,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:04:54,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-19 00:04:54,970 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:04:54,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-19 00:04:54,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-19 00:04:54,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-19 00:04:54,971 INFO L87 Difference]: Start difference. First operand 202 states and 323 transitions. Second operand 9 states. [2018-11-19 00:04:57,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:04:57,911 INFO L93 Difference]: Finished difference Result 260 states and 408 transitions. [2018-11-19 00:04:57,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-19 00:04:57,912 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-19 00:04:57,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:04:57,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-19 00:04:57,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2018-11-19 00:04:57,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-19 00:04:57,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2018-11-19 00:04:57,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 146 transitions. [2018-11-19 00:04:58,149 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:04:58,159 INFO L225 Difference]: With dead ends: 260 [2018-11-19 00:04:58,159 INFO L226 Difference]: Without dead ends: 258 [2018-11-19 00:04:58,160 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-19 00:04:58,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-19 00:04:59,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 235. [2018-11-19 00:04:59,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:04:59,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand 235 states. [2018-11-19 00:04:59,183 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand 235 states. [2018-11-19 00:04:59,184 INFO L87 Difference]: Start difference. First operand 258 states. Second operand 235 states. [2018-11-19 00:04:59,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:04:59,201 INFO L93 Difference]: Finished difference Result 258 states and 406 transitions. [2018-11-19 00:04:59,201 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 406 transitions. [2018-11-19 00:04:59,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:04:59,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:04:59,204 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand 258 states. [2018-11-19 00:04:59,204 INFO L87 Difference]: Start difference. First operand 235 states. Second operand 258 states. [2018-11-19 00:04:59,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:04:59,221 INFO L93 Difference]: Finished difference Result 258 states and 406 transitions. [2018-11-19 00:04:59,221 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 406 transitions. [2018-11-19 00:04:59,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:04:59,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:04:59,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:04:59,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:04:59,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-11-19 00:04:59,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 374 transitions. [2018-11-19 00:04:59,238 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 374 transitions. Word has length 28 [2018-11-19 00:04:59,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:04:59,238 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 374 transitions. [2018-11-19 00:04:59,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-19 00:04:59,239 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 374 transitions. [2018-11-19 00:04:59,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-19 00:04:59,240 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:04:59,240 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:04:59,240 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:04:59,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:04:59,241 INFO L82 PathProgramCache]: Analyzing trace with hash -249410930, now seen corresponding path program 1 times [2018-11-19 00:04:59,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:04:59,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:04:59,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:04:59,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:04:59,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:04:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:04:59,381 INFO L256 TraceCheckUtils]: 0: Hoare triple {3926#true} call ULTIMATE.init(); {3926#true} is VALID [2018-11-19 00:04:59,381 INFO L273 TraceCheckUtils]: 1: Hoare triple {3926#true} assume true; {3926#true} is VALID [2018-11-19 00:04:59,381 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3926#true} {3926#true} #96#return; {3926#true} is VALID [2018-11-19 00:04:59,382 INFO L256 TraceCheckUtils]: 3: Hoare triple {3926#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {3926#true} is VALID [2018-11-19 00:04:59,382 INFO L273 TraceCheckUtils]: 4: Hoare triple {3926#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3926#true} is VALID [2018-11-19 00:04:59,385 INFO L273 TraceCheckUtils]: 5: Hoare triple {3926#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {3928#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:04:59,387 INFO L273 TraceCheckUtils]: 6: Hoare triple {3928#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {3928#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:04:59,387 INFO L273 TraceCheckUtils]: 7: Hoare triple {3928#(<= main_~r~0 main_~n~0)} assume true; {3928#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:04:59,389 INFO L273 TraceCheckUtils]: 8: Hoare triple {3928#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {3928#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:04:59,389 INFO L273 TraceCheckUtils]: 9: Hoare triple {3928#(<= main_~r~0 main_~n~0)} assume true; {3928#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:04:59,389 INFO L273 TraceCheckUtils]: 10: Hoare triple {3928#(<= main_~r~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {3928#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:04:59,390 INFO L273 TraceCheckUtils]: 11: Hoare triple {3928#(<= main_~r~0 main_~n~0)} assume ~j~0 < ~r~0; {3929#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-19 00:04:59,390 INFO L256 TraceCheckUtils]: 12: Hoare triple {3929#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {3926#true} is VALID [2018-11-19 00:04:59,391 INFO L273 TraceCheckUtils]: 13: Hoare triple {3926#true} ~cond := #in~cond; {3930#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-19 00:04:59,392 INFO L273 TraceCheckUtils]: 14: Hoare triple {3930#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {3931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:04:59,392 INFO L273 TraceCheckUtils]: 15: Hoare triple {3931#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:04:59,394 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {3931#(not (= |__VERIFIER_assert_#in~cond| 0))} {3929#(<= (+ main_~j~0 1) main_~n~0)} #100#return; {3929#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-19 00:04:59,394 INFO L256 TraceCheckUtils]: 17: Hoare triple {3929#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {3926#true} is VALID [2018-11-19 00:04:59,394 INFO L273 TraceCheckUtils]: 18: Hoare triple {3926#true} ~cond := #in~cond; {3926#true} is VALID [2018-11-19 00:04:59,395 INFO L273 TraceCheckUtils]: 19: Hoare triple {3926#true} assume !(0 == ~cond); {3926#true} is VALID [2018-11-19 00:04:59,395 INFO L273 TraceCheckUtils]: 20: Hoare triple {3926#true} assume true; {3926#true} is VALID [2018-11-19 00:04:59,400 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {3926#true} {3929#(<= (+ main_~j~0 1) main_~n~0)} #102#return; {3929#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-19 00:04:59,400 INFO L256 TraceCheckUtils]: 22: Hoare triple {3929#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {3926#true} is VALID [2018-11-19 00:04:59,400 INFO L273 TraceCheckUtils]: 23: Hoare triple {3926#true} ~cond := #in~cond; {3926#true} is VALID [2018-11-19 00:04:59,400 INFO L273 TraceCheckUtils]: 24: Hoare triple {3926#true} assume !(0 == ~cond); {3926#true} is VALID [2018-11-19 00:04:59,400 INFO L273 TraceCheckUtils]: 25: Hoare triple {3926#true} assume true; {3926#true} is VALID [2018-11-19 00:04:59,401 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {3926#true} {3929#(<= (+ main_~j~0 1) main_~n~0)} #104#return; {3929#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-19 00:04:59,402 INFO L256 TraceCheckUtils]: 27: Hoare triple {3929#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {3931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:04:59,402 INFO L273 TraceCheckUtils]: 28: Hoare triple {3931#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3932#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-19 00:04:59,403 INFO L273 TraceCheckUtils]: 29: Hoare triple {3932#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3927#false} is VALID [2018-11-19 00:04:59,403 INFO L273 TraceCheckUtils]: 30: Hoare triple {3927#false} assume !false; {3927#false} is VALID [2018-11-19 00:04:59,404 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-19 00:04:59,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:04:59,404 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-19 00:04:59,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:04:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:04:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:04:59,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:04:59,523 INFO L256 TraceCheckUtils]: 0: Hoare triple {3926#true} call ULTIMATE.init(); {3926#true} is VALID [2018-11-19 00:04:59,523 INFO L273 TraceCheckUtils]: 1: Hoare triple {3926#true} assume true; {3926#true} is VALID [2018-11-19 00:04:59,523 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3926#true} {3926#true} #96#return; {3926#true} is VALID [2018-11-19 00:04:59,524 INFO L256 TraceCheckUtils]: 3: Hoare triple {3926#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {3926#true} is VALID [2018-11-19 00:04:59,524 INFO L273 TraceCheckUtils]: 4: Hoare triple {3926#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3926#true} is VALID [2018-11-19 00:04:59,525 INFO L273 TraceCheckUtils]: 5: Hoare triple {3926#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {3928#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:04:59,525 INFO L273 TraceCheckUtils]: 6: Hoare triple {3928#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {3928#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:04:59,527 INFO L273 TraceCheckUtils]: 7: Hoare triple {3928#(<= main_~r~0 main_~n~0)} assume true; {3928#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:04:59,527 INFO L273 TraceCheckUtils]: 8: Hoare triple {3928#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {3928#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:04:59,529 INFO L273 TraceCheckUtils]: 9: Hoare triple {3928#(<= main_~r~0 main_~n~0)} assume true; {3928#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:04:59,529 INFO L273 TraceCheckUtils]: 10: Hoare triple {3928#(<= main_~r~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {3928#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:04:59,530 INFO L273 TraceCheckUtils]: 11: Hoare triple {3928#(<= main_~r~0 main_~n~0)} assume ~j~0 < ~r~0; {3929#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-19 00:04:59,530 INFO L256 TraceCheckUtils]: 12: Hoare triple {3929#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {3926#true} is VALID [2018-11-19 00:04:59,530 INFO L273 TraceCheckUtils]: 13: Hoare triple {3926#true} ~cond := #in~cond; {3926#true} is VALID [2018-11-19 00:04:59,530 INFO L273 TraceCheckUtils]: 14: Hoare triple {3926#true} assume !(0 == ~cond); {3926#true} is VALID [2018-11-19 00:04:59,530 INFO L273 TraceCheckUtils]: 15: Hoare triple {3926#true} assume true; {3926#true} is VALID [2018-11-19 00:04:59,531 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {3926#true} {3929#(<= (+ main_~j~0 1) main_~n~0)} #100#return; {3929#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-19 00:04:59,531 INFO L256 TraceCheckUtils]: 17: Hoare triple {3929#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {3926#true} is VALID [2018-11-19 00:04:59,531 INFO L273 TraceCheckUtils]: 18: Hoare triple {3926#true} ~cond := #in~cond; {3926#true} is VALID [2018-11-19 00:04:59,531 INFO L273 TraceCheckUtils]: 19: Hoare triple {3926#true} assume !(0 == ~cond); {3926#true} is VALID [2018-11-19 00:04:59,532 INFO L273 TraceCheckUtils]: 20: Hoare triple {3926#true} assume true; {3926#true} is VALID [2018-11-19 00:04:59,532 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {3926#true} {3929#(<= (+ main_~j~0 1) main_~n~0)} #102#return; {3929#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-19 00:04:59,532 INFO L256 TraceCheckUtils]: 22: Hoare triple {3929#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {3926#true} is VALID [2018-11-19 00:04:59,533 INFO L273 TraceCheckUtils]: 23: Hoare triple {3926#true} ~cond := #in~cond; {3926#true} is VALID [2018-11-19 00:04:59,533 INFO L273 TraceCheckUtils]: 24: Hoare triple {3926#true} assume !(0 == ~cond); {3926#true} is VALID [2018-11-19 00:04:59,533 INFO L273 TraceCheckUtils]: 25: Hoare triple {3926#true} assume true; {3926#true} is VALID [2018-11-19 00:04:59,538 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {3926#true} {3929#(<= (+ main_~j~0 1) main_~n~0)} #104#return; {3929#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-19 00:04:59,539 INFO L256 TraceCheckUtils]: 27: Hoare triple {3929#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {4017#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-19 00:04:59,541 INFO L273 TraceCheckUtils]: 28: Hoare triple {4017#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {4021#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-19 00:04:59,541 INFO L273 TraceCheckUtils]: 29: Hoare triple {4021#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3927#false} is VALID [2018-11-19 00:04:59,541 INFO L273 TraceCheckUtils]: 30: Hoare triple {3927#false} assume !false; {3927#false} is VALID [2018-11-19 00:04:59,543 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-19 00:04:59,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:04:59,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-19 00:04:59,571 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-19 00:04:59,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:04:59,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-19 00:04:59,619 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:04:59,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-19 00:04:59,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-19 00:04:59,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-19 00:04:59,620 INFO L87 Difference]: Start difference. First operand 235 states and 374 transitions. Second operand 9 states. [2018-11-19 00:05:03,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:05:03,092 INFO L93 Difference]: Finished difference Result 317 states and 503 transitions. [2018-11-19 00:05:03,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-19 00:05:03,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-19 00:05:03,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:05:03,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-19 00:05:03,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2018-11-19 00:05:03,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-19 00:05:03,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2018-11-19 00:05:03,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 94 transitions. [2018-11-19 00:05:03,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:05:03,437 INFO L225 Difference]: With dead ends: 317 [2018-11-19 00:05:03,437 INFO L226 Difference]: Without dead ends: 315 [2018-11-19 00:05:03,438 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-19 00:05:03,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-11-19 00:05:04,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 288. [2018-11-19 00:05:04,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:05:04,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 315 states. Second operand 288 states. [2018-11-19 00:05:04,974 INFO L74 IsIncluded]: Start isIncluded. First operand 315 states. Second operand 288 states. [2018-11-19 00:05:04,975 INFO L87 Difference]: Start difference. First operand 315 states. Second operand 288 states. [2018-11-19 00:05:04,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:05:04,995 INFO L93 Difference]: Finished difference Result 315 states and 501 transitions. [2018-11-19 00:05:04,995 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 501 transitions. [2018-11-19 00:05:04,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:05:04,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:05:04,998 INFO L74 IsIncluded]: Start isIncluded. First operand 288 states. Second operand 315 states. [2018-11-19 00:05:04,998 INFO L87 Difference]: Start difference. First operand 288 states. Second operand 315 states. [2018-11-19 00:05:05,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:05:05,019 INFO L93 Difference]: Finished difference Result 315 states and 501 transitions. [2018-11-19 00:05:05,019 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 501 transitions. [2018-11-19 00:05:05,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:05:05,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:05:05,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:05:05,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:05:05,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-11-19 00:05:05,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 463 transitions. [2018-11-19 00:05:05,041 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 463 transitions. Word has length 31 [2018-11-19 00:05:05,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:05:05,042 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 463 transitions. [2018-11-19 00:05:05,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-19 00:05:05,042 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 463 transitions. [2018-11-19 00:05:05,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-19 00:05:05,043 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:05:05,043 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:05:05,044 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:05:05,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:05:05,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1125815644, now seen corresponding path program 1 times [2018-11-19 00:05:05,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:05:05,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:05:05,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:05:05,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:05:05,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:05:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:05:05,424 INFO L256 TraceCheckUtils]: 0: Hoare triple {5602#true} call ULTIMATE.init(); {5602#true} is VALID [2018-11-19 00:05:05,424 INFO L273 TraceCheckUtils]: 1: Hoare triple {5602#true} assume true; {5602#true} is VALID [2018-11-19 00:05:05,424 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5602#true} {5602#true} #96#return; {5602#true} is VALID [2018-11-19 00:05:05,425 INFO L256 TraceCheckUtils]: 3: Hoare triple {5602#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {5602#true} is VALID [2018-11-19 00:05:05,425 INFO L273 TraceCheckUtils]: 4: Hoare triple {5602#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {5602#true} is VALID [2018-11-19 00:05:05,426 INFO L273 TraceCheckUtils]: 5: Hoare triple {5602#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {5604#(<= (* 2 main_~l~0) (+ main_~n~0 2))} is VALID [2018-11-19 00:05:05,427 INFO L273 TraceCheckUtils]: 6: Hoare triple {5604#(<= (* 2 main_~l~0) (+ main_~n~0 2))} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {5605#(<= (+ main_~l~0 1) main_~n~0)} is VALID [2018-11-19 00:05:05,428 INFO L273 TraceCheckUtils]: 7: Hoare triple {5605#(<= (+ main_~l~0 1) main_~n~0)} assume true; {5605#(<= (+ main_~l~0 1) main_~n~0)} is VALID [2018-11-19 00:05:05,438 INFO L273 TraceCheckUtils]: 8: Hoare triple {5605#(<= (+ main_~l~0 1) main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {5606#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2018-11-19 00:05:05,438 INFO L273 TraceCheckUtils]: 9: Hoare triple {5606#(<= (+ main_~i~0 1) main_~n~0)} assume true; {5606#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2018-11-19 00:05:05,439 INFO L273 TraceCheckUtils]: 10: Hoare triple {5606#(<= (+ main_~i~0 1) main_~n~0)} assume !!(~j~0 <= ~r~0); {5606#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2018-11-19 00:05:05,440 INFO L273 TraceCheckUtils]: 11: Hoare triple {5606#(<= (+ main_~i~0 1) main_~n~0)} assume !(~j~0 < ~r~0); {5606#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2018-11-19 00:05:05,440 INFO L256 TraceCheckUtils]: 12: Hoare triple {5606#(<= (+ main_~i~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {5602#true} is VALID [2018-11-19 00:05:05,443 INFO L273 TraceCheckUtils]: 13: Hoare triple {5602#true} ~cond := #in~cond; {5607#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-19 00:05:05,443 INFO L273 TraceCheckUtils]: 14: Hoare triple {5607#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {5608#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:05:05,443 INFO L273 TraceCheckUtils]: 15: Hoare triple {5608#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5608#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:05:05,444 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {5608#(not (= |__VERIFIER_assert_#in~cond| 0))} {5606#(<= (+ main_~i~0 1) main_~n~0)} #108#return; {5606#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2018-11-19 00:05:05,444 INFO L256 TraceCheckUtils]: 17: Hoare triple {5606#(<= (+ main_~i~0 1) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {5602#true} is VALID [2018-11-19 00:05:05,444 INFO L273 TraceCheckUtils]: 18: Hoare triple {5602#true} ~cond := #in~cond; {5602#true} is VALID [2018-11-19 00:05:05,444 INFO L273 TraceCheckUtils]: 19: Hoare triple {5602#true} assume !(0 == ~cond); {5602#true} is VALID [2018-11-19 00:05:05,445 INFO L273 TraceCheckUtils]: 20: Hoare triple {5602#true} assume true; {5602#true} is VALID [2018-11-19 00:05:05,450 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {5602#true} {5606#(<= (+ main_~i~0 1) main_~n~0)} #110#return; {5606#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2018-11-19 00:05:05,452 INFO L273 TraceCheckUtils]: 22: Hoare triple {5606#(<= (+ main_~i~0 1) main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {5606#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2018-11-19 00:05:05,453 INFO L273 TraceCheckUtils]: 23: Hoare triple {5606#(<= (+ main_~i~0 1) main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {5606#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2018-11-19 00:05:05,453 INFO L256 TraceCheckUtils]: 24: Hoare triple {5606#(<= (+ main_~i~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {5602#true} is VALID [2018-11-19 00:05:05,453 INFO L273 TraceCheckUtils]: 25: Hoare triple {5602#true} ~cond := #in~cond; {5602#true} is VALID [2018-11-19 00:05:05,453 INFO L273 TraceCheckUtils]: 26: Hoare triple {5602#true} assume !(0 == ~cond); {5602#true} is VALID [2018-11-19 00:05:05,454 INFO L273 TraceCheckUtils]: 27: Hoare triple {5602#true} assume true; {5602#true} is VALID [2018-11-19 00:05:05,454 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {5602#true} {5606#(<= (+ main_~i~0 1) main_~n~0)} #112#return; {5606#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2018-11-19 00:05:05,455 INFO L256 TraceCheckUtils]: 29: Hoare triple {5606#(<= (+ main_~i~0 1) main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {5608#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:05:05,455 INFO L273 TraceCheckUtils]: 30: Hoare triple {5608#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5609#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-19 00:05:05,456 INFO L273 TraceCheckUtils]: 31: Hoare triple {5609#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5603#false} is VALID [2018-11-19 00:05:05,456 INFO L273 TraceCheckUtils]: 32: Hoare triple {5603#false} assume !false; {5603#false} is VALID [2018-11-19 00:05:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-19 00:05:05,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:05:05,458 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:05:05,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:05:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:05:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:05:05,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:05:05,913 INFO L256 TraceCheckUtils]: 0: Hoare triple {5602#true} call ULTIMATE.init(); {5602#true} is VALID [2018-11-19 00:05:05,913 INFO L273 TraceCheckUtils]: 1: Hoare triple {5602#true} assume true; {5602#true} is VALID [2018-11-19 00:05:05,913 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5602#true} {5602#true} #96#return; {5602#true} is VALID [2018-11-19 00:05:05,913 INFO L256 TraceCheckUtils]: 3: Hoare triple {5602#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {5602#true} is VALID [2018-11-19 00:05:05,914 INFO L273 TraceCheckUtils]: 4: Hoare triple {5602#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {5602#true} is VALID [2018-11-19 00:05:05,914 INFO L273 TraceCheckUtils]: 5: Hoare triple {5602#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {5628#(and (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= main_~r~0 main_~n~0) (<= 1 main_~n~0))} is VALID [2018-11-19 00:05:05,915 INFO L273 TraceCheckUtils]: 6: Hoare triple {5628#(and (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= main_~r~0 main_~n~0) (<= 1 main_~n~0))} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {5632#(and (<= main_~r~0 main_~n~0) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2)))} is VALID [2018-11-19 00:05:05,916 INFO L273 TraceCheckUtils]: 7: Hoare triple {5632#(and (<= main_~r~0 main_~n~0) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2)))} assume true; {5632#(and (<= main_~r~0 main_~n~0) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2)))} is VALID [2018-11-19 00:05:05,916 INFO L273 TraceCheckUtils]: 8: Hoare triple {5632#(and (<= main_~r~0 main_~n~0) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2)))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {5639#(and (<= main_~i~0 (div main_~n~0 2)) (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0))} is VALID [2018-11-19 00:05:05,917 INFO L273 TraceCheckUtils]: 9: Hoare triple {5639#(and (<= main_~i~0 (div main_~n~0 2)) (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0))} assume true; {5639#(and (<= main_~i~0 (div main_~n~0 2)) (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0))} is VALID [2018-11-19 00:05:05,917 INFO L273 TraceCheckUtils]: 10: Hoare triple {5639#(and (<= main_~i~0 (div main_~n~0 2)) (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0))} assume !!(~j~0 <= ~r~0); {5639#(and (<= main_~i~0 (div main_~n~0 2)) (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0))} is VALID [2018-11-19 00:05:05,920 INFO L273 TraceCheckUtils]: 11: Hoare triple {5639#(and (<= main_~i~0 (div main_~n~0 2)) (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0))} assume !(~j~0 < ~r~0); {5639#(and (<= main_~i~0 (div main_~n~0 2)) (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0))} is VALID [2018-11-19 00:05:05,921 INFO L256 TraceCheckUtils]: 12: Hoare triple {5639#(and (<= main_~i~0 (div main_~n~0 2)) (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {5602#true} is VALID [2018-11-19 00:05:05,921 INFO L273 TraceCheckUtils]: 13: Hoare triple {5602#true} ~cond := #in~cond; {5607#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-19 00:05:05,924 INFO L273 TraceCheckUtils]: 14: Hoare triple {5607#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {5608#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:05:05,927 INFO L273 TraceCheckUtils]: 15: Hoare triple {5608#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5608#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:05:05,929 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {5608#(not (= |__VERIFIER_assert_#in~cond| 0))} {5639#(and (<= main_~i~0 (div main_~n~0 2)) (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0))} #108#return; {5664#(and (<= main_~i~0 (div main_~n~0 2)) (< 0 main_~i~0))} is VALID [2018-11-19 00:05:05,929 INFO L256 TraceCheckUtils]: 17: Hoare triple {5664#(and (<= main_~i~0 (div main_~n~0 2)) (< 0 main_~i~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {5602#true} is VALID [2018-11-19 00:05:05,929 INFO L273 TraceCheckUtils]: 18: Hoare triple {5602#true} ~cond := #in~cond; {5602#true} is VALID [2018-11-19 00:05:05,929 INFO L273 TraceCheckUtils]: 19: Hoare triple {5602#true} assume !(0 == ~cond); {5602#true} is VALID [2018-11-19 00:05:05,929 INFO L273 TraceCheckUtils]: 20: Hoare triple {5602#true} assume true; {5602#true} is VALID [2018-11-19 00:05:05,930 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {5602#true} {5664#(and (<= main_~i~0 (div main_~n~0 2)) (< 0 main_~i~0))} #110#return; {5664#(and (<= main_~i~0 (div main_~n~0 2)) (< 0 main_~i~0))} is VALID [2018-11-19 00:05:05,930 INFO L273 TraceCheckUtils]: 22: Hoare triple {5664#(and (<= main_~i~0 (div main_~n~0 2)) (< 0 main_~i~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {5664#(and (<= main_~i~0 (div main_~n~0 2)) (< 0 main_~i~0))} is VALID [2018-11-19 00:05:05,931 INFO L273 TraceCheckUtils]: 23: Hoare triple {5664#(and (<= main_~i~0 (div main_~n~0 2)) (< 0 main_~i~0))} assume !(0 != #t~nondet5);havoc #t~nondet5; {5664#(and (<= main_~i~0 (div main_~n~0 2)) (< 0 main_~i~0))} is VALID [2018-11-19 00:05:05,931 INFO L256 TraceCheckUtils]: 24: Hoare triple {5664#(and (<= main_~i~0 (div main_~n~0 2)) (< 0 main_~i~0))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {5602#true} is VALID [2018-11-19 00:05:05,931 INFO L273 TraceCheckUtils]: 25: Hoare triple {5602#true} ~cond := #in~cond; {5602#true} is VALID [2018-11-19 00:05:05,931 INFO L273 TraceCheckUtils]: 26: Hoare triple {5602#true} assume !(0 == ~cond); {5602#true} is VALID [2018-11-19 00:05:05,931 INFO L273 TraceCheckUtils]: 27: Hoare triple {5602#true} assume true; {5602#true} is VALID [2018-11-19 00:05:05,932 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {5602#true} {5664#(and (<= main_~i~0 (div main_~n~0 2)) (< 0 main_~i~0))} #112#return; {5664#(and (<= main_~i~0 (div main_~n~0 2)) (< 0 main_~i~0))} is VALID [2018-11-19 00:05:05,933 INFO L256 TraceCheckUtils]: 29: Hoare triple {5664#(and (<= main_~i~0 (div main_~n~0 2)) (< 0 main_~i~0))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {5704#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-19 00:05:05,933 INFO L273 TraceCheckUtils]: 30: Hoare triple {5704#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {5708#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-19 00:05:05,933 INFO L273 TraceCheckUtils]: 31: Hoare triple {5708#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5603#false} is VALID [2018-11-19 00:05:05,934 INFO L273 TraceCheckUtils]: 32: Hoare triple {5603#false} assume !false; {5603#false} is VALID [2018-11-19 00:05:05,936 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-19 00:05:05,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:05:05,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 14 [2018-11-19 00:05:05,957 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-19 00:05:05,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:05:05,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-19 00:05:06,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:05:06,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-19 00:05:06,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-19 00:05:06,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-11-19 00:05:06,006 INFO L87 Difference]: Start difference. First operand 288 states and 463 transitions. Second operand 14 states. [2018-11-19 00:05:11,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:05:11,704 INFO L93 Difference]: Finished difference Result 382 states and 598 transitions. [2018-11-19 00:05:11,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-19 00:05:11,704 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-19 00:05:11,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:05:11,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-19 00:05:11,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 250 transitions. [2018-11-19 00:05:11,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-19 00:05:11,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 250 transitions. [2018-11-19 00:05:11,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 250 transitions. [2018-11-19 00:05:12,179 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:05:12,191 INFO L225 Difference]: With dead ends: 382 [2018-11-19 00:05:12,192 INFO L226 Difference]: Without dead ends: 380 [2018-11-19 00:05:12,192 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-11-19 00:05:12,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-19 00:05:13,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 337. [2018-11-19 00:05:13,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:05:13,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 380 states. Second operand 337 states. [2018-11-19 00:05:13,170 INFO L74 IsIncluded]: Start isIncluded. First operand 380 states. Second operand 337 states. [2018-11-19 00:05:13,171 INFO L87 Difference]: Start difference. First operand 380 states. Second operand 337 states. [2018-11-19 00:05:13,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:05:13,191 INFO L93 Difference]: Finished difference Result 380 states and 596 transitions. [2018-11-19 00:05:13,191 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 596 transitions. [2018-11-19 00:05:13,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:05:13,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:05:13,195 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand 380 states. [2018-11-19 00:05:13,195 INFO L87 Difference]: Start difference. First operand 337 states. Second operand 380 states. [2018-11-19 00:05:13,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:05:13,215 INFO L93 Difference]: Finished difference Result 380 states and 596 transitions. [2018-11-19 00:05:13,215 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 596 transitions. [2018-11-19 00:05:13,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:05:13,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:05:13,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:05:13,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:05:13,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-19 00:05:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 531 transitions. [2018-11-19 00:05:13,236 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 531 transitions. Word has length 33 [2018-11-19 00:05:13,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:05:13,237 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 531 transitions. [2018-11-19 00:05:13,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-19 00:05:13,237 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 531 transitions. [2018-11-19 00:05:13,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-19 00:05:13,238 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:05:13,238 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:05:13,238 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:05:13,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:05:13,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1831965438, now seen corresponding path program 1 times [2018-11-19 00:05:13,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:05:13,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:05:13,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:05:13,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:05:13,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:05:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:05:13,510 INFO L256 TraceCheckUtils]: 0: Hoare triple {7601#true} call ULTIMATE.init(); {7601#true} is VALID [2018-11-19 00:05:13,511 INFO L273 TraceCheckUtils]: 1: Hoare triple {7601#true} assume true; {7601#true} is VALID [2018-11-19 00:05:13,511 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7601#true} {7601#true} #96#return; {7601#true} is VALID [2018-11-19 00:05:13,511 INFO L256 TraceCheckUtils]: 3: Hoare triple {7601#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {7601#true} is VALID [2018-11-19 00:05:13,512 INFO L273 TraceCheckUtils]: 4: Hoare triple {7601#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {7601#true} is VALID [2018-11-19 00:05:13,512 INFO L273 TraceCheckUtils]: 5: Hoare triple {7601#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {7601#true} is VALID [2018-11-19 00:05:13,512 INFO L273 TraceCheckUtils]: 6: Hoare triple {7601#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {7601#true} is VALID [2018-11-19 00:05:13,512 INFO L273 TraceCheckUtils]: 7: Hoare triple {7601#true} assume true; {7601#true} is VALID [2018-11-19 00:05:13,513 INFO L273 TraceCheckUtils]: 8: Hoare triple {7601#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {7601#true} is VALID [2018-11-19 00:05:13,513 INFO L273 TraceCheckUtils]: 9: Hoare triple {7601#true} assume true; {7601#true} is VALID [2018-11-19 00:05:13,513 INFO L273 TraceCheckUtils]: 10: Hoare triple {7601#true} assume !(~j~0 <= ~r~0); {7601#true} is VALID [2018-11-19 00:05:13,514 INFO L273 TraceCheckUtils]: 11: Hoare triple {7601#true} assume ~l~0 > 1; {7603#(<= 2 main_~l~0)} is VALID [2018-11-19 00:05:13,514 INFO L256 TraceCheckUtils]: 12: Hoare triple {7603#(<= 2 main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {7601#true} is VALID [2018-11-19 00:05:13,515 INFO L273 TraceCheckUtils]: 13: Hoare triple {7601#true} ~cond := #in~cond; {7604#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-19 00:05:13,515 INFO L273 TraceCheckUtils]: 14: Hoare triple {7604#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {7605#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:05:13,515 INFO L273 TraceCheckUtils]: 15: Hoare triple {7605#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7605#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:05:13,516 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {7605#(not (= |__VERIFIER_assert_#in~cond| 0))} {7603#(<= 2 main_~l~0)} #120#return; {7603#(<= 2 main_~l~0)} is VALID [2018-11-19 00:05:13,516 INFO L256 TraceCheckUtils]: 17: Hoare triple {7603#(<= 2 main_~l~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {7601#true} is VALID [2018-11-19 00:05:13,516 INFO L273 TraceCheckUtils]: 18: Hoare triple {7601#true} ~cond := #in~cond; {7601#true} is VALID [2018-11-19 00:05:13,516 INFO L273 TraceCheckUtils]: 19: Hoare triple {7601#true} assume !(0 == ~cond); {7601#true} is VALID [2018-11-19 00:05:13,516 INFO L273 TraceCheckUtils]: 20: Hoare triple {7601#true} assume true; {7601#true} is VALID [2018-11-19 00:05:13,517 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {7601#true} {7603#(<= 2 main_~l~0)} #122#return; {7603#(<= 2 main_~l~0)} is VALID [2018-11-19 00:05:13,518 INFO L273 TraceCheckUtils]: 22: Hoare triple {7603#(<= 2 main_~l~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {7606#(<= 1 main_~l~0)} is VALID [2018-11-19 00:05:13,519 INFO L273 TraceCheckUtils]: 23: Hoare triple {7606#(<= 1 main_~l~0)} assume true; {7606#(<= 1 main_~l~0)} is VALID [2018-11-19 00:05:13,519 INFO L273 TraceCheckUtils]: 24: Hoare triple {7606#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {7607#(<= 2 main_~j~0)} is VALID [2018-11-19 00:05:13,519 INFO L273 TraceCheckUtils]: 25: Hoare triple {7607#(<= 2 main_~j~0)} assume true; {7607#(<= 2 main_~j~0)} is VALID [2018-11-19 00:05:13,520 INFO L273 TraceCheckUtils]: 26: Hoare triple {7607#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {7607#(<= 2 main_~j~0)} is VALID [2018-11-19 00:05:13,520 INFO L273 TraceCheckUtils]: 27: Hoare triple {7607#(<= 2 main_~j~0)} assume ~j~0 < ~r~0; {7607#(<= 2 main_~j~0)} is VALID [2018-11-19 00:05:13,521 INFO L256 TraceCheckUtils]: 28: Hoare triple {7607#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {7605#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:05:13,521 INFO L273 TraceCheckUtils]: 29: Hoare triple {7605#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7608#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-19 00:05:13,521 INFO L273 TraceCheckUtils]: 30: Hoare triple {7608#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7602#false} is VALID [2018-11-19 00:05:13,522 INFO L273 TraceCheckUtils]: 31: Hoare triple {7602#false} assume !false; {7602#false} is VALID [2018-11-19 00:05:13,523 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-19 00:05:13,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:05:13,523 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:05:13,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:05:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:05:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:05:13,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:05:13,640 INFO L256 TraceCheckUtils]: 0: Hoare triple {7601#true} call ULTIMATE.init(); {7601#true} is VALID [2018-11-19 00:05:13,640 INFO L273 TraceCheckUtils]: 1: Hoare triple {7601#true} assume true; {7601#true} is VALID [2018-11-19 00:05:13,640 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7601#true} {7601#true} #96#return; {7601#true} is VALID [2018-11-19 00:05:13,640 INFO L256 TraceCheckUtils]: 3: Hoare triple {7601#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {7601#true} is VALID [2018-11-19 00:05:13,641 INFO L273 TraceCheckUtils]: 4: Hoare triple {7601#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {7601#true} is VALID [2018-11-19 00:05:13,641 INFO L273 TraceCheckUtils]: 5: Hoare triple {7601#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {7601#true} is VALID [2018-11-19 00:05:13,641 INFO L273 TraceCheckUtils]: 6: Hoare triple {7601#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {7601#true} is VALID [2018-11-19 00:05:13,641 INFO L273 TraceCheckUtils]: 7: Hoare triple {7601#true} assume true; {7601#true} is VALID [2018-11-19 00:05:13,641 INFO L273 TraceCheckUtils]: 8: Hoare triple {7601#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {7601#true} is VALID [2018-11-19 00:05:13,642 INFO L273 TraceCheckUtils]: 9: Hoare triple {7601#true} assume true; {7601#true} is VALID [2018-11-19 00:05:13,642 INFO L273 TraceCheckUtils]: 10: Hoare triple {7601#true} assume !(~j~0 <= ~r~0); {7601#true} is VALID [2018-11-19 00:05:13,642 INFO L273 TraceCheckUtils]: 11: Hoare triple {7601#true} assume ~l~0 > 1; {7603#(<= 2 main_~l~0)} is VALID [2018-11-19 00:05:13,642 INFO L256 TraceCheckUtils]: 12: Hoare triple {7603#(<= 2 main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {7601#true} is VALID [2018-11-19 00:05:13,643 INFO L273 TraceCheckUtils]: 13: Hoare triple {7601#true} ~cond := #in~cond; {7601#true} is VALID [2018-11-19 00:05:13,643 INFO L273 TraceCheckUtils]: 14: Hoare triple {7601#true} assume !(0 == ~cond); {7601#true} is VALID [2018-11-19 00:05:13,643 INFO L273 TraceCheckUtils]: 15: Hoare triple {7601#true} assume true; {7601#true} is VALID [2018-11-19 00:05:13,643 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {7601#true} {7603#(<= 2 main_~l~0)} #120#return; {7603#(<= 2 main_~l~0)} is VALID [2018-11-19 00:05:13,643 INFO L256 TraceCheckUtils]: 17: Hoare triple {7603#(<= 2 main_~l~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {7601#true} is VALID [2018-11-19 00:05:13,644 INFO L273 TraceCheckUtils]: 18: Hoare triple {7601#true} ~cond := #in~cond; {7601#true} is VALID [2018-11-19 00:05:13,644 INFO L273 TraceCheckUtils]: 19: Hoare triple {7601#true} assume !(0 == ~cond); {7601#true} is VALID [2018-11-19 00:05:13,644 INFO L273 TraceCheckUtils]: 20: Hoare triple {7601#true} assume true; {7601#true} is VALID [2018-11-19 00:05:13,644 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {7601#true} {7603#(<= 2 main_~l~0)} #122#return; {7603#(<= 2 main_~l~0)} is VALID [2018-11-19 00:05:13,645 INFO L273 TraceCheckUtils]: 22: Hoare triple {7603#(<= 2 main_~l~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {7606#(<= 1 main_~l~0)} is VALID [2018-11-19 00:05:13,645 INFO L273 TraceCheckUtils]: 23: Hoare triple {7606#(<= 1 main_~l~0)} assume true; {7606#(<= 1 main_~l~0)} is VALID [2018-11-19 00:05:13,646 INFO L273 TraceCheckUtils]: 24: Hoare triple {7606#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {7607#(<= 2 main_~j~0)} is VALID [2018-11-19 00:05:13,646 INFO L273 TraceCheckUtils]: 25: Hoare triple {7607#(<= 2 main_~j~0)} assume true; {7607#(<= 2 main_~j~0)} is VALID [2018-11-19 00:05:13,647 INFO L273 TraceCheckUtils]: 26: Hoare triple {7607#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {7607#(<= 2 main_~j~0)} is VALID [2018-11-19 00:05:13,647 INFO L273 TraceCheckUtils]: 27: Hoare triple {7607#(<= 2 main_~j~0)} assume ~j~0 < ~r~0; {7607#(<= 2 main_~j~0)} is VALID [2018-11-19 00:05:13,648 INFO L256 TraceCheckUtils]: 28: Hoare triple {7607#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {7696#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-19 00:05:13,649 INFO L273 TraceCheckUtils]: 29: Hoare triple {7696#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {7700#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-19 00:05:13,649 INFO L273 TraceCheckUtils]: 30: Hoare triple {7700#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7602#false} is VALID [2018-11-19 00:05:13,650 INFO L273 TraceCheckUtils]: 31: Hoare triple {7602#false} assume !false; {7602#false} is VALID [2018-11-19 00:05:13,651 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-19 00:05:13,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:05:13,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 10 [2018-11-19 00:05:13,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-19 00:05:13,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:05:13,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-19 00:05:13,703 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:05:13,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-19 00:05:13,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-19 00:05:13,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-19 00:05:13,704 INFO L87 Difference]: Start difference. First operand 337 states and 531 transitions. Second operand 10 states. [2018-11-19 00:05:16,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:05:16,537 INFO L93 Difference]: Finished difference Result 351 states and 543 transitions. [2018-11-19 00:05:16,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-19 00:05:16,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-19 00:05:16,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:05:16,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-19 00:05:16,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2018-11-19 00:05:16,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-19 00:05:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2018-11-19 00:05:16,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 66 transitions. [2018-11-19 00:05:17,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:05:17,095 INFO L225 Difference]: With dead ends: 351 [2018-11-19 00:05:17,095 INFO L226 Difference]: Without dead ends: 349 [2018-11-19 00:05:17,095 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-11-19 00:05:17,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-11-19 00:05:19,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 345. [2018-11-19 00:05:19,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:05:19,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 349 states. Second operand 345 states. [2018-11-19 00:05:19,267 INFO L74 IsIncluded]: Start isIncluded. First operand 349 states. Second operand 345 states. [2018-11-19 00:05:19,267 INFO L87 Difference]: Start difference. First operand 349 states. Second operand 345 states. [2018-11-19 00:05:19,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:05:19,288 INFO L93 Difference]: Finished difference Result 349 states and 541 transitions. [2018-11-19 00:05:19,288 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 541 transitions. [2018-11-19 00:05:19,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:05:19,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:05:19,291 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand 349 states. [2018-11-19 00:05:19,291 INFO L87 Difference]: Start difference. First operand 345 states. Second operand 349 states. [2018-11-19 00:05:19,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:05:19,308 INFO L93 Difference]: Finished difference Result 349 states and 541 transitions. [2018-11-19 00:05:19,308 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 541 transitions. [2018-11-19 00:05:19,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:05:19,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:05:19,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:05:19,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:05:19,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-11-19 00:05:19,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 537 transitions. [2018-11-19 00:05:19,328 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 537 transitions. Word has length 32 [2018-11-19 00:05:19,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:05:19,328 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 537 transitions. [2018-11-19 00:05:19,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-19 00:05:19,328 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 537 transitions. [2018-11-19 00:05:19,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-19 00:05:19,330 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:05:19,330 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:05:19,330 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:05:19,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:05:19,330 INFO L82 PathProgramCache]: Analyzing trace with hash 797412390, now seen corresponding path program 1 times [2018-11-19 00:05:19,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:05:19,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:05:19,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:05:19,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:05:19,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:05:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:05:20,040 INFO L256 TraceCheckUtils]: 0: Hoare triple {9487#true} call ULTIMATE.init(); {9487#true} is VALID [2018-11-19 00:05:20,040 INFO L273 TraceCheckUtils]: 1: Hoare triple {9487#true} assume true; {9487#true} is VALID [2018-11-19 00:05:20,040 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9487#true} {9487#true} #96#return; {9487#true} is VALID [2018-11-19 00:05:20,041 INFO L256 TraceCheckUtils]: 3: Hoare triple {9487#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {9487#true} is VALID [2018-11-19 00:05:20,041 INFO L273 TraceCheckUtils]: 4: Hoare triple {9487#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {9487#true} is VALID [2018-11-19 00:05:20,041 INFO L273 TraceCheckUtils]: 5: Hoare triple {9487#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {9489#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:05:20,042 INFO L273 TraceCheckUtils]: 6: Hoare triple {9489#(<= main_~r~0 main_~n~0)} assume !(~l~0 > 1);#t~post3 := ~r~0;~r~0 := #t~post3 - 1;havoc #t~post3; {9490#(<= (+ main_~r~0 1) main_~n~0)} is VALID [2018-11-19 00:05:20,043 INFO L273 TraceCheckUtils]: 7: Hoare triple {9490#(<= (+ main_~r~0 1) main_~n~0)} assume true; {9490#(<= (+ main_~r~0 1) main_~n~0)} is VALID [2018-11-19 00:05:20,043 INFO L273 TraceCheckUtils]: 8: Hoare triple {9490#(<= (+ main_~r~0 1) main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {9491#(<= (+ (* 2 main_~i~0) main_~r~0 4) (+ main_~j~0 (* 2 main_~n~0)))} is VALID [2018-11-19 00:05:20,044 INFO L273 TraceCheckUtils]: 9: Hoare triple {9491#(<= (+ (* 2 main_~i~0) main_~r~0 4) (+ main_~j~0 (* 2 main_~n~0)))} assume true; {9491#(<= (+ (* 2 main_~i~0) main_~r~0 4) (+ main_~j~0 (* 2 main_~n~0)))} is VALID [2018-11-19 00:05:20,044 INFO L273 TraceCheckUtils]: 10: Hoare triple {9491#(<= (+ (* 2 main_~i~0) main_~r~0 4) (+ main_~j~0 (* 2 main_~n~0)))} assume !!(~j~0 <= ~r~0); {9492#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2018-11-19 00:05:20,045 INFO L273 TraceCheckUtils]: 11: Hoare triple {9492#(<= (+ main_~i~0 2) main_~n~0)} assume !(~j~0 < ~r~0); {9492#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2018-11-19 00:05:20,045 INFO L256 TraceCheckUtils]: 12: Hoare triple {9492#(<= (+ main_~i~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {9487#true} is VALID [2018-11-19 00:05:20,051 INFO L273 TraceCheckUtils]: 13: Hoare triple {9487#true} ~cond := #in~cond; {9493#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-19 00:05:20,052 INFO L273 TraceCheckUtils]: 14: Hoare triple {9493#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {9494#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:05:20,052 INFO L273 TraceCheckUtils]: 15: Hoare triple {9494#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9494#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:05:20,053 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {9494#(not (= |__VERIFIER_assert_#in~cond| 0))} {9492#(<= (+ main_~i~0 2) main_~n~0)} #108#return; {9492#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2018-11-19 00:05:20,053 INFO L256 TraceCheckUtils]: 17: Hoare triple {9492#(<= (+ main_~i~0 2) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {9487#true} is VALID [2018-11-19 00:05:20,053 INFO L273 TraceCheckUtils]: 18: Hoare triple {9487#true} ~cond := #in~cond; {9487#true} is VALID [2018-11-19 00:05:20,053 INFO L273 TraceCheckUtils]: 19: Hoare triple {9487#true} assume !(0 == ~cond); {9487#true} is VALID [2018-11-19 00:05:20,054 INFO L273 TraceCheckUtils]: 20: Hoare triple {9487#true} assume true; {9487#true} is VALID [2018-11-19 00:05:20,055 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {9487#true} {9492#(<= (+ main_~i~0 2) main_~n~0)} #110#return; {9492#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2018-11-19 00:05:20,056 INFO L273 TraceCheckUtils]: 22: Hoare triple {9492#(<= (+ main_~i~0 2) main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {9492#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2018-11-19 00:05:20,056 INFO L273 TraceCheckUtils]: 23: Hoare triple {9492#(<= (+ main_~i~0 2) main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {9492#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2018-11-19 00:05:20,056 INFO L256 TraceCheckUtils]: 24: Hoare triple {9492#(<= (+ main_~i~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {9487#true} is VALID [2018-11-19 00:05:20,056 INFO L273 TraceCheckUtils]: 25: Hoare triple {9487#true} ~cond := #in~cond; {9487#true} is VALID [2018-11-19 00:05:20,056 INFO L273 TraceCheckUtils]: 26: Hoare triple {9487#true} assume !(0 == ~cond); {9487#true} is VALID [2018-11-19 00:05:20,057 INFO L273 TraceCheckUtils]: 27: Hoare triple {9487#true} assume true; {9487#true} is VALID [2018-11-19 00:05:20,057 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {9487#true} {9492#(<= (+ main_~i~0 2) main_~n~0)} #112#return; {9492#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2018-11-19 00:05:20,058 INFO L256 TraceCheckUtils]: 29: Hoare triple {9492#(<= (+ main_~i~0 2) main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {9494#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:05:20,058 INFO L273 TraceCheckUtils]: 30: Hoare triple {9494#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {9495#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-19 00:05:20,059 INFO L273 TraceCheckUtils]: 31: Hoare triple {9495#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9488#false} is VALID [2018-11-19 00:05:20,059 INFO L273 TraceCheckUtils]: 32: Hoare triple {9488#false} assume !false; {9488#false} is VALID [2018-11-19 00:05:20,060 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-19 00:05:20,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:05:20,060 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:05:20,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:05:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:05:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:05:20,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:05:20,496 INFO L256 TraceCheckUtils]: 0: Hoare triple {9487#true} call ULTIMATE.init(); {9487#true} is VALID [2018-11-19 00:05:20,497 INFO L273 TraceCheckUtils]: 1: Hoare triple {9487#true} assume true; {9487#true} is VALID [2018-11-19 00:05:20,497 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9487#true} {9487#true} #96#return; {9487#true} is VALID [2018-11-19 00:05:20,497 INFO L256 TraceCheckUtils]: 3: Hoare triple {9487#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {9487#true} is VALID [2018-11-19 00:05:20,498 INFO L273 TraceCheckUtils]: 4: Hoare triple {9487#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {9487#true} is VALID [2018-11-19 00:05:20,499 INFO L273 TraceCheckUtils]: 5: Hoare triple {9487#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {9489#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:05:20,499 INFO L273 TraceCheckUtils]: 6: Hoare triple {9489#(<= main_~r~0 main_~n~0)} assume !(~l~0 > 1);#t~post3 := ~r~0;~r~0 := #t~post3 - 1;havoc #t~post3; {9490#(<= (+ main_~r~0 1) main_~n~0)} is VALID [2018-11-19 00:05:20,500 INFO L273 TraceCheckUtils]: 7: Hoare triple {9490#(<= (+ main_~r~0 1) main_~n~0)} assume true; {9490#(<= (+ main_~r~0 1) main_~n~0)} is VALID [2018-11-19 00:05:20,501 INFO L273 TraceCheckUtils]: 8: Hoare triple {9490#(<= (+ main_~r~0 1) main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {9523#(and (< 1 main_~r~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= (+ main_~r~0 1) main_~n~0))} is VALID [2018-11-19 00:05:20,503 INFO L273 TraceCheckUtils]: 9: Hoare triple {9523#(and (< 1 main_~r~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= (+ main_~r~0 1) main_~n~0))} assume true; {9523#(and (< 1 main_~r~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= (+ main_~r~0 1) main_~n~0))} is VALID [2018-11-19 00:05:20,504 INFO L273 TraceCheckUtils]: 10: Hoare triple {9523#(and (< 1 main_~r~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= (+ main_~r~0 1) main_~n~0))} assume !!(~j~0 <= ~r~0); {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} is VALID [2018-11-19 00:05:20,505 INFO L273 TraceCheckUtils]: 11: Hoare triple {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} assume !(~j~0 < ~r~0); {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} is VALID [2018-11-19 00:05:20,506 INFO L256 TraceCheckUtils]: 12: Hoare triple {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {9487#true} is VALID [2018-11-19 00:05:20,506 INFO L273 TraceCheckUtils]: 13: Hoare triple {9487#true} ~cond := #in~cond; {9487#true} is VALID [2018-11-19 00:05:20,506 INFO L273 TraceCheckUtils]: 14: Hoare triple {9487#true} assume !(0 == ~cond); {9487#true} is VALID [2018-11-19 00:05:20,507 INFO L273 TraceCheckUtils]: 15: Hoare triple {9487#true} assume true; {9487#true} is VALID [2018-11-19 00:05:20,526 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {9487#true} {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} #108#return; {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} is VALID [2018-11-19 00:05:20,526 INFO L256 TraceCheckUtils]: 17: Hoare triple {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {9487#true} is VALID [2018-11-19 00:05:20,527 INFO L273 TraceCheckUtils]: 18: Hoare triple {9487#true} ~cond := #in~cond; {9487#true} is VALID [2018-11-19 00:05:20,527 INFO L273 TraceCheckUtils]: 19: Hoare triple {9487#true} assume !(0 == ~cond); {9487#true} is VALID [2018-11-19 00:05:20,527 INFO L273 TraceCheckUtils]: 20: Hoare triple {9487#true} assume true; {9487#true} is VALID [2018-11-19 00:05:20,542 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {9487#true} {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} #110#return; {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} is VALID [2018-11-19 00:05:20,557 INFO L273 TraceCheckUtils]: 22: Hoare triple {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} is VALID [2018-11-19 00:05:20,573 INFO L273 TraceCheckUtils]: 23: Hoare triple {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} assume !(0 != #t~nondet5);havoc #t~nondet5; {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} is VALID [2018-11-19 00:05:20,573 INFO L256 TraceCheckUtils]: 24: Hoare triple {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {9487#true} is VALID [2018-11-19 00:05:20,573 INFO L273 TraceCheckUtils]: 25: Hoare triple {9487#true} ~cond := #in~cond; {9487#true} is VALID [2018-11-19 00:05:20,574 INFO L273 TraceCheckUtils]: 26: Hoare triple {9487#true} assume !(0 == ~cond); {9487#true} is VALID [2018-11-19 00:05:20,574 INFO L273 TraceCheckUtils]: 27: Hoare triple {9487#true} assume true; {9487#true} is VALID [2018-11-19 00:05:20,582 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {9487#true} {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} #112#return; {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} is VALID [2018-11-19 00:05:20,586 INFO L256 TraceCheckUtils]: 29: Hoare triple {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {9588#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-19 00:05:20,586 INFO L273 TraceCheckUtils]: 30: Hoare triple {9588#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {9592#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-19 00:05:20,588 INFO L273 TraceCheckUtils]: 31: Hoare triple {9592#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9488#false} is VALID [2018-11-19 00:05:20,588 INFO L273 TraceCheckUtils]: 32: Hoare triple {9488#false} assume !false; {9488#false} is VALID [2018-11-19 00:05:20,591 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-19 00:05:20,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:05:20,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2018-11-19 00:05:20,610 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-11-19 00:05:20,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:05:20,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-19 00:05:20,702 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:05:20,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-19 00:05:20,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-19 00:05:20,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-19 00:05:20,704 INFO L87 Difference]: Start difference. First operand 345 states and 537 transitions. Second operand 13 states. [2018-11-19 00:05:26,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:05:26,612 INFO L93 Difference]: Finished difference Result 570 states and 913 transitions. [2018-11-19 00:05:26,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-19 00:05:26,612 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-11-19 00:05:26,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:05:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-19 00:05:26,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 130 transitions. [2018-11-19 00:05:26,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-19 00:05:26,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 130 transitions. [2018-11-19 00:05:26,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 130 transitions. [2018-11-19 00:05:26,854 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:05:26,876 INFO L225 Difference]: With dead ends: 570 [2018-11-19 00:05:26,876 INFO L226 Difference]: Without dead ends: 568 [2018-11-19 00:05:26,877 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-11-19 00:05:26,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-11-19 00:05:32,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 533. [2018-11-19 00:05:32,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:05:32,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 568 states. Second operand 533 states. [2018-11-19 00:05:32,467 INFO L74 IsIncluded]: Start isIncluded. First operand 568 states. Second operand 533 states. [2018-11-19 00:05:32,467 INFO L87 Difference]: Start difference. First operand 568 states. Second operand 533 states. [2018-11-19 00:05:32,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:05:32,498 INFO L93 Difference]: Finished difference Result 568 states and 911 transitions. [2018-11-19 00:05:32,498 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 911 transitions. [2018-11-19 00:05:32,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:05:32,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:05:32,502 INFO L74 IsIncluded]: Start isIncluded. First operand 533 states. Second operand 568 states. [2018-11-19 00:05:32,503 INFO L87 Difference]: Start difference. First operand 533 states. Second operand 568 states. [2018-11-19 00:05:32,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:05:32,534 INFO L93 Difference]: Finished difference Result 568 states and 911 transitions. [2018-11-19 00:05:32,534 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 911 transitions. [2018-11-19 00:05:32,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:05:32,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:05:32,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:05:32,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:05:32,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-11-19 00:05:32,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 863 transitions. [2018-11-19 00:05:32,570 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 863 transitions. Word has length 33 [2018-11-19 00:05:32,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:05:32,570 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 863 transitions. [2018-11-19 00:05:32,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-19 00:05:32,570 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 863 transitions. [2018-11-19 00:05:32,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-19 00:05:32,572 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:05:32,572 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:05:32,572 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:05:32,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:05:32,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1227502379, now seen corresponding path program 1 times [2018-11-19 00:05:32,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:05:32,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:05:32,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:05:32,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:05:32,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:05:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:05:32,845 INFO L256 TraceCheckUtils]: 0: Hoare triple {12467#true} call ULTIMATE.init(); {12467#true} is VALID [2018-11-19 00:05:32,846 INFO L273 TraceCheckUtils]: 1: Hoare triple {12467#true} assume true; {12467#true} is VALID [2018-11-19 00:05:32,846 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {12467#true} {12467#true} #96#return; {12467#true} is VALID [2018-11-19 00:05:32,846 INFO L256 TraceCheckUtils]: 3: Hoare triple {12467#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {12467#true} is VALID [2018-11-19 00:05:32,846 INFO L273 TraceCheckUtils]: 4: Hoare triple {12467#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {12467#true} is VALID [2018-11-19 00:05:32,847 INFO L273 TraceCheckUtils]: 5: Hoare triple {12467#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {12469#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:05:32,847 INFO L273 TraceCheckUtils]: 6: Hoare triple {12469#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {12469#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:05:32,847 INFO L273 TraceCheckUtils]: 7: Hoare triple {12469#(<= main_~r~0 main_~n~0)} assume true; {12469#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:05:32,848 INFO L273 TraceCheckUtils]: 8: Hoare triple {12469#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {12469#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:05:32,848 INFO L273 TraceCheckUtils]: 9: Hoare triple {12469#(<= main_~r~0 main_~n~0)} assume true; {12469#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:05:32,848 INFO L273 TraceCheckUtils]: 10: Hoare triple {12469#(<= main_~r~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {12469#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:05:32,849 INFO L273 TraceCheckUtils]: 11: Hoare triple {12469#(<= main_~r~0 main_~n~0)} assume ~j~0 < ~r~0; {12470#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-19 00:05:32,849 INFO L256 TraceCheckUtils]: 12: Hoare triple {12470#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {12467#true} is VALID [2018-11-19 00:05:32,849 INFO L273 TraceCheckUtils]: 13: Hoare triple {12467#true} ~cond := #in~cond; {12471#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-19 00:05:32,850 INFO L273 TraceCheckUtils]: 14: Hoare triple {12471#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {12472#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:05:32,850 INFO L273 TraceCheckUtils]: 15: Hoare triple {12472#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12472#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:05:32,851 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {12472#(not (= |__VERIFIER_assert_#in~cond| 0))} {12470#(<= (+ main_~j~0 1) main_~n~0)} #100#return; {12470#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-19 00:05:32,851 INFO L256 TraceCheckUtils]: 17: Hoare triple {12470#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {12467#true} is VALID [2018-11-19 00:05:32,851 INFO L273 TraceCheckUtils]: 18: Hoare triple {12467#true} ~cond := #in~cond; {12467#true} is VALID [2018-11-19 00:05:32,851 INFO L273 TraceCheckUtils]: 19: Hoare triple {12467#true} assume !(0 == ~cond); {12467#true} is VALID [2018-11-19 00:05:32,852 INFO L273 TraceCheckUtils]: 20: Hoare triple {12467#true} assume true; {12467#true} is VALID [2018-11-19 00:05:32,852 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {12467#true} {12470#(<= (+ main_~j~0 1) main_~n~0)} #102#return; {12470#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-19 00:05:32,852 INFO L256 TraceCheckUtils]: 22: Hoare triple {12470#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {12467#true} is VALID [2018-11-19 00:05:32,853 INFO L273 TraceCheckUtils]: 23: Hoare triple {12467#true} ~cond := #in~cond; {12467#true} is VALID [2018-11-19 00:05:32,853 INFO L273 TraceCheckUtils]: 24: Hoare triple {12467#true} assume !(0 == ~cond); {12467#true} is VALID [2018-11-19 00:05:32,853 INFO L273 TraceCheckUtils]: 25: Hoare triple {12467#true} assume true; {12467#true} is VALID [2018-11-19 00:05:32,854 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {12467#true} {12470#(<= (+ main_~j~0 1) main_~n~0)} #104#return; {12470#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-19 00:05:32,854 INFO L256 TraceCheckUtils]: 27: Hoare triple {12470#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {12467#true} is VALID [2018-11-19 00:05:32,854 INFO L273 TraceCheckUtils]: 28: Hoare triple {12467#true} ~cond := #in~cond; {12467#true} is VALID [2018-11-19 00:05:32,854 INFO L273 TraceCheckUtils]: 29: Hoare triple {12467#true} assume !(0 == ~cond); {12467#true} is VALID [2018-11-19 00:05:32,855 INFO L273 TraceCheckUtils]: 30: Hoare triple {12467#true} assume true; {12467#true} is VALID [2018-11-19 00:05:32,855 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {12467#true} {12470#(<= (+ main_~j~0 1) main_~n~0)} #106#return; {12470#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-19 00:05:32,856 INFO L273 TraceCheckUtils]: 32: Hoare triple {12470#(<= (+ main_~j~0 1) main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {12470#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-19 00:05:32,857 INFO L273 TraceCheckUtils]: 33: Hoare triple {12470#(<= (+ main_~j~0 1) main_~n~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {12473#(<= main_~j~0 main_~n~0)} is VALID [2018-11-19 00:05:32,857 INFO L256 TraceCheckUtils]: 34: Hoare triple {12473#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {12467#true} is VALID [2018-11-19 00:05:32,857 INFO L273 TraceCheckUtils]: 35: Hoare triple {12467#true} ~cond := #in~cond; {12467#true} is VALID [2018-11-19 00:05:32,857 INFO L273 TraceCheckUtils]: 36: Hoare triple {12467#true} assume !(0 == ~cond); {12467#true} is VALID [2018-11-19 00:05:32,857 INFO L273 TraceCheckUtils]: 37: Hoare triple {12467#true} assume true; {12467#true} is VALID [2018-11-19 00:05:32,858 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {12467#true} {12473#(<= main_~j~0 main_~n~0)} #108#return; {12473#(<= main_~j~0 main_~n~0)} is VALID [2018-11-19 00:05:32,858 INFO L256 TraceCheckUtils]: 39: Hoare triple {12473#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {12472#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:05:32,858 INFO L273 TraceCheckUtils]: 40: Hoare triple {12472#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {12474#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-19 00:05:32,859 INFO L273 TraceCheckUtils]: 41: Hoare triple {12474#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12468#false} is VALID [2018-11-19 00:05:32,859 INFO L273 TraceCheckUtils]: 42: Hoare triple {12468#false} assume !false; {12468#false} is VALID [2018-11-19 00:05:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-19 00:05:32,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:05:32,861 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:05:32,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:05:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:05:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:05:32,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:05:32,993 INFO L256 TraceCheckUtils]: 0: Hoare triple {12467#true} call ULTIMATE.init(); {12467#true} is VALID [2018-11-19 00:05:32,993 INFO L273 TraceCheckUtils]: 1: Hoare triple {12467#true} assume true; {12467#true} is VALID [2018-11-19 00:05:32,993 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {12467#true} {12467#true} #96#return; {12467#true} is VALID [2018-11-19 00:05:32,993 INFO L256 TraceCheckUtils]: 3: Hoare triple {12467#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {12467#true} is VALID [2018-11-19 00:05:32,994 INFO L273 TraceCheckUtils]: 4: Hoare triple {12467#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {12467#true} is VALID [2018-11-19 00:05:32,995 INFO L273 TraceCheckUtils]: 5: Hoare triple {12467#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {12469#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:05:32,995 INFO L273 TraceCheckUtils]: 6: Hoare triple {12469#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {12469#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:05:32,996 INFO L273 TraceCheckUtils]: 7: Hoare triple {12469#(<= main_~r~0 main_~n~0)} assume true; {12469#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:05:32,996 INFO L273 TraceCheckUtils]: 8: Hoare triple {12469#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {12469#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:05:32,997 INFO L273 TraceCheckUtils]: 9: Hoare triple {12469#(<= main_~r~0 main_~n~0)} assume true; {12469#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:05:32,997 INFO L273 TraceCheckUtils]: 10: Hoare triple {12469#(<= main_~r~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {12469#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:05:32,998 INFO L273 TraceCheckUtils]: 11: Hoare triple {12469#(<= main_~r~0 main_~n~0)} assume ~j~0 < ~r~0; {12470#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-19 00:05:32,998 INFO L256 TraceCheckUtils]: 12: Hoare triple {12470#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {12467#true} is VALID [2018-11-19 00:05:32,999 INFO L273 TraceCheckUtils]: 13: Hoare triple {12467#true} ~cond := #in~cond; {12467#true} is VALID [2018-11-19 00:05:32,999 INFO L273 TraceCheckUtils]: 14: Hoare triple {12467#true} assume !(0 == ~cond); {12467#true} is VALID [2018-11-19 00:05:32,999 INFO L273 TraceCheckUtils]: 15: Hoare triple {12467#true} assume true; {12467#true} is VALID [2018-11-19 00:05:33,003 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {12467#true} {12470#(<= (+ main_~j~0 1) main_~n~0)} #100#return; {12470#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-19 00:05:33,003 INFO L256 TraceCheckUtils]: 17: Hoare triple {12470#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {12467#true} is VALID [2018-11-19 00:05:33,004 INFO L273 TraceCheckUtils]: 18: Hoare triple {12467#true} ~cond := #in~cond; {12467#true} is VALID [2018-11-19 00:05:33,004 INFO L273 TraceCheckUtils]: 19: Hoare triple {12467#true} assume !(0 == ~cond); {12467#true} is VALID [2018-11-19 00:05:33,004 INFO L273 TraceCheckUtils]: 20: Hoare triple {12467#true} assume true; {12467#true} is VALID [2018-11-19 00:05:33,009 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {12467#true} {12470#(<= (+ main_~j~0 1) main_~n~0)} #102#return; {12470#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-19 00:05:33,010 INFO L256 TraceCheckUtils]: 22: Hoare triple {12470#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {12467#true} is VALID [2018-11-19 00:05:33,010 INFO L273 TraceCheckUtils]: 23: Hoare triple {12467#true} ~cond := #in~cond; {12467#true} is VALID [2018-11-19 00:05:33,010 INFO L273 TraceCheckUtils]: 24: Hoare triple {12467#true} assume !(0 == ~cond); {12467#true} is VALID [2018-11-19 00:05:33,010 INFO L273 TraceCheckUtils]: 25: Hoare triple {12467#true} assume true; {12467#true} is VALID [2018-11-19 00:05:33,011 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {12467#true} {12470#(<= (+ main_~j~0 1) main_~n~0)} #104#return; {12470#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-19 00:05:33,011 INFO L256 TraceCheckUtils]: 27: Hoare triple {12470#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {12467#true} is VALID [2018-11-19 00:05:33,011 INFO L273 TraceCheckUtils]: 28: Hoare triple {12467#true} ~cond := #in~cond; {12467#true} is VALID [2018-11-19 00:05:33,011 INFO L273 TraceCheckUtils]: 29: Hoare triple {12467#true} assume !(0 == ~cond); {12467#true} is VALID [2018-11-19 00:05:33,011 INFO L273 TraceCheckUtils]: 30: Hoare triple {12467#true} assume true; {12467#true} is VALID [2018-11-19 00:05:33,012 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {12467#true} {12470#(<= (+ main_~j~0 1) main_~n~0)} #106#return; {12470#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-19 00:05:33,012 INFO L273 TraceCheckUtils]: 32: Hoare triple {12470#(<= (+ main_~j~0 1) main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {12470#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-19 00:05:33,013 INFO L273 TraceCheckUtils]: 33: Hoare triple {12470#(<= (+ main_~j~0 1) main_~n~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {12473#(<= main_~j~0 main_~n~0)} is VALID [2018-11-19 00:05:33,013 INFO L256 TraceCheckUtils]: 34: Hoare triple {12473#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {12467#true} is VALID [2018-11-19 00:05:33,013 INFO L273 TraceCheckUtils]: 35: Hoare triple {12467#true} ~cond := #in~cond; {12467#true} is VALID [2018-11-19 00:05:33,013 INFO L273 TraceCheckUtils]: 36: Hoare triple {12467#true} assume !(0 == ~cond); {12467#true} is VALID [2018-11-19 00:05:33,014 INFO L273 TraceCheckUtils]: 37: Hoare triple {12467#true} assume true; {12467#true} is VALID [2018-11-19 00:05:33,014 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {12467#true} {12473#(<= main_~j~0 main_~n~0)} #108#return; {12473#(<= main_~j~0 main_~n~0)} is VALID [2018-11-19 00:05:33,014 INFO L256 TraceCheckUtils]: 39: Hoare triple {12473#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {12595#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-19 00:05:33,015 INFO L273 TraceCheckUtils]: 40: Hoare triple {12595#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {12599#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-19 00:05:33,015 INFO L273 TraceCheckUtils]: 41: Hoare triple {12599#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12468#false} is VALID [2018-11-19 00:05:33,015 INFO L273 TraceCheckUtils]: 42: Hoare triple {12468#false} assume !false; {12468#false} is VALID [2018-11-19 00:05:33,017 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-19 00:05:33,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:05:33,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 10 [2018-11-19 00:05:33,036 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-11-19 00:05:33,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:05:33,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-19 00:05:33,075 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:05:33,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-19 00:05:33,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-19 00:05:33,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-19 00:05:33,076 INFO L87 Difference]: Start difference. First operand 533 states and 863 transitions. Second operand 10 states. [2018-11-19 00:05:42,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:05:42,453 INFO L93 Difference]: Finished difference Result 609 states and 972 transitions. [2018-11-19 00:05:42,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-19 00:05:42,453 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-11-19 00:05:42,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:05:42,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-19 00:05:42,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2018-11-19 00:05:42,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-19 00:05:42,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2018-11-19 00:05:42,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 108 transitions. [2018-11-19 00:05:42,601 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:05:42,626 INFO L225 Difference]: With dead ends: 609 [2018-11-19 00:05:42,627 INFO L226 Difference]: Without dead ends: 607 [2018-11-19 00:05:42,627 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-11-19 00:05:42,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-11-19 00:05:47,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 537. [2018-11-19 00:05:47,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:05:47,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 607 states. Second operand 537 states. [2018-11-19 00:05:47,113 INFO L74 IsIncluded]: Start isIncluded. First operand 607 states. Second operand 537 states. [2018-11-19 00:05:47,113 INFO L87 Difference]: Start difference. First operand 607 states. Second operand 537 states. [2018-11-19 00:05:47,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:05:47,146 INFO L93 Difference]: Finished difference Result 607 states and 970 transitions. [2018-11-19 00:05:47,146 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 970 transitions. [2018-11-19 00:05:47,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:05:47,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:05:47,149 INFO L74 IsIncluded]: Start isIncluded. First operand 537 states. Second operand 607 states. [2018-11-19 00:05:47,150 INFO L87 Difference]: Start difference. First operand 537 states. Second operand 607 states. [2018-11-19 00:05:47,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:05:47,184 INFO L93 Difference]: Finished difference Result 607 states and 970 transitions. [2018-11-19 00:05:47,185 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 970 transitions. [2018-11-19 00:05:47,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:05:47,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:05:47,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:05:47,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:05:47,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-11-19 00:05:47,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 866 transitions. [2018-11-19 00:05:47,219 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 866 transitions. Word has length 43 [2018-11-19 00:05:47,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:05:47,219 INFO L480 AbstractCegarLoop]: Abstraction has 537 states and 866 transitions. [2018-11-19 00:05:47,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-19 00:05:47,219 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 866 transitions. [2018-11-19 00:05:47,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-19 00:05:47,221 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:05:47,221 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:05:47,221 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:05:47,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:05:47,222 INFO L82 PathProgramCache]: Analyzing trace with hash 351208904, now seen corresponding path program 1 times [2018-11-19 00:05:47,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:05:47,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:05:47,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:05:47,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:05:47,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:05:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:05:47,577 INFO L256 TraceCheckUtils]: 0: Hoare triple {15609#true} call ULTIMATE.init(); {15609#true} is VALID [2018-11-19 00:05:47,577 INFO L273 TraceCheckUtils]: 1: Hoare triple {15609#true} assume true; {15609#true} is VALID [2018-11-19 00:05:47,577 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {15609#true} {15609#true} #96#return; {15609#true} is VALID [2018-11-19 00:05:47,578 INFO L256 TraceCheckUtils]: 3: Hoare triple {15609#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {15609#true} is VALID [2018-11-19 00:05:47,578 INFO L273 TraceCheckUtils]: 4: Hoare triple {15609#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {15609#true} is VALID [2018-11-19 00:05:47,578 INFO L273 TraceCheckUtils]: 5: Hoare triple {15609#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {15609#true} is VALID [2018-11-19 00:05:47,578 INFO L273 TraceCheckUtils]: 6: Hoare triple {15609#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {15609#true} is VALID [2018-11-19 00:05:47,578 INFO L273 TraceCheckUtils]: 7: Hoare triple {15609#true} assume true; {15609#true} is VALID [2018-11-19 00:05:47,578 INFO L273 TraceCheckUtils]: 8: Hoare triple {15609#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {15609#true} is VALID [2018-11-19 00:05:47,578 INFO L273 TraceCheckUtils]: 9: Hoare triple {15609#true} assume true; {15609#true} is VALID [2018-11-19 00:05:47,579 INFO L273 TraceCheckUtils]: 10: Hoare triple {15609#true} assume !(~j~0 <= ~r~0); {15609#true} is VALID [2018-11-19 00:05:47,580 INFO L273 TraceCheckUtils]: 11: Hoare triple {15609#true} assume ~l~0 > 1; {15611#(<= 2 main_~l~0)} is VALID [2018-11-19 00:05:47,580 INFO L256 TraceCheckUtils]: 12: Hoare triple {15611#(<= 2 main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {15609#true} is VALID [2018-11-19 00:05:47,580 INFO L273 TraceCheckUtils]: 13: Hoare triple {15609#true} ~cond := #in~cond; {15612#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-19 00:05:47,582 INFO L273 TraceCheckUtils]: 14: Hoare triple {15612#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {15613#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:05:47,582 INFO L273 TraceCheckUtils]: 15: Hoare triple {15613#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15613#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:05:47,584 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {15613#(not (= |__VERIFIER_assert_#in~cond| 0))} {15611#(<= 2 main_~l~0)} #120#return; {15611#(<= 2 main_~l~0)} is VALID [2018-11-19 00:05:47,584 INFO L256 TraceCheckUtils]: 17: Hoare triple {15611#(<= 2 main_~l~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {15609#true} is VALID [2018-11-19 00:05:47,584 INFO L273 TraceCheckUtils]: 18: Hoare triple {15609#true} ~cond := #in~cond; {15609#true} is VALID [2018-11-19 00:05:47,584 INFO L273 TraceCheckUtils]: 19: Hoare triple {15609#true} assume !(0 == ~cond); {15609#true} is VALID [2018-11-19 00:05:47,584 INFO L273 TraceCheckUtils]: 20: Hoare triple {15609#true} assume true; {15609#true} is VALID [2018-11-19 00:05:47,586 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {15609#true} {15611#(<= 2 main_~l~0)} #122#return; {15611#(<= 2 main_~l~0)} is VALID [2018-11-19 00:05:47,586 INFO L273 TraceCheckUtils]: 22: Hoare triple {15611#(<= 2 main_~l~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {15614#(<= 1 main_~l~0)} is VALID [2018-11-19 00:05:47,599 INFO L273 TraceCheckUtils]: 23: Hoare triple {15614#(<= 1 main_~l~0)} assume true; {15614#(<= 1 main_~l~0)} is VALID [2018-11-19 00:05:47,600 INFO L273 TraceCheckUtils]: 24: Hoare triple {15614#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {15615#(<= 1 main_~i~0)} is VALID [2018-11-19 00:05:47,601 INFO L273 TraceCheckUtils]: 25: Hoare triple {15615#(<= 1 main_~i~0)} assume true; {15615#(<= 1 main_~i~0)} is VALID [2018-11-19 00:05:47,604 INFO L273 TraceCheckUtils]: 26: Hoare triple {15615#(<= 1 main_~i~0)} assume !!(~j~0 <= ~r~0); {15615#(<= 1 main_~i~0)} is VALID [2018-11-19 00:05:47,604 INFO L273 TraceCheckUtils]: 27: Hoare triple {15615#(<= 1 main_~i~0)} assume !(~j~0 < ~r~0); {15615#(<= 1 main_~i~0)} is VALID [2018-11-19 00:05:47,604 INFO L256 TraceCheckUtils]: 28: Hoare triple {15615#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {15609#true} is VALID [2018-11-19 00:05:47,604 INFO L273 TraceCheckUtils]: 29: Hoare triple {15609#true} ~cond := #in~cond; {15609#true} is VALID [2018-11-19 00:05:47,604 INFO L273 TraceCheckUtils]: 30: Hoare triple {15609#true} assume !(0 == ~cond); {15609#true} is VALID [2018-11-19 00:05:47,605 INFO L273 TraceCheckUtils]: 31: Hoare triple {15609#true} assume true; {15609#true} is VALID [2018-11-19 00:05:47,605 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {15609#true} {15615#(<= 1 main_~i~0)} #108#return; {15615#(<= 1 main_~i~0)} is VALID [2018-11-19 00:05:47,605 INFO L256 TraceCheckUtils]: 33: Hoare triple {15615#(<= 1 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {15609#true} is VALID [2018-11-19 00:05:47,605 INFO L273 TraceCheckUtils]: 34: Hoare triple {15609#true} ~cond := #in~cond; {15609#true} is VALID [2018-11-19 00:05:47,605 INFO L273 TraceCheckUtils]: 35: Hoare triple {15609#true} assume !(0 == ~cond); {15609#true} is VALID [2018-11-19 00:05:47,605 INFO L273 TraceCheckUtils]: 36: Hoare triple {15609#true} assume true; {15609#true} is VALID [2018-11-19 00:05:47,606 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {15609#true} {15615#(<= 1 main_~i~0)} #110#return; {15615#(<= 1 main_~i~0)} is VALID [2018-11-19 00:05:47,606 INFO L273 TraceCheckUtils]: 38: Hoare triple {15615#(<= 1 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {15615#(<= 1 main_~i~0)} is VALID [2018-11-19 00:05:47,607 INFO L273 TraceCheckUtils]: 39: Hoare triple {15615#(<= 1 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {15615#(<= 1 main_~i~0)} is VALID [2018-11-19 00:05:47,607 INFO L256 TraceCheckUtils]: 40: Hoare triple {15615#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {15613#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:05:47,608 INFO L273 TraceCheckUtils]: 41: Hoare triple {15613#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {15616#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-19 00:05:47,608 INFO L273 TraceCheckUtils]: 42: Hoare triple {15616#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {15610#false} is VALID [2018-11-19 00:05:47,608 INFO L273 TraceCheckUtils]: 43: Hoare triple {15610#false} assume !false; {15610#false} is VALID [2018-11-19 00:05:47,610 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-19 00:05:47,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:05:47,610 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:05:47,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:05:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:05:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:05:47,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:05:47,725 INFO L256 TraceCheckUtils]: 0: Hoare triple {15609#true} call ULTIMATE.init(); {15609#true} is VALID [2018-11-19 00:05:47,725 INFO L273 TraceCheckUtils]: 1: Hoare triple {15609#true} assume true; {15609#true} is VALID [2018-11-19 00:05:47,725 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {15609#true} {15609#true} #96#return; {15609#true} is VALID [2018-11-19 00:05:47,726 INFO L256 TraceCheckUtils]: 3: Hoare triple {15609#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {15609#true} is VALID [2018-11-19 00:05:47,726 INFO L273 TraceCheckUtils]: 4: Hoare triple {15609#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {15609#true} is VALID [2018-11-19 00:05:47,726 INFO L273 TraceCheckUtils]: 5: Hoare triple {15609#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {15609#true} is VALID [2018-11-19 00:05:47,726 INFO L273 TraceCheckUtils]: 6: Hoare triple {15609#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {15609#true} is VALID [2018-11-19 00:05:47,727 INFO L273 TraceCheckUtils]: 7: Hoare triple {15609#true} assume true; {15609#true} is VALID [2018-11-19 00:05:47,727 INFO L273 TraceCheckUtils]: 8: Hoare triple {15609#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {15609#true} is VALID [2018-11-19 00:05:47,727 INFO L273 TraceCheckUtils]: 9: Hoare triple {15609#true} assume true; {15609#true} is VALID [2018-11-19 00:05:47,727 INFO L273 TraceCheckUtils]: 10: Hoare triple {15609#true} assume !(~j~0 <= ~r~0); {15609#true} is VALID [2018-11-19 00:05:47,728 INFO L273 TraceCheckUtils]: 11: Hoare triple {15609#true} assume ~l~0 > 1; {15611#(<= 2 main_~l~0)} is VALID [2018-11-19 00:05:47,728 INFO L256 TraceCheckUtils]: 12: Hoare triple {15611#(<= 2 main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {15609#true} is VALID [2018-11-19 00:05:47,728 INFO L273 TraceCheckUtils]: 13: Hoare triple {15609#true} ~cond := #in~cond; {15609#true} is VALID [2018-11-19 00:05:47,728 INFO L273 TraceCheckUtils]: 14: Hoare triple {15609#true} assume !(0 == ~cond); {15609#true} is VALID [2018-11-19 00:05:47,728 INFO L273 TraceCheckUtils]: 15: Hoare triple {15609#true} assume true; {15609#true} is VALID [2018-11-19 00:05:47,729 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {15609#true} {15611#(<= 2 main_~l~0)} #120#return; {15611#(<= 2 main_~l~0)} is VALID [2018-11-19 00:05:47,729 INFO L256 TraceCheckUtils]: 17: Hoare triple {15611#(<= 2 main_~l~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {15609#true} is VALID [2018-11-19 00:05:47,729 INFO L273 TraceCheckUtils]: 18: Hoare triple {15609#true} ~cond := #in~cond; {15609#true} is VALID [2018-11-19 00:05:47,729 INFO L273 TraceCheckUtils]: 19: Hoare triple {15609#true} assume !(0 == ~cond); {15609#true} is VALID [2018-11-19 00:05:47,729 INFO L273 TraceCheckUtils]: 20: Hoare triple {15609#true} assume true; {15609#true} is VALID [2018-11-19 00:05:47,730 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {15609#true} {15611#(<= 2 main_~l~0)} #122#return; {15611#(<= 2 main_~l~0)} is VALID [2018-11-19 00:05:47,730 INFO L273 TraceCheckUtils]: 22: Hoare triple {15611#(<= 2 main_~l~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {15614#(<= 1 main_~l~0)} is VALID [2018-11-19 00:05:47,731 INFO L273 TraceCheckUtils]: 23: Hoare triple {15614#(<= 1 main_~l~0)} assume true; {15614#(<= 1 main_~l~0)} is VALID [2018-11-19 00:05:47,731 INFO L273 TraceCheckUtils]: 24: Hoare triple {15614#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {15615#(<= 1 main_~i~0)} is VALID [2018-11-19 00:05:47,732 INFO L273 TraceCheckUtils]: 25: Hoare triple {15615#(<= 1 main_~i~0)} assume true; {15615#(<= 1 main_~i~0)} is VALID [2018-11-19 00:05:47,732 INFO L273 TraceCheckUtils]: 26: Hoare triple {15615#(<= 1 main_~i~0)} assume !!(~j~0 <= ~r~0); {15615#(<= 1 main_~i~0)} is VALID [2018-11-19 00:05:47,733 INFO L273 TraceCheckUtils]: 27: Hoare triple {15615#(<= 1 main_~i~0)} assume !(~j~0 < ~r~0); {15615#(<= 1 main_~i~0)} is VALID [2018-11-19 00:05:47,733 INFO L256 TraceCheckUtils]: 28: Hoare triple {15615#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {15609#true} is VALID [2018-11-19 00:05:47,733 INFO L273 TraceCheckUtils]: 29: Hoare triple {15609#true} ~cond := #in~cond; {15609#true} is VALID [2018-11-19 00:05:47,734 INFO L273 TraceCheckUtils]: 30: Hoare triple {15609#true} assume !(0 == ~cond); {15609#true} is VALID [2018-11-19 00:05:47,734 INFO L273 TraceCheckUtils]: 31: Hoare triple {15609#true} assume true; {15609#true} is VALID [2018-11-19 00:05:47,734 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {15609#true} {15615#(<= 1 main_~i~0)} #108#return; {15615#(<= 1 main_~i~0)} is VALID [2018-11-19 00:05:47,735 INFO L256 TraceCheckUtils]: 33: Hoare triple {15615#(<= 1 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {15609#true} is VALID [2018-11-19 00:05:47,735 INFO L273 TraceCheckUtils]: 34: Hoare triple {15609#true} ~cond := #in~cond; {15609#true} is VALID [2018-11-19 00:05:47,735 INFO L273 TraceCheckUtils]: 35: Hoare triple {15609#true} assume !(0 == ~cond); {15609#true} is VALID [2018-11-19 00:05:47,735 INFO L273 TraceCheckUtils]: 36: Hoare triple {15609#true} assume true; {15609#true} is VALID [2018-11-19 00:05:47,736 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {15609#true} {15615#(<= 1 main_~i~0)} #110#return; {15615#(<= 1 main_~i~0)} is VALID [2018-11-19 00:05:47,736 INFO L273 TraceCheckUtils]: 38: Hoare triple {15615#(<= 1 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {15615#(<= 1 main_~i~0)} is VALID [2018-11-19 00:05:47,737 INFO L273 TraceCheckUtils]: 39: Hoare triple {15615#(<= 1 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {15615#(<= 1 main_~i~0)} is VALID [2018-11-19 00:05:47,738 INFO L256 TraceCheckUtils]: 40: Hoare triple {15615#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {15740#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-19 00:05:47,738 INFO L273 TraceCheckUtils]: 41: Hoare triple {15740#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {15744#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-19 00:05:47,738 INFO L273 TraceCheckUtils]: 42: Hoare triple {15744#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15610#false} is VALID [2018-11-19 00:05:47,739 INFO L273 TraceCheckUtils]: 43: Hoare triple {15610#false} assume !false; {15610#false} is VALID [2018-11-19 00:05:47,740 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-19 00:05:47,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:05:47,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 10 [2018-11-19 00:05:47,759 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-11-19 00:05:47,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:05:47,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-19 00:05:47,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:05:47,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-19 00:05:47,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-19 00:05:47,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-19 00:05:47,796 INFO L87 Difference]: Start difference. First operand 537 states and 866 transitions. Second operand 10 states. [2018-11-19 00:05:53,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:05:53,752 INFO L93 Difference]: Finished difference Result 573 states and 918 transitions. [2018-11-19 00:05:53,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-19 00:05:53,753 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-11-19 00:05:53,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:05:53,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-19 00:05:53,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2018-11-19 00:05:53,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-19 00:05:53,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2018-11-19 00:05:53,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 103 transitions. [2018-11-19 00:05:53,884 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:05:53,911 INFO L225 Difference]: With dead ends: 573 [2018-11-19 00:05:53,911 INFO L226 Difference]: Without dead ends: 571 [2018-11-19 00:05:53,912 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-11-19 00:05:53,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-11-19 00:05:59,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 541. [2018-11-19 00:05:59,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:05:59,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 571 states. Second operand 541 states. [2018-11-19 00:05:59,087 INFO L74 IsIncluded]: Start isIncluded. First operand 571 states. Second operand 541 states. [2018-11-19 00:05:59,087 INFO L87 Difference]: Start difference. First operand 571 states. Second operand 541 states. [2018-11-19 00:05:59,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:05:59,114 INFO L93 Difference]: Finished difference Result 571 states and 916 transitions. [2018-11-19 00:05:59,114 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 916 transitions. [2018-11-19 00:05:59,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:05:59,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:05:59,116 INFO L74 IsIncluded]: Start isIncluded. First operand 541 states. Second operand 571 states. [2018-11-19 00:05:59,116 INFO L87 Difference]: Start difference. First operand 541 states. Second operand 571 states. [2018-11-19 00:05:59,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:05:59,147 INFO L93 Difference]: Finished difference Result 571 states and 916 transitions. [2018-11-19 00:05:59,147 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 916 transitions. [2018-11-19 00:05:59,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:05:59,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:05:59,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:05:59,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:05:59,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2018-11-19 00:05:59,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 869 transitions. [2018-11-19 00:05:59,176 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 869 transitions. Word has length 44 [2018-11-19 00:05:59,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:05:59,176 INFO L480 AbstractCegarLoop]: Abstraction has 541 states and 869 transitions. [2018-11-19 00:05:59,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-19 00:05:59,176 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 869 transitions. [2018-11-19 00:05:59,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-19 00:05:59,178 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:05:59,178 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:05:59,178 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:05:59,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:05:59,179 INFO L82 PathProgramCache]: Analyzing trace with hash 506108398, now seen corresponding path program 1 times [2018-11-19 00:05:59,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:05:59,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:05:59,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:05:59,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:05:59,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:05:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:05:59,380 INFO L256 TraceCheckUtils]: 0: Hoare triple {18641#true} call ULTIMATE.init(); {18641#true} is VALID [2018-11-19 00:05:59,380 INFO L273 TraceCheckUtils]: 1: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-19 00:05:59,380 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {18641#true} {18641#true} #96#return; {18641#true} is VALID [2018-11-19 00:05:59,380 INFO L256 TraceCheckUtils]: 3: Hoare triple {18641#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {18641#true} is VALID [2018-11-19 00:05:59,381 INFO L273 TraceCheckUtils]: 4: Hoare triple {18641#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {18641#true} is VALID [2018-11-19 00:05:59,381 INFO L273 TraceCheckUtils]: 5: Hoare triple {18641#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {18641#true} is VALID [2018-11-19 00:05:59,381 INFO L273 TraceCheckUtils]: 6: Hoare triple {18641#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {18641#true} is VALID [2018-11-19 00:05:59,381 INFO L273 TraceCheckUtils]: 7: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-19 00:05:59,382 INFO L273 TraceCheckUtils]: 8: Hoare triple {18641#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {18641#true} is VALID [2018-11-19 00:05:59,382 INFO L273 TraceCheckUtils]: 9: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-19 00:05:59,382 INFO L273 TraceCheckUtils]: 10: Hoare triple {18641#true} assume !!(~j~0 <= ~r~0); {18641#true} is VALID [2018-11-19 00:05:59,382 INFO L273 TraceCheckUtils]: 11: Hoare triple {18641#true} assume !(~j~0 < ~r~0); {18641#true} is VALID [2018-11-19 00:05:59,382 INFO L256 TraceCheckUtils]: 12: Hoare triple {18641#true} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {18641#true} is VALID [2018-11-19 00:05:59,383 INFO L273 TraceCheckUtils]: 13: Hoare triple {18641#true} ~cond := #in~cond; {18643#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-19 00:05:59,383 INFO L273 TraceCheckUtils]: 14: Hoare triple {18643#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {18644#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:05:59,383 INFO L273 TraceCheckUtils]: 15: Hoare triple {18644#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18644#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:05:59,384 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {18644#(not (= |__VERIFIER_assert_#in~cond| 0))} {18641#true} #108#return; {18645#(<= 1 main_~j~0)} is VALID [2018-11-19 00:05:59,384 INFO L256 TraceCheckUtils]: 17: Hoare triple {18645#(<= 1 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {18641#true} is VALID [2018-11-19 00:05:59,384 INFO L273 TraceCheckUtils]: 18: Hoare triple {18641#true} ~cond := #in~cond; {18641#true} is VALID [2018-11-19 00:05:59,384 INFO L273 TraceCheckUtils]: 19: Hoare triple {18641#true} assume !(0 == ~cond); {18641#true} is VALID [2018-11-19 00:05:59,385 INFO L273 TraceCheckUtils]: 20: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-19 00:05:59,385 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {18641#true} {18645#(<= 1 main_~j~0)} #110#return; {18645#(<= 1 main_~j~0)} is VALID [2018-11-19 00:05:59,385 INFO L273 TraceCheckUtils]: 22: Hoare triple {18645#(<= 1 main_~j~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {18645#(<= 1 main_~j~0)} is VALID [2018-11-19 00:05:59,386 INFO L273 TraceCheckUtils]: 23: Hoare triple {18645#(<= 1 main_~j~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {18645#(<= 1 main_~j~0)} is VALID [2018-11-19 00:05:59,386 INFO L256 TraceCheckUtils]: 24: Hoare triple {18645#(<= 1 main_~j~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {18641#true} is VALID [2018-11-19 00:05:59,386 INFO L273 TraceCheckUtils]: 25: Hoare triple {18641#true} ~cond := #in~cond; {18641#true} is VALID [2018-11-19 00:05:59,386 INFO L273 TraceCheckUtils]: 26: Hoare triple {18641#true} assume !(0 == ~cond); {18641#true} is VALID [2018-11-19 00:05:59,386 INFO L273 TraceCheckUtils]: 27: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-19 00:05:59,387 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {18641#true} {18645#(<= 1 main_~j~0)} #112#return; {18645#(<= 1 main_~j~0)} is VALID [2018-11-19 00:05:59,387 INFO L256 TraceCheckUtils]: 29: Hoare triple {18645#(<= 1 main_~j~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {18641#true} is VALID [2018-11-19 00:05:59,387 INFO L273 TraceCheckUtils]: 30: Hoare triple {18641#true} ~cond := #in~cond; {18641#true} is VALID [2018-11-19 00:05:59,387 INFO L273 TraceCheckUtils]: 31: Hoare triple {18641#true} assume !(0 == ~cond); {18641#true} is VALID [2018-11-19 00:05:59,387 INFO L273 TraceCheckUtils]: 32: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-19 00:05:59,388 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {18641#true} {18645#(<= 1 main_~j~0)} #114#return; {18645#(<= 1 main_~j~0)} is VALID [2018-11-19 00:05:59,388 INFO L256 TraceCheckUtils]: 34: Hoare triple {18645#(<= 1 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {18641#true} is VALID [2018-11-19 00:05:59,388 INFO L273 TraceCheckUtils]: 35: Hoare triple {18641#true} ~cond := #in~cond; {18641#true} is VALID [2018-11-19 00:05:59,388 INFO L273 TraceCheckUtils]: 36: Hoare triple {18641#true} assume !(0 == ~cond); {18641#true} is VALID [2018-11-19 00:05:59,388 INFO L273 TraceCheckUtils]: 37: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-19 00:05:59,388 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {18641#true} {18645#(<= 1 main_~j~0)} #116#return; {18645#(<= 1 main_~j~0)} is VALID [2018-11-19 00:05:59,389 INFO L256 TraceCheckUtils]: 39: Hoare triple {18645#(<= 1 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {18641#true} is VALID [2018-11-19 00:05:59,389 INFO L273 TraceCheckUtils]: 40: Hoare triple {18641#true} ~cond := #in~cond; {18641#true} is VALID [2018-11-19 00:05:59,389 INFO L273 TraceCheckUtils]: 41: Hoare triple {18641#true} assume !(0 == ~cond); {18641#true} is VALID [2018-11-19 00:05:59,389 INFO L273 TraceCheckUtils]: 42: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-19 00:05:59,389 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {18641#true} {18645#(<= 1 main_~j~0)} #118#return; {18645#(<= 1 main_~j~0)} is VALID [2018-11-19 00:05:59,390 INFO L273 TraceCheckUtils]: 44: Hoare triple {18645#(<= 1 main_~j~0)} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {18646#(<= 1 main_~i~0)} is VALID [2018-11-19 00:05:59,390 INFO L273 TraceCheckUtils]: 45: Hoare triple {18646#(<= 1 main_~i~0)} assume true; {18646#(<= 1 main_~i~0)} is VALID [2018-11-19 00:05:59,391 INFO L273 TraceCheckUtils]: 46: Hoare triple {18646#(<= 1 main_~i~0)} assume !!(~j~0 <= ~r~0); {18646#(<= 1 main_~i~0)} is VALID [2018-11-19 00:05:59,391 INFO L273 TraceCheckUtils]: 47: Hoare triple {18646#(<= 1 main_~i~0)} assume !(~j~0 < ~r~0); {18646#(<= 1 main_~i~0)} is VALID [2018-11-19 00:05:59,391 INFO L256 TraceCheckUtils]: 48: Hoare triple {18646#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {18641#true} is VALID [2018-11-19 00:05:59,392 INFO L273 TraceCheckUtils]: 49: Hoare triple {18641#true} ~cond := #in~cond; {18641#true} is VALID [2018-11-19 00:05:59,392 INFO L273 TraceCheckUtils]: 50: Hoare triple {18641#true} assume !(0 == ~cond); {18641#true} is VALID [2018-11-19 00:05:59,392 INFO L273 TraceCheckUtils]: 51: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-19 00:05:59,393 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {18641#true} {18646#(<= 1 main_~i~0)} #108#return; {18646#(<= 1 main_~i~0)} is VALID [2018-11-19 00:05:59,393 INFO L256 TraceCheckUtils]: 53: Hoare triple {18646#(<= 1 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {18641#true} is VALID [2018-11-19 00:05:59,393 INFO L273 TraceCheckUtils]: 54: Hoare triple {18641#true} ~cond := #in~cond; {18641#true} is VALID [2018-11-19 00:05:59,394 INFO L273 TraceCheckUtils]: 55: Hoare triple {18641#true} assume !(0 == ~cond); {18641#true} is VALID [2018-11-19 00:05:59,394 INFO L273 TraceCheckUtils]: 56: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-19 00:05:59,395 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {18641#true} {18646#(<= 1 main_~i~0)} #110#return; {18646#(<= 1 main_~i~0)} is VALID [2018-11-19 00:05:59,395 INFO L273 TraceCheckUtils]: 58: Hoare triple {18646#(<= 1 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {18646#(<= 1 main_~i~0)} is VALID [2018-11-19 00:05:59,395 INFO L273 TraceCheckUtils]: 59: Hoare triple {18646#(<= 1 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {18646#(<= 1 main_~i~0)} is VALID [2018-11-19 00:05:59,396 INFO L256 TraceCheckUtils]: 60: Hoare triple {18646#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {18644#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:05:59,396 INFO L273 TraceCheckUtils]: 61: Hoare triple {18644#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {18647#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-19 00:05:59,397 INFO L273 TraceCheckUtils]: 62: Hoare triple {18647#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {18642#false} is VALID [2018-11-19 00:05:59,397 INFO L273 TraceCheckUtils]: 63: Hoare triple {18642#false} assume !false; {18642#false} is VALID [2018-11-19 00:05:59,400 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 19 proven. 26 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-19 00:05:59,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:05:59,400 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:05:59,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:05:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:05:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:05:59,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:05:59,952 INFO L256 TraceCheckUtils]: 0: Hoare triple {18641#true} call ULTIMATE.init(); {18641#true} is VALID [2018-11-19 00:05:59,952 INFO L273 TraceCheckUtils]: 1: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-19 00:05:59,952 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {18641#true} {18641#true} #96#return; {18641#true} is VALID [2018-11-19 00:05:59,952 INFO L256 TraceCheckUtils]: 3: Hoare triple {18641#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {18641#true} is VALID [2018-11-19 00:05:59,953 INFO L273 TraceCheckUtils]: 4: Hoare triple {18641#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {18641#true} is VALID [2018-11-19 00:05:59,953 INFO L273 TraceCheckUtils]: 5: Hoare triple {18641#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {18641#true} is VALID [2018-11-19 00:05:59,954 INFO L273 TraceCheckUtils]: 6: Hoare triple {18641#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {18669#(<= 1 main_~l~0)} is VALID [2018-11-19 00:05:59,954 INFO L273 TraceCheckUtils]: 7: Hoare triple {18669#(<= 1 main_~l~0)} assume true; {18669#(<= 1 main_~l~0)} is VALID [2018-11-19 00:05:59,955 INFO L273 TraceCheckUtils]: 8: Hoare triple {18669#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {18676#(exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0)))} is VALID [2018-11-19 00:05:59,955 INFO L273 TraceCheckUtils]: 9: Hoare triple {18676#(exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0)))} assume true; {18676#(exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0)))} is VALID [2018-11-19 00:05:59,956 INFO L273 TraceCheckUtils]: 10: Hoare triple {18676#(exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0)))} assume !!(~j~0 <= ~r~0); {18676#(exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0)))} is VALID [2018-11-19 00:05:59,978 INFO L273 TraceCheckUtils]: 11: Hoare triple {18676#(exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0)))} assume !(~j~0 < ~r~0); {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} is VALID [2018-11-19 00:05:59,978 INFO L256 TraceCheckUtils]: 12: Hoare triple {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {18641#true} is VALID [2018-11-19 00:05:59,978 INFO L273 TraceCheckUtils]: 13: Hoare triple {18641#true} ~cond := #in~cond; {18641#true} is VALID [2018-11-19 00:05:59,978 INFO L273 TraceCheckUtils]: 14: Hoare triple {18641#true} assume !(0 == ~cond); {18641#true} is VALID [2018-11-19 00:05:59,978 INFO L273 TraceCheckUtils]: 15: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-19 00:05:59,979 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {18641#true} {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} #108#return; {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} is VALID [2018-11-19 00:05:59,979 INFO L256 TraceCheckUtils]: 17: Hoare triple {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {18641#true} is VALID [2018-11-19 00:05:59,979 INFO L273 TraceCheckUtils]: 18: Hoare triple {18641#true} ~cond := #in~cond; {18641#true} is VALID [2018-11-19 00:05:59,979 INFO L273 TraceCheckUtils]: 19: Hoare triple {18641#true} assume !(0 == ~cond); {18641#true} is VALID [2018-11-19 00:05:59,980 INFO L273 TraceCheckUtils]: 20: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-19 00:05:59,980 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {18641#true} {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} #110#return; {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} is VALID [2018-11-19 00:05:59,980 INFO L273 TraceCheckUtils]: 22: Hoare triple {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} is VALID [2018-11-19 00:05:59,981 INFO L273 TraceCheckUtils]: 23: Hoare triple {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} assume !(0 != #t~nondet5);havoc #t~nondet5; {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} is VALID [2018-11-19 00:05:59,981 INFO L256 TraceCheckUtils]: 24: Hoare triple {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {18641#true} is VALID [2018-11-19 00:05:59,981 INFO L273 TraceCheckUtils]: 25: Hoare triple {18641#true} ~cond := #in~cond; {18641#true} is VALID [2018-11-19 00:05:59,981 INFO L273 TraceCheckUtils]: 26: Hoare triple {18641#true} assume !(0 == ~cond); {18641#true} is VALID [2018-11-19 00:05:59,982 INFO L273 TraceCheckUtils]: 27: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-19 00:05:59,982 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {18641#true} {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} #112#return; {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} is VALID [2018-11-19 00:05:59,983 INFO L256 TraceCheckUtils]: 29: Hoare triple {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {18641#true} is VALID [2018-11-19 00:05:59,983 INFO L273 TraceCheckUtils]: 30: Hoare triple {18641#true} ~cond := #in~cond; {18641#true} is VALID [2018-11-19 00:05:59,983 INFO L273 TraceCheckUtils]: 31: Hoare triple {18641#true} assume !(0 == ~cond); {18641#true} is VALID [2018-11-19 00:05:59,983 INFO L273 TraceCheckUtils]: 32: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-19 00:05:59,984 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {18641#true} {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} #114#return; {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} is VALID [2018-11-19 00:05:59,984 INFO L256 TraceCheckUtils]: 34: Hoare triple {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {18641#true} is VALID [2018-11-19 00:05:59,984 INFO L273 TraceCheckUtils]: 35: Hoare triple {18641#true} ~cond := #in~cond; {18641#true} is VALID [2018-11-19 00:05:59,984 INFO L273 TraceCheckUtils]: 36: Hoare triple {18641#true} assume !(0 == ~cond); {18641#true} is VALID [2018-11-19 00:05:59,984 INFO L273 TraceCheckUtils]: 37: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-19 00:05:59,985 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {18641#true} {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} #116#return; {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} is VALID [2018-11-19 00:05:59,985 INFO L256 TraceCheckUtils]: 39: Hoare triple {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {18641#true} is VALID [2018-11-19 00:05:59,985 INFO L273 TraceCheckUtils]: 40: Hoare triple {18641#true} ~cond := #in~cond; {18641#true} is VALID [2018-11-19 00:05:59,985 INFO L273 TraceCheckUtils]: 41: Hoare triple {18641#true} assume !(0 == ~cond); {18641#true} is VALID [2018-11-19 00:05:59,985 INFO L273 TraceCheckUtils]: 42: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-19 00:05:59,986 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {18641#true} {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} #118#return; {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} is VALID [2018-11-19 00:05:59,988 INFO L273 TraceCheckUtils]: 44: Hoare triple {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {18786#(exists ((v_main_~j~0_28 Int) (main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) v_main_~j~0_28) (<= (* 2 v_main_~j~0_28) main_~j~0) (<= main_~r~0 v_main_~j~0_28)))} is VALID [2018-11-19 00:05:59,988 INFO L273 TraceCheckUtils]: 45: Hoare triple {18786#(exists ((v_main_~j~0_28 Int) (main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) v_main_~j~0_28) (<= (* 2 v_main_~j~0_28) main_~j~0) (<= main_~r~0 v_main_~j~0_28)))} assume true; {18786#(exists ((v_main_~j~0_28 Int) (main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) v_main_~j~0_28) (<= (* 2 v_main_~j~0_28) main_~j~0) (<= main_~r~0 v_main_~j~0_28)))} is VALID [2018-11-19 00:05:59,989 INFO L273 TraceCheckUtils]: 46: Hoare triple {18786#(exists ((v_main_~j~0_28 Int) (main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) v_main_~j~0_28) (<= (* 2 v_main_~j~0_28) main_~j~0) (<= main_~r~0 v_main_~j~0_28)))} assume !!(~j~0 <= ~r~0); {18642#false} is VALID [2018-11-19 00:05:59,989 INFO L273 TraceCheckUtils]: 47: Hoare triple {18642#false} assume !(~j~0 < ~r~0); {18642#false} is VALID [2018-11-19 00:05:59,989 INFO L256 TraceCheckUtils]: 48: Hoare triple {18642#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {18642#false} is VALID [2018-11-19 00:05:59,989 INFO L273 TraceCheckUtils]: 49: Hoare triple {18642#false} ~cond := #in~cond; {18642#false} is VALID [2018-11-19 00:05:59,989 INFO L273 TraceCheckUtils]: 50: Hoare triple {18642#false} assume !(0 == ~cond); {18642#false} is VALID [2018-11-19 00:05:59,989 INFO L273 TraceCheckUtils]: 51: Hoare triple {18642#false} assume true; {18642#false} is VALID [2018-11-19 00:05:59,990 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {18642#false} {18642#false} #108#return; {18642#false} is VALID [2018-11-19 00:05:59,990 INFO L256 TraceCheckUtils]: 53: Hoare triple {18642#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {18642#false} is VALID [2018-11-19 00:05:59,990 INFO L273 TraceCheckUtils]: 54: Hoare triple {18642#false} ~cond := #in~cond; {18642#false} is VALID [2018-11-19 00:05:59,990 INFO L273 TraceCheckUtils]: 55: Hoare triple {18642#false} assume !(0 == ~cond); {18642#false} is VALID [2018-11-19 00:05:59,991 INFO L273 TraceCheckUtils]: 56: Hoare triple {18642#false} assume true; {18642#false} is VALID [2018-11-19 00:05:59,991 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {18642#false} {18642#false} #110#return; {18642#false} is VALID [2018-11-19 00:05:59,991 INFO L273 TraceCheckUtils]: 58: Hoare triple {18642#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {18642#false} is VALID [2018-11-19 00:05:59,991 INFO L273 TraceCheckUtils]: 59: Hoare triple {18642#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {18642#false} is VALID [2018-11-19 00:05:59,991 INFO L256 TraceCheckUtils]: 60: Hoare triple {18642#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {18642#false} is VALID [2018-11-19 00:05:59,992 INFO L273 TraceCheckUtils]: 61: Hoare triple {18642#false} ~cond := #in~cond; {18642#false} is VALID [2018-11-19 00:05:59,992 INFO L273 TraceCheckUtils]: 62: Hoare triple {18642#false} assume 0 == ~cond; {18642#false} is VALID [2018-11-19 00:05:59,992 INFO L273 TraceCheckUtils]: 63: Hoare triple {18642#false} assume !false; {18642#false} is VALID [2018-11-19 00:05:59,996 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-19 00:06:00,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:06:00,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-11-19 00:06:00,015 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-11-19 00:06:00,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:06:00,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-19 00:06:00,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:06:00,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-19 00:06:00,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-19 00:06:00,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-19 00:06:00,104 INFO L87 Difference]: Start difference. First operand 541 states and 869 transitions. Second operand 11 states. [2018-11-19 00:06:09,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:09,013 INFO L93 Difference]: Finished difference Result 1112 states and 1758 transitions. [2018-11-19 00:06:09,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-19 00:06:09,014 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-11-19 00:06:09,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:06:09,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-19 00:06:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 325 transitions. [2018-11-19 00:06:09,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-19 00:06:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 325 transitions. [2018-11-19 00:06:09,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 325 transitions. [2018-11-19 00:06:09,492 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 325 edges. 325 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:06:09,507 INFO L225 Difference]: With dead ends: 1112 [2018-11-19 00:06:09,507 INFO L226 Difference]: Without dead ends: 287 [2018-11-19 00:06:09,513 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2018-11-19 00:06:09,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-11-19 00:06:10,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 240. [2018-11-19 00:06:10,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:06:10,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states. Second operand 240 states. [2018-11-19 00:06:10,954 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand 240 states. [2018-11-19 00:06:10,954 INFO L87 Difference]: Start difference. First operand 287 states. Second operand 240 states. [2018-11-19 00:06:10,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:10,962 INFO L93 Difference]: Finished difference Result 287 states and 410 transitions. [2018-11-19 00:06:10,962 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 410 transitions. [2018-11-19 00:06:10,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:10,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:10,964 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand 287 states. [2018-11-19 00:06:10,964 INFO L87 Difference]: Start difference. First operand 240 states. Second operand 287 states. [2018-11-19 00:06:10,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:10,974 INFO L93 Difference]: Finished difference Result 287 states and 410 transitions. [2018-11-19 00:06:10,974 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 410 transitions. [2018-11-19 00:06:10,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:10,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:10,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:06:10,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:06:10,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-11-19 00:06:10,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 348 transitions. [2018-11-19 00:06:10,983 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 348 transitions. Word has length 64 [2018-11-19 00:06:10,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:06:10,983 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 348 transitions. [2018-11-19 00:06:10,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-19 00:06:10,984 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 348 transitions. [2018-11-19 00:06:10,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-19 00:06:10,985 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:06:10,985 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:06:10,985 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:06:10,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:06:10,986 INFO L82 PathProgramCache]: Analyzing trace with hash 653076176, now seen corresponding path program 1 times [2018-11-19 00:06:10,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:06:10,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:06:10,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:10,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:06:10,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:06:11,078 INFO L256 TraceCheckUtils]: 0: Hoare triple {21522#true} call ULTIMATE.init(); {21522#true} is VALID [2018-11-19 00:06:11,079 INFO L273 TraceCheckUtils]: 1: Hoare triple {21522#true} assume true; {21522#true} is VALID [2018-11-19 00:06:11,079 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21522#true} {21522#true} #96#return; {21522#true} is VALID [2018-11-19 00:06:11,079 INFO L256 TraceCheckUtils]: 3: Hoare triple {21522#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {21522#true} is VALID [2018-11-19 00:06:11,079 INFO L273 TraceCheckUtils]: 4: Hoare triple {21522#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {21522#true} is VALID [2018-11-19 00:06:11,080 INFO L273 TraceCheckUtils]: 5: Hoare triple {21522#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {21522#true} is VALID [2018-11-19 00:06:11,080 INFO L273 TraceCheckUtils]: 6: Hoare triple {21522#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {21522#true} is VALID [2018-11-19 00:06:11,080 INFO L273 TraceCheckUtils]: 7: Hoare triple {21522#true} assume true; {21522#true} is VALID [2018-11-19 00:06:11,081 INFO L273 TraceCheckUtils]: 8: Hoare triple {21522#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {21524#(<= 2 main_~r~0)} is VALID [2018-11-19 00:06:11,081 INFO L273 TraceCheckUtils]: 9: Hoare triple {21524#(<= 2 main_~r~0)} assume true; {21524#(<= 2 main_~r~0)} is VALID [2018-11-19 00:06:11,082 INFO L273 TraceCheckUtils]: 10: Hoare triple {21524#(<= 2 main_~r~0)} assume !(~j~0 <= ~r~0); {21524#(<= 2 main_~r~0)} is VALID [2018-11-19 00:06:11,082 INFO L273 TraceCheckUtils]: 11: Hoare triple {21524#(<= 2 main_~r~0)} assume ~l~0 > 1; {21524#(<= 2 main_~r~0)} is VALID [2018-11-19 00:06:11,082 INFO L256 TraceCheckUtils]: 12: Hoare triple {21524#(<= 2 main_~r~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {21522#true} is VALID [2018-11-19 00:06:11,082 INFO L273 TraceCheckUtils]: 13: Hoare triple {21522#true} ~cond := #in~cond; {21522#true} is VALID [2018-11-19 00:06:11,082 INFO L273 TraceCheckUtils]: 14: Hoare triple {21522#true} assume !(0 == ~cond); {21522#true} is VALID [2018-11-19 00:06:11,083 INFO L273 TraceCheckUtils]: 15: Hoare triple {21522#true} assume true; {21522#true} is VALID [2018-11-19 00:06:11,083 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {21522#true} {21524#(<= 2 main_~r~0)} #120#return; {21524#(<= 2 main_~r~0)} is VALID [2018-11-19 00:06:11,083 INFO L256 TraceCheckUtils]: 17: Hoare triple {21524#(<= 2 main_~r~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {21522#true} is VALID [2018-11-19 00:06:11,083 INFO L273 TraceCheckUtils]: 18: Hoare triple {21522#true} ~cond := #in~cond; {21522#true} is VALID [2018-11-19 00:06:11,083 INFO L273 TraceCheckUtils]: 19: Hoare triple {21522#true} assume !(0 == ~cond); {21522#true} is VALID [2018-11-19 00:06:11,084 INFO L273 TraceCheckUtils]: 20: Hoare triple {21522#true} assume true; {21522#true} is VALID [2018-11-19 00:06:11,084 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {21522#true} {21524#(<= 2 main_~r~0)} #122#return; {21524#(<= 2 main_~r~0)} is VALID [2018-11-19 00:06:11,085 INFO L273 TraceCheckUtils]: 22: Hoare triple {21524#(<= 2 main_~r~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {21524#(<= 2 main_~r~0)} is VALID [2018-11-19 00:06:11,086 INFO L273 TraceCheckUtils]: 23: Hoare triple {21524#(<= 2 main_~r~0)} assume true; {21524#(<= 2 main_~r~0)} is VALID [2018-11-19 00:06:11,086 INFO L273 TraceCheckUtils]: 24: Hoare triple {21524#(<= 2 main_~r~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {21524#(<= 2 main_~r~0)} is VALID [2018-11-19 00:06:11,087 INFO L273 TraceCheckUtils]: 25: Hoare triple {21524#(<= 2 main_~r~0)} assume true; {21524#(<= 2 main_~r~0)} is VALID [2018-11-19 00:06:11,087 INFO L273 TraceCheckUtils]: 26: Hoare triple {21524#(<= 2 main_~r~0)} assume !!(~j~0 <= ~r~0); {21524#(<= 2 main_~r~0)} is VALID [2018-11-19 00:06:11,088 INFO L273 TraceCheckUtils]: 27: Hoare triple {21524#(<= 2 main_~r~0)} assume !(~j~0 < ~r~0); {21525#(<= (+ main_~r~0 2) (* 2 main_~j~0))} is VALID [2018-11-19 00:06:11,088 INFO L256 TraceCheckUtils]: 28: Hoare triple {21525#(<= (+ main_~r~0 2) (* 2 main_~j~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {21522#true} is VALID [2018-11-19 00:06:11,088 INFO L273 TraceCheckUtils]: 29: Hoare triple {21522#true} ~cond := #in~cond; {21522#true} is VALID [2018-11-19 00:06:11,089 INFO L273 TraceCheckUtils]: 30: Hoare triple {21522#true} assume !(0 == ~cond); {21522#true} is VALID [2018-11-19 00:06:11,089 INFO L273 TraceCheckUtils]: 31: Hoare triple {21522#true} assume true; {21522#true} is VALID [2018-11-19 00:06:11,090 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {21522#true} {21525#(<= (+ main_~r~0 2) (* 2 main_~j~0))} #108#return; {21525#(<= (+ main_~r~0 2) (* 2 main_~j~0))} is VALID [2018-11-19 00:06:11,090 INFO L256 TraceCheckUtils]: 33: Hoare triple {21525#(<= (+ main_~r~0 2) (* 2 main_~j~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {21522#true} is VALID [2018-11-19 00:06:11,090 INFO L273 TraceCheckUtils]: 34: Hoare triple {21522#true} ~cond := #in~cond; {21522#true} is VALID [2018-11-19 00:06:11,090 INFO L273 TraceCheckUtils]: 35: Hoare triple {21522#true} assume !(0 == ~cond); {21522#true} is VALID [2018-11-19 00:06:11,090 INFO L273 TraceCheckUtils]: 36: Hoare triple {21522#true} assume true; {21522#true} is VALID [2018-11-19 00:06:11,091 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {21522#true} {21525#(<= (+ main_~r~0 2) (* 2 main_~j~0))} #110#return; {21525#(<= (+ main_~r~0 2) (* 2 main_~j~0))} is VALID [2018-11-19 00:06:11,092 INFO L273 TraceCheckUtils]: 38: Hoare triple {21525#(<= (+ main_~r~0 2) (* 2 main_~j~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {21525#(<= (+ main_~r~0 2) (* 2 main_~j~0))} is VALID [2018-11-19 00:06:11,092 INFO L273 TraceCheckUtils]: 39: Hoare triple {21525#(<= (+ main_~r~0 2) (* 2 main_~j~0))} assume !(0 != #t~nondet5);havoc #t~nondet5; {21525#(<= (+ main_~r~0 2) (* 2 main_~j~0))} is VALID [2018-11-19 00:06:11,092 INFO L256 TraceCheckUtils]: 40: Hoare triple {21525#(<= (+ main_~r~0 2) (* 2 main_~j~0))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {21522#true} is VALID [2018-11-19 00:06:11,092 INFO L273 TraceCheckUtils]: 41: Hoare triple {21522#true} ~cond := #in~cond; {21522#true} is VALID [2018-11-19 00:06:11,092 INFO L273 TraceCheckUtils]: 42: Hoare triple {21522#true} assume !(0 == ~cond); {21522#true} is VALID [2018-11-19 00:06:11,092 INFO L273 TraceCheckUtils]: 43: Hoare triple {21522#true} assume true; {21522#true} is VALID [2018-11-19 00:06:11,102 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {21522#true} {21525#(<= (+ main_~r~0 2) (* 2 main_~j~0))} #112#return; {21525#(<= (+ main_~r~0 2) (* 2 main_~j~0))} is VALID [2018-11-19 00:06:11,102 INFO L256 TraceCheckUtils]: 45: Hoare triple {21525#(<= (+ main_~r~0 2) (* 2 main_~j~0))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {21522#true} is VALID [2018-11-19 00:06:11,103 INFO L273 TraceCheckUtils]: 46: Hoare triple {21522#true} ~cond := #in~cond; {21522#true} is VALID [2018-11-19 00:06:11,103 INFO L273 TraceCheckUtils]: 47: Hoare triple {21522#true} assume !(0 == ~cond); {21522#true} is VALID [2018-11-19 00:06:11,103 INFO L273 TraceCheckUtils]: 48: Hoare triple {21522#true} assume true; {21522#true} is VALID [2018-11-19 00:06:11,107 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {21522#true} {21525#(<= (+ main_~r~0 2) (* 2 main_~j~0))} #114#return; {21525#(<= (+ main_~r~0 2) (* 2 main_~j~0))} is VALID [2018-11-19 00:06:11,107 INFO L256 TraceCheckUtils]: 50: Hoare triple {21525#(<= (+ main_~r~0 2) (* 2 main_~j~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {21522#true} is VALID [2018-11-19 00:06:11,107 INFO L273 TraceCheckUtils]: 51: Hoare triple {21522#true} ~cond := #in~cond; {21522#true} is VALID [2018-11-19 00:06:11,107 INFO L273 TraceCheckUtils]: 52: Hoare triple {21522#true} assume !(0 == ~cond); {21522#true} is VALID [2018-11-19 00:06:11,107 INFO L273 TraceCheckUtils]: 53: Hoare triple {21522#true} assume true; {21522#true} is VALID [2018-11-19 00:06:11,108 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {21522#true} {21525#(<= (+ main_~r~0 2) (* 2 main_~j~0))} #116#return; {21525#(<= (+ main_~r~0 2) (* 2 main_~j~0))} is VALID [2018-11-19 00:06:11,108 INFO L256 TraceCheckUtils]: 55: Hoare triple {21525#(<= (+ main_~r~0 2) (* 2 main_~j~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {21522#true} is VALID [2018-11-19 00:06:11,108 INFO L273 TraceCheckUtils]: 56: Hoare triple {21522#true} ~cond := #in~cond; {21522#true} is VALID [2018-11-19 00:06:11,108 INFO L273 TraceCheckUtils]: 57: Hoare triple {21522#true} assume !(0 == ~cond); {21522#true} is VALID [2018-11-19 00:06:11,108 INFO L273 TraceCheckUtils]: 58: Hoare triple {21522#true} assume true; {21522#true} is VALID [2018-11-19 00:06:11,109 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {21522#true} {21525#(<= (+ main_~r~0 2) (* 2 main_~j~0))} #118#return; {21525#(<= (+ main_~r~0 2) (* 2 main_~j~0))} is VALID [2018-11-19 00:06:11,128 INFO L273 TraceCheckUtils]: 60: Hoare triple {21525#(<= (+ main_~r~0 2) (* 2 main_~j~0))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {21526#(<= (+ main_~r~0 2) main_~j~0)} is VALID [2018-11-19 00:06:11,136 INFO L273 TraceCheckUtils]: 61: Hoare triple {21526#(<= (+ main_~r~0 2) main_~j~0)} assume true; {21526#(<= (+ main_~r~0 2) main_~j~0)} is VALID [2018-11-19 00:06:11,147 INFO L273 TraceCheckUtils]: 62: Hoare triple {21526#(<= (+ main_~r~0 2) main_~j~0)} assume !!(~j~0 <= ~r~0); {21523#false} is VALID [2018-11-19 00:06:11,147 INFO L273 TraceCheckUtils]: 63: Hoare triple {21523#false} assume !(~j~0 < ~r~0); {21523#false} is VALID [2018-11-19 00:06:11,147 INFO L256 TraceCheckUtils]: 64: Hoare triple {21523#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {21522#true} is VALID [2018-11-19 00:06:11,147 INFO L273 TraceCheckUtils]: 65: Hoare triple {21522#true} ~cond := #in~cond; {21522#true} is VALID [2018-11-19 00:06:11,148 INFO L273 TraceCheckUtils]: 66: Hoare triple {21522#true} assume !(0 == ~cond); {21522#true} is VALID [2018-11-19 00:06:11,148 INFO L273 TraceCheckUtils]: 67: Hoare triple {21522#true} assume true; {21522#true} is VALID [2018-11-19 00:06:11,148 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {21522#true} {21523#false} #108#return; {21523#false} is VALID [2018-11-19 00:06:11,148 INFO L256 TraceCheckUtils]: 69: Hoare triple {21523#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {21522#true} is VALID [2018-11-19 00:06:11,148 INFO L273 TraceCheckUtils]: 70: Hoare triple {21522#true} ~cond := #in~cond; {21522#true} is VALID [2018-11-19 00:06:11,148 INFO L273 TraceCheckUtils]: 71: Hoare triple {21522#true} assume !(0 == ~cond); {21522#true} is VALID [2018-11-19 00:06:11,148 INFO L273 TraceCheckUtils]: 72: Hoare triple {21522#true} assume true; {21522#true} is VALID [2018-11-19 00:06:11,149 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {21522#true} {21523#false} #110#return; {21523#false} is VALID [2018-11-19 00:06:11,149 INFO L273 TraceCheckUtils]: 74: Hoare triple {21523#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {21523#false} is VALID [2018-11-19 00:06:11,149 INFO L273 TraceCheckUtils]: 75: Hoare triple {21523#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {21523#false} is VALID [2018-11-19 00:06:11,149 INFO L256 TraceCheckUtils]: 76: Hoare triple {21523#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {21522#true} is VALID [2018-11-19 00:06:11,149 INFO L273 TraceCheckUtils]: 77: Hoare triple {21522#true} ~cond := #in~cond; {21522#true} is VALID [2018-11-19 00:06:11,149 INFO L273 TraceCheckUtils]: 78: Hoare triple {21522#true} assume !(0 == ~cond); {21522#true} is VALID [2018-11-19 00:06:11,150 INFO L273 TraceCheckUtils]: 79: Hoare triple {21522#true} assume true; {21522#true} is VALID [2018-11-19 00:06:11,150 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {21522#true} {21523#false} #112#return; {21523#false} is VALID [2018-11-19 00:06:11,150 INFO L256 TraceCheckUtils]: 81: Hoare triple {21523#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {21523#false} is VALID [2018-11-19 00:06:11,150 INFO L273 TraceCheckUtils]: 82: Hoare triple {21523#false} ~cond := #in~cond; {21523#false} is VALID [2018-11-19 00:06:11,150 INFO L273 TraceCheckUtils]: 83: Hoare triple {21523#false} assume 0 == ~cond; {21523#false} is VALID [2018-11-19 00:06:11,151 INFO L273 TraceCheckUtils]: 84: Hoare triple {21523#false} assume !false; {21523#false} is VALID [2018-11-19 00:06:11,156 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 31 proven. 4 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-19 00:06:11,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:06:11,156 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:06:11,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:06:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:06:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:06:11,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:06:11,843 INFO L256 TraceCheckUtils]: 0: Hoare triple {21522#true} call ULTIMATE.init(); {21522#true} is VALID [2018-11-19 00:06:11,843 INFO L273 TraceCheckUtils]: 1: Hoare triple {21522#true} assume true; {21522#true} is VALID [2018-11-19 00:06:11,844 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21522#true} {21522#true} #96#return; {21522#true} is VALID [2018-11-19 00:06:11,844 INFO L256 TraceCheckUtils]: 3: Hoare triple {21522#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {21522#true} is VALID [2018-11-19 00:06:11,844 INFO L273 TraceCheckUtils]: 4: Hoare triple {21522#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {21522#true} is VALID [2018-11-19 00:06:11,844 INFO L273 TraceCheckUtils]: 5: Hoare triple {21522#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {21522#true} is VALID [2018-11-19 00:06:11,844 INFO L273 TraceCheckUtils]: 6: Hoare triple {21522#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {21522#true} is VALID [2018-11-19 00:06:11,844 INFO L273 TraceCheckUtils]: 7: Hoare triple {21522#true} assume true; {21522#true} is VALID [2018-11-19 00:06:11,845 INFO L273 TraceCheckUtils]: 8: Hoare triple {21522#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {21554#(<= main_~j~0 (* 2 main_~l~0))} is VALID [2018-11-19 00:06:11,846 INFO L273 TraceCheckUtils]: 9: Hoare triple {21554#(<= main_~j~0 (* 2 main_~l~0))} assume true; {21554#(<= main_~j~0 (* 2 main_~l~0))} is VALID [2018-11-19 00:06:11,846 INFO L273 TraceCheckUtils]: 10: Hoare triple {21554#(<= main_~j~0 (* 2 main_~l~0))} assume !(~j~0 <= ~r~0); {21561#(<= (+ main_~r~0 1) (* 2 main_~l~0))} is VALID [2018-11-19 00:06:11,847 INFO L273 TraceCheckUtils]: 11: Hoare triple {21561#(<= (+ main_~r~0 1) (* 2 main_~l~0))} assume ~l~0 > 1; {21565#(and (<= (+ main_~r~0 1) (* 2 main_~l~0)) (< 1 main_~l~0))} is VALID [2018-11-19 00:06:11,847 INFO L256 TraceCheckUtils]: 12: Hoare triple {21565#(and (<= (+ main_~r~0 1) (* 2 main_~l~0)) (< 1 main_~l~0))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {21522#true} is VALID [2018-11-19 00:06:11,847 INFO L273 TraceCheckUtils]: 13: Hoare triple {21522#true} ~cond := #in~cond; {21522#true} is VALID [2018-11-19 00:06:11,847 INFO L273 TraceCheckUtils]: 14: Hoare triple {21522#true} assume !(0 == ~cond); {21522#true} is VALID [2018-11-19 00:06:11,847 INFO L273 TraceCheckUtils]: 15: Hoare triple {21522#true} assume true; {21522#true} is VALID [2018-11-19 00:06:11,848 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {21522#true} {21565#(and (<= (+ main_~r~0 1) (* 2 main_~l~0)) (< 1 main_~l~0))} #120#return; {21565#(and (<= (+ main_~r~0 1) (* 2 main_~l~0)) (< 1 main_~l~0))} is VALID [2018-11-19 00:06:11,848 INFO L256 TraceCheckUtils]: 17: Hoare triple {21565#(and (<= (+ main_~r~0 1) (* 2 main_~l~0)) (< 1 main_~l~0))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {21522#true} is VALID [2018-11-19 00:06:11,848 INFO L273 TraceCheckUtils]: 18: Hoare triple {21522#true} ~cond := #in~cond; {21522#true} is VALID [2018-11-19 00:06:11,848 INFO L273 TraceCheckUtils]: 19: Hoare triple {21522#true} assume !(0 == ~cond); {21522#true} is VALID [2018-11-19 00:06:11,848 INFO L273 TraceCheckUtils]: 20: Hoare triple {21522#true} assume true; {21522#true} is VALID [2018-11-19 00:06:11,849 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {21522#true} {21565#(and (<= (+ main_~r~0 1) (* 2 main_~l~0)) (< 1 main_~l~0))} #122#return; {21565#(and (<= (+ main_~r~0 1) (* 2 main_~l~0)) (< 1 main_~l~0))} is VALID [2018-11-19 00:06:11,851 INFO L273 TraceCheckUtils]: 22: Hoare triple {21565#(and (<= (+ main_~r~0 1) (* 2 main_~l~0)) (< 1 main_~l~0))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {21599#(exists ((v_main_~l~0_21 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21))))} is VALID [2018-11-19 00:06:11,852 INFO L273 TraceCheckUtils]: 23: Hoare triple {21599#(exists ((v_main_~l~0_21 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21))))} assume true; {21599#(exists ((v_main_~l~0_21 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21))))} is VALID [2018-11-19 00:06:11,853 INFO L273 TraceCheckUtils]: 24: Hoare triple {21599#(exists ((v_main_~l~0_21 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21))))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} is VALID [2018-11-19 00:06:11,853 INFO L273 TraceCheckUtils]: 25: Hoare triple {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} assume true; {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} is VALID [2018-11-19 00:06:11,853 INFO L273 TraceCheckUtils]: 26: Hoare triple {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} assume !!(~j~0 <= ~r~0); {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} is VALID [2018-11-19 00:06:11,854 INFO L273 TraceCheckUtils]: 27: Hoare triple {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} assume !(~j~0 < ~r~0); {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} is VALID [2018-11-19 00:06:11,854 INFO L256 TraceCheckUtils]: 28: Hoare triple {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {21522#true} is VALID [2018-11-19 00:06:11,854 INFO L273 TraceCheckUtils]: 29: Hoare triple {21522#true} ~cond := #in~cond; {21522#true} is VALID [2018-11-19 00:06:11,854 INFO L273 TraceCheckUtils]: 30: Hoare triple {21522#true} assume !(0 == ~cond); {21522#true} is VALID [2018-11-19 00:06:11,854 INFO L273 TraceCheckUtils]: 31: Hoare triple {21522#true} assume true; {21522#true} is VALID [2018-11-19 00:06:11,855 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {21522#true} {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} #108#return; {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} is VALID [2018-11-19 00:06:11,855 INFO L256 TraceCheckUtils]: 33: Hoare triple {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {21522#true} is VALID [2018-11-19 00:06:11,855 INFO L273 TraceCheckUtils]: 34: Hoare triple {21522#true} ~cond := #in~cond; {21522#true} is VALID [2018-11-19 00:06:11,855 INFO L273 TraceCheckUtils]: 35: Hoare triple {21522#true} assume !(0 == ~cond); {21522#true} is VALID [2018-11-19 00:06:11,855 INFO L273 TraceCheckUtils]: 36: Hoare triple {21522#true} assume true; {21522#true} is VALID [2018-11-19 00:06:11,856 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {21522#true} {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} #110#return; {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} is VALID [2018-11-19 00:06:11,856 INFO L273 TraceCheckUtils]: 38: Hoare triple {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} is VALID [2018-11-19 00:06:11,856 INFO L273 TraceCheckUtils]: 39: Hoare triple {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} assume !(0 != #t~nondet5);havoc #t~nondet5; {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} is VALID [2018-11-19 00:06:11,856 INFO L256 TraceCheckUtils]: 40: Hoare triple {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {21522#true} is VALID [2018-11-19 00:06:11,857 INFO L273 TraceCheckUtils]: 41: Hoare triple {21522#true} ~cond := #in~cond; {21522#true} is VALID [2018-11-19 00:06:11,857 INFO L273 TraceCheckUtils]: 42: Hoare triple {21522#true} assume !(0 == ~cond); {21522#true} is VALID [2018-11-19 00:06:11,857 INFO L273 TraceCheckUtils]: 43: Hoare triple {21522#true} assume true; {21522#true} is VALID [2018-11-19 00:06:11,857 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {21522#true} {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} #112#return; {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} is VALID [2018-11-19 00:06:11,858 INFO L256 TraceCheckUtils]: 45: Hoare triple {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {21522#true} is VALID [2018-11-19 00:06:11,858 INFO L273 TraceCheckUtils]: 46: Hoare triple {21522#true} ~cond := #in~cond; {21522#true} is VALID [2018-11-19 00:06:11,858 INFO L273 TraceCheckUtils]: 47: Hoare triple {21522#true} assume !(0 == ~cond); {21522#true} is VALID [2018-11-19 00:06:11,858 INFO L273 TraceCheckUtils]: 48: Hoare triple {21522#true} assume true; {21522#true} is VALID [2018-11-19 00:06:11,858 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {21522#true} {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} #114#return; {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} is VALID [2018-11-19 00:06:11,858 INFO L256 TraceCheckUtils]: 50: Hoare triple {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {21522#true} is VALID [2018-11-19 00:06:11,859 INFO L273 TraceCheckUtils]: 51: Hoare triple {21522#true} ~cond := #in~cond; {21522#true} is VALID [2018-11-19 00:06:11,859 INFO L273 TraceCheckUtils]: 52: Hoare triple {21522#true} assume !(0 == ~cond); {21522#true} is VALID [2018-11-19 00:06:11,859 INFO L273 TraceCheckUtils]: 53: Hoare triple {21522#true} assume true; {21522#true} is VALID [2018-11-19 00:06:11,860 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {21522#true} {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} #116#return; {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} is VALID [2018-11-19 00:06:11,860 INFO L256 TraceCheckUtils]: 55: Hoare triple {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {21522#true} is VALID [2018-11-19 00:06:11,860 INFO L273 TraceCheckUtils]: 56: Hoare triple {21522#true} ~cond := #in~cond; {21522#true} is VALID [2018-11-19 00:06:11,860 INFO L273 TraceCheckUtils]: 57: Hoare triple {21522#true} assume !(0 == ~cond); {21522#true} is VALID [2018-11-19 00:06:11,860 INFO L273 TraceCheckUtils]: 58: Hoare triple {21522#true} assume true; {21522#true} is VALID [2018-11-19 00:06:11,861 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {21522#true} {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} #118#return; {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} is VALID [2018-11-19 00:06:12,233 INFO L273 TraceCheckUtils]: 60: Hoare triple {21606#(exists ((v_main_~l~0_21 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) main_~j~0)))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {21715#(exists ((v_main_~l~0_21 Int) (v_main_~j~0_29 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) v_main_~j~0_29) (<= (* 2 v_main_~j~0_29) main_~j~0)))} is UNKNOWN [2018-11-19 00:06:12,234 INFO L273 TraceCheckUtils]: 61: Hoare triple {21715#(exists ((v_main_~l~0_21 Int) (v_main_~j~0_29 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) v_main_~j~0_29) (<= (* 2 v_main_~j~0_29) main_~j~0)))} assume true; {21715#(exists ((v_main_~l~0_21 Int) (v_main_~j~0_29 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) v_main_~j~0_29) (<= (* 2 v_main_~j~0_29) main_~j~0)))} is VALID [2018-11-19 00:06:12,235 INFO L273 TraceCheckUtils]: 62: Hoare triple {21715#(exists ((v_main_~l~0_21 Int) (v_main_~j~0_29 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_21) (<= v_main_~l~0_21 (+ main_~l~0 1)) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_21)) (<= (* 2 main_~l~0) v_main_~j~0_29) (<= (* 2 v_main_~j~0_29) main_~j~0)))} assume !!(~j~0 <= ~r~0); {21523#false} is VALID [2018-11-19 00:06:12,235 INFO L273 TraceCheckUtils]: 63: Hoare triple {21523#false} assume !(~j~0 < ~r~0); {21523#false} is VALID [2018-11-19 00:06:12,235 INFO L256 TraceCheckUtils]: 64: Hoare triple {21523#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {21523#false} is VALID [2018-11-19 00:06:12,235 INFO L273 TraceCheckUtils]: 65: Hoare triple {21523#false} ~cond := #in~cond; {21523#false} is VALID [2018-11-19 00:06:12,236 INFO L273 TraceCheckUtils]: 66: Hoare triple {21523#false} assume !(0 == ~cond); {21523#false} is VALID [2018-11-19 00:06:12,236 INFO L273 TraceCheckUtils]: 67: Hoare triple {21523#false} assume true; {21523#false} is VALID [2018-11-19 00:06:12,236 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {21523#false} {21523#false} #108#return; {21523#false} is VALID [2018-11-19 00:06:12,236 INFO L256 TraceCheckUtils]: 69: Hoare triple {21523#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {21523#false} is VALID [2018-11-19 00:06:12,236 INFO L273 TraceCheckUtils]: 70: Hoare triple {21523#false} ~cond := #in~cond; {21523#false} is VALID [2018-11-19 00:06:12,236 INFO L273 TraceCheckUtils]: 71: Hoare triple {21523#false} assume !(0 == ~cond); {21523#false} is VALID [2018-11-19 00:06:12,236 INFO L273 TraceCheckUtils]: 72: Hoare triple {21523#false} assume true; {21523#false} is VALID [2018-11-19 00:06:12,237 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {21523#false} {21523#false} #110#return; {21523#false} is VALID [2018-11-19 00:06:12,237 INFO L273 TraceCheckUtils]: 74: Hoare triple {21523#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {21523#false} is VALID [2018-11-19 00:06:12,237 INFO L273 TraceCheckUtils]: 75: Hoare triple {21523#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {21523#false} is VALID [2018-11-19 00:06:12,237 INFO L256 TraceCheckUtils]: 76: Hoare triple {21523#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {21523#false} is VALID [2018-11-19 00:06:12,237 INFO L273 TraceCheckUtils]: 77: Hoare triple {21523#false} ~cond := #in~cond; {21523#false} is VALID [2018-11-19 00:06:12,237 INFO L273 TraceCheckUtils]: 78: Hoare triple {21523#false} assume !(0 == ~cond); {21523#false} is VALID [2018-11-19 00:06:12,237 INFO L273 TraceCheckUtils]: 79: Hoare triple {21523#false} assume true; {21523#false} is VALID [2018-11-19 00:06:12,237 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {21523#false} {21523#false} #112#return; {21523#false} is VALID [2018-11-19 00:06:12,238 INFO L256 TraceCheckUtils]: 81: Hoare triple {21523#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {21523#false} is VALID [2018-11-19 00:06:12,238 INFO L273 TraceCheckUtils]: 82: Hoare triple {21523#false} ~cond := #in~cond; {21523#false} is VALID [2018-11-19 00:06:12,238 INFO L273 TraceCheckUtils]: 83: Hoare triple {21523#false} assume 0 == ~cond; {21523#false} is VALID [2018-11-19 00:06:12,238 INFO L273 TraceCheckUtils]: 84: Hoare triple {21523#false} assume !false; {21523#false} is VALID [2018-11-19 00:06:12,249 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 123 proven. 4 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-19 00:06:12,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:06:12,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2018-11-19 00:06:12,270 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-11-19 00:06:12,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:06:12,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-19 00:06:13,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 89 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2018-11-19 00:06:13,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-19 00:06:13,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-19 00:06:13,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-19 00:06:13,870 INFO L87 Difference]: Start difference. First operand 240 states and 348 transitions. Second operand 11 states. [2018-11-19 00:06:14,610 WARN L180 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2018-11-19 00:06:15,744 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-19 00:06:17,682 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-19 00:06:21,077 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-19 00:06:38,124 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2018-11-19 00:06:51,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:51,221 INFO L93 Difference]: Finished difference Result 497 states and 728 transitions. [2018-11-19 00:06:51,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-19 00:06:51,221 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-11-19 00:06:51,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:06:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-19 00:06:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 343 transitions. [2018-11-19 00:06:51,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-19 00:06:51,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 343 transitions. [2018-11-19 00:06:51,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 343 transitions. [2018-11-19 00:06:53,411 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 343 edges. 339 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2018-11-19 00:06:53,423 INFO L225 Difference]: With dead ends: 497 [2018-11-19 00:06:53,423 INFO L226 Difference]: Without dead ends: 353 [2018-11-19 00:06:53,424 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=188, Invalid=561, Unknown=7, NotChecked=0, Total=756 [2018-11-19 00:06:53,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-11-19 00:06:54,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 214. [2018-11-19 00:06:54,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:06:54,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 353 states. Second operand 214 states. [2018-11-19 00:06:54,951 INFO L74 IsIncluded]: Start isIncluded. First operand 353 states. Second operand 214 states. [2018-11-19 00:06:54,951 INFO L87 Difference]: Start difference. First operand 353 states. Second operand 214 states. [2018-11-19 00:06:54,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:54,965 INFO L93 Difference]: Finished difference Result 353 states and 520 transitions. [2018-11-19 00:06:54,965 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 520 transitions. [2018-11-19 00:06:54,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:54,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:54,966 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand 353 states. [2018-11-19 00:06:54,966 INFO L87 Difference]: Start difference. First operand 214 states. Second operand 353 states. [2018-11-19 00:06:54,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:54,979 INFO L93 Difference]: Finished difference Result 353 states and 520 transitions. [2018-11-19 00:06:54,979 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 520 transitions. [2018-11-19 00:06:54,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:54,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:54,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:06:54,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:06:54,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-11-19 00:06:54,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 301 transitions. [2018-11-19 00:06:54,987 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 301 transitions. Word has length 85 [2018-11-19 00:06:54,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:06:54,987 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 301 transitions. [2018-11-19 00:06:54,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-19 00:06:54,988 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 301 transitions. [2018-11-19 00:06:54,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-19 00:06:54,989 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:06:54,989 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:06:54,989 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:06:54,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:06:54,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1543835351, now seen corresponding path program 1 times [2018-11-19 00:06:54,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:06:54,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:06:54,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:54,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:06:54,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:06:55,157 INFO L256 TraceCheckUtils]: 0: Hoare triple {23604#true} call ULTIMATE.init(); {23604#true} is VALID [2018-11-19 00:06:55,157 INFO L273 TraceCheckUtils]: 1: Hoare triple {23604#true} assume true; {23604#true} is VALID [2018-11-19 00:06:55,157 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23604#true} {23604#true} #96#return; {23604#true} is VALID [2018-11-19 00:06:55,157 INFO L256 TraceCheckUtils]: 3: Hoare triple {23604#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {23604#true} is VALID [2018-11-19 00:06:55,157 INFO L273 TraceCheckUtils]: 4: Hoare triple {23604#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {23604#true} is VALID [2018-11-19 00:06:55,158 INFO L273 TraceCheckUtils]: 5: Hoare triple {23604#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {23606#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:06:55,159 INFO L273 TraceCheckUtils]: 6: Hoare triple {23606#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {23606#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:06:55,159 INFO L273 TraceCheckUtils]: 7: Hoare triple {23606#(<= main_~r~0 main_~n~0)} assume true; {23606#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:06:55,159 INFO L273 TraceCheckUtils]: 8: Hoare triple {23606#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {23606#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:06:55,160 INFO L273 TraceCheckUtils]: 9: Hoare triple {23606#(<= main_~r~0 main_~n~0)} assume true; {23606#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:06:55,160 INFO L273 TraceCheckUtils]: 10: Hoare triple {23606#(<= main_~r~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {23606#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:06:55,160 INFO L273 TraceCheckUtils]: 11: Hoare triple {23606#(<= main_~r~0 main_~n~0)} assume ~j~0 < ~r~0; {23607#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-19 00:06:55,161 INFO L256 TraceCheckUtils]: 12: Hoare triple {23607#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {23604#true} is VALID [2018-11-19 00:06:55,161 INFO L273 TraceCheckUtils]: 13: Hoare triple {23604#true} ~cond := #in~cond; {23608#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-19 00:06:55,162 INFO L273 TraceCheckUtils]: 14: Hoare triple {23608#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {23609#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:06:55,162 INFO L273 TraceCheckUtils]: 15: Hoare triple {23609#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23609#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:06:55,163 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {23609#(not (= |__VERIFIER_assert_#in~cond| 0))} {23607#(<= (+ main_~j~0 1) main_~n~0)} #100#return; {23607#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-19 00:06:55,163 INFO L256 TraceCheckUtils]: 17: Hoare triple {23607#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {23604#true} is VALID [2018-11-19 00:06:55,164 INFO L273 TraceCheckUtils]: 18: Hoare triple {23604#true} ~cond := #in~cond; {23604#true} is VALID [2018-11-19 00:06:55,164 INFO L273 TraceCheckUtils]: 19: Hoare triple {23604#true} assume !(0 == ~cond); {23604#true} is VALID [2018-11-19 00:06:55,164 INFO L273 TraceCheckUtils]: 20: Hoare triple {23604#true} assume true; {23604#true} is VALID [2018-11-19 00:06:55,165 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {23604#true} {23607#(<= (+ main_~j~0 1) main_~n~0)} #102#return; {23607#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-19 00:06:55,165 INFO L256 TraceCheckUtils]: 22: Hoare triple {23607#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {23604#true} is VALID [2018-11-19 00:06:55,165 INFO L273 TraceCheckUtils]: 23: Hoare triple {23604#true} ~cond := #in~cond; {23604#true} is VALID [2018-11-19 00:06:55,165 INFO L273 TraceCheckUtils]: 24: Hoare triple {23604#true} assume !(0 == ~cond); {23604#true} is VALID [2018-11-19 00:06:55,166 INFO L273 TraceCheckUtils]: 25: Hoare triple {23604#true} assume true; {23604#true} is VALID [2018-11-19 00:06:55,166 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {23604#true} {23607#(<= (+ main_~j~0 1) main_~n~0)} #104#return; {23607#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-19 00:06:55,167 INFO L256 TraceCheckUtils]: 27: Hoare triple {23607#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {23604#true} is VALID [2018-11-19 00:06:55,167 INFO L273 TraceCheckUtils]: 28: Hoare triple {23604#true} ~cond := #in~cond; {23604#true} is VALID [2018-11-19 00:06:55,167 INFO L273 TraceCheckUtils]: 29: Hoare triple {23604#true} assume !(0 == ~cond); {23604#true} is VALID [2018-11-19 00:06:55,167 INFO L273 TraceCheckUtils]: 30: Hoare triple {23604#true} assume true; {23604#true} is VALID [2018-11-19 00:06:55,167 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {23604#true} {23607#(<= (+ main_~j~0 1) main_~n~0)} #106#return; {23607#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-19 00:06:55,168 INFO L273 TraceCheckUtils]: 32: Hoare triple {23607#(<= (+ main_~j~0 1) main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {23607#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-19 00:06:55,168 INFO L273 TraceCheckUtils]: 33: Hoare triple {23607#(<= (+ main_~j~0 1) main_~n~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {23610#(<= main_~j~0 main_~n~0)} is VALID [2018-11-19 00:06:55,168 INFO L256 TraceCheckUtils]: 34: Hoare triple {23610#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {23604#true} is VALID [2018-11-19 00:06:55,169 INFO L273 TraceCheckUtils]: 35: Hoare triple {23604#true} ~cond := #in~cond; {23604#true} is VALID [2018-11-19 00:06:55,169 INFO L273 TraceCheckUtils]: 36: Hoare triple {23604#true} assume !(0 == ~cond); {23604#true} is VALID [2018-11-19 00:06:55,169 INFO L273 TraceCheckUtils]: 37: Hoare triple {23604#true} assume true; {23604#true} is VALID [2018-11-19 00:06:55,169 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {23604#true} {23610#(<= main_~j~0 main_~n~0)} #108#return; {23610#(<= main_~j~0 main_~n~0)} is VALID [2018-11-19 00:06:55,169 INFO L256 TraceCheckUtils]: 39: Hoare triple {23610#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {23604#true} is VALID [2018-11-19 00:06:55,170 INFO L273 TraceCheckUtils]: 40: Hoare triple {23604#true} ~cond := #in~cond; {23604#true} is VALID [2018-11-19 00:06:55,170 INFO L273 TraceCheckUtils]: 41: Hoare triple {23604#true} assume !(0 == ~cond); {23604#true} is VALID [2018-11-19 00:06:55,170 INFO L273 TraceCheckUtils]: 42: Hoare triple {23604#true} assume true; {23604#true} is VALID [2018-11-19 00:06:55,170 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {23604#true} {23610#(<= main_~j~0 main_~n~0)} #110#return; {23610#(<= main_~j~0 main_~n~0)} is VALID [2018-11-19 00:06:55,171 INFO L273 TraceCheckUtils]: 44: Hoare triple {23610#(<= main_~j~0 main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {23610#(<= main_~j~0 main_~n~0)} is VALID [2018-11-19 00:06:55,171 INFO L273 TraceCheckUtils]: 45: Hoare triple {23610#(<= main_~j~0 main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {23610#(<= main_~j~0 main_~n~0)} is VALID [2018-11-19 00:06:55,171 INFO L256 TraceCheckUtils]: 46: Hoare triple {23610#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {23604#true} is VALID [2018-11-19 00:06:55,171 INFO L273 TraceCheckUtils]: 47: Hoare triple {23604#true} ~cond := #in~cond; {23604#true} is VALID [2018-11-19 00:06:55,171 INFO L273 TraceCheckUtils]: 48: Hoare triple {23604#true} assume !(0 == ~cond); {23604#true} is VALID [2018-11-19 00:06:55,171 INFO L273 TraceCheckUtils]: 49: Hoare triple {23604#true} assume true; {23604#true} is VALID [2018-11-19 00:06:55,172 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {23604#true} {23610#(<= main_~j~0 main_~n~0)} #112#return; {23610#(<= main_~j~0 main_~n~0)} is VALID [2018-11-19 00:06:55,172 INFO L256 TraceCheckUtils]: 51: Hoare triple {23610#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {23604#true} is VALID [2018-11-19 00:06:55,172 INFO L273 TraceCheckUtils]: 52: Hoare triple {23604#true} ~cond := #in~cond; {23604#true} is VALID [2018-11-19 00:06:55,172 INFO L273 TraceCheckUtils]: 53: Hoare triple {23604#true} assume !(0 == ~cond); {23604#true} is VALID [2018-11-19 00:06:55,172 INFO L273 TraceCheckUtils]: 54: Hoare triple {23604#true} assume true; {23604#true} is VALID [2018-11-19 00:06:55,173 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {23604#true} {23610#(<= main_~j~0 main_~n~0)} #114#return; {23610#(<= main_~j~0 main_~n~0)} is VALID [2018-11-19 00:06:55,173 INFO L256 TraceCheckUtils]: 56: Hoare triple {23610#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {23604#true} is VALID [2018-11-19 00:06:55,173 INFO L273 TraceCheckUtils]: 57: Hoare triple {23604#true} ~cond := #in~cond; {23604#true} is VALID [2018-11-19 00:06:55,173 INFO L273 TraceCheckUtils]: 58: Hoare triple {23604#true} assume !(0 == ~cond); {23604#true} is VALID [2018-11-19 00:06:55,173 INFO L273 TraceCheckUtils]: 59: Hoare triple {23604#true} assume true; {23604#true} is VALID [2018-11-19 00:06:55,174 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {23604#true} {23610#(<= main_~j~0 main_~n~0)} #116#return; {23610#(<= main_~j~0 main_~n~0)} is VALID [2018-11-19 00:06:55,174 INFO L256 TraceCheckUtils]: 61: Hoare triple {23610#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {23604#true} is VALID [2018-11-19 00:06:55,174 INFO L273 TraceCheckUtils]: 62: Hoare triple {23604#true} ~cond := #in~cond; {23604#true} is VALID [2018-11-19 00:06:55,175 INFO L273 TraceCheckUtils]: 63: Hoare triple {23604#true} assume !(0 == ~cond); {23604#true} is VALID [2018-11-19 00:06:55,175 INFO L273 TraceCheckUtils]: 64: Hoare triple {23604#true} assume true; {23604#true} is VALID [2018-11-19 00:06:55,175 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {23604#true} {23610#(<= main_~j~0 main_~n~0)} #118#return; {23610#(<= main_~j~0 main_~n~0)} is VALID [2018-11-19 00:06:55,176 INFO L273 TraceCheckUtils]: 66: Hoare triple {23610#(<= main_~j~0 main_~n~0)} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {23611#(<= main_~i~0 main_~n~0)} is VALID [2018-11-19 00:06:55,177 INFO L273 TraceCheckUtils]: 67: Hoare triple {23611#(<= main_~i~0 main_~n~0)} assume true; {23611#(<= main_~i~0 main_~n~0)} is VALID [2018-11-19 00:06:55,177 INFO L273 TraceCheckUtils]: 68: Hoare triple {23611#(<= main_~i~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {23611#(<= main_~i~0 main_~n~0)} is VALID [2018-11-19 00:06:55,177 INFO L273 TraceCheckUtils]: 69: Hoare triple {23611#(<= main_~i~0 main_~n~0)} assume !(~j~0 < ~r~0); {23611#(<= main_~i~0 main_~n~0)} is VALID [2018-11-19 00:06:55,177 INFO L256 TraceCheckUtils]: 70: Hoare triple {23611#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {23604#true} is VALID [2018-11-19 00:06:55,178 INFO L273 TraceCheckUtils]: 71: Hoare triple {23604#true} ~cond := #in~cond; {23604#true} is VALID [2018-11-19 00:06:55,178 INFO L273 TraceCheckUtils]: 72: Hoare triple {23604#true} assume !(0 == ~cond); {23604#true} is VALID [2018-11-19 00:06:55,178 INFO L273 TraceCheckUtils]: 73: Hoare triple {23604#true} assume true; {23604#true} is VALID [2018-11-19 00:06:55,178 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {23604#true} {23611#(<= main_~i~0 main_~n~0)} #108#return; {23611#(<= main_~i~0 main_~n~0)} is VALID [2018-11-19 00:06:55,178 INFO L256 TraceCheckUtils]: 75: Hoare triple {23611#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {23604#true} is VALID [2018-11-19 00:06:55,179 INFO L273 TraceCheckUtils]: 76: Hoare triple {23604#true} ~cond := #in~cond; {23604#true} is VALID [2018-11-19 00:06:55,179 INFO L273 TraceCheckUtils]: 77: Hoare triple {23604#true} assume !(0 == ~cond); {23604#true} is VALID [2018-11-19 00:06:55,179 INFO L273 TraceCheckUtils]: 78: Hoare triple {23604#true} assume true; {23604#true} is VALID [2018-11-19 00:06:55,179 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {23604#true} {23611#(<= main_~i~0 main_~n~0)} #110#return; {23611#(<= main_~i~0 main_~n~0)} is VALID [2018-11-19 00:06:55,180 INFO L273 TraceCheckUtils]: 80: Hoare triple {23611#(<= main_~i~0 main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {23611#(<= main_~i~0 main_~n~0)} is VALID [2018-11-19 00:06:55,180 INFO L273 TraceCheckUtils]: 81: Hoare triple {23611#(<= main_~i~0 main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {23611#(<= main_~i~0 main_~n~0)} is VALID [2018-11-19 00:06:55,180 INFO L256 TraceCheckUtils]: 82: Hoare triple {23611#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {23604#true} is VALID [2018-11-19 00:06:55,180 INFO L273 TraceCheckUtils]: 83: Hoare triple {23604#true} ~cond := #in~cond; {23604#true} is VALID [2018-11-19 00:06:55,181 INFO L273 TraceCheckUtils]: 84: Hoare triple {23604#true} assume !(0 == ~cond); {23604#true} is VALID [2018-11-19 00:06:55,181 INFO L273 TraceCheckUtils]: 85: Hoare triple {23604#true} assume true; {23604#true} is VALID [2018-11-19 00:06:55,182 INFO L268 TraceCheckUtils]: 86: Hoare quadruple {23604#true} {23611#(<= main_~i~0 main_~n~0)} #112#return; {23611#(<= main_~i~0 main_~n~0)} is VALID [2018-11-19 00:06:55,182 INFO L256 TraceCheckUtils]: 87: Hoare triple {23611#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {23609#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:06:55,183 INFO L273 TraceCheckUtils]: 88: Hoare triple {23609#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {23612#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-19 00:06:55,184 INFO L273 TraceCheckUtils]: 89: Hoare triple {23612#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {23605#false} is VALID [2018-11-19 00:06:55,184 INFO L273 TraceCheckUtils]: 90: Hoare triple {23605#false} assume !false; {23605#false} is VALID [2018-11-19 00:06:55,190 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-19 00:06:55,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:06:55,190 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:06:55,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:06:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:06:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:06:55,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:06:56,108 INFO L256 TraceCheckUtils]: 0: Hoare triple {23604#true} call ULTIMATE.init(); {23604#true} is VALID [2018-11-19 00:06:56,108 INFO L273 TraceCheckUtils]: 1: Hoare triple {23604#true} assume true; {23604#true} is VALID [2018-11-19 00:06:56,108 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23604#true} {23604#true} #96#return; {23604#true} is VALID [2018-11-19 00:06:56,108 INFO L256 TraceCheckUtils]: 3: Hoare triple {23604#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {23604#true} is VALID [2018-11-19 00:06:56,109 INFO L273 TraceCheckUtils]: 4: Hoare triple {23604#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {23604#true} is VALID [2018-11-19 00:06:56,109 INFO L273 TraceCheckUtils]: 5: Hoare triple {23604#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {23606#(<= main_~r~0 main_~n~0)} is VALID [2018-11-19 00:06:56,110 INFO L273 TraceCheckUtils]: 6: Hoare triple {23606#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {23634#(and (<= 1 main_~l~0) (<= main_~r~0 main_~n~0))} is VALID [2018-11-19 00:06:56,110 INFO L273 TraceCheckUtils]: 7: Hoare triple {23634#(and (<= 1 main_~l~0) (<= main_~r~0 main_~n~0))} assume true; {23634#(and (<= 1 main_~l~0) (<= main_~r~0 main_~n~0))} is VALID [2018-11-19 00:06:56,111 INFO L273 TraceCheckUtils]: 8: Hoare triple {23634#(and (<= 1 main_~l~0) (<= main_~r~0 main_~n~0))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {23641#(and (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} is VALID [2018-11-19 00:06:56,112 INFO L273 TraceCheckUtils]: 9: Hoare triple {23641#(and (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} assume true; {23641#(and (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} is VALID [2018-11-19 00:06:56,112 INFO L273 TraceCheckUtils]: 10: Hoare triple {23641#(and (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} assume !!(~j~0 <= ~r~0); {23641#(and (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} is VALID [2018-11-19 00:06:56,113 INFO L273 TraceCheckUtils]: 11: Hoare triple {23641#(and (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} assume ~j~0 < ~r~0; {23641#(and (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} is VALID [2018-11-19 00:06:56,113 INFO L256 TraceCheckUtils]: 12: Hoare triple {23641#(and (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {23604#true} is VALID [2018-11-19 00:06:56,113 INFO L273 TraceCheckUtils]: 13: Hoare triple {23604#true} ~cond := #in~cond; {23604#true} is VALID [2018-11-19 00:06:56,113 INFO L273 TraceCheckUtils]: 14: Hoare triple {23604#true} assume !(0 == ~cond); {23604#true} is VALID [2018-11-19 00:06:56,113 INFO L273 TraceCheckUtils]: 15: Hoare triple {23604#true} assume true; {23604#true} is VALID [2018-11-19 00:06:56,114 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {23604#true} {23641#(and (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} #100#return; {23641#(and (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} is VALID [2018-11-19 00:06:56,114 INFO L256 TraceCheckUtils]: 17: Hoare triple {23641#(and (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {23604#true} is VALID [2018-11-19 00:06:56,114 INFO L273 TraceCheckUtils]: 18: Hoare triple {23604#true} ~cond := #in~cond; {23604#true} is VALID [2018-11-19 00:06:56,115 INFO L273 TraceCheckUtils]: 19: Hoare triple {23604#true} assume !(0 == ~cond); {23604#true} is VALID [2018-11-19 00:06:56,115 INFO L273 TraceCheckUtils]: 20: Hoare triple {23604#true} assume true; {23604#true} is VALID [2018-11-19 00:06:56,116 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {23604#true} {23641#(and (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} #102#return; {23641#(and (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} is VALID [2018-11-19 00:06:56,116 INFO L256 TraceCheckUtils]: 22: Hoare triple {23641#(and (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {23604#true} is VALID [2018-11-19 00:06:56,116 INFO L273 TraceCheckUtils]: 23: Hoare triple {23604#true} ~cond := #in~cond; {23604#true} is VALID [2018-11-19 00:06:56,116 INFO L273 TraceCheckUtils]: 24: Hoare triple {23604#true} assume !(0 == ~cond); {23604#true} is VALID [2018-11-19 00:06:56,117 INFO L273 TraceCheckUtils]: 25: Hoare triple {23604#true} assume true; {23604#true} is VALID [2018-11-19 00:06:56,117 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {23604#true} {23641#(and (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} #104#return; {23641#(and (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} is VALID [2018-11-19 00:06:56,118 INFO L256 TraceCheckUtils]: 27: Hoare triple {23641#(and (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {23604#true} is VALID [2018-11-19 00:06:56,118 INFO L273 TraceCheckUtils]: 28: Hoare triple {23604#true} ~cond := #in~cond; {23604#true} is VALID [2018-11-19 00:06:56,118 INFO L273 TraceCheckUtils]: 29: Hoare triple {23604#true} assume !(0 == ~cond); {23604#true} is VALID [2018-11-19 00:06:56,118 INFO L273 TraceCheckUtils]: 30: Hoare triple {23604#true} assume true; {23604#true} is VALID [2018-11-19 00:06:56,119 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {23604#true} {23641#(and (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} #106#return; {23641#(and (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} is VALID [2018-11-19 00:06:56,120 INFO L273 TraceCheckUtils]: 32: Hoare triple {23641#(and (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {23641#(and (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} is VALID [2018-11-19 00:06:56,123 INFO L273 TraceCheckUtils]: 33: Hoare triple {23641#(and (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {23717#(and (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (<= main_~r~0 main_~n~0))} is VALID [2018-11-19 00:06:56,123 INFO L256 TraceCheckUtils]: 34: Hoare triple {23717#(and (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {23604#true} is VALID [2018-11-19 00:06:56,123 INFO L273 TraceCheckUtils]: 35: Hoare triple {23604#true} ~cond := #in~cond; {23604#true} is VALID [2018-11-19 00:06:56,123 INFO L273 TraceCheckUtils]: 36: Hoare triple {23604#true} assume !(0 == ~cond); {23604#true} is VALID [2018-11-19 00:06:56,123 INFO L273 TraceCheckUtils]: 37: Hoare triple {23604#true} assume true; {23604#true} is VALID [2018-11-19 00:06:56,124 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {23604#true} {23717#(and (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (<= main_~r~0 main_~n~0))} #108#return; {23717#(and (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (<= main_~r~0 main_~n~0))} is VALID [2018-11-19 00:06:56,125 INFO L256 TraceCheckUtils]: 39: Hoare triple {23717#(and (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {23604#true} is VALID [2018-11-19 00:06:56,125 INFO L273 TraceCheckUtils]: 40: Hoare triple {23604#true} ~cond := #in~cond; {23604#true} is VALID [2018-11-19 00:06:56,125 INFO L273 TraceCheckUtils]: 41: Hoare triple {23604#true} assume !(0 == ~cond); {23604#true} is VALID [2018-11-19 00:06:56,125 INFO L273 TraceCheckUtils]: 42: Hoare triple {23604#true} assume true; {23604#true} is VALID [2018-11-19 00:06:56,126 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {23604#true} {23717#(and (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (<= main_~r~0 main_~n~0))} #110#return; {23717#(and (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (<= main_~r~0 main_~n~0))} is VALID [2018-11-19 00:06:56,127 INFO L273 TraceCheckUtils]: 44: Hoare triple {23717#(and (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (<= main_~r~0 main_~n~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {23717#(and (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (<= main_~r~0 main_~n~0))} is VALID [2018-11-19 00:06:56,128 INFO L273 TraceCheckUtils]: 45: Hoare triple {23717#(and (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (<= main_~r~0 main_~n~0))} assume !(0 != #t~nondet5);havoc #t~nondet5; {23717#(and (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (<= main_~r~0 main_~n~0))} is VALID [2018-11-19 00:06:56,128 INFO L256 TraceCheckUtils]: 46: Hoare triple {23717#(and (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {23604#true} is VALID [2018-11-19 00:06:56,128 INFO L273 TraceCheckUtils]: 47: Hoare triple {23604#true} ~cond := #in~cond; {23604#true} is VALID [2018-11-19 00:06:56,128 INFO L273 TraceCheckUtils]: 48: Hoare triple {23604#true} assume !(0 == ~cond); {23604#true} is VALID [2018-11-19 00:06:56,129 INFO L273 TraceCheckUtils]: 49: Hoare triple {23604#true} assume true; {23604#true} is VALID [2018-11-19 00:06:56,129 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {23604#true} {23717#(and (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (<= main_~r~0 main_~n~0))} #112#return; {23717#(and (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (<= main_~r~0 main_~n~0))} is VALID [2018-11-19 00:06:56,130 INFO L256 TraceCheckUtils]: 51: Hoare triple {23717#(and (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {23604#true} is VALID [2018-11-19 00:06:56,130 INFO L273 TraceCheckUtils]: 52: Hoare triple {23604#true} ~cond := #in~cond; {23604#true} is VALID [2018-11-19 00:06:56,130 INFO L273 TraceCheckUtils]: 53: Hoare triple {23604#true} assume !(0 == ~cond); {23604#true} is VALID [2018-11-19 00:06:56,130 INFO L273 TraceCheckUtils]: 54: Hoare triple {23604#true} assume true; {23604#true} is VALID [2018-11-19 00:06:56,131 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {23604#true} {23717#(and (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (<= main_~r~0 main_~n~0))} #114#return; {23717#(and (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (<= main_~r~0 main_~n~0))} is VALID [2018-11-19 00:06:56,131 INFO L256 TraceCheckUtils]: 56: Hoare triple {23717#(and (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {23604#true} is VALID [2018-11-19 00:06:56,132 INFO L273 TraceCheckUtils]: 57: Hoare triple {23604#true} ~cond := #in~cond; {23604#true} is VALID [2018-11-19 00:06:56,132 INFO L273 TraceCheckUtils]: 58: Hoare triple {23604#true} assume !(0 == ~cond); {23604#true} is VALID [2018-11-19 00:06:56,132 INFO L273 TraceCheckUtils]: 59: Hoare triple {23604#true} assume true; {23604#true} is VALID [2018-11-19 00:06:56,133 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {23604#true} {23717#(and (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (<= main_~r~0 main_~n~0))} #116#return; {23717#(and (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (<= main_~r~0 main_~n~0))} is VALID [2018-11-19 00:06:56,133 INFO L256 TraceCheckUtils]: 61: Hoare triple {23717#(and (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {23604#true} is VALID [2018-11-19 00:06:56,133 INFO L273 TraceCheckUtils]: 62: Hoare triple {23604#true} ~cond := #in~cond; {23604#true} is VALID [2018-11-19 00:06:56,133 INFO L273 TraceCheckUtils]: 63: Hoare triple {23604#true} assume !(0 == ~cond); {23604#true} is VALID [2018-11-19 00:06:56,134 INFO L273 TraceCheckUtils]: 64: Hoare triple {23604#true} assume true; {23604#true} is VALID [2018-11-19 00:06:56,134 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {23604#true} {23717#(and (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (<= main_~r~0 main_~n~0))} #118#return; {23717#(and (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (<= main_~r~0 main_~n~0))} is VALID [2018-11-19 00:06:56,136 INFO L273 TraceCheckUtils]: 66: Hoare triple {23717#(and (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (<= main_~r~0 main_~n~0))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {23817#(and (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int) (v_main_~j~0_31 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) v_main_~j~0_31) (<= (* 2 v_main_~j~0_31) main_~j~0) (<= main_~i~0 v_main_~j~0_31))))} is VALID [2018-11-19 00:06:56,136 INFO L273 TraceCheckUtils]: 67: Hoare triple {23817#(and (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int) (v_main_~j~0_31 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) v_main_~j~0_31) (<= (* 2 v_main_~j~0_31) main_~j~0) (<= main_~i~0 v_main_~j~0_31))))} assume true; {23817#(and (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int) (v_main_~j~0_31 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) v_main_~j~0_31) (<= (* 2 v_main_~j~0_31) main_~j~0) (<= main_~i~0 v_main_~j~0_31))))} is VALID [2018-11-19 00:06:56,138 INFO L273 TraceCheckUtils]: 68: Hoare triple {23817#(and (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int) (v_main_~j~0_31 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) v_main_~j~0_31) (<= (* 2 v_main_~j~0_31) main_~j~0) (<= main_~i~0 v_main_~j~0_31))))} assume !!(~j~0 <= ~r~0); {23824#(exists ((main_~l~0 Int) (v_main_~j~0_31 Int)) (and (<= 1 main_~l~0) (<= (* 2 v_main_~j~0_31) main_~n~0) (<= (+ (* 2 main_~l~0) 1) v_main_~j~0_31) (<= main_~i~0 v_main_~j~0_31)))} is VALID [2018-11-19 00:06:56,138 INFO L273 TraceCheckUtils]: 69: Hoare triple {23824#(exists ((main_~l~0 Int) (v_main_~j~0_31 Int)) (and (<= 1 main_~l~0) (<= (* 2 v_main_~j~0_31) main_~n~0) (<= (+ (* 2 main_~l~0) 1) v_main_~j~0_31) (<= main_~i~0 v_main_~j~0_31)))} assume !(~j~0 < ~r~0); {23824#(exists ((main_~l~0 Int) (v_main_~j~0_31 Int)) (and (<= 1 main_~l~0) (<= (* 2 v_main_~j~0_31) main_~n~0) (<= (+ (* 2 main_~l~0) 1) v_main_~j~0_31) (<= main_~i~0 v_main_~j~0_31)))} is VALID [2018-11-19 00:06:56,138 INFO L256 TraceCheckUtils]: 70: Hoare triple {23824#(exists ((main_~l~0 Int) (v_main_~j~0_31 Int)) (and (<= 1 main_~l~0) (<= (* 2 v_main_~j~0_31) main_~n~0) (<= (+ (* 2 main_~l~0) 1) v_main_~j~0_31) (<= main_~i~0 v_main_~j~0_31)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {23604#true} is VALID [2018-11-19 00:06:56,138 INFO L273 TraceCheckUtils]: 71: Hoare triple {23604#true} ~cond := #in~cond; {23604#true} is VALID [2018-11-19 00:06:56,139 INFO L273 TraceCheckUtils]: 72: Hoare triple {23604#true} assume !(0 == ~cond); {23604#true} is VALID [2018-11-19 00:06:56,139 INFO L273 TraceCheckUtils]: 73: Hoare triple {23604#true} assume true; {23604#true} is VALID [2018-11-19 00:06:56,139 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {23604#true} {23824#(exists ((main_~l~0 Int) (v_main_~j~0_31 Int)) (and (<= 1 main_~l~0) (<= (* 2 v_main_~j~0_31) main_~n~0) (<= (+ (* 2 main_~l~0) 1) v_main_~j~0_31) (<= main_~i~0 v_main_~j~0_31)))} #108#return; {23824#(exists ((main_~l~0 Int) (v_main_~j~0_31 Int)) (and (<= 1 main_~l~0) (<= (* 2 v_main_~j~0_31) main_~n~0) (<= (+ (* 2 main_~l~0) 1) v_main_~j~0_31) (<= main_~i~0 v_main_~j~0_31)))} is VALID [2018-11-19 00:06:56,139 INFO L256 TraceCheckUtils]: 75: Hoare triple {23824#(exists ((main_~l~0 Int) (v_main_~j~0_31 Int)) (and (<= 1 main_~l~0) (<= (* 2 v_main_~j~0_31) main_~n~0) (<= (+ (* 2 main_~l~0) 1) v_main_~j~0_31) (<= main_~i~0 v_main_~j~0_31)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {23604#true} is VALID [2018-11-19 00:06:56,139 INFO L273 TraceCheckUtils]: 76: Hoare triple {23604#true} ~cond := #in~cond; {23604#true} is VALID [2018-11-19 00:06:56,140 INFO L273 TraceCheckUtils]: 77: Hoare triple {23604#true} assume !(0 == ~cond); {23604#true} is VALID [2018-11-19 00:06:56,140 INFO L273 TraceCheckUtils]: 78: Hoare triple {23604#true} assume true; {23604#true} is VALID [2018-11-19 00:06:56,140 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {23604#true} {23824#(exists ((main_~l~0 Int) (v_main_~j~0_31 Int)) (and (<= 1 main_~l~0) (<= (* 2 v_main_~j~0_31) main_~n~0) (<= (+ (* 2 main_~l~0) 1) v_main_~j~0_31) (<= main_~i~0 v_main_~j~0_31)))} #110#return; {23824#(exists ((main_~l~0 Int) (v_main_~j~0_31 Int)) (and (<= 1 main_~l~0) (<= (* 2 v_main_~j~0_31) main_~n~0) (<= (+ (* 2 main_~l~0) 1) v_main_~j~0_31) (<= main_~i~0 v_main_~j~0_31)))} is VALID [2018-11-19 00:06:56,141 INFO L273 TraceCheckUtils]: 80: Hoare triple {23824#(exists ((main_~l~0 Int) (v_main_~j~0_31 Int)) (and (<= 1 main_~l~0) (<= (* 2 v_main_~j~0_31) main_~n~0) (<= (+ (* 2 main_~l~0) 1) v_main_~j~0_31) (<= main_~i~0 v_main_~j~0_31)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {23824#(exists ((main_~l~0 Int) (v_main_~j~0_31 Int)) (and (<= 1 main_~l~0) (<= (* 2 v_main_~j~0_31) main_~n~0) (<= (+ (* 2 main_~l~0) 1) v_main_~j~0_31) (<= main_~i~0 v_main_~j~0_31)))} is VALID [2018-11-19 00:06:56,142 INFO L273 TraceCheckUtils]: 81: Hoare triple {23824#(exists ((main_~l~0 Int) (v_main_~j~0_31 Int)) (and (<= 1 main_~l~0) (<= (* 2 v_main_~j~0_31) main_~n~0) (<= (+ (* 2 main_~l~0) 1) v_main_~j~0_31) (<= main_~i~0 v_main_~j~0_31)))} assume !(0 != #t~nondet5);havoc #t~nondet5; {23824#(exists ((main_~l~0 Int) (v_main_~j~0_31 Int)) (and (<= 1 main_~l~0) (<= (* 2 v_main_~j~0_31) main_~n~0) (<= (+ (* 2 main_~l~0) 1) v_main_~j~0_31) (<= main_~i~0 v_main_~j~0_31)))} is VALID [2018-11-19 00:06:56,142 INFO L256 TraceCheckUtils]: 82: Hoare triple {23824#(exists ((main_~l~0 Int) (v_main_~j~0_31 Int)) (and (<= 1 main_~l~0) (<= (* 2 v_main_~j~0_31) main_~n~0) (<= (+ (* 2 main_~l~0) 1) v_main_~j~0_31) (<= main_~i~0 v_main_~j~0_31)))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {23604#true} is VALID [2018-11-19 00:06:56,142 INFO L273 TraceCheckUtils]: 83: Hoare triple {23604#true} ~cond := #in~cond; {23604#true} is VALID [2018-11-19 00:06:56,142 INFO L273 TraceCheckUtils]: 84: Hoare triple {23604#true} assume !(0 == ~cond); {23604#true} is VALID [2018-11-19 00:06:56,143 INFO L273 TraceCheckUtils]: 85: Hoare triple {23604#true} assume true; {23604#true} is VALID [2018-11-19 00:06:56,143 INFO L268 TraceCheckUtils]: 86: Hoare quadruple {23604#true} {23824#(exists ((main_~l~0 Int) (v_main_~j~0_31 Int)) (and (<= 1 main_~l~0) (<= (* 2 v_main_~j~0_31) main_~n~0) (<= (+ (* 2 main_~l~0) 1) v_main_~j~0_31) (<= main_~i~0 v_main_~j~0_31)))} #112#return; {23824#(exists ((main_~l~0 Int) (v_main_~j~0_31 Int)) (and (<= 1 main_~l~0) (<= (* 2 v_main_~j~0_31) main_~n~0) (<= (+ (* 2 main_~l~0) 1) v_main_~j~0_31) (<= main_~i~0 v_main_~j~0_31)))} is VALID [2018-11-19 00:06:56,144 INFO L256 TraceCheckUtils]: 87: Hoare triple {23824#(exists ((main_~l~0 Int) (v_main_~j~0_31 Int)) (and (<= 1 main_~l~0) (<= (* 2 v_main_~j~0_31) main_~n~0) (<= (+ (* 2 main_~l~0) 1) v_main_~j~0_31) (<= main_~i~0 v_main_~j~0_31)))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {23882#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-19 00:06:56,145 INFO L273 TraceCheckUtils]: 88: Hoare triple {23882#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {23886#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-19 00:06:56,145 INFO L273 TraceCheckUtils]: 89: Hoare triple {23886#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23605#false} is VALID [2018-11-19 00:06:56,145 INFO L273 TraceCheckUtils]: 90: Hoare triple {23605#false} assume !false; {23605#false} is VALID [2018-11-19 00:06:56,157 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 28 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-19 00:06:56,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:06:56,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-11-19 00:06:56,176 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 91 [2018-11-19 00:06:56,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:06:56,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-19 00:06:56,325 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:06:56,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-19 00:06:56,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-19 00:06:56,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-11-19 00:06:56,326 INFO L87 Difference]: Start difference. First operand 214 states and 301 transitions. Second operand 16 states. [2018-11-19 00:07:03,383 WARN L180 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-19 00:07:15,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:15,922 INFO L93 Difference]: Finished difference Result 348 states and 495 transitions. [2018-11-19 00:07:15,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-19 00:07:15,923 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 91 [2018-11-19 00:07:15,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:07:15,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-19 00:07:15,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 384 transitions. [2018-11-19 00:07:15,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-19 00:07:15,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 384 transitions. [2018-11-19 00:07:15,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 384 transitions. [2018-11-19 00:07:22,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 384 edges. 372 inductive. 0 not inductive. 12 times theorem prover too weak to decide inductivity. [2018-11-19 00:07:22,049 INFO L225 Difference]: With dead ends: 348 [2018-11-19 00:07:22,050 INFO L226 Difference]: Without dead ends: 0 [2018-11-19 00:07:22,053 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=549, Invalid=1900, Unknown=1, NotChecked=0, Total=2450 [2018-11-19 00:07:22,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-19 00:07:22,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-19 00:07:22,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:07:22,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-19 00:07:22,054 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-19 00:07:22,054 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-19 00:07:22,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:22,054 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-19 00:07:22,054 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-19 00:07:22,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:22,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:22,055 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-19 00:07:22,055 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-19 00:07:22,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:22,055 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-19 00:07:22,055 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-19 00:07:22,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:22,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:22,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:07:22,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:07:22,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-19 00:07:22,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-19 00:07:22,056 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2018-11-19 00:07:22,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:07:22,056 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-19 00:07:22,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-19 00:07:22,057 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-19 00:07:22,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:22,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-19 00:07:22,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:22,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:22,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:22,467 WARN L180 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 146 [2018-11-19 00:07:22,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:22,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:22,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:22,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:22,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:22,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:22,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:22,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:22,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:22,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:22,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:22,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:22,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:22,869 WARN L180 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 124 [2018-11-19 00:07:23,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:23,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:23,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:23,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:23,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:23,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:23,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:23,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:23,394 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 115 [2018-11-19 00:07:23,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:23,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:23,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:23,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:25,249 WARN L180 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 94 DAG size of output: 23 [2018-11-19 00:07:27,047 WARN L180 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 145 DAG size of output: 16 [2018-11-19 00:07:28,708 WARN L180 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 92 DAG size of output: 23 [2018-11-19 00:07:30,331 WARN L180 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 123 DAG size of output: 17 [2018-11-19 00:07:30,919 WARN L180 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 22 [2018-11-19 00:07:31,073 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 22 [2018-11-19 00:07:31,281 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 23 [2018-11-19 00:07:31,495 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 22 [2018-11-19 00:07:31,704 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 23 [2018-11-19 00:07:32,124 WARN L180 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 18 [2018-11-19 00:07:32,283 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 22 [2018-11-19 00:07:32,504 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 24 [2018-11-19 00:07:32,976 WARN L180 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 18 [2018-11-19 00:07:33,369 WARN L180 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 21 [2018-11-19 00:07:47,222 WARN L180 SmtUtils]: Spent 13.58 s on a formula simplification. DAG size of input: 100 DAG size of output: 29 [2018-11-19 00:07:47,230 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-19 00:07:47,230 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-19 00:07:47,230 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-19 00:07:47,230 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-19 00:07:47,231 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-19 00:07:47,231 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-19 00:07:47,231 INFO L421 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (and (<= 1 main_~l~0) (<= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~j~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= 2 main_~r~0)) [2018-11-19 00:07:47,231 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 56) no Hoare annotation was computed. [2018-11-19 00:07:47,231 INFO L421 ceAbstractionStarter]: At program point L40(line 40) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= main_~j~0 main_~n~0) (<= 2 main_~r~0)) [2018-11-19 00:07:47,232 INFO L421 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (and (<= 1 main_~l~0) (<= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~j~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= 2 main_~r~0)) [2018-11-19 00:07:47,232 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 24 44) no Hoare annotation was computed. [2018-11-19 00:07:47,233 INFO L421 ceAbstractionStarter]: At program point L24-3(lines 24 44) the Hoare annotation is: (let ((.cse0 (<= 1 main_~l~0)) (.cse1 (<= 1 main_~i~0)) (.cse2 (<= main_~l~0 (+ (div main_~n~0 2) 1))) (.cse3 (<= 2 main_~r~0))) (or (and .cse0 .cse1 (<= main_~i~0 main_~n~0) .cse2 (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse3) (and .cse0 .cse1 .cse2 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse3 (<= (+ main_~r~0 1) main_~n~0)))) [2018-11-19 00:07:47,233 INFO L425 ceAbstractionStarter]: For program point L24-4(lines 21 54) no Hoare annotation was computed. [2018-11-19 00:07:47,233 INFO L425 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2018-11-19 00:07:47,233 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 10 56) no Hoare annotation was computed. [2018-11-19 00:07:47,233 INFO L425 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2018-11-19 00:07:47,233 INFO L421 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (and (<= 1 main_~l~0) (<= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= main_~j~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= 2 main_~r~0)) [2018-11-19 00:07:47,234 INFO L425 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-11-19 00:07:47,234 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 32) no Hoare annotation was computed. [2018-11-19 00:07:47,234 INFO L421 ceAbstractionStarter]: At program point L25-1(lines 25 32) the Hoare annotation is: (and (<= 1 main_~l~0) (<= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= main_~j~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= 2 main_~r~0)) [2018-11-19 00:07:47,234 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 54) no Hoare annotation was computed. [2018-11-19 00:07:47,234 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 21 54) no Hoare annotation was computed. [2018-11-19 00:07:47,234 INFO L421 ceAbstractionStarter]: At program point L50(line 50) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0)) [2018-11-19 00:07:47,234 INFO L421 ceAbstractionStarter]: At program point L50-1(line 50) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0)) [2018-11-19 00:07:47,235 INFO L421 ceAbstractionStarter]: At program point L46(line 46) the Hoare annotation is: (and (<= 2 main_~j~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= main_~r~0 main_~n~0) (<= 2 main_~l~0) (<= 2 main_~r~0)) [2018-11-19 00:07:47,235 INFO L425 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-11-19 00:07:47,235 INFO L421 ceAbstractionStarter]: At program point L46-1(line 46) the Hoare annotation is: (and (<= 2 main_~j~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= main_~r~0 main_~n~0) (<= 2 main_~l~0) (<= 2 main_~r~0)) [2018-11-19 00:07:47,235 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 56) no Hoare annotation was computed. [2018-11-19 00:07:47,235 INFO L421 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (and (<= 1 main_~l~0) (<= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= main_~j~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= 2 main_~r~0)) [2018-11-19 00:07:47,235 INFO L421 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (and (<= 1 main_~l~0) (<= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= main_~j~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= 2 main_~r~0)) [2018-11-19 00:07:47,236 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-19 00:07:47,236 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-11-19 00:07:47,236 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 56) the Hoare annotation is: true [2018-11-19 00:07:47,236 INFO L421 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (and (<= 1 main_~l~0) (<= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~j~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= 2 main_~r~0)) [2018-11-19 00:07:47,236 INFO L421 ceAbstractionStarter]: At program point L26-1(line 26) the Hoare annotation is: (and (<= 1 main_~l~0) (<= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~j~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= 2 main_~r~0)) [2018-11-19 00:07:47,236 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-11-19 00:07:47,236 INFO L425 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2018-11-19 00:07:47,237 INFO L421 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (and (<= 1 main_~l~0) (<= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= main_~j~0 main_~n~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= 2 main_~r~0)) [2018-11-19 00:07:47,237 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-11-19 00:07:47,237 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-19 00:07:47,237 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-19 00:07:47,237 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-19 00:07:47,237 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-19 00:07:47,237 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-19 00:07:47,238 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-19 00:07:47,239 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-19 00:07:47,240 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-19 00:07:47,240 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-19 00:07:47,240 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-19 00:07:47,240 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-19 00:07:47,240 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-19 00:07:47,240 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-19 00:07:47,240 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-19 00:07:47,241 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-19 00:07:47,241 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-19 00:07:47,241 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-19 00:07:47,241 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-19 00:07:47,241 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-19 00:07:47,241 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-19 00:07:47,241 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-19 00:07:47,241 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-19 00:07:47,241 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-19 00:07:47,242 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2018-11-19 00:07:47,242 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2018-11-19 00:07:47,242 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-19 00:07:47,242 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-19 00:07:47,242 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-19 00:07:47,242 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-19 00:07:47,242 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-19 00:07:47,242 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-19 00:07:47,242 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-19 00:07:47,243 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-19 00:07:47,243 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-19 00:07:47,243 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-19 00:07:47,243 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-19 00:07:47,243 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-19 00:07:47,243 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-19 00:07:47,243 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-19 00:07:47,243 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-19 00:07:47,243 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-19 00:07:47,244 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2018-11-19 00:07:47,244 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-19 00:07:47,244 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-19 00:07:47,244 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2018-11-19 00:07:47,244 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2018-11-19 00:07:47,244 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-19 00:07:47,244 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-19 00:07:47,244 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2018-11-19 00:07:47,245 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2018-11-19 00:07:47,245 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2018-11-19 00:07:47,245 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2018-11-19 00:07:47,245 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2018-11-19 00:07:47,245 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2018-11-19 00:07:47,245 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-19 00:07:47,245 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-19 00:07:47,245 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-19 00:07:47,245 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-19 00:07:47,245 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2018-11-19 00:07:47,246 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2018-11-19 00:07:47,246 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2018-11-19 00:07:47,246 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2018-11-19 00:07:47,246 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-19 00:07:47,246 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-19 00:07:47,246 INFO L163 areAnnotationChecker]: CFG has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-19 00:07:47,252 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-19 00:07:47,253 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-19 00:07:47,253 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-19 00:07:47,254 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-19 00:07:47,258 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-19 00:07:47,258 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-19 00:07:47,258 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-19 00:07:47,259 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-19 00:07:47,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:07:47 BoogieIcfgContainer [2018-11-19 00:07:47,261 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-19 00:07:47,262 INFO L168 Benchmark]: Toolchain (without parser) took 188541.84 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 133.4 MB. Max. memory is 7.1 GB. [2018-11-19 00:07:47,263 INFO L168 Benchmark]: CDTParser took 0.23 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-19 00:07:47,264 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.95 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-19 00:07:47,264 INFO L168 Benchmark]: Boogie Preprocessor took 39.56 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-19 00:07:47,265 INFO L168 Benchmark]: RCFGBuilder took 934.55 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 709.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -746.1 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-19 00:07:47,265 INFO L168 Benchmark]: TraceAbstraction took 187204.38 ms. Allocated memory was 2.2 GB in the beginning and 2.8 GB in the end (delta: 549.5 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -389.9 MB). Peak memory consumption was 159.5 MB. Max. memory is 7.1 GB. [2018-11-19 00:07:47,268 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 0.23 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 358.95 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.56 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 934.55 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 709.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -746.1 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 187204.38 ms. Allocated memory was 2.2 GB in the beginning and 2.8 GB in the end (delta: 549.5 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -389.9 MB). Peak memory consumption was 159.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] * 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: 24]: Loop Invariant [2018-11-19 00:07:47,274 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-19 00:07:47,274 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-19 00:07:47,275 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-19 00:07:47,275 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-19 00:07:47,275 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-19 00:07:47,276 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-19 00:07:47,276 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-19 00:07:47,276 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] Derived loop invariant: (((((((1 <= l && 1 <= i) && i <= n) && l <= n / 2 + 1) && l + 1 <= n) && r <= n) && (\exists main_~l~0 : int :: 1 <= main_~l~0 && 2 * main_~l~0 <= j)) && 2 <= r) || (((((1 <= l && 1 <= i) && l <= n / 2 + 1) && (\exists main_~l~0 : int :: i <= main_~l~0 && 2 * main_~l~0 <= j)) && 2 <= r) && r + 1 <= n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 1 error locations. SAFE Result, 187.1s OverallTime, 14 OverallIterations, 14 TraceHistogramMax, 123.7s AutomataDifference, 0.0s DeadEndRemovalTime, 25.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 805 SDtfs, 930 SDslu, 3853 SDs, 0 SdLazy, 6442 SolverSat, 1563 SolverUnsat, 26 SolverUnknown, 0 SolverNotchecked, 29.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 728 GetRequests, 508 SyntacticMatches, 7 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 14.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=541occurred in iteration=11, 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: 25.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 479 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 633 PreInvPairs, 938 NumberOfFragments, 568 HoareAnnotationTreeSize, 633 FomulaSimplifications, 74228018 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 20 FomulaSimplificationsInter, 5045138 FormulaSimplificationTreeSizeReductionInter, 22.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 1057 NumberOfCodeBlocks, 1057 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1032 ConstructedInterpolants, 71 QuantifiedInterpolants, 187278 SizeOfPredicates, 42 NumberOfNonLiveVariables, 1171 ConjunctsInSsa, 122 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 1656/1804 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...