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-1c58c86 [2019-05-15 10:56:03,998 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-05-15 10:56:04,000 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-05-15 10:56:04,017 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-15 10:56:04,017 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-05-15 10:56:04,019 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-15 10:56:04,020 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-05-15 10:56:04,023 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-05-15 10:56:04,025 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-05-15 10:56:04,026 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-05-15 10:56:04,034 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-05-15 10:56:04,035 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-05-15 10:56:04,039 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-05-15 10:56:04,040 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-05-15 10:56:04,041 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-05-15 10:56:04,042 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-15 10:56:04,043 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-05-15 10:56:04,044 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-15 10:56:04,049 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-05-15 10:56:04,051 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-05-15 10:56:04,053 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-05-15 10:56:04,055 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-05-15 10:56:04,059 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-15 10:56:04,059 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-15 10:56:04,059 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-05-15 10:56:04,060 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-05-15 10:56:04,061 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-05-15 10:56:04,062 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-05-15 10:56:04,062 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-05-15 10:56:04,063 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-05-15 10:56:04,066 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-05-15 10:56:04,066 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-05-15 10:56:04,067 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-15 10:56:04,068 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-05-15 10:56:04,070 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-05-15 10:56:04,070 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-05-15 10:56:04,070 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-05-15 10:56:04,072 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-05-15 10:56:04,073 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-05-15 10:56:04,111 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-05-15 10:56:04,123 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-15 10:56:04,127 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-05-15 10:56:04,128 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-05-15 10:56:04,129 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-05-15 10:56:04,130 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-05-15 10:56:04,130 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/n.c11.i_3.bpl' [2019-05-15 10:56:04,167 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-05-15 10:56:04,169 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-05-15 10:56:04,169 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-15 10:56:04,169 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-05-15 10:56:04,170 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-05-15 10:56:04,186 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 15.05 10:56:04" (1/1) ... [2019-05-15 10:56:04,197 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 15.05 10:56:04" (1/1) ... [2019-05-15 10:56:04,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-15 10:56:04,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-05-15 10:56:04,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-05-15 10:56:04,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-05-15 10:56:04,217 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 15.05 10:56:04" (1/1) ... [2019-05-15 10:56:04,218 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 15.05 10:56:04" (1/1) ... [2019-05-15 10:56:04,218 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 15.05 10:56:04" (1/1) ... [2019-05-15 10:56:04,219 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 15.05 10:56:04" (1/1) ... [2019-05-15 10:56:04,222 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 15.05 10:56:04" (1/1) ... [2019-05-15 10:56:04,224 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 15.05 10:56:04" (1/1) ... [2019-05-15 10:56:04,225 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 15.05 10:56:04" (1/1) ... [2019-05-15 10:56:04,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-15 10:56:04,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-05-15 10:56:04,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-05-15 10:56:04,227 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-05-15 10:56:04,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:04" (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-05-15 10:56:04,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-05-15 10:56:04,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-05-15 10:56:04,699 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-05-15 10:56:04,699 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-05-15 10:56:04,700 INFO L202 PluginConnector]: Adding new model n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:04 BoogieIcfgContainer [2019-05-15 10:56:04,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-05-15 10:56:04,701 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2019-05-15 10:56:04,701 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2019-05-15 10:56:04,702 INFO L275 PluginConnector]: IcfgTransformer initialized [2019-05-15 10:56:04,705 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 15.05 10:56:04" (1/1) ... [2019-05-15 10:56:04,802 INFO L632 onniauxMapEliminator]: L40 [2019-05-15 10:56:04,803 INFO L633 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-05-15 10:56:04,803 INFO L634 onniauxMapEliminator]: Out Formula: (and v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1 (or (not v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1) (= v_ULTIMATE.start_main_~a~5_idx_0_term_1 (mod v_ULTIMATE.start_main_~len~5_6 4294967296))) (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)))) (= v_ULTIMATE.start_main_~a~5_val_0_out_1 v_ULTIMATE.start_main_~a~5_val_0_in_1) (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)) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_5|, ULTIMATE.start_main_~a~5_idx_0=v_ULTIMATE.start_main_~a~5_idx_0_term_1, ULTIMATE.start_main_~a~5_idx_0_bool=v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1, 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_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_out_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|, ULTIMATE.start_main_~a~5_idx_0_bool=v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_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_val_0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~len~5] [2019-05-15 10:56:04,804 INFO L635 onniauxMapEliminator]: L40 [2019-05-15 10:56:04,858 INFO L202 PluginConnector]: Adding new model n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:56:04 BasicIcfg [2019-05-15 10:56:04,858 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2019-05-15 10:56:04,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-05-15 10:56:04,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-05-15 10:56:04,866 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-05-15 10:56:04,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:04" (1/3) ... [2019-05-15 10:56:04,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca01742 and model type n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.05 10:56:04, skipping insertion in model container [2019-05-15 10:56:04,868 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 15.05 10:56:04" (2/3) ... [2019-05-15 10:56:04,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca01742 and model type n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:56:04, skipping insertion in model container [2019-05-15 10:56:04,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:56:04" (3/3) ... [2019-05-15 10:56:04,871 INFO L109 eAbstractionObserver]: Analyzing ICFG n.c11.i_3.bplME [2019-05-15 10:56:04,883 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-15 10:56:04,893 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-05-15 10:56:04,913 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-05-15 10:56:04,944 INFO L127 ementStrategyFactory]: Using default assertion order modulation [2019-05-15 10:56:04,945 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-05-15 10:56:04,945 INFO L378 AbstractCegarLoop]: Hoare is false [2019-05-15 10:56:04,946 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-05-15 10:56:04,946 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-05-15 10:56:04,946 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-05-15 10:56:04,946 INFO L382 AbstractCegarLoop]: Difference is false [2019-05-15 10:56:04,946 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-05-15 10:56:04,946 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-15 10:56:04,961 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-05-15 10:56:04,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-05-15 10:56:04,972 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:04,973 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-05-15 10:56:04,976 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:04,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:04,982 INFO L82 PathProgramCache]: Analyzing trace with hash 42734, now seen corresponding path program 1 times [2019-05-15 10:56:05,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:05,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2019-05-15 10:56:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:05,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:05,235 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-05-15 10:56:05,238 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-05-15 10:56:05,239 INFO L273 TraceCheckUtils]: 2: Hoare triple {9#false} [16] L31-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9#false} is VALID [2019-05-15 10:56:05,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:56:05,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:56:05,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-05-15 10:56:05,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-05-15 10:56:05,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:05,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-05-15 10:56:05,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:05,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-05-15 10:56:05,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-15 10:56:05,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-15 10:56:05,283 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-05-15 10:56:05,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:05,341 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-05-15 10:56:05,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-15 10:56:05,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-05-15 10:56:05,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:05,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:05,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-05-15 10:56:05,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:05,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-05-15 10:56:05,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 7 transitions. [2019-05-15 10:56:05,403 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:05,413 INFO L225 Difference]: With dead ends: 5 [2019-05-15 10:56:05,414 INFO L226 Difference]: Without dead ends: 5 [2019-05-15 10:56:05,416 INFO L628 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-05-15 10:56:05,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-05-15 10:56:05,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-05-15 10:56:05,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:05,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:05,444 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:05,445 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:05,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:05,446 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-05-15 10:56:05,447 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-05-15 10:56:05,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:05,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:05,448 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:05,448 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:05,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:05,449 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-05-15 10:56:05,450 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-05-15 10:56:05,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:05,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:05,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:05,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:05,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-05-15 10:56:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-05-15 10:56:05,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-05-15 10:56:05,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:05,454 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-05-15 10:56:05,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-05-15 10:56:05,454 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-05-15 10:56:05,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-05-15 10:56:05,455 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:05,455 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-05-15 10:56:05,455 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:05,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:05,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1325669, now seen corresponding path program 1 times [2019-05-15 10:56:05,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:05,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-05-15 10:56:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:05,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:05,695 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-05-15 10:56:05,708 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 v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1 (or (not v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1) .cse0) (or (= v_ULTIMATE.start_main_~a~5_val_0_in_1 0) (not .cse0)) (= v_ULTIMATE.start_main_~a~5_val_0_out_1 v_ULTIMATE.start_main_~a~5_val_0_in_1) (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)))) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_5|, ULTIMATE.start_main_~a~5_idx_0=v_ULTIMATE.start_main_~a~5_idx_0_term_1, ULTIMATE.start_main_~a~5_idx_0_bool=v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1, 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_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_out_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|, ULTIMATE.start_main_~a~5_idx_0_bool=v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_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_val_0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~len~5] {48#(= 1 ULTIMATE.start_main_~len~5)} is VALID [2019-05-15 10:56:05,722 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-05-15 10:56:05,723 INFO L273 TraceCheckUtils]: 3: Hoare triple {40#false} [16] L31-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#false} is VALID [2019-05-15 10:56:05,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:56:05,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:56:05,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-05-15 10:56:05,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-05-15 10:56:05,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:05,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-05-15 10:56:05,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:05,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-05-15 10:56:05,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-15 10:56:05,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:56:05,777 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-05-15 10:56:05,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:05,968 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-05-15 10:56:05,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-15 10:56:05,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-05-15 10:56:05,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:05,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:56:05,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-05-15 10:56:05,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:56:05,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-05-15 10:56:05,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 7 transitions. [2019-05-15 10:56:06,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:06,041 INFO L225 Difference]: With dead ends: 6 [2019-05-15 10:56:06,041 INFO L226 Difference]: Without dead ends: 6 [2019-05-15 10:56:06,043 INFO L628 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-05-15 10:56:06,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-05-15 10:56:06,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-05-15 10:56:06,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:06,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2019-05-15 10:56:06,045 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-05-15 10:56:06,045 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-05-15 10:56:06,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:06,046 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-05-15 10:56:06,046 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-05-15 10:56:06,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:06,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:06,047 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-05-15 10:56:06,047 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-05-15 10:56:06,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:06,048 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-05-15 10:56:06,049 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-05-15 10:56:06,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:06,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:06,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:06,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:06,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-05-15 10:56:06,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-05-15 10:56:06,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-05-15 10:56:06,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:06,052 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-05-15 10:56:06,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-05-15 10:56:06,052 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-05-15 10:56:06,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-05-15 10:56:06,052 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:06,053 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-05-15 10:56:06,053 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:06,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:06,054 INFO L82 PathProgramCache]: Analyzing trace with hash 41096654, now seen corresponding path program 2 times [2019-05-15 10:56:06,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:06,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 10 conjunts are in the unsatisfiable core [2019-05-15 10:56:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:06,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:06,214 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-05-15 10:56:06,216 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 v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1 (or (not v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1) .cse0) (or (= v_ULTIMATE.start_main_~a~5_val_0_in_1 0) (not .cse0)) (= v_ULTIMATE.start_main_~a~5_val_0_out_1 v_ULTIMATE.start_main_~a~5_val_0_in_1) (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)))) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_5|, ULTIMATE.start_main_~a~5_idx_0=v_ULTIMATE.start_main_~a~5_idx_0_term_1, ULTIMATE.start_main_~a~5_idx_0_bool=v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1, 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_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_out_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|, ULTIMATE.start_main_~a~5_idx_0_bool=v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_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_val_0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~len~5] {87#(= 1 ULTIMATE.start_main_~len~5)} is VALID [2019-05-15 10:56:06,220 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 v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1 (or (not v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1) .cse0) (or (= v_ULTIMATE.start_main_~a~5_val_0_in_1 0) (not .cse0)) (= v_ULTIMATE.start_main_~a~5_val_0_out_1 v_ULTIMATE.start_main_~a~5_val_0_in_1) (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)))) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_5|, ULTIMATE.start_main_~a~5_idx_0=v_ULTIMATE.start_main_~a~5_idx_0_term_1, ULTIMATE.start_main_~a~5_idx_0_bool=v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1, 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_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_out_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|, ULTIMATE.start_main_~a~5_idx_0_bool=v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_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_val_0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~len~5] {91#(= 2 ULTIMATE.start_main_~len~5)} is VALID [2019-05-15 10:56:06,221 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-05-15 10:56:06,221 INFO L273 TraceCheckUtils]: 4: Hoare triple {79#false} [16] L31-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79#false} is VALID [2019-05-15 10:56:06,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:56:06,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:56:06,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-05-15 10:56:06,223 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-05-15 10:56:06,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:06,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-05-15 10:56:06,238 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:06,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-05-15 10:56:06,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-05-15 10:56:06,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-05-15 10:56:06,239 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-05-15 10:56:06,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:06,463 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-05-15 10:56:06,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-05-15 10:56:06,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-05-15 10:56:06,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:06,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-05-15 10:56:06,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2019-05-15 10:56:06,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-05-15 10:56:06,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2019-05-15 10:56:06,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 8 transitions. [2019-05-15 10:56:06,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:06,482 INFO L225 Difference]: With dead ends: 7 [2019-05-15 10:56:06,482 INFO L226 Difference]: Without dead ends: 7 [2019-05-15 10:56:06,483 INFO L628 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-05-15 10:56:06,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-05-15 10:56:06,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-05-15 10:56:06,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:06,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-05-15 10:56:06,484 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-05-15 10:56:06,485 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-05-15 10:56:06,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:06,486 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-05-15 10:56:06,486 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-05-15 10:56:06,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:06,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:06,486 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-05-15 10:56:06,487 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-05-15 10:56:06,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:06,488 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-05-15 10:56:06,488 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-05-15 10:56:06,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:06,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:06,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:06,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:06,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-05-15 10:56:06,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-05-15 10:56:06,490 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-05-15 10:56:06,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:06,490 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-05-15 10:56:06,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-05-15 10:56:06,491 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-05-15 10:56:06,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-05-15 10:56:06,491 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:06,491 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-05-15 10:56:06,492 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:06,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:06,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1273997189, now seen corresponding path program 3 times [2019-05-15 10:56:06,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:06,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 12 conjunts are in the unsatisfiable core [2019-05-15 10:56:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:06,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:06,692 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-05-15 10:56:06,694 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 v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1 (or (not v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1) .cse0) (or (= v_ULTIMATE.start_main_~a~5_val_0_in_1 0) (not .cse0)) (= v_ULTIMATE.start_main_~a~5_val_0_out_1 v_ULTIMATE.start_main_~a~5_val_0_in_1) (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)))) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_5|, ULTIMATE.start_main_~a~5_idx_0=v_ULTIMATE.start_main_~a~5_idx_0_term_1, ULTIMATE.start_main_~a~5_idx_0_bool=v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1, 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_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_out_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|, ULTIMATE.start_main_~a~5_idx_0_bool=v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_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_val_0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~len~5] {134#(= 1 ULTIMATE.start_main_~len~5)} is VALID [2019-05-15 10:56:06,696 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 v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1 (or (not v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1) .cse0) (or (= v_ULTIMATE.start_main_~a~5_val_0_in_1 0) (not .cse0)) (= v_ULTIMATE.start_main_~a~5_val_0_out_1 v_ULTIMATE.start_main_~a~5_val_0_in_1) (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)))) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_5|, ULTIMATE.start_main_~a~5_idx_0=v_ULTIMATE.start_main_~a~5_idx_0_term_1, ULTIMATE.start_main_~a~5_idx_0_bool=v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1, 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_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_out_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|, ULTIMATE.start_main_~a~5_idx_0_bool=v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_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_val_0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~len~5] {138#(= 2 ULTIMATE.start_main_~len~5)} is VALID [2019-05-15 10:56:06,703 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 v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1 (or (not v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1) .cse0) (or (= v_ULTIMATE.start_main_~a~5_val_0_in_1 0) (not .cse0)) (= v_ULTIMATE.start_main_~a~5_val_0_out_1 v_ULTIMATE.start_main_~a~5_val_0_in_1) (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)))) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_5|, ULTIMATE.start_main_~a~5_idx_0=v_ULTIMATE.start_main_~a~5_idx_0_term_1, ULTIMATE.start_main_~a~5_idx_0_bool=v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1, 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_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_out_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|, ULTIMATE.start_main_~a~5_idx_0_bool=v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_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_val_0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~len~5] {142#(= 3 ULTIMATE.start_main_~len~5)} is VALID [2019-05-15 10:56:06,704 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-05-15 10:56:06,705 INFO L273 TraceCheckUtils]: 5: Hoare triple {126#false} [16] L31-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#false} is VALID [2019-05-15 10:56:06,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:56:06,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:56:06,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-05-15 10:56:06,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-05-15 10:56:06,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:06,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-05-15 10:56:06,720 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:06,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-05-15 10:56:06,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-05-15 10:56:06,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-05-15 10:56:06,721 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-05-15 10:56:06,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:06,897 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-05-15 10:56:06,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-05-15 10:56:06,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-05-15 10:56:06,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:06,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-05-15 10:56:06,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-05-15 10:56:06,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-05-15 10:56:06,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-05-15 10:56:06,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 9 transitions. [2019-05-15 10:56:07,017 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:07,018 INFO L225 Difference]: With dead ends: 8 [2019-05-15 10:56:07,018 INFO L226 Difference]: Without dead ends: 8 [2019-05-15 10:56:07,019 INFO L628 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-05-15 10:56:07,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-05-15 10:56:07,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-05-15 10:56:07,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:07,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2019-05-15 10:56:07,020 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-05-15 10:56:07,020 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-05-15 10:56:07,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:07,021 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-05-15 10:56:07,021 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-05-15 10:56:07,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:07,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:07,022 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-05-15 10:56:07,022 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-05-15 10:56:07,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:07,023 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-05-15 10:56:07,023 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-05-15 10:56:07,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:07,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:07,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:07,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:07,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-05-15 10:56:07,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-05-15 10:56:07,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-05-15 10:56:07,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:07,025 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-05-15 10:56:07,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-05-15 10:56:07,026 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-05-15 10:56:07,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-05-15 10:56:07,026 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:07,026 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-05-15 10:56:07,027 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:07,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:07,027 INFO L82 PathProgramCache]: Analyzing trace with hash 839208110, now seen corresponding path program 4 times [2019-05-15 10:56:07,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:07,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 14 conjunts are in the unsatisfiable core [2019-05-15 10:56:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:07,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:07,260 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-05-15 10:56:07,261 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 v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1 (or (not v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1) .cse0) (or (= v_ULTIMATE.start_main_~a~5_val_0_in_1 0) (not .cse0)) (= v_ULTIMATE.start_main_~a~5_val_0_out_1 v_ULTIMATE.start_main_~a~5_val_0_in_1) (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)))) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_5|, ULTIMATE.start_main_~a~5_idx_0=v_ULTIMATE.start_main_~a~5_idx_0_term_1, ULTIMATE.start_main_~a~5_idx_0_bool=v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1, 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_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_out_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|, ULTIMATE.start_main_~a~5_idx_0_bool=v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_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_val_0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~len~5] {189#(= 1 ULTIMATE.start_main_~len~5)} is VALID [2019-05-15 10:56:07,262 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 v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1 (or (not v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1) .cse0) (or (= v_ULTIMATE.start_main_~a~5_val_0_in_1 0) (not .cse0)) (= v_ULTIMATE.start_main_~a~5_val_0_out_1 v_ULTIMATE.start_main_~a~5_val_0_in_1) (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)))) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_5|, ULTIMATE.start_main_~a~5_idx_0=v_ULTIMATE.start_main_~a~5_idx_0_term_1, ULTIMATE.start_main_~a~5_idx_0_bool=v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1, 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_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_out_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|, ULTIMATE.start_main_~a~5_idx_0_bool=v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_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_val_0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~len~5] {193#(= 2 ULTIMATE.start_main_~len~5)} is VALID [2019-05-15 10:56:07,263 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 v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1 (or (not v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1) .cse0) (or (= v_ULTIMATE.start_main_~a~5_val_0_in_1 0) (not .cse0)) (= v_ULTIMATE.start_main_~a~5_val_0_out_1 v_ULTIMATE.start_main_~a~5_val_0_in_1) (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)))) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_5|, ULTIMATE.start_main_~a~5_idx_0=v_ULTIMATE.start_main_~a~5_idx_0_term_1, ULTIMATE.start_main_~a~5_idx_0_bool=v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1, 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_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_out_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|, ULTIMATE.start_main_~a~5_idx_0_bool=v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_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_val_0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~len~5] {197#(= 3 ULTIMATE.start_main_~len~5)} is VALID [2019-05-15 10:56:07,268 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 v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1 (or (not v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1) .cse0) (or (= v_ULTIMATE.start_main_~a~5_val_0_in_1 0) (not .cse0)) (= v_ULTIMATE.start_main_~a~5_val_0_out_1 v_ULTIMATE.start_main_~a~5_val_0_in_1) (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)))) InVars {ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_5|, ULTIMATE.start_main_~a~5_idx_0=v_ULTIMATE.start_main_~a~5_idx_0_term_1, ULTIMATE.start_main_~a~5_idx_0_bool=v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_1, 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_~a~5_val_0=v_ULTIMATE.start_main_~a~5_val_0_out_1, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|, ULTIMATE.start_main_~a~5_idx_0_bool=v_ULTIMATE.start_main_~a~5_idx_0_term_assigned_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_val_0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~len~5] {201#(= 4 ULTIMATE.start_main_~len~5)} is VALID [2019-05-15 10:56:07,269 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-05-15 10:56:07,269 INFO L273 TraceCheckUtils]: 6: Hoare triple {181#false} [16] L31-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#false} is VALID [2019-05-15 10:56:07,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:56:07,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:56:07,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-05-15 10:56:07,271 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-05-15 10:56:07,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:07,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2019-05-15 10:56:07,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:07,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-05-15 10:56:07,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-05-15 10:56:07,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-05-15 10:56:07,286 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-05-15 10:56:07,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:07,394 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2019-05-15 10:56:07,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-05-15 10:56:07,394 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-05-15 10:56:07,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:07,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-05-15 10:56:07,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-05-15 10:56:07,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-05-15 10:56:07,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-05-15 10:56:07,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 7 transitions. [2019-05-15 10:56:07,405 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:07,405 INFO L225 Difference]: With dead ends: 6 [2019-05-15 10:56:07,405 INFO L226 Difference]: Without dead ends: 0 [2019-05-15 10:56:07,406 INFO L628 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-05-15 10:56:07,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-05-15 10:56:07,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-05-15 10:56:07,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:07,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:07,407 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:07,408 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:07,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:07,408 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:56:07,408 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:07,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:07,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:07,409 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:07,409 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:07,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:07,410 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:56:07,410 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:07,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:07,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:07,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:07,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:07,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-05-15 10:56:07,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-05-15 10:56:07,411 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2019-05-15 10:56:07,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:07,411 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-05-15 10:56:07,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-05-15 10:56:07,412 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:07,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:07,414 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-05-15 10:56:07,416 INFO L202 PluginConnector]: Adding new model n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:56:07 BasicIcfg [2019-05-15 10:56:07,416 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-05-15 10:56:07,417 INFO L168 Benchmark]: Toolchain (without parser) took 3249.36 ms. Allocated memory was 139.5 MB in the beginning and 177.7 MB in the end (delta: 38.3 MB). Free memory was 109.2 MB in the beginning and 62.7 MB in the end (delta: 46.5 MB). Peak memory consumption was 84.8 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:07,418 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 ms. Allocated memory is still 139.5 MB. Free memory is still 110.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:56:07,419 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.96 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-05-15 10:56:07,420 INFO L168 Benchmark]: Boogie Preprocessor took 20.68 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: 900.3 kB). Peak memory consumption was 900.3 kB. Max. memory is 7.1 GB. [2019-05-15 10:56:07,421 INFO L168 Benchmark]: RCFGBuilder took 473.65 ms. Allocated memory is still 139.5 MB. Free memory was 106.2 MB in the beginning and 95.8 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:07,422 INFO L168 Benchmark]: IcfgTransformer took 157.39 ms. Allocated memory is still 139.5 MB. Free memory was 95.8 MB in the beginning and 92.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:07,422 INFO L168 Benchmark]: TraceAbstraction took 2556.36 ms. Allocated memory was 139.5 MB in the beginning and 177.7 MB in the end (delta: 38.3 MB). Free memory was 92.3 MB in the beginning and 62.7 MB in the end (delta: 29.6 MB). Peak memory consumption was 67.8 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:07,427 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.26 ms. Allocated memory is still 139.5 MB. Free memory is still 110.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.96 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 20.68 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: 900.3 kB). Peak memory consumption was 900.3 kB. Max. memory is 7.1 GB. * RCFGBuilder took 473.65 ms. Allocated memory is still 139.5 MB. Free memory was 106.2 MB in the beginning and 95.8 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * IcfgTransformer took 157.39 ms. Allocated memory is still 139.5 MB. Free memory was 95.8 MB in the beginning and 92.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2556.36 ms. Allocated memory was 139.5 MB in the beginning and 177.7 MB in the end (delta: 38.3 MB). Free memory was 92.3 MB in the beginning and 62.7 MB in the end (delta: 29.6 MB). Peak memory consumption was 67.8 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.4s 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.2s 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, 155 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...