java -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-1de736e-m [2019-02-15 10:44:52,820 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 10:44:52,822 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 10:44:52,833 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 10:44:52,834 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 10:44:52,835 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 10:44:52,836 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 10:44:52,838 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 10:44:52,840 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 10:44:52,841 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 10:44:52,842 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 10:44:52,843 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 10:44:52,844 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 10:44:52,845 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 10:44:52,846 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 10:44:52,847 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 10:44:52,848 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 10:44:52,850 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 10:44:52,852 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 10:44:52,854 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 10:44:52,855 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 10:44:52,856 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 10:44:52,859 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 10:44:52,859 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 10:44:52,860 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 10:44:52,861 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 10:44:52,862 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 10:44:52,863 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 10:44:52,864 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 10:44:52,865 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 10:44:52,865 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 10:44:52,866 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 10:44:52,867 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 10:44:52,867 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 10:44:52,868 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 10:44:52,869 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 10:44:52,869 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 [2019-02-15 10:44:52,883 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 10:44:52,883 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 10:44:52,884 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 10:44:52,884 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 10:44:52,884 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 10:44:52,885 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 10:44:52,885 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 10:44:52,885 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 10:44:52,885 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-15 10:44:52,885 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 10:44:52,886 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-15 10:44:52,886 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-15 10:44:52,886 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 10:44:52,886 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 10:44:52,887 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 10:44:52,887 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 10:44:52,887 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 10:44:52,888 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 10:44:52,888 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 10:44:52,888 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 10:44:52,888 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 10:44:52,888 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 10:44:52,889 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 10:44:52,889 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 10:44:52,889 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 10:44:52,890 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 10:44:52,891 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 10:44:52,891 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 10:44:52,891 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 10:44:52,891 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 10:44:52,891 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 10:44:52,892 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:44:52,892 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 10:44:52,892 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 10:44:52,892 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 10:44:52,892 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 10:44:52,893 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 10:44:52,893 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 10:44:52,893 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 10:44:52,893 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 10:44:52,944 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 10:44:52,961 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 10:44:52,966 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 10:44:52,967 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 10:44:52,968 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 10:44:52,969 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 [2019-02-15 10:44:52,970 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/n.c11.i_3.bpl' [2019-02-15 10:44:53,016 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 10:44:53,018 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 10:44:53,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 10:44:53,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 10:44:53,019 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 10:44:53,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:53" (1/1) ... [2019-02-15 10:44:53,050 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:53" (1/1) ... [2019-02-15 10:44:53,064 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 10:44:53,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 10:44:53,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 10:44:53,065 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 10:44:53,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:53" (1/1) ... [2019-02-15 10:44:53,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:53" (1/1) ... [2019-02-15 10:44:53,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:53" (1/1) ... [2019-02-15 10:44:53,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:53" (1/1) ... [2019-02-15 10:44:53,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:53" (1/1) ... [2019-02-15 10:44:53,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:53" (1/1) ... [2019-02-15 10:44:53,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:53" (1/1) ... [2019-02-15 10:44:53,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 10:44:53,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 10:44:53,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 10:44:53,088 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 10:44:53,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:53" (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 [2019-02-15 10:44:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-15 10:44:53,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-15 10:44:53,362 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-15 10:44:53,362 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-02-15 10:44:53,364 INFO L202 PluginConnector]: Adding new model n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:44:53 BoogieIcfgContainer [2019-02-15 10:44:53,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 10:44:53,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 10:44:53,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 10:44:53,369 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 10:44:53,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:53" (1/2) ... [2019-02-15 10:44:53,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67501a3 and model type n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:44:53, skipping insertion in model container [2019-02-15 10:44:53,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:44:53" (2/2) ... [2019-02-15 10:44:53,372 INFO L112 eAbstractionObserver]: Analyzing ICFG n.c11.i_3.bpl [2019-02-15 10:44:53,382 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 10:44:53,389 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-15 10:44:53,406 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-15 10:44:53,444 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 10:44:53,445 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 10:44:53,445 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 10:44:53,445 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 10:44:53,445 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 10:44:53,445 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 10:44:53,445 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 10:44:53,446 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 10:44:53,463 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-15 10:44:53,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:44:53,478 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:53,479 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:44:53,484 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:53,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:53,493 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-02-15 10:44:53,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:53,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:53,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:53,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:53,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:53,816 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2019-02-15 10:44:53,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:44:53,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:44:53,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-15 10:44:53,821 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:44:53,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 10:44:53,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 10:44:53,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:44:53,838 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-02-15 10:44:53,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:53,890 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-02-15 10:44:53,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:44:53,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-15 10:44:53,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:53,902 INFO L225 Difference]: With dead ends: 9 [2019-02-15 10:44:53,902 INFO L226 Difference]: Without dead ends: 5 [2019-02-15 10:44:53,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:44:53,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-02-15 10:44:53,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-02-15 10:44:53,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-15 10:44:53,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-02-15 10:44:53,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-02-15 10:44:53,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:53,942 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-02-15 10:44:53,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 10:44:53,942 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-15 10:44:53,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:44:53,943 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:53,943 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:44:53,943 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:53,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:53,944 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-02-15 10:44:53,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:53,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:53,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:53,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:53,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:54,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:44:54,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:54,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:54,126 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:44:54,128 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-02-15 10:44:54,166 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:44:54,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:44:54,432 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:44:54,434 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. [2019-02-15 10:44:54,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:54,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:44:54,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:54,446 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 [2019-02-15 10:44:54,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:54,488 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:44:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:54,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:54,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:44:54,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:54,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:44:54,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:54,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2019-02-15 10:44:54,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:54,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-15 10:44:54,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-15 10:44:54,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 10:44:54,763 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2019-02-15 10:44:54,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:54,787 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-15 10:44:54,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 10:44:54,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-02-15 10:44:54,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:54,788 INFO L225 Difference]: With dead ends: 8 [2019-02-15 10:44:54,788 INFO L226 Difference]: Without dead ends: 6 [2019-02-15 10:44:54,789 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 [2019-02-15 10:44:54,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-02-15 10:44:54,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-02-15 10:44:54,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-15 10:44:54,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-02-15 10:44:54,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-02-15 10:44:54,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:54,793 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-02-15 10:44:54,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-15 10:44:54,793 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-15 10:44:54,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:44:54,793 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:54,794 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-15 10:44:54,794 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:54,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:54,794 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-02-15 10:44:54,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:54,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:54,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:54,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:54,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:55,143 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2019-02-15 10:44:55,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:44:55,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:55,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:55,146 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:55,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:55,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:55,146 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 [2019-02-15 10:44:55,165 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:44:55,165 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:44:55,201 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-15 10:44:55,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:44:55,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:55,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:44:55,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:55,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:44:55,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:55,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2019-02-15 10:44:55,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:55,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:44:55,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:44:55,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:44:55,436 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-02-15 10:44:55,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:55,472 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-02-15 10:44:55,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:44:55,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-02-15 10:44:55,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:55,473 INFO L225 Difference]: With dead ends: 9 [2019-02-15 10:44:55,473 INFO L226 Difference]: Without dead ends: 7 [2019-02-15 10:44:55,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:44:55,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-15 10:44:55,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-15 10:44:55,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-15 10:44:55,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-02-15 10:44:55,477 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-02-15 10:44:55,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:55,477 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-02-15 10:44:55,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:44:55,477 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-15 10:44:55,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:44:55,478 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:55,478 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-02-15 10:44:55,478 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:55,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:55,478 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-02-15 10:44:55,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:55,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:55,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:44:55,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:55,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:55,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:44:55,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:55,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:55,768 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:55,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:55,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:55,768 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 [2019-02-15 10:44:55,779 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:44:55,779 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:44:55,814 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:44:55,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:44:55,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:55,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:44:55,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:55,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:44:55,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:55,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2019-02-15 10:44:55,973 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:55,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 10:44:55,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 10:44:55,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:44:55,974 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-02-15 10:44:56,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:56,015 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-02-15 10:44:56,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:44:56,016 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-02-15 10:44:56,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:56,017 INFO L225 Difference]: With dead ends: 10 [2019-02-15 10:44:56,017 INFO L226 Difference]: Without dead ends: 8 [2019-02-15 10:44:56,018 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 [2019-02-15 10:44:56,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-15 10:44:56,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-02-15 10:44:56,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-15 10:44:56,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-15 10:44:56,022 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-02-15 10:44:56,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:56,023 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-15 10:44:56,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 10:44:56,023 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-15 10:44:56,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:44:56,023 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:56,024 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-02-15 10:44:56,024 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:56,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:56,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-02-15 10:44:56,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:56,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:56,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:44:56,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:56,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:56,499 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2019-02-15 10:44:56,500 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:44:56,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:56,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:56,501 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:56,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:56,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:56,501 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 [2019-02-15 10:44:56,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:56,511 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:44:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:56,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:56,577 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:44:56,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:56,706 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:44:56,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:56,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2019-02-15 10:44:56,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:56,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:44:56,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:44:56,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:44:56,728 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2019-02-15 10:44:56,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:56,774 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-02-15 10:44:56,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:44:56,775 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-15 10:44:56,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:56,776 INFO L225 Difference]: With dead ends: 9 [2019-02-15 10:44:56,776 INFO L226 Difference]: Without dead ends: 0 [2019-02-15 10:44:56,777 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 [2019-02-15 10:44:56,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-15 10:44:56,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-15 10:44:56,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-15 10:44:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-15 10:44:56,778 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2019-02-15 10:44:56,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:56,778 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-15 10:44:56,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:44:56,778 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-15 10:44:56,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-15 10:44:56,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-15 10:44:56,879 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 43) no Hoare annotation was computed. [2019-02-15 10:44:56,879 INFO L444 ceAbstractionStarter]: At program point L31(lines 31 41) the Hoare annotation is: false [2019-02-15 10:44:56,879 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 43) no Hoare annotation was computed. [2019-02-15 10:44:56,879 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 43) no Hoare annotation was computed. [2019-02-15 10:44:56,879 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 42) no Hoare annotation was computed. [2019-02-15 10:44:56,880 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))) [2019-02-15 10:44:56,891 INFO L202 PluginConnector]: Adding new model n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:44:56 BoogieIcfgContainer [2019-02-15 10:44:56,891 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-15 10:44:56,892 INFO L168 Benchmark]: Toolchain (without parser) took 3874.70 ms. Allocated memory was 133.2 MB in the beginning and 170.9 MB in the end (delta: 37.7 MB). Free memory was 108.4 MB in the beginning and 56.3 MB in the end (delta: 52.2 MB). Peak memory consumption was 89.9 MB. Max. memory is 7.1 GB. [2019-02-15 10:44:56,893 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 133.2 MB. Free memory is still 109.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-15 10:44:56,894 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.40 ms. Allocated memory is still 133.2 MB. Free memory was 108.2 MB in the beginning and 106.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-02-15 10:44:56,895 INFO L168 Benchmark]: Boogie Preprocessor took 22.73 ms. Allocated memory is still 133.2 MB. Free memory was 106.6 MB in the beginning and 105.7 MB in the end (delta: 966.9 kB). Peak memory consumption was 966.9 kB. Max. memory is 7.1 GB. [2019-02-15 10:44:56,895 INFO L168 Benchmark]: RCFGBuilder took 275.92 ms. Allocated memory is still 133.2 MB. Free memory was 105.4 MB in the beginning and 96.9 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 7.1 GB. [2019-02-15 10:44:56,897 INFO L168 Benchmark]: TraceAbstraction took 3526.29 ms. Allocated memory was 133.2 MB in the beginning and 170.9 MB in the end (delta: 37.7 MB). Free memory was 96.7 MB in the beginning and 56.3 MB in the end (delta: 40.5 MB). Peak memory consumption was 78.2 MB. Max. memory is 7.1 GB. [2019-02-15 10:44:56,950 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 133.2 MB. Free memory is still 109.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.40 ms. Allocated memory is still 133.2 MB. Free memory was 108.2 MB in the beginning and 106.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.73 ms. Allocated memory is still 133.2 MB. Free memory was 106.6 MB in the beginning and 105.7 MB in the end (delta: 966.9 kB). Peak memory consumption was 966.9 kB. Max. memory is 7.1 GB. * RCFGBuilder took 275.92 ms. Allocated memory is still 133.2 MB. Free memory was 105.4 MB in the beginning and 96.9 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3526.29 ms. Allocated memory was 133.2 MB in the beginning and 170.9 MB in the end (delta: 37.7 MB). Free memory was 96.7 MB in the beginning and 56.3 MB in the end (delta: 40.5 MB). Peak memory consumption was 78.2 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, 3.4s OverallTime, 5 OverallIterations, 4 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13 SDtfs, 0 SDslu, 9 SDs, 0 SdLazy, 72 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s 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.0s 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, 2.2s 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...