java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/n.c11.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-15a42f0 [2018-12-18 22:08:36,098 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-18 22:08:36,101 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-18 22:08:36,113 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-18 22:08:36,113 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-18 22:08:36,114 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-18 22:08:36,115 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-18 22:08:36,117 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-18 22:08:36,119 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-18 22:08:36,120 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-18 22:08:36,121 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-18 22:08:36,121 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-18 22:08:36,122 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-18 22:08:36,123 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-18 22:08:36,124 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-18 22:08:36,125 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-18 22:08:36,126 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-18 22:08:36,128 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-18 22:08:36,130 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-18 22:08:36,131 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-18 22:08:36,133 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-18 22:08:36,134 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-18 22:08:36,138 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-18 22:08:36,139 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-18 22:08:36,139 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-18 22:08:36,143 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-18 22:08:36,144 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-18 22:08:36,145 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-18 22:08:36,148 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-18 22:08:36,150 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-18 22:08:36,151 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-18 22:08:36,151 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-18 22:08:36,152 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-18 22:08:36,152 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-18 22:08:36,154 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-18 22:08:36,155 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-18 22:08:36,155 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-18 22:08:36,174 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-18 22:08:36,174 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-18 22:08:36,175 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-18 22:08:36,175 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-18 22:08:36,175 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-18 22:08:36,176 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-18 22:08:36,176 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-18 22:08:36,176 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-18 22:08:36,176 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-18 22:08:36,176 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-18 22:08:36,177 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-18 22:08:36,177 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-18 22:08:36,177 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-18 22:08:36,177 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-18 22:08:36,178 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-18 22:08:36,178 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-18 22:08:36,178 INFO L133 SettingsManager]: * Use SBE=true [2018-12-18 22:08:36,178 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-18 22:08:36,179 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-18 22:08:36,179 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-18 22:08:36,179 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-18 22:08:36,179 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-18 22:08:36,179 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-18 22:08:36,180 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-18 22:08:36,180 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-18 22:08:36,180 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-18 22:08:36,180 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-18 22:08:36,180 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-18 22:08:36,181 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-18 22:08:36,181 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-18 22:08:36,181 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-18 22:08:36,181 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-18 22:08:36,181 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-18 22:08:36,181 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-18 22:08:36,182 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-18 22:08:36,182 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-18 22:08:36,182 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-18 22:08:36,182 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-18 22:08:36,182 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-18 22:08:36,183 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-18 22:08:36,217 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-18 22:08:36,231 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-18 22:08:36,234 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-18 22:08:36,236 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-18 22:08:36,237 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-18 22:08:36,238 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/n.c11.i_3.bpl [2018-12-18 22:08:36,238 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/n.c11.i_3.bpl' [2018-12-18 22:08:36,281 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-18 22:08:36,283 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-18 22:08:36,283 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-18 22:08:36,284 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-18 22:08:36,284 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-18 22:08:36,303 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 18.12 10:08:36" (1/1) ... [2018-12-18 22:08:36,315 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 18.12 10:08:36" (1/1) ... [2018-12-18 22:08:36,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-18 22:08:36,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-18 22:08:36,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-18 22:08:36,325 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-18 22:08:36,337 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 18.12 10:08:36" (1/1) ... [2018-12-18 22:08:36,338 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 18.12 10:08:36" (1/1) ... [2018-12-18 22:08:36,339 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 18.12 10:08:36" (1/1) ... [2018-12-18 22:08:36,339 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 18.12 10:08:36" (1/1) ... [2018-12-18 22:08:36,343 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 18.12 10:08:36" (1/1) ... [2018-12-18 22:08:36,346 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 18.12 10:08:36" (1/1) ... [2018-12-18 22:08:36,347 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 18.12 10:08:36" (1/1) ... [2018-12-18 22:08:36,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-18 22:08:36,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-18 22:08:36,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-18 22:08:36,349 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-18 22:08:36,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:08:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-18 22:08:36,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-18 22:08:36,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-18 22:08:36,672 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-18 22:08:36,672 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-18 22:08:36,673 INFO L202 PluginConnector]: Adding new model n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:08:36 BoogieIcfgContainer [2018-12-18 22:08:36,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-18 22:08:36,674 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-18 22:08:36,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-18 22:08:36,678 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-18 22:08:36,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:08:36" (1/2) ... [2018-12-18 22:08:36,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c101d8 and model type n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:08:36, skipping insertion in model container [2018-12-18 22:08:36,680 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 18.12 10:08:36" (2/2) ... [2018-12-18 22:08:36,682 INFO L112 eAbstractionObserver]: Analyzing ICFG n.c11.i_3.bpl [2018-12-18 22:08:36,693 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-18 22:08:36,702 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-18 22:08:36,722 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-18 22:08:36,759 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-18 22:08:36,760 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-18 22:08:36,760 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-18 22:08:36,760 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-18 22:08:36,760 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-18 22:08:36,761 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-18 22:08:36,761 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-18 22:08:36,761 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-18 22:08:36,777 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-18 22:08:36,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 22:08:36,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:08:36,785 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 22:08:36,787 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:08:36,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:08:36,794 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-18 22:08:36,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:08:36,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:08:36,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:08:36,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:08:36,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:08:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:08:37,253 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2018-12-18 22:08:37,271 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {11#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} is VALID [2018-12-18 22:08:37,279 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {10#false} is VALID [2018-12-18 22:08:37,279 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !false; {10#false} is VALID [2018-12-18 22:08:37,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:08:37,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-18 22:08:37,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-18 22:08:37,283 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 22:08:37,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-18 22:08:37,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:08:37,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-18 22:08:37,315 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:08:37,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-18 22:08:37,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-18 22:08:37,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 22:08:37,326 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-18 22:08:37,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:08:37,439 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-18 22:08:37,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 22:08:37,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-18 22:08:37,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:08:37,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:08:37,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-12-18 22:08:37,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:08:37,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-12-18 22:08:37,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 10 transitions. [2018-12-18 22:08:37,513 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:08:37,523 INFO L225 Difference]: With dead ends: 9 [2018-12-18 22:08:37,523 INFO L226 Difference]: Without dead ends: 5 [2018-12-18 22:08:37,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 22:08:37,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-18 22:08:37,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-18 22:08:37,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:08:37,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2018-12-18 22:08:37,623 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2018-12-18 22:08:37,623 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2018-12-18 22:08:37,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:08:37,625 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2018-12-18 22:08:37,625 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-18 22:08:37,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:08:37,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:08:37,626 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2018-12-18 22:08:37,626 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2018-12-18 22:08:37,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:08:37,628 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2018-12-18 22:08:37,628 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-18 22:08:37,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:08:37,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:08:37,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:08:37,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:08:37,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-18 22:08:37,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-18 22:08:37,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-18 22:08:37,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:08:37,633 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-18 22:08:37,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-18 22:08:37,633 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-18 22:08:37,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-18 22:08:37,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:08:37,634 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-18 22:08:37,634 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:08:37,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:08:37,635 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-18 22:08:37,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:08:37,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:08:37,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:08:37,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:08:37,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:08:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:08:38,153 INFO L273 TraceCheckUtils]: 0: Hoare triple {45#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {47#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} is VALID [2018-12-18 22:08:38,169 INFO L273 TraceCheckUtils]: 1: Hoare triple {47#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {48#(and (< 0 (+ (div ULTIMATE.start_main_~len~5 4294967296) 1)) (<= ULTIMATE.start_main_~len~5 1))} is VALID [2018-12-18 22:08:38,184 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#(and (< 0 (+ (div ULTIMATE.start_main_~len~5 4294967296) 1)) (<= ULTIMATE.start_main_~len~5 1))} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {46#false} is VALID [2018-12-18 22:08:38,185 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-12-18 22:08:38,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:08:38,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:08:38,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 22:08:38,187 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-18 22:08:38,191 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-18 22:08:38,236 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-18 22:08:38,237 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-18 22:08:38,547 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-18 22:08:38,549 INFO L272 AbstractInterpreter]: Visited 4 different actions 13 times. Merged at 3 different actions 9 times. Widened at 1 different actions 1 times. Performed 134 root evaluator evaluations with a maximum evaluation depth of 5. Performed 134 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-18 22:08:38,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:08:38,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-18 22:08:38,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:08:38,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-18 22:08:38,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:08:38,568 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-18 22:08:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:08:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:08:38,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-18 22:08:38,721 INFO L273 TraceCheckUtils]: 0: Hoare triple {45#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {47#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} is VALID [2018-12-18 22:08:38,723 INFO L273 TraceCheckUtils]: 1: Hoare triple {47#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {55#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} is VALID [2018-12-18 22:08:38,724 INFO L273 TraceCheckUtils]: 2: Hoare triple {55#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {46#false} is VALID [2018-12-18 22:08:38,725 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-12-18 22:08:38,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:08:38,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-18 22:08:38,855 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-12-18 22:08:38,856 INFO L273 TraceCheckUtils]: 2: Hoare triple {65#(< (mod ULTIMATE.start_main_~len~5 4294967296) 5)} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {46#false} is VALID [2018-12-18 22:08:38,859 INFO L273 TraceCheckUtils]: 1: Hoare triple {69#(< (mod (+ ULTIMATE.start_main_~len~5 1) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {65#(< (mod ULTIMATE.start_main_~len~5 4294967296) 5)} is VALID [2018-12-18 22:08:38,860 INFO L273 TraceCheckUtils]: 0: Hoare triple {45#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {69#(< (mod (+ ULTIMATE.start_main_~len~5 1) 4294967296) 5)} is VALID [2018-12-18 22:08:38,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:08:38,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-18 22:08:38,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2018-12-18 22:08:38,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-18 22:08:38,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-18 22:08:38,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:08:38,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-12-18 22:08:38,907 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:08:38,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-18 22:08:38,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-18 22:08:38,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-18 22:08:38,908 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-12-18 22:08:39,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:08:39,148 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-18 22:08:39,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-18 22:08:39,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-18 22:08:39,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:08:39,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-18 22:08:39,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-12-18 22:08:39,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-18 22:08:39,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-12-18 22:08:39,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 8 transitions. [2018-12-18 22:08:39,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:08:39,181 INFO L225 Difference]: With dead ends: 8 [2018-12-18 22:08:39,181 INFO L226 Difference]: Without dead ends: 6 [2018-12-18 22:08:39,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-18 22:08:39,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-18 22:08:39,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-18 22:08:39,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:08:39,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2018-12-18 22:08:39,197 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2018-12-18 22:08:39,197 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2018-12-18 22:08:39,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:08:39,199 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-12-18 22:08:39,199 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-18 22:08:39,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:08:39,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:08:39,200 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2018-12-18 22:08:39,200 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2018-12-18 22:08:39,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:08:39,201 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-12-18 22:08:39,201 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-18 22:08:39,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:08:39,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:08:39,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:08:39,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:08:39,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-18 22:08:39,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-18 22:08:39,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-18 22:08:39,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:08:39,205 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-18 22:08:39,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-18 22:08:39,205 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-18 22:08:39,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-18 22:08:39,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:08:39,206 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-18 22:08:39,206 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:08:39,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:08:39,206 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-18 22:08:39,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:08:39,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:08:39,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:08:39,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:08:39,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:08:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:08:39,557 INFO L273 TraceCheckUtils]: 0: Hoare triple {107#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {109#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} is VALID [2018-12-18 22:08:39,559 INFO L273 TraceCheckUtils]: 1: Hoare triple {109#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {110#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} is VALID [2018-12-18 22:08:39,560 INFO L273 TraceCheckUtils]: 2: Hoare triple {110#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {111#(and (<= ULTIMATE.start_main_~len~5 2) (< 0 (+ (div ULTIMATE.start_main_~len~5 4294967296) 1)))} is VALID [2018-12-18 22:08:39,561 INFO L273 TraceCheckUtils]: 3: Hoare triple {111#(and (<= ULTIMATE.start_main_~len~5 2) (< 0 (+ (div ULTIMATE.start_main_~len~5 4294967296) 1)))} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {108#false} is VALID [2018-12-18 22:08:39,561 INFO L273 TraceCheckUtils]: 4: Hoare triple {108#false} assume !false; {108#false} is VALID [2018-12-18 22:08:39,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:08:39,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:08:39,562 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 22:08:39,563 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-18 22:08:39,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-18 22:08:39,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:08:39,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-18 22:08:39,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-18 22:08:39,575 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-18 22:08:39,585 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-18 22:08:39,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-18 22:08:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:08:39,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-18 22:08:39,980 INFO L273 TraceCheckUtils]: 0: Hoare triple {107#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {109#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} is VALID [2018-12-18 22:08:39,981 INFO L273 TraceCheckUtils]: 1: Hoare triple {109#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {110#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} is VALID [2018-12-18 22:08:39,982 INFO L273 TraceCheckUtils]: 2: Hoare triple {110#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {121#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} is VALID [2018-12-18 22:08:40,001 INFO L273 TraceCheckUtils]: 3: Hoare triple {121#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {108#false} is VALID [2018-12-18 22:08:40,001 INFO L273 TraceCheckUtils]: 4: Hoare triple {108#false} assume !false; {108#false} is VALID [2018-12-18 22:08:40,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:08:40,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-18 22:08:40,113 INFO L273 TraceCheckUtils]: 4: Hoare triple {108#false} assume !false; {108#false} is VALID [2018-12-18 22:08:40,115 INFO L273 TraceCheckUtils]: 3: Hoare triple {131#(< (mod ULTIMATE.start_main_~len~5 4294967296) 5)} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {108#false} is VALID [2018-12-18 22:08:40,116 INFO L273 TraceCheckUtils]: 2: Hoare triple {135#(< (mod (+ ULTIMATE.start_main_~len~5 1) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {131#(< (mod ULTIMATE.start_main_~len~5 4294967296) 5)} is VALID [2018-12-18 22:08:40,118 INFO L273 TraceCheckUtils]: 1: Hoare triple {139#(< (mod (+ ULTIMATE.start_main_~len~5 2) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {135#(< (mod (+ ULTIMATE.start_main_~len~5 1) 4294967296) 5)} is VALID [2018-12-18 22:08:40,127 INFO L273 TraceCheckUtils]: 0: Hoare triple {107#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {139#(< (mod (+ ULTIMATE.start_main_~len~5 2) 4294967296) 5)} is VALID [2018-12-18 22:08:40,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:08:40,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-18 22:08:40,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2018-12-18 22:08:40,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-18 22:08:40,147 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-18 22:08:40,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:08:40,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-12-18 22:08:40,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:08:40,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-18 22:08:40,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-18 22:08:40,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-18 22:08:40,161 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-12-18 22:08:40,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:08:40,255 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-18 22:08:40,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-18 22:08:40,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-18 22:08:40,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:08:40,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-18 22:08:40,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2018-12-18 22:08:40,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-18 22:08:40,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2018-12-18 22:08:40,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 9 transitions. [2018-12-18 22:08:40,278 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:08:40,278 INFO L225 Difference]: With dead ends: 9 [2018-12-18 22:08:40,279 INFO L226 Difference]: Without dead ends: 7 [2018-12-18 22:08:40,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-18 22:08:40,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-18 22:08:40,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-18 22:08:40,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:08:40,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2018-12-18 22:08:40,298 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2018-12-18 22:08:40,298 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2018-12-18 22:08:40,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:08:40,299 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-12-18 22:08:40,299 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-18 22:08:40,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:08:40,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:08:40,300 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2018-12-18 22:08:40,300 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2018-12-18 22:08:40,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:08:40,301 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-12-18 22:08:40,301 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-18 22:08:40,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:08:40,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:08:40,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:08:40,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:08:40,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-18 22:08:40,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-18 22:08:40,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-18 22:08:40,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:08:40,304 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-18 22:08:40,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-18 22:08:40,304 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-18 22:08:40,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-18 22:08:40,305 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:08:40,305 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-18 22:08:40,305 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:08:40,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:08:40,306 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-12-18 22:08:40,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:08:40,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:08:40,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-18 22:08:40,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:08:40,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:08:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:08:40,535 INFO L273 TraceCheckUtils]: 0: Hoare triple {183#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {185#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} is VALID [2018-12-18 22:08:40,537 INFO L273 TraceCheckUtils]: 1: Hoare triple {185#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {186#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} is VALID [2018-12-18 22:08:40,539 INFO L273 TraceCheckUtils]: 2: Hoare triple {186#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {187#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} is VALID [2018-12-18 22:08:40,541 INFO L273 TraceCheckUtils]: 3: Hoare triple {187#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {188#(and (< 0 (+ (div ULTIMATE.start_main_~len~5 4294967296) 1)) (<= ULTIMATE.start_main_~len~5 3))} is VALID [2018-12-18 22:08:40,543 INFO L273 TraceCheckUtils]: 4: Hoare triple {188#(and (< 0 (+ (div ULTIMATE.start_main_~len~5 4294967296) 1)) (<= ULTIMATE.start_main_~len~5 3))} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {184#false} is VALID [2018-12-18 22:08:40,543 INFO L273 TraceCheckUtils]: 5: Hoare triple {184#false} assume !false; {184#false} is VALID [2018-12-18 22:08:40,544 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:08:40,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:08:40,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 22:08:40,545 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-18 22:08:40,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-18 22:08:40,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:08:40,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-18 22:08:40,561 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-18 22:08:40,561 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-18 22:08:40,570 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-18 22:08:40,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-18 22:08:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:08:40,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-18 22:08:40,702 INFO L273 TraceCheckUtils]: 0: Hoare triple {183#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {185#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} is VALID [2018-12-18 22:08:40,703 INFO L273 TraceCheckUtils]: 1: Hoare triple {185#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {186#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} is VALID [2018-12-18 22:08:40,705 INFO L273 TraceCheckUtils]: 2: Hoare triple {186#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {187#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} is VALID [2018-12-18 22:08:40,711 INFO L273 TraceCheckUtils]: 3: Hoare triple {187#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {201#(and (<= ULTIMATE.start_main_~len~5 3) (<= 3 ULTIMATE.start_main_~len~5))} is VALID [2018-12-18 22:08:40,713 INFO L273 TraceCheckUtils]: 4: Hoare triple {201#(and (<= ULTIMATE.start_main_~len~5 3) (<= 3 ULTIMATE.start_main_~len~5))} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {184#false} is VALID [2018-12-18 22:08:40,713 INFO L273 TraceCheckUtils]: 5: Hoare triple {184#false} assume !false; {184#false} is VALID [2018-12-18 22:08:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:08:40,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-18 22:08:40,914 INFO L273 TraceCheckUtils]: 5: Hoare triple {184#false} assume !false; {184#false} is VALID [2018-12-18 22:08:40,915 INFO L273 TraceCheckUtils]: 4: Hoare triple {211#(< (mod ULTIMATE.start_main_~len~5 4294967296) 5)} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {184#false} is VALID [2018-12-18 22:08:40,917 INFO L273 TraceCheckUtils]: 3: Hoare triple {215#(< (mod (+ ULTIMATE.start_main_~len~5 1) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {211#(< (mod ULTIMATE.start_main_~len~5 4294967296) 5)} is VALID [2018-12-18 22:08:40,919 INFO L273 TraceCheckUtils]: 2: Hoare triple {219#(< (mod (+ ULTIMATE.start_main_~len~5 2) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {215#(< (mod (+ ULTIMATE.start_main_~len~5 1) 4294967296) 5)} is VALID [2018-12-18 22:08:40,921 INFO L273 TraceCheckUtils]: 1: Hoare triple {223#(< (mod (+ ULTIMATE.start_main_~len~5 3) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {219#(< (mod (+ ULTIMATE.start_main_~len~5 2) 4294967296) 5)} is VALID [2018-12-18 22:08:40,922 INFO L273 TraceCheckUtils]: 0: Hoare triple {183#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {223#(< (mod (+ ULTIMATE.start_main_~len~5 3) 4294967296) 5)} is VALID [2018-12-18 22:08:40,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:08:40,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-18 22:08:40,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-12-18 22:08:40,942 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-18 22:08:40,943 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-18 22:08:40,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:08:40,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-12-18 22:08:40,959 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:08:40,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-18 22:08:40,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-18 22:08:40,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-18 22:08:40,961 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-12-18 22:08:41,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:08:41,130 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-18 22:08:41,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-18 22:08:41,130 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-18 22:08:41,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:08:41,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-18 22:08:41,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2018-12-18 22:08:41,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-18 22:08:41,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2018-12-18 22:08:41,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 10 transitions. [2018-12-18 22:08:41,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:08:41,151 INFO L225 Difference]: With dead ends: 10 [2018-12-18 22:08:41,151 INFO L226 Difference]: Without dead ends: 8 [2018-12-18 22:08:41,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-18 22:08:41,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-18 22:08:41,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-18 22:08:41,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:08:41,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2018-12-18 22:08:41,293 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2018-12-18 22:08:41,294 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2018-12-18 22:08:41,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:08:41,295 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-18 22:08:41,295 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-18 22:08:41,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:08:41,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:08:41,295 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2018-12-18 22:08:41,296 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2018-12-18 22:08:41,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:08:41,297 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-18 22:08:41,297 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-18 22:08:41,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:08:41,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:08:41,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:08:41,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:08:41,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-18 22:08:41,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-18 22:08:41,299 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-18 22:08:41,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:08:41,299 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-18 22:08:41,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-18 22:08:41,300 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-18 22:08:41,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-18 22:08:41,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:08:41,300 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-18 22:08:41,300 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:08:41,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:08:41,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-12-18 22:08:41,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:08:41,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:08:41,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-18 22:08:41,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:08:41,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:08:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:08:41,665 INFO L273 TraceCheckUtils]: 0: Hoare triple {273#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {275#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} is VALID [2018-12-18 22:08:41,667 INFO L273 TraceCheckUtils]: 1: Hoare triple {275#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {276#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} is VALID [2018-12-18 22:08:41,668 INFO L273 TraceCheckUtils]: 2: Hoare triple {276#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {277#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} is VALID [2018-12-18 22:08:41,669 INFO L273 TraceCheckUtils]: 3: Hoare triple {277#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {278#(and (<= ULTIMATE.start_main_~len~5 3) (<= 3 ULTIMATE.start_main_~len~5))} is VALID [2018-12-18 22:08:41,674 INFO L273 TraceCheckUtils]: 4: Hoare triple {278#(and (<= ULTIMATE.start_main_~len~5 3) (<= 3 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {279#(and (< 0 (+ (div ULTIMATE.start_main_~len~5 4294967296) 1)) (<= ULTIMATE.start_main_~len~5 4))} is VALID [2018-12-18 22:08:41,675 INFO L273 TraceCheckUtils]: 5: Hoare triple {279#(and (< 0 (+ (div ULTIMATE.start_main_~len~5 4294967296) 1)) (<= ULTIMATE.start_main_~len~5 4))} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {274#false} is VALID [2018-12-18 22:08:41,675 INFO L273 TraceCheckUtils]: 6: Hoare triple {274#false} assume !false; {274#false} is VALID [2018-12-18 22:08:41,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:08:41,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:08:41,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 22:08:41,677 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-18 22:08:41,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-18 22:08:41,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:08:41,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-18 22:08:41,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:08:41,693 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-18 22:08:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:08:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:08:41,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-18 22:08:41,915 INFO L273 TraceCheckUtils]: 0: Hoare triple {273#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {275#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} is VALID [2018-12-18 22:08:41,916 INFO L273 TraceCheckUtils]: 1: Hoare triple {275#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {276#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} is VALID [2018-12-18 22:08:41,918 INFO L273 TraceCheckUtils]: 2: Hoare triple {276#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {277#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} is VALID [2018-12-18 22:08:41,919 INFO L273 TraceCheckUtils]: 3: Hoare triple {277#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {278#(and (<= ULTIMATE.start_main_~len~5 3) (<= 3 ULTIMATE.start_main_~len~5))} is VALID [2018-12-18 22:08:41,921 INFO L273 TraceCheckUtils]: 4: Hoare triple {278#(and (<= ULTIMATE.start_main_~len~5 3) (<= 3 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {295#(and (<= 4 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 4))} is VALID [2018-12-18 22:08:41,922 INFO L273 TraceCheckUtils]: 5: Hoare triple {295#(and (<= 4 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 4))} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {274#false} is VALID [2018-12-18 22:08:41,923 INFO L273 TraceCheckUtils]: 6: Hoare triple {274#false} assume !false; {274#false} is VALID [2018-12-18 22:08:41,924 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:08:41,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-18 22:08:42,260 INFO L273 TraceCheckUtils]: 6: Hoare triple {274#false} assume !false; {274#false} is VALID [2018-12-18 22:08:42,263 INFO L273 TraceCheckUtils]: 5: Hoare triple {305#(< (mod ULTIMATE.start_main_~len~5 4294967296) 5)} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {274#false} is VALID [2018-12-18 22:08:42,264 INFO L273 TraceCheckUtils]: 4: Hoare triple {309#(< (mod (+ ULTIMATE.start_main_~len~5 1) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {305#(< (mod ULTIMATE.start_main_~len~5 4294967296) 5)} is VALID [2018-12-18 22:08:42,265 INFO L273 TraceCheckUtils]: 3: Hoare triple {313#(< (mod (+ ULTIMATE.start_main_~len~5 2) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {309#(< (mod (+ ULTIMATE.start_main_~len~5 1) 4294967296) 5)} is VALID [2018-12-18 22:08:42,267 INFO L273 TraceCheckUtils]: 2: Hoare triple {317#(< (mod (+ ULTIMATE.start_main_~len~5 3) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {313#(< (mod (+ ULTIMATE.start_main_~len~5 2) 4294967296) 5)} is VALID [2018-12-18 22:08:42,269 INFO L273 TraceCheckUtils]: 1: Hoare triple {321#(< (mod (+ ULTIMATE.start_main_~len~5 4) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {317#(< (mod (+ ULTIMATE.start_main_~len~5 3) 4294967296) 5)} is VALID [2018-12-18 22:08:42,270 INFO L273 TraceCheckUtils]: 0: Hoare triple {273#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {321#(< (mod (+ ULTIMATE.start_main_~len~5 4) 4294967296) 5)} is VALID [2018-12-18 22:08:42,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:08:42,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-18 22:08:42,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-12-18 22:08:42,291 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-18 22:08:42,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-12-18 22:08:42,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:08:42,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-12-18 22:08:42,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:08:42,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-18 22:08:42,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-18 22:08:42,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-12-18 22:08:42,305 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-12-18 22:08:42,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:08:42,416 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-18 22:08:42,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-18 22:08:42,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-12-18 22:08:42,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:08:42,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-18 22:08:42,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-12-18 22:08:42,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-18 22:08:42,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-12-18 22:08:42,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 10 transitions. [2018-12-18 22:08:42,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:08:42,433 INFO L225 Difference]: With dead ends: 9 [2018-12-18 22:08:42,434 INFO L226 Difference]: Without dead ends: 0 [2018-12-18 22:08:42,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-12-18 22:08:42,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-18 22:08:42,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-18 22:08:42,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:08:42,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-12-18 22:08:42,435 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-12-18 22:08:42,435 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-12-18 22:08:42,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:08:42,436 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-18 22:08:42,436 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-18 22:08:42,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:08:42,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:08:42,436 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-12-18 22:08:42,436 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-12-18 22:08:42,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:08:42,436 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-18 22:08:42,436 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-18 22:08:42,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:08:42,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:08:42,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:08:42,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:08:42,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-18 22:08:42,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-18 22:08:42,437 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-12-18 22:08:42,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:08:42,437 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-18 22:08:42,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-18 22:08:42,438 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-18 22:08:42,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:08:42,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-18 22:08:42,506 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 42) no Hoare annotation was computed. [2018-12-18 22:08:42,506 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 43) no Hoare annotation was computed. [2018-12-18 22:08:42,506 INFO L444 ceAbstractionStarter]: At program point L31(lines 31 41) the Hoare annotation is: false [2018-12-18 22:08:42,506 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 43) no Hoare annotation was computed. [2018-12-18 22:08:42,506 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 43) no Hoare annotation was computed. [2018-12-18 22:08:42,507 INFO L444 ceAbstractionStarter]: At program point L40(lines 17 40) the Hoare annotation is: (or (and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5)) (and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1)) (and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5)) (and (<= ULTIMATE.start_main_~len~5 3) (<= 3 ULTIMATE.start_main_~len~5)) (and (<= 4 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 4))) [2018-12-18 22:08:42,508 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-12-18 22:08:42,514 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2018-12-18 22:08:42,515 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-12-18 22:08:42,515 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-12-18 22:08:42,515 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-12-18 22:08:42,521 INFO L202 PluginConnector]: Adding new model n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:08:42 BoogieIcfgContainer [2018-12-18 22:08:42,521 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-18 22:08:42,523 INFO L168 Benchmark]: Toolchain (without parser) took 6241.38 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 697.3 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -639.4 MB). Peak memory consumption was 57.9 MB. Max. memory is 7.1 GB. [2018-12-18 22:08:42,524 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 22:08:42,525 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 22:08:42,525 INFO L168 Benchmark]: Boogie Preprocessor took 23.93 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 22:08:42,526 INFO L168 Benchmark]: RCFGBuilder took 324.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-18 22:08:42,526 INFO L168 Benchmark]: TraceAbstraction took 5847.02 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 697.3 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -660.6 MB). Peak memory consumption was 36.7 MB. Max. memory is 7.1 GB. [2018-12-18 22:08:42,530 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.93 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 324.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5847.02 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 697.3 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -660.6 MB). Peak memory consumption was 36.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 - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((main_~len~5 <= 0 && 0 <= main_~len~5) || (1 <= main_~len~5 && main_~len~5 <= 1)) || (main_~len~5 <= 2 && 2 <= main_~len~5)) || (main_~len~5 <= 3 && 3 <= main_~len~5)) || (4 <= main_~len~5 && main_~len~5 <= 4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 5.7s OverallTime, 5 OverallIterations, 4 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13 SDtfs, 0 SDslu, 11 SDs, 0 SdLazy, 76 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.9s 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.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 7 NumberOfFragments, 37 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 56 ConstructedInterpolants, 0 QuantifiedInterpolants, 1534 SizeOfPredicates, 12 NumberOfNonLiveVariables, 102 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 0/60 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...