java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInlineTransformed.xml --icfgtransformation.transformationtype MAP_ELIMINATION_MONNIAUX -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/n.c11.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-48de6b2 [2019-04-26 16:09:57,223 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-04-26 16:09:57,225 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-04-26 16:09:57,242 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-04-26 16:09:57,242 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-04-26 16:09:57,244 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-04-26 16:09:57,246 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-04-26 16:09:57,248 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-04-26 16:09:57,250 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-04-26 16:09:57,257 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-04-26 16:09:57,258 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-04-26 16:09:57,260 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-04-26 16:09:57,261 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-04-26 16:09:57,263 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-04-26 16:09:57,267 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-04-26 16:09:57,267 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-04-26 16:09:57,268 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-04-26 16:09:57,274 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-04-26 16:09:57,276 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-04-26 16:09:57,279 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-04-26 16:09:57,280 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-04-26 16:09:57,281 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-04-26 16:09:57,284 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-04-26 16:09:57,284 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-04-26 16:09:57,284 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-04-26 16:09:57,285 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-04-26 16:09:57,285 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-04-26 16:09:57,286 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-04-26 16:09:57,287 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-04-26 16:09:57,287 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-04-26 16:09:57,288 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-04-26 16:09:57,289 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-04-26 16:09:57,290 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-04-26 16:09:57,290 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-04-26 16:09:57,291 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-04-26 16:09:57,291 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-04-26 16:09:57,291 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-04-26 16:09:57,292 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-04-26 16:09:57,293 INFO L181 SettingsManager]: Finished resetting all preferences to default values... Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: TransformationType -> MAP_ELIMINATION_MONNIAUX [2019-04-26 16:09:57,344 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-04-26 16:09:57,356 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-04-26 16:09:57,358 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-04-26 16:09:57,360 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-04-26 16:09:57,360 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-04-26 16:09:57,361 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/n.c11.i_3.bpl [2019-04-26 16:09:57,361 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/n.c11.i_3.bpl' [2019-04-26 16:09:57,394 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-04-26 16:09:57,396 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-04-26 16:09:57,396 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-04-26 16:09:57,397 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-04-26 16:09:57,397 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-04-26 16:09:57,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:57" (1/1) ... [2019-04-26 16:09:57,425 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:57" (1/1) ... [2019-04-26 16:09:57,433 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-04-26 16:09:57,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-04-26 16:09:57,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-04-26 16:09:57,435 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-04-26 16:09:57,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:57" (1/1) ... [2019-04-26 16:09:57,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:57" (1/1) ... [2019-04-26 16:09:57,447 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:57" (1/1) ... [2019-04-26 16:09:57,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:57" (1/1) ... [2019-04-26 16:09:57,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:57" (1/1) ... [2019-04-26 16:09:57,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:57" (1/1) ... [2019-04-26 16:09:57,454 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:57" (1/1) ... [2019-04-26 16:09:57,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-04-26 16:09:57,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-04-26 16:09:57,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-04-26 16:09:57,457 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-04-26 16:09:57,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:57" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-04-26 16:09:57,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-04-26 16:09:57,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-04-26 16:09:57,853 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-04-26 16:09:57,854 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-04-26 16:09:57,855 INFO L202 PluginConnector]: Adding new model n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:09:57 BoogieIcfgContainer [2019-04-26 16:09:57,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-04-26 16:09:57,859 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2019-04-26 16:09:57,859 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2019-04-26 16:09:57,860 INFO L276 PluginConnector]: IcfgTransformer initialized [2019-04-26 16:09:57,865 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:09:57" (1/1) ... [2019-04-26 16:09:57,911 INFO L359 onniauxMapEliminator]: L40 [2019-04-26 16:09:57,911 INFO L360 onniauxMapEliminator]: In Formula: (and (not (= 4 (mod v_ULTIMATE.start_main_~len~5_6 4294967296))) (= v_ULTIMATE.start_main_~a~5_4 (store v_ULTIMATE.start_main_~a~5_5 (mod v_ULTIMATE.start_main_~len~5_6 4294967296) 0)) (not (= 0 (mod |v_ULTIMATE.start_main_#t~nondet0_5| 256))) (= (+ v_ULTIMATE.start_main_~len~5_6 1) v_ULTIMATE.start_main_~len~5_5)) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_5|, ULTIMATE.start_main_~a~5=v_ULTIMATE.start_main_~a~5_5, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_6} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_4|, ULTIMATE.start_main_~a~5=v_ULTIMATE.start_main_~a~5_4, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~a~5, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~len~5] [2019-04-26 16:09:57,912 INFO L361 onniauxMapEliminator]: Out Formula: (and (or (= v_ULTIMATE.start_main_~a~5_val_0_in_1 0) (not (= v_ULTIMATE.start_main_~a~5_idx_0_term_1 (mod v_ULTIMATE.start_main_~len~5_6 4294967296)))) (not (= 4 (mod v_ULTIMATE.start_main_~len~5_6 4294967296))) (not (= 0 (mod |v_ULTIMATE.start_main_#t~nondet0_5| 256))) (= (+ v_ULTIMATE.start_main_~len~5_6 1) v_ULTIMATE.start_main_~len~5_5) (= v_ULTIMATE.start_main_~a~5_idx_0_term_1 (mod v_ULTIMATE.start_main_~len~5_6 4294967296))) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_5|, ULTIMATE.start_main_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_in_1, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_6} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_4|, ULTIMATE.start_main_~a~5_idx_0=v_ULTIMATE.start_main_~a~5_idx_0_term_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|, ULTIMATE.start_main_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_out_1, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~a~5_idx_0, ULTIMATE.start_main_~a~5_val_0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~len~5] [2019-04-26 16:09:57,912 INFO L362 onniauxMapEliminator]: L40 [2019-04-26 16:09:57,933 INFO L202 PluginConnector]: Adding new model n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 26.04 04:09:57 BasicIcfg [2019-04-26 16:09:57,934 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2019-04-26 16:09:57,935 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-04-26 16:09:57,936 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-04-26 16:09:57,939 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-04-26 16:09:57,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:57" (1/3) ... [2019-04-26 16:09:57,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@201641c9 and model type n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.04 04:09:57, skipping insertion in model container [2019-04-26 16:09:57,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:09:57" (2/3) ... [2019-04-26 16:09:57,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@201641c9 and model type n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.04 04:09:57, skipping insertion in model container [2019-04-26 16:09:57,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 26.04 04:09:57" (3/3) ... [2019-04-26 16:09:57,943 INFO L112 eAbstractionObserver]: Analyzing ICFG n.c11.i_3.bplME [2019-04-26 16:09:57,965 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-04-26 16:09:57,976 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-04-26 16:09:57,998 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-26 16:09:58,028 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-04-26 16:09:58,029 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-26 16:09:58,029 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-26 16:09:58,029 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-26 16:09:58,030 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-26 16:09:58,030 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-26 16:09:58,030 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-26 16:09:58,030 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-26 16:09:58,030 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-04-26 16:09:58,051 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-04-26 16:09:58,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-04-26 16:09:58,074 INFO L394 BasicCegarLoop]: Found error trace [2019-04-26 16:09:58,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-04-26 16:09:58,078 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-04-26 16:09:58,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-26 16:09:58,084 INFO L82 PathProgramCache]: Analyzing trace with hash 42734, now seen corresponding path program 1 times [2019-04-26 16:09:58,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-04-26 16:09:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-26 16:09:58,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2019-04-26 16:09:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-26 16:09:58,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-26 16:09:58,329 INFO L273 TraceCheckUtils]: 0: Hoare triple {8#true} [13] ULTIMATE.startENTRY-->L40: Formula: (= v_ULTIMATE.start_main_~len~5_1 0) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~a~5=v_ULTIMATE.start_main_~a~5_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_1|, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~a~5, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~len~5, ULTIMATE.start_main_~i~5] {13#(= 0 ULTIMATE.start_main_~len~5)} is VALID [2019-04-26 16:09:58,334 INFO L273 TraceCheckUtils]: 1: Hoare triple {13#(= 0 ULTIMATE.start_main_~len~5)} [14] L40-->L31: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (= (mod |v_ULTIMATE.start_main_#t~nondet0_3| 256) 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (let ((.cse0 (mod v_ULTIMATE.start_main_~len~5_4 4294967296))) (and (<= 0 .cse0) (< .cse0 5))) 1 0))) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_3|, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_4} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_2|, ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start___VERIFIER_assert_#in~cond] {9#false} is VALID [2019-04-26 16:09:58,335 INFO L273 TraceCheckUtils]: 2: Hoare triple {9#false} [16] L31-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9#false} is VALID [2019-04-26 16:09:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-26 16:09:58,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-26 16:09:58,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-26 16:09:58,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-04-26 16:09:58,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-04-26 16:09:58,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-04-26 16:09:58,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-04-26 16:09:58,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-26 16:09:58,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-26 16:09:58,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-26 16:09:58,387 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-04-26 16:09:58,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-26 16:09:58,447 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-04-26 16:09:58,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-26 16:09:58,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-04-26 16:09:58,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-26 16:09:58,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-04-26 16:09:58,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-04-26 16:09:58,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-04-26 16:09:58,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-04-26 16:09:58,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 7 transitions. [2019-04-26 16:09:58,511 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-04-26 16:09:58,521 INFO L225 Difference]: With dead ends: 5 [2019-04-26 16:09:58,521 INFO L226 Difference]: Without dead ends: 5 [2019-04-26 16:09:58,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-26 16:09:58,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-04-26 16:09:58,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-04-26 16:09:58,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-04-26 16:09:58,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-04-26 16:09:58,551 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-04-26 16:09:58,551 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-04-26 16:09:58,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-26 16:09:58,553 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-04-26 16:09:58,554 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-04-26 16:09:58,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-26 16:09:58,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-04-26 16:09:58,554 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-04-26 16:09:58,555 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-04-26 16:09:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-26 16:09:58,558 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-04-26 16:09:58,558 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-04-26 16:09:58,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-26 16:09:58,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-04-26 16:09:58,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-04-26 16:09:58,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-04-26 16:09:58,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-04-26 16:09:58,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-04-26 16:09:58,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-04-26 16:09:58,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-26 16:09:58,564 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-04-26 16:09:58,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-26 16:09:58,564 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-04-26 16:09:58,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-04-26 16:09:58,565 INFO L394 BasicCegarLoop]: Found error trace [2019-04-26 16:09:58,566 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-04-26 16:09:58,566 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-04-26 16:09:58,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-26 16:09:58,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1325669, now seen corresponding path program 1 times [2019-04-26 16:09:58,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-04-26 16:09:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-26 16:09:58,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 8 conjunts are in the unsatisfiable core [2019-04-26 16:09:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-26 16:09:58,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-26 16:09:58,810 INFO L273 TraceCheckUtils]: 0: Hoare triple {39#true} [13] ULTIMATE.startENTRY-->L40: Formula: (= v_ULTIMATE.start_main_~len~5_1 0) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~a~5=v_ULTIMATE.start_main_~a~5_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_1|, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~a~5, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~len~5, ULTIMATE.start_main_~i~5] {44#(= 0 ULTIMATE.start_main_~len~5)} is VALID [2019-04-26 16:09:58,836 INFO L273 TraceCheckUtils]: 1: Hoare triple {44#(= 0 ULTIMATE.start_main_~len~5)} [15] L40-->L40: Formula: (let ((.cse1 (mod v_ULTIMATE.start_main_~len~5_6 4294967296))) (let ((.cse0 (= v_ULTIMATE.start_main_~a~5_idx_0_term_1 .cse1))) (and (or (= v_ULTIMATE.start_main_~a~5_val_0_in_1 0) (not .cse0)) (not (= 4 .cse1)) (not (= 0 (mod |v_ULTIMATE.start_main_#t~nondet0_5| 256))) (= (+ v_ULTIMATE.start_main_~len~5_6 1) v_ULTIMATE.start_main_~len~5_5) .cse0))) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_5|, ULTIMATE.start_main_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_in_1, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_6} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_4|, ULTIMATE.start_main_~a~5_idx_0=v_ULTIMATE.start_main_~a~5_idx_0_term_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|, ULTIMATE.start_main_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_out_1, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~a~5_idx_0, ULTIMATE.start_main_~a~5_val_0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~len~5] {48#(= 1 ULTIMATE.start_main_~len~5)} is VALID [2019-04-26 16:09:58,840 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#(= 1 ULTIMATE.start_main_~len~5)} [14] L40-->L31: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (= (mod |v_ULTIMATE.start_main_#t~nondet0_3| 256) 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (let ((.cse0 (mod v_ULTIMATE.start_main_~len~5_4 4294967296))) (and (<= 0 .cse0) (< .cse0 5))) 1 0))) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_3|, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_4} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_2|, ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start___VERIFIER_assert_#in~cond] {40#false} is VALID [2019-04-26 16:09:58,841 INFO L273 TraceCheckUtils]: 3: Hoare triple {40#false} [16] L31-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#false} is VALID [2019-04-26 16:09:58,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-26 16:09:58,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-04-26 16:09:58,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-04-26 16:09:58,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-04-26 16:09:58,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-04-26 16:09:58,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-04-26 16:09:58,905 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-04-26 16:09:58,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-26 16:09:58,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-26 16:09:58,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-26 16:09:58,906 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-04-26 16:09:59,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-26 16:09:59,035 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-04-26 16:09:59,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-26 16:09:59,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-04-26 16:09:59,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-26 16:09:59,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-04-26 16:09:59,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-04-26 16:09:59,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-04-26 16:09:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-04-26 16:09:59,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 7 transitions. [2019-04-26 16:09:59,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-04-26 16:09:59,115 INFO L225 Difference]: With dead ends: 6 [2019-04-26 16:09:59,115 INFO L226 Difference]: Without dead ends: 6 [2019-04-26 16:09:59,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-26 16:09:59,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-04-26 16:09:59,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-04-26 16:09:59,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-04-26 16:09:59,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2019-04-26 16:09:59,119 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-04-26 16:09:59,120 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-04-26 16:09:59,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-26 16:09:59,121 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-04-26 16:09:59,121 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-04-26 16:09:59,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-26 16:09:59,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-04-26 16:09:59,122 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-04-26 16:09:59,122 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-04-26 16:09:59,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-26 16:09:59,123 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-04-26 16:09:59,123 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-04-26 16:09:59,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-26 16:09:59,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-04-26 16:09:59,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-04-26 16:09:59,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-04-26 16:09:59,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-04-26 16:09:59,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-04-26 16:09:59,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-04-26 16:09:59,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-26 16:09:59,126 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-04-26 16:09:59,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-26 16:09:59,126 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-04-26 16:09:59,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-04-26 16:09:59,126 INFO L394 BasicCegarLoop]: Found error trace [2019-04-26 16:09:59,126 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-04-26 16:09:59,127 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-04-26 16:09:59,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-26 16:09:59,127 INFO L82 PathProgramCache]: Analyzing trace with hash 41096654, now seen corresponding path program 2 times [2019-04-26 16:09:59,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-04-26 16:09:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-26 16:09:59,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-04-26 16:09:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-26 16:09:59,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-26 16:09:59,338 INFO L273 TraceCheckUtils]: 0: Hoare triple {78#true} [13] ULTIMATE.startENTRY-->L40: Formula: (= v_ULTIMATE.start_main_~len~5_1 0) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~a~5=v_ULTIMATE.start_main_~a~5_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_1|, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~a~5, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~len~5, ULTIMATE.start_main_~i~5] {83#(= 0 ULTIMATE.start_main_~len~5)} is VALID [2019-04-26 16:09:59,343 INFO L273 TraceCheckUtils]: 1: Hoare triple {83#(= 0 ULTIMATE.start_main_~len~5)} [15] L40-->L40: Formula: (let ((.cse1 (mod v_ULTIMATE.start_main_~len~5_6 4294967296))) (let ((.cse0 (= v_ULTIMATE.start_main_~a~5_idx_0_term_1 .cse1))) (and (or (= v_ULTIMATE.start_main_~a~5_val_0_in_1 0) (not .cse0)) (not (= 4 .cse1)) (not (= 0 (mod |v_ULTIMATE.start_main_#t~nondet0_5| 256))) (= (+ v_ULTIMATE.start_main_~len~5_6 1) v_ULTIMATE.start_main_~len~5_5) .cse0))) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_5|, ULTIMATE.start_main_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_in_1, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_6} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_4|, ULTIMATE.start_main_~a~5_idx_0=v_ULTIMATE.start_main_~a~5_idx_0_term_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|, ULTIMATE.start_main_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_out_1, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~a~5_idx_0, ULTIMATE.start_main_~a~5_val_0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~len~5] {87#(= 1 ULTIMATE.start_main_~len~5)} is VALID [2019-04-26 16:09:59,344 INFO L273 TraceCheckUtils]: 2: Hoare triple {87#(= 1 ULTIMATE.start_main_~len~5)} [15] L40-->L40: Formula: (let ((.cse1 (mod v_ULTIMATE.start_main_~len~5_6 4294967296))) (let ((.cse0 (= v_ULTIMATE.start_main_~a~5_idx_0_term_1 .cse1))) (and (or (= v_ULTIMATE.start_main_~a~5_val_0_in_1 0) (not .cse0)) (not (= 4 .cse1)) (not (= 0 (mod |v_ULTIMATE.start_main_#t~nondet0_5| 256))) (= (+ v_ULTIMATE.start_main_~len~5_6 1) v_ULTIMATE.start_main_~len~5_5) .cse0))) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_5|, ULTIMATE.start_main_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_in_1, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_6} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_4|, ULTIMATE.start_main_~a~5_idx_0=v_ULTIMATE.start_main_~a~5_idx_0_term_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|, ULTIMATE.start_main_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_out_1, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~a~5_idx_0, ULTIMATE.start_main_~a~5_val_0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~len~5] {91#(= 2 ULTIMATE.start_main_~len~5)} is VALID [2019-04-26 16:09:59,346 INFO L273 TraceCheckUtils]: 3: Hoare triple {91#(= 2 ULTIMATE.start_main_~len~5)} [14] L40-->L31: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (= (mod |v_ULTIMATE.start_main_#t~nondet0_3| 256) 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (let ((.cse0 (mod v_ULTIMATE.start_main_~len~5_4 4294967296))) (and (<= 0 .cse0) (< .cse0 5))) 1 0))) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_3|, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_4} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_2|, ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start___VERIFIER_assert_#in~cond] {79#false} is VALID [2019-04-26 16:09:59,346 INFO L273 TraceCheckUtils]: 4: Hoare triple {79#false} [16] L31-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79#false} is VALID [2019-04-26 16:09:59,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-26 16:09:59,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-04-26 16:09:59,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-04-26 16:09:59,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-04-26 16:09:59,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-04-26 16:09:59,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-04-26 16:09:59,361 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-04-26 16:09:59,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-04-26 16:09:59,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-04-26 16:09:59,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-04-26 16:09:59,362 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-04-26 16:09:59,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-26 16:09:59,606 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-04-26 16:09:59,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-04-26 16:09:59,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-04-26 16:09:59,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-26 16:09:59,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-04-26 16:09:59,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2019-04-26 16:09:59,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-04-26 16:09:59,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2019-04-26 16:09:59,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 8 transitions. [2019-04-26 16:09:59,628 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-04-26 16:09:59,629 INFO L225 Difference]: With dead ends: 7 [2019-04-26 16:09:59,629 INFO L226 Difference]: Without dead ends: 7 [2019-04-26 16:09:59,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-04-26 16:09:59,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-04-26 16:09:59,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-04-26 16:09:59,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-04-26 16:09:59,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-04-26 16:09:59,631 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-04-26 16:09:59,632 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-04-26 16:09:59,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-26 16:09:59,633 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-04-26 16:09:59,633 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-04-26 16:09:59,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-26 16:09:59,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-04-26 16:09:59,633 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-04-26 16:09:59,633 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-04-26 16:09:59,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-26 16:09:59,634 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-04-26 16:09:59,635 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-04-26 16:09:59,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-26 16:09:59,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-04-26 16:09:59,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-04-26 16:09:59,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-04-26 16:09:59,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-04-26 16:09:59,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-04-26 16:09:59,636 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-04-26 16:09:59,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-26 16:09:59,637 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-04-26 16:09:59,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-04-26 16:09:59,637 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-04-26 16:09:59,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-04-26 16:09:59,637 INFO L394 BasicCegarLoop]: Found error trace [2019-04-26 16:09:59,638 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-04-26 16:09:59,638 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-04-26 16:09:59,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-26 16:09:59,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1273997189, now seen corresponding path program 3 times [2019-04-26 16:09:59,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-04-26 16:09:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-26 16:09:59,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 12 conjunts are in the unsatisfiable core [2019-04-26 16:09:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-26 16:09:59,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-26 16:09:59,785 INFO L273 TraceCheckUtils]: 0: Hoare triple {125#true} [13] ULTIMATE.startENTRY-->L40: Formula: (= v_ULTIMATE.start_main_~len~5_1 0) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~a~5=v_ULTIMATE.start_main_~a~5_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_1|, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~a~5, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~len~5, ULTIMATE.start_main_~i~5] {130#(= 0 ULTIMATE.start_main_~len~5)} is VALID [2019-04-26 16:09:59,790 INFO L273 TraceCheckUtils]: 1: Hoare triple {130#(= 0 ULTIMATE.start_main_~len~5)} [15] L40-->L40: Formula: (let ((.cse1 (mod v_ULTIMATE.start_main_~len~5_6 4294967296))) (let ((.cse0 (= v_ULTIMATE.start_main_~a~5_idx_0_term_1 .cse1))) (and (or (= v_ULTIMATE.start_main_~a~5_val_0_in_1 0) (not .cse0)) (not (= 4 .cse1)) (not (= 0 (mod |v_ULTIMATE.start_main_#t~nondet0_5| 256))) (= (+ v_ULTIMATE.start_main_~len~5_6 1) v_ULTIMATE.start_main_~len~5_5) .cse0))) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_5|, ULTIMATE.start_main_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_in_1, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_6} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_4|, ULTIMATE.start_main_~a~5_idx_0=v_ULTIMATE.start_main_~a~5_idx_0_term_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|, ULTIMATE.start_main_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_out_1, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~a~5_idx_0, ULTIMATE.start_main_~a~5_val_0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~len~5] {134#(= 1 ULTIMATE.start_main_~len~5)} is VALID [2019-04-26 16:09:59,792 INFO L273 TraceCheckUtils]: 2: Hoare triple {134#(= 1 ULTIMATE.start_main_~len~5)} [15] L40-->L40: Formula: (let ((.cse1 (mod v_ULTIMATE.start_main_~len~5_6 4294967296))) (let ((.cse0 (= v_ULTIMATE.start_main_~a~5_idx_0_term_1 .cse1))) (and (or (= v_ULTIMATE.start_main_~a~5_val_0_in_1 0) (not .cse0)) (not (= 4 .cse1)) (not (= 0 (mod |v_ULTIMATE.start_main_#t~nondet0_5| 256))) (= (+ v_ULTIMATE.start_main_~len~5_6 1) v_ULTIMATE.start_main_~len~5_5) .cse0))) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_5|, ULTIMATE.start_main_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_in_1, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_6} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_4|, ULTIMATE.start_main_~a~5_idx_0=v_ULTIMATE.start_main_~a~5_idx_0_term_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|, ULTIMATE.start_main_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_out_1, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~a~5_idx_0, ULTIMATE.start_main_~a~5_val_0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~len~5] {138#(= 2 ULTIMATE.start_main_~len~5)} is VALID [2019-04-26 16:09:59,817 INFO L273 TraceCheckUtils]: 3: Hoare triple {138#(= 2 ULTIMATE.start_main_~len~5)} [15] L40-->L40: Formula: (let ((.cse1 (mod v_ULTIMATE.start_main_~len~5_6 4294967296))) (let ((.cse0 (= v_ULTIMATE.start_main_~a~5_idx_0_term_1 .cse1))) (and (or (= v_ULTIMATE.start_main_~a~5_val_0_in_1 0) (not .cse0)) (not (= 4 .cse1)) (not (= 0 (mod |v_ULTIMATE.start_main_#t~nondet0_5| 256))) (= (+ v_ULTIMATE.start_main_~len~5_6 1) v_ULTIMATE.start_main_~len~5_5) .cse0))) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_5|, ULTIMATE.start_main_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_in_1, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_6} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_4|, ULTIMATE.start_main_~a~5_idx_0=v_ULTIMATE.start_main_~a~5_idx_0_term_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|, ULTIMATE.start_main_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_out_1, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~a~5_idx_0, ULTIMATE.start_main_~a~5_val_0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~len~5] {142#(= 3 ULTIMATE.start_main_~len~5)} is VALID [2019-04-26 16:09:59,829 INFO L273 TraceCheckUtils]: 4: Hoare triple {142#(= 3 ULTIMATE.start_main_~len~5)} [14] L40-->L31: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (= (mod |v_ULTIMATE.start_main_#t~nondet0_3| 256) 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (let ((.cse0 (mod v_ULTIMATE.start_main_~len~5_4 4294967296))) (and (<= 0 .cse0) (< .cse0 5))) 1 0))) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_3|, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_4} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_2|, ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start___VERIFIER_assert_#in~cond] {126#false} is VALID [2019-04-26 16:09:59,830 INFO L273 TraceCheckUtils]: 5: Hoare triple {126#false} [16] L31-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#false} is VALID [2019-04-26 16:09:59,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-26 16:09:59,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-04-26 16:09:59,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-04-26 16:09:59,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-04-26 16:09:59,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-04-26 16:09:59,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-04-26 16:09:59,850 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-04-26 16:09:59,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-04-26 16:09:59,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-04-26 16:09:59,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-04-26 16:09:59,851 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-04-26 16:10:00,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-26 16:10:00,006 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-04-26 16:10:00,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-04-26 16:10:00,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-04-26 16:10:00,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-26 16:10:00,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-04-26 16:10:00,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-04-26 16:10:00,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-04-26 16:10:00,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-04-26 16:10:00,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 9 transitions. [2019-04-26 16:10:00,135 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-04-26 16:10:00,136 INFO L225 Difference]: With dead ends: 8 [2019-04-26 16:10:00,136 INFO L226 Difference]: Without dead ends: 8 [2019-04-26 16:10:00,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-04-26 16:10:00,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-04-26 16:10:00,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-04-26 16:10:00,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-04-26 16:10:00,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2019-04-26 16:10:00,139 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-04-26 16:10:00,139 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-04-26 16:10:00,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-26 16:10:00,141 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-04-26 16:10:00,141 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-04-26 16:10:00,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-26 16:10:00,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-04-26 16:10:00,143 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-04-26 16:10:00,144 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-04-26 16:10:00,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-26 16:10:00,146 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-04-26 16:10:00,146 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-04-26 16:10:00,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-26 16:10:00,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-04-26 16:10:00,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-04-26 16:10:00,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-04-26 16:10:00,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-04-26 16:10:00,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-04-26 16:10:00,149 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-04-26 16:10:00,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-26 16:10:00,149 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-04-26 16:10:00,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-04-26 16:10:00,150 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-04-26 16:10:00,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-04-26 16:10:00,150 INFO L394 BasicCegarLoop]: Found error trace [2019-04-26 16:10:00,150 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-04-26 16:10:00,151 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-04-26 16:10:00,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-26 16:10:00,151 INFO L82 PathProgramCache]: Analyzing trace with hash 839208110, now seen corresponding path program 4 times [2019-04-26 16:10:00,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-04-26 16:10:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-26 16:10:00,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 14 conjunts are in the unsatisfiable core [2019-04-26 16:10:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-26 16:10:00,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-26 16:10:00,445 INFO L273 TraceCheckUtils]: 0: Hoare triple {180#true} [13] ULTIMATE.startENTRY-->L40: Formula: (= v_ULTIMATE.start_main_~len~5_1 0) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~a~5=v_ULTIMATE.start_main_~a~5_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_1|, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~a~5, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~len~5, ULTIMATE.start_main_~i~5] {185#(= 0 ULTIMATE.start_main_~len~5)} is VALID [2019-04-26 16:10:00,447 INFO L273 TraceCheckUtils]: 1: Hoare triple {185#(= 0 ULTIMATE.start_main_~len~5)} [15] L40-->L40: Formula: (let ((.cse1 (mod v_ULTIMATE.start_main_~len~5_6 4294967296))) (let ((.cse0 (= v_ULTIMATE.start_main_~a~5_idx_0_term_1 .cse1))) (and (or (= v_ULTIMATE.start_main_~a~5_val_0_in_1 0) (not .cse0)) (not (= 4 .cse1)) (not (= 0 (mod |v_ULTIMATE.start_main_#t~nondet0_5| 256))) (= (+ v_ULTIMATE.start_main_~len~5_6 1) v_ULTIMATE.start_main_~len~5_5) .cse0))) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_5|, ULTIMATE.start_main_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_in_1, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_6} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_4|, ULTIMATE.start_main_~a~5_idx_0=v_ULTIMATE.start_main_~a~5_idx_0_term_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|, ULTIMATE.start_main_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_out_1, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~a~5_idx_0, ULTIMATE.start_main_~a~5_val_0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~len~5] {189#(= 1 ULTIMATE.start_main_~len~5)} is VALID [2019-04-26 16:10:00,448 INFO L273 TraceCheckUtils]: 2: Hoare triple {189#(= 1 ULTIMATE.start_main_~len~5)} [15] L40-->L40: Formula: (let ((.cse1 (mod v_ULTIMATE.start_main_~len~5_6 4294967296))) (let ((.cse0 (= v_ULTIMATE.start_main_~a~5_idx_0_term_1 .cse1))) (and (or (= v_ULTIMATE.start_main_~a~5_val_0_in_1 0) (not .cse0)) (not (= 4 .cse1)) (not (= 0 (mod |v_ULTIMATE.start_main_#t~nondet0_5| 256))) (= (+ v_ULTIMATE.start_main_~len~5_6 1) v_ULTIMATE.start_main_~len~5_5) .cse0))) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_5|, ULTIMATE.start_main_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_in_1, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_6} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_4|, ULTIMATE.start_main_~a~5_idx_0=v_ULTIMATE.start_main_~a~5_idx_0_term_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|, ULTIMATE.start_main_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_out_1, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~a~5_idx_0, ULTIMATE.start_main_~a~5_val_0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~len~5] {193#(= 2 ULTIMATE.start_main_~len~5)} is VALID [2019-04-26 16:10:00,451 INFO L273 TraceCheckUtils]: 3: Hoare triple {193#(= 2 ULTIMATE.start_main_~len~5)} [15] L40-->L40: Formula: (let ((.cse1 (mod v_ULTIMATE.start_main_~len~5_6 4294967296))) (let ((.cse0 (= v_ULTIMATE.start_main_~a~5_idx_0_term_1 .cse1))) (and (or (= v_ULTIMATE.start_main_~a~5_val_0_in_1 0) (not .cse0)) (not (= 4 .cse1)) (not (= 0 (mod |v_ULTIMATE.start_main_#t~nondet0_5| 256))) (= (+ v_ULTIMATE.start_main_~len~5_6 1) v_ULTIMATE.start_main_~len~5_5) .cse0))) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_5|, ULTIMATE.start_main_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_in_1, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_6} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_4|, ULTIMATE.start_main_~a~5_idx_0=v_ULTIMATE.start_main_~a~5_idx_0_term_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|, ULTIMATE.start_main_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_out_1, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~a~5_idx_0, ULTIMATE.start_main_~a~5_val_0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~len~5] {197#(= 3 ULTIMATE.start_main_~len~5)} is VALID [2019-04-26 16:10:00,452 INFO L273 TraceCheckUtils]: 4: Hoare triple {197#(= 3 ULTIMATE.start_main_~len~5)} [15] L40-->L40: Formula: (let ((.cse1 (mod v_ULTIMATE.start_main_~len~5_6 4294967296))) (let ((.cse0 (= v_ULTIMATE.start_main_~a~5_idx_0_term_1 .cse1))) (and (or (= v_ULTIMATE.start_main_~a~5_val_0_in_1 0) (not .cse0)) (not (= 4 .cse1)) (not (= 0 (mod |v_ULTIMATE.start_main_#t~nondet0_5| 256))) (= (+ v_ULTIMATE.start_main_~len~5_6 1) v_ULTIMATE.start_main_~len~5_5) .cse0))) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_5|, ULTIMATE.start_main_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_in_1, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_6} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_4|, ULTIMATE.start_main_~a~5_idx_0=v_ULTIMATE.start_main_~a~5_idx_0_term_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|, ULTIMATE.start_main_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_out_1, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~a~5_idx_0, ULTIMATE.start_main_~a~5_val_0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~len~5] {201#(= 4 ULTIMATE.start_main_~len~5)} is VALID [2019-04-26 16:10:00,453 INFO L273 TraceCheckUtils]: 5: Hoare triple {201#(= 4 ULTIMATE.start_main_~len~5)} [14] L40-->L31: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (= (mod |v_ULTIMATE.start_main_#t~nondet0_3| 256) 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (let ((.cse0 (mod v_ULTIMATE.start_main_~len~5_4 4294967296))) (and (<= 0 .cse0) (< .cse0 5))) 1 0))) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_3|, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_4} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_2|, ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~len~5=v_ULTIMATE.start_main_~len~5_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start___VERIFIER_assert_#in~cond] {181#false} is VALID [2019-04-26 16:10:00,453 INFO L273 TraceCheckUtils]: 6: Hoare triple {181#false} [16] L31-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#false} is VALID [2019-04-26 16:10:00,454 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-26 16:10:00,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-04-26 16:10:00,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-04-26 16:10:00,455 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-04-26 16:10:00,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-04-26 16:10:00,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2019-04-26 16:10:00,466 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-04-26 16:10:00,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-04-26 16:10:00,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-04-26 16:10:00,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-04-26 16:10:00,467 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-04-26 16:10:00,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-26 16:10:00,587 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2019-04-26 16:10:00,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-04-26 16:10:00,587 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-04-26 16:10:00,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-26 16:10:00,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-04-26 16:10:00,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-04-26 16:10:00,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-04-26 16:10:00,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-04-26 16:10:00,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 7 transitions. [2019-04-26 16:10:00,619 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-04-26 16:10:00,619 INFO L225 Difference]: With dead ends: 6 [2019-04-26 16:10:00,619 INFO L226 Difference]: Without dead ends: 0 [2019-04-26 16:10:00,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-04-26 16:10:00,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-26 16:10:00,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-26 16:10:00,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-04-26 16:10:00,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-04-26 16:10:00,621 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-04-26 16:10:00,621 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-04-26 16:10:00,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-26 16:10:00,622 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-04-26 16:10:00,622 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-26 16:10:00,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-26 16:10:00,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-04-26 16:10:00,622 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-04-26 16:10:00,622 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-04-26 16:10:00,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-26 16:10:00,623 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-04-26 16:10:00,623 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-26 16:10:00,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-26 16:10:00,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-04-26 16:10:00,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-04-26 16:10:00,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-04-26 16:10:00,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-26 16:10:00,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-26 16:10:00,624 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2019-04-26 16:10:00,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-26 16:10:00,625 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-26 16:10:00,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-04-26 16:10:00,625 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-26 16:10:00,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-26 16:10:00,628 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-04-26 16:10:00,630 INFO L202 PluginConnector]: Adding new model n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.04 04:10:00 BasicIcfg [2019-04-26 16:10:00,630 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-04-26 16:10:00,631 INFO L168 Benchmark]: Toolchain (without parser) took 3236.31 ms. Allocated memory was 139.5 MB in the beginning and 176.7 MB in the end (delta: 37.2 MB). Free memory was 109.2 MB in the beginning and 63.6 MB in the end (delta: 45.6 MB). Peak memory consumption was 82.8 MB. Max. memory is 7.1 GB. [2019-04-26 16:10:00,633 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory is still 110.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-04-26 16:10:00,634 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.49 ms. Allocated memory is still 139.5 MB. Free memory was 108.8 MB in the beginning and 107.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-04-26 16:10:00,635 INFO L168 Benchmark]: Boogie Preprocessor took 21.79 ms. Allocated memory is still 139.5 MB. Free memory was 107.1 MB in the beginning and 106.2 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 7.1 GB. [2019-04-26 16:10:00,635 INFO L168 Benchmark]: RCFGBuilder took 398.93 ms. Allocated memory is still 139.5 MB. Free memory was 106.2 MB in the beginning and 95.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2019-04-26 16:10:00,636 INFO L168 Benchmark]: IcfgTransformer took 74.88 ms. Allocated memory is still 139.5 MB. Free memory was 95.6 MB in the beginning and 93.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-04-26 16:10:00,637 INFO L168 Benchmark]: TraceAbstraction took 2694.85 ms. Allocated memory was 139.5 MB in the beginning and 176.7 MB in the end (delta: 37.2 MB). Free memory was 93.0 MB in the beginning and 63.6 MB in the end (delta: 29.4 MB). Peak memory consumption was 66.7 MB. Max. memory is 7.1 GB. [2019-04-26 16:10:00,642 INFO L337 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: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory is still 110.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.49 ms. Allocated memory is still 139.5 MB. Free memory was 108.8 MB in the beginning and 107.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.79 ms. Allocated memory is still 139.5 MB. Free memory was 107.1 MB in the beginning and 106.2 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 7.1 GB. * RCFGBuilder took 398.93 ms. Allocated memory is still 139.5 MB. Free memory was 106.2 MB in the beginning and 95.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * IcfgTransformer took 74.88 ms. Allocated memory is still 139.5 MB. Free memory was 95.6 MB in the beginning and 93.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2694.85 ms. Allocated memory was 139.5 MB in the beginning and 176.7 MB in the end (delta: 37.2 MB). Free memory was 93.0 MB in the beginning and 63.6 MB in the end (delta: 29.4 MB). Peak memory consumption was 66.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. SAFE Result, 2.6s OverallTime, 5 OverallIterations, 4 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13 SDtfs, 0 SDslu, 10 SDs, 0 SdLazy, 74 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 230 SizeOfPredicates, 15 NumberOfNonLiveVariables, 135 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/20 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...